=============================================================================== 0200be94 : int IMFS_chown( const rtems_filesystem_location_info_t *loc, uid_t owner, gid_t group ) { 200be94: 9d e3 bf 98 save %sp, -104, %sp /* * Verify I am the owner of the node or the super user. */ #if defined(RTEMS_POSIX_API) st_uid = geteuid(); 200be98: 40 00 02 6e call 200c850 200be9c: fa 06 20 08 ld [ %i0 + 8 ], %i5 if ( ( st_uid != jnode->st_uid ) && ( st_uid != 0 ) ) 200bea0: c2 17 60 3c lduh [ %i5 + 0x3c ], %g1 200bea4: 91 2a 20 10 sll %o0, 0x10, %o0 200bea8: 91 32 20 10 srl %o0, 0x10, %o0 200beac: 80 a0 40 08 cmp %g1, %o0 200beb0: 02 80 00 04 be 200bec0 200beb4: 80 a2 20 00 cmp %o0, 0 200beb8: 12 80 00 0b bne 200bee4 <== ALWAYS TAKEN 200bebc: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EPERM ); #endif jnode->st_uid = owner; 200bec0: f2 37 60 3c sth %i1, [ %i5 + 0x3c ] jnode->st_gid = group; 200bec4: f4 37 60 3e sth %i2, [ %i5 + 0x3e ] IMFS_update_ctime( jnode ); 200bec8: 90 07 bf f8 add %fp, -8, %o0 200becc: 7f ff de 13 call 2003718 200bed0: 92 10 20 00 clr %o1 200bed4: c2 07 bf f8 ld [ %fp + -8 ], %g1 200bed8: c2 27 60 48 st %g1, [ %i5 + 0x48 ] return 0; } 200bedc: 81 c7 e0 08 ret 200bee0: 91 e8 20 00 restore %g0, 0, %o0 #if defined(RTEMS_POSIX_API) st_uid = geteuid(); if ( ( st_uid != jnode->st_uid ) && ( st_uid != 0 ) ) rtems_set_errno_and_return_minus_one( EPERM ); 200bee4: 40 00 11 3d call 20103d8 <__errno> 200bee8: b0 10 3f ff mov -1, %i0 200beec: 82 10 20 01 mov 1, %g1 200bef0: c2 22 00 00 st %g1, [ %o0 ] 200bef4: 81 c7 e0 08 ret 200bef8: 81 e8 00 00 restore =============================================================================== 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 94 sethi %hi(0x2025000), %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 20 90 or %i4, 0x90, %i4 20058a0: 37 00 80 8b sethi %hi(0x2022c00), %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 8b sethi %hi(0x2022c00), %l4 return; } puts(""); 20058a8: 21 00 80 8b sethi %hi(0x2022c00), %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 8b sethi %hi(0x2022c00), %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 8b sethi %hi(0x2022c00), %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 60 or %i3, 0x360, %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 d0 or %l4, 0x3d0, %l4 return; } puts(""); 20058bc: a0 14 22 f8 or %l0, 0x2f8, %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 b8 or %l3, 0x3b8, %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 a0 or %l2, 0x3a0, %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 3f 8d call 201571c 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 3c 67 call 2014aa4 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 3c 0e call 2014964 <== 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 3f 66 call 201571c 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 8b sethi %hi(0x2022c00), %o1 20059c8: 40 00 3b e7 call 2014964 20059cc: 92 12 63 80 or %o1, 0x380, %o1 ! 2022f80 default: fprintf(stdout, " bad type %d\n", IMFS_type( the_jnode ) ); return; } puts(""); 20059d0: 40 00 43 54 call 2016720 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 8b sethi %hi(0x2022c00), %o1 20059f4: 40 00 3b dc call 2014964 20059f8: 92 12 63 68 or %o1, 0x368, %o1 ! 2022f68 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 3b f3 call 20149d4 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 3f 3e call 201571c 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 8b sethi %hi(0x2022c00), %o1 2005a44: 40 00 3b c8 call 2014964 2005a48: 92 12 63 90 or %o1, 0x390, %o1 ! 2022f90 2005a4c: 30 bf ff e1 b,a 20059d0 =============================================================================== 0200c040 : rtems_filesystem_eval_path_context_t *ctx, void *arg, const char *token, size_t tokenlen ) { 200c040: 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; 200c044: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 bool access_ok = rtems_filesystem_eval_path_check_access( 200c048: 90 10 00 18 mov %i0, %o0 200c04c: d4 07 20 30 ld [ %i4 + 0x30 ], %o2 200c050: d6 17 20 3c lduh [ %i4 + 0x3c ], %o3 200c054: d8 17 20 3e lduh [ %i4 + 0x3e ], %o4 200c058: 40 00 03 24 call 200cce8 200c05c: 92 10 20 01 mov 1, %o1 dir->st_mode, dir->st_uid, dir->st_gid ); if ( access_ok ) { 200c060: 80 8a 20 ff btst 0xff, %o0 200c064: 12 80 00 04 bne 200c074 200c068: 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)) { 200c06c: 81 c7 e0 08 ret 200c070: 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] == '.'; 200c074: 02 80 00 58 be 200c1d4 200c078: 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] == '.'; 200c07c: 22 80 00 37 be,a 200c158 200c080: c2 4e 80 00 ldsb [ %i2 ], %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200c084: 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 ); 200c088: b2 07 20 54 add %i4, 0x54, %i1 while ( current != tail ) { 200c08c: 80 a7 40 19 cmp %i5, %i1 200c090: 02 80 00 30 be 200c150 200c094: 90 07 60 0c add %i5, 0xc, %o0 IMFS_jnode_t *entry = (IMFS_jnode_t *) current; bool match = strncmp( entry->name, token, tokenlen ) == 0 200c098: 92 10 00 1a mov %i2, %o1 200c09c: 40 00 16 66 call 2011a34 200c0a0: 94 10 00 1b mov %i3, %o2 && entry->name [tokenlen] == '\0'; 200c0a4: 80 a2 20 00 cmp %o0, 0 200c0a8: 12 80 00 26 bne 200c140 200c0ac: 82 07 40 1b add %i5, %i3, %g1 200c0b0: c2 48 60 0c ldsb [ %g1 + 0xc ], %g1 200c0b4: 80 a0 60 00 cmp %g1, 0 200c0b8: 32 80 00 23 bne,a 200c144 200c0bc: 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; 200c0c0: 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 ); 200c0c4: c4 06 20 04 ld [ %i0 + 4 ], %g2 200c0c8: c2 00 40 00 ld [ %g1 ], %g1 200c0cc: 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; 200c0d0: c0 26 20 0c clr [ %i0 + 0xc ] 200c0d4: 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; 200c0d8: 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)) { 200c0dc: 80 a0 60 02 cmp %g1, 2 200c0e0: 02 80 00 43 be 200c1ec 200c0e4: 86 10 00 02 mov %g2, %g3 entry = entry->info.hard_link.link_node; } if ( type == IMFS_SYM_LINK && (follow_sym_link || !terminal)) { 200c0e8: 80 a0 60 03 cmp %g1, 3 200c0ec: 02 80 00 28 be 200c18c 200c0f0: 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 ) { 200c0f4: 32 80 00 2c bne,a 200c1a4 200c0f8: c4 17 20 34 lduh [ %i4 + 0x34 ], %g2 if ( node->info.directory.mt_fs != NULL ) { 200c0fc: f6 07 60 5c ld [ %i5 + 0x5c ], %i3 200c100: 80 a6 e0 00 cmp %i3, 0 200c104: 02 80 00 27 be 200c1a0 200c108: 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( 200c10c: d4 07 60 30 ld [ %i5 + 0x30 ], %o2 200c110: d6 17 60 3c lduh [ %i5 + 0x3c ], %o3 200c114: d8 17 60 3e lduh [ %i5 + 0x3e ], %o4 200c118: 40 00 02 f4 call 200cce8 200c11c: 92 10 20 01 mov 1, %o1 RTEMS_FS_PERMS_EXEC, entry->st_mode, entry->st_uid, entry->st_gid ); if ( access_ok ) { 200c120: 80 8a 20 ff btst 0xff, %o0 200c124: 02 bf ff d2 be 200c06c <== NEVER TAKEN 200c128: 90 10 00 18 mov %i0, %o0 rtems_filesystem_eval_path_restart( ctx, fs_root_ptr ); 200c12c: 92 06 e0 24 add %i3, 0x24, %o1 200c130: 7f ff e2 8b call 2004b5c 200c134: b0 10 20 01 mov 1, %i0 200c138: 81 c7 e0 08 ret 200c13c: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Next( Chain_Node *the_node ) { return the_node->next; 200c140: 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 ) { 200c144: 80 a6 40 1d cmp %i1, %i5 200c148: 12 bf ff d4 bne 200c098 200c14c: 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; 200c150: 81 c7 e0 08 ret 200c154: 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] == '.'; 200c158: 80 a0 60 2e cmp %g1, 0x2e 200c15c: 32 bf ff cb bne,a 200c088 200c160: fa 07 20 50 ld [ %i4 + 0x50 ], %i5 200c164: c2 4e a0 01 ldsb [ %i2 + 1 ], %g1 200c168: 80 a0 60 2e cmp %g1, 0x2e 200c16c: 32 bf ff c7 bne,a 200c088 <== NEVER TAKEN 200c170: 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; 200c174: 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 ) { 200c178: 80 a7 60 00 cmp %i5, 0 200c17c: 02 bf ff f5 be 200c150 200c180: 01 00 00 00 nop 200c184: 10 bf ff d0 b 200c0c4 200c188: 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)) { 200c18c: 80 a0 a0 00 cmp %g2, 0 200c190: 02 80 00 20 be 200c210 200c194: 80 89 20 10 btst 0x10, %g4 200c198: 32 80 00 1f bne,a 200c214 200c19c: 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; 200c1a0: 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; 200c1a4: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 200c1a8: 84 00 bf ff add %g2, -1, %g2 200c1ac: c4 37 20 34 sth %g2, [ %i4 + 0x34 ] ++entry->reference_count; 200c1b0: c4 17 60 34 lduh [ %i5 + 0x34 ], %g2 200c1b4: c2 00 60 04 ld [ %g1 + 4 ], %g1 200c1b8: 84 00 a0 01 inc %g2 200c1bc: c4 37 60 34 sth %g2, [ %i5 + 0x34 ] currentloc->node_access = entry; 200c1c0: fa 26 20 20 st %i5, [ %i0 + 0x20 ] 200c1c4: c2 26 20 28 st %g1, [ %i0 + 0x28 ] void *arg, const char *token, size_t tokenlen ) { rtems_filesystem_eval_path_generic_status status = 200c1c8: b0 08 e0 ff and %g3, 0xff, %i0 status = RTEMS_FILESYSTEM_EVAL_PATH_GENERIC_NO_ENTRY; } } return status; } 200c1cc: 81 c7 e0 08 ret 200c1d0: 81 e8 00 00 restore static inline bool rtems_filesystem_is_current_directory( const char *token, size_t tokenlen ) { return tokenlen == 1 && token [0] == '.'; 200c1d4: c2 4e 80 00 ldsb [ %i2 ], %g1 200c1d8: 80 a0 60 2e cmp %g1, 0x2e 200c1dc: 32 bf ff ab bne,a 200c088 200c1e0: fa 07 20 50 ld [ %i4 + 0x50 ], %i5 200c1e4: 10 bf ff b7 b 200c0c0 200c1e8: 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)) { 200c1ec: 80 a0 a0 00 cmp %g2, 0 200c1f0: 12 80 00 04 bne 200c200 200c1f4: 80 89 20 08 btst 8, %g4 entry = entry->info.hard_link.link_node; 200c1f8: 10 bf ff ea b 200c1a0 200c1fc: 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)) { 200c200: 22 bf ff e9 be,a 200c1a4 200c204: c4 17 20 34 lduh [ %i4 + 0x34 ], %g2 200c208: 10 bf ff e6 b 200c1a0 200c20c: 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; 200c210: fa 07 60 50 ld [ %i5 + 0x50 ], %i5 rtems_filesystem_eval_path_recursive( ctx, target, strlen( target ) ); 200c214: 40 00 15 d6 call 201196c 200c218: 90 10 00 1d mov %i5, %o0 200c21c: 92 10 00 1d mov %i5, %o1 200c220: 94 10 00 08 mov %o0, %o2 200c224: 7f ff e2 67 call 2004bc0 200c228: 90 10 00 18 mov %i0, %o0 200c22c: 30 bf ff 90 b,a 200c06c =============================================================================== 0200c248 : int IMFS_fchmod( const rtems_filesystem_location_info_t *loc, mode_t mode ) { 200c248: 9d e3 bf 98 save %sp, -104, %sp /* * Verify I am the owner of the node or the super user. */ #if defined(RTEMS_POSIX_API) st_uid = geteuid(); 200c24c: 40 00 01 81 call 200c850 200c250: fa 06 20 08 ld [ %i0 + 8 ], %i5 if ( ( st_uid != jnode->st_uid ) && ( st_uid != 0 ) ) 200c254: c2 17 60 3c lduh [ %i5 + 0x3c ], %g1 200c258: 91 2a 20 10 sll %o0, 0x10, %o0 200c25c: 91 32 20 10 srl %o0, 0x10, %o0 200c260: 80 a0 40 08 cmp %g1, %o0 200c264: 02 80 00 04 be 200c274 200c268: 80 a2 20 00 cmp %o0, 0 200c26c: 12 80 00 0e bne 200c2a4 <== ALWAYS TAKEN 200c270: 01 00 00 00 nop /* * Change only the RWX permissions on the jnode to mode. */ jnode->st_mode &= ~(S_IRWXU | S_IRWXG | S_IRWXO | S_ISUID | S_ISGID | S_ISVTX); 200c274: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 jnode->st_mode |= mode & (S_IRWXU | S_IRWXG | S_IRWXO | S_ISUID | S_ISGID | S_ISVTX); IMFS_update_ctime( jnode ); 200c278: 90 07 bf f8 add %fp, -8, %o0 /* * Change only the RWX permissions on the jnode to mode. */ jnode->st_mode &= ~(S_IRWXU | S_IRWXG | S_IRWXO | S_ISUID | S_ISGID | S_ISVTX); 200c27c: 82 08 70 00 and %g1, -4096, %g1 jnode->st_mode |= mode & (S_IRWXU | S_IRWXG | S_IRWXO | S_ISUID | S_ISGID | S_ISVTX); IMFS_update_ctime( jnode ); 200c280: 92 10 20 00 clr %o1 /* * Change only the RWX permissions on the jnode to mode. */ jnode->st_mode &= ~(S_IRWXU | S_IRWXG | S_IRWXO | S_ISUID | S_ISGID | S_ISVTX); jnode->st_mode |= mode & (S_IRWXU | S_IRWXG | S_IRWXO | S_ISUID | S_ISGID | S_ISVTX); 200c284: b2 0e 6f ff and %i1, 0xfff, %i1 200c288: b2 16 40 01 or %i1, %g1, %i1 IMFS_update_ctime( jnode ); 200c28c: 7f ff dd 23 call 2003718 200c290: f2 27 60 30 st %i1, [ %i5 + 0x30 ] 200c294: c2 07 bf f8 ld [ %fp + -8 ], %g1 200c298: c2 27 60 48 st %g1, [ %i5 + 0x48 ] return 0; } 200c29c: 81 c7 e0 08 ret 200c2a0: 91 e8 20 00 restore %g0, 0, %o0 */ #if defined(RTEMS_POSIX_API) st_uid = geteuid(); if ( ( st_uid != jnode->st_uid ) && ( st_uid != 0 ) ) rtems_set_errno_and_return_minus_one( EPERM ); 200c2a4: 40 00 10 4d call 20103d8 <__errno> 200c2a8: b0 10 3f ff mov -1, %i0 200c2ac: 82 10 20 01 mov 1, %g1 200c2b0: c2 22 00 00 st %g1, [ %o0 ] 200c2b4: 81 c7 e0 08 ret 200c2b8: 81 e8 00 00 restore =============================================================================== 02003910 : static ssize_t IMFS_fifo_write( rtems_libio_t *iop, const void *buffer, size_t count ) { 2003910: 9d e3 bf 98 save %sp, -104, %sp IMFS_jnode_t *jnode = iop->pathinfo.node_access; 2003914: fa 06 20 1c ld [ %i0 + 0x1c ], %i5 int err = pipe_write(JNODE2PIPE(jnode), buffer, count, iop); 2003918: 96 10 00 18 mov %i0, %o3 200391c: d0 07 60 50 ld [ %i5 + 0x50 ], %o0 2003920: 92 10 00 19 mov %i1, %o1 2003924: 40 00 2d 64 call 200eeb4 2003928: 94 10 00 1a mov %i2, %o2 if (err > 0) { 200392c: b0 92 20 00 orcc %o0, 0, %i0 2003930: 04 80 00 09 ble 2003954 2003934: 90 07 bf f8 add %fp, -8, %o0 IMFS_mtime_ctime_update(jnode); 2003938: 40 00 04 4c call 2004a68 200393c: 92 10 20 00 clr %o1 2003940: c2 07 bf f8 ld [ %fp + -8 ], %g1 2003944: c2 27 60 44 st %g1, [ %i5 + 0x44 ] 2003948: c2 27 60 48 st %g1, [ %i5 + 0x48 ] 200394c: 81 c7 e0 08 ret 2003950: 81 e8 00 00 restore } IMFS_FIFO_RETURN(err); 2003954: 80 a6 20 00 cmp %i0, 0 2003958: 12 80 00 04 bne 2003968 <== ALWAYS TAKEN 200395c: 01 00 00 00 nop } 2003960: 81 c7 e0 08 ret <== NOT EXECUTED 2003964: 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); 2003968: 40 00 3b 09 call 201258c <__errno> 200396c: 01 00 00 00 nop 2003970: 82 20 00 18 neg %i0, %g1 2003974: c2 22 00 00 st %g1, [ %o0 ] } 2003978: 81 c7 e0 08 ret 200397c: 91 e8 3f ff restore %g0, -1, %o0 =============================================================================== 0200c2bc : ((IMFS_jnode_t *)( rtems_chain_head( jnode_get_control( jnode ) )->next)) void IMFS_fsunmount( rtems_filesystem_mount_table_entry_t *temp_mt_entry ) { 200c2bc: 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; 200c2c0: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 200c2c4: c6 00 a0 08 ld [ %g2 + 8 ], %g3 200c2c8: f2 00 80 00 ld [ %g2 ], %i1 200c2cc: f4 00 a0 04 ld [ %g2 + 4 ], %i2 200c2d0: f6 00 a0 0c ld [ %g2 + 0xc ], %i3 200c2d4: f8 00 a0 10 ld [ %g2 + 0x10 ], %i4 200c2d8: c8 00 a0 14 ld [ %g2 + 0x14 ], %g4 200c2dc: c2 00 e0 4c ld [ %g3 + 0x4c ], %g1 200c2e0: f2 27 bf e8 st %i1, [ %fp + -24 ] 200c2e4: f4 27 bf ec st %i2, [ %fp + -20 ] 200c2e8: c6 27 bf f0 st %g3, [ %fp + -16 ] 200c2ec: f6 27 bf f4 st %i3, [ %fp + -12 ] 200c2f0: f8 27 bf f8 st %i4, [ %fp + -8 ] 200c2f4: 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; 200c2f8: c0 20 a0 08 clr [ %g2 + 8 ] 200c2fc: 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; 200c300: ba 10 00 03 mov %g3, %i5 200c304: c2 00 60 04 ld [ %g1 + 4 ], %g1 */ temp_mt_entry->mt_fs_root->location.node_access = NULL; do { next = jnode->Parent; 200c308: f8 07 60 08 ld [ %i5 + 8 ], %i4 loc.node_access = (void *)jnode; 200c30c: fa 27 bf f0 st %i5, [ %fp + -16 ] IMFS_Set_handlers( &loc ); if ( !IMFS_is_directory( jnode ) || jnode_has_no_children( jnode ) ) { 200c310: 80 a0 a0 00 cmp %g2, 0 200c314: 12 80 00 13 bne 200c360 <== NEVER TAKEN 200c318: c2 27 bf f8 st %g1, [ %fp + -8 ] 200c31c: 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 ); 200c320: 84 07 60 54 add %i5, 0x54, %g2 200c324: 80 a0 40 02 cmp %g1, %g2 200c328: 02 80 00 0f be 200c364 200c32c: 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; 200c330: 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); 200c334: 80 a7 60 00 cmp %i5, 0 200c338: 02 80 00 21 be 200c3bc <== NEVER TAKEN 200c33c: 01 00 00 00 nop 200c340: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 */ temp_mt_entry->mt_fs_root->location.node_access = NULL; do { next = jnode->Parent; 200c344: f8 07 60 08 ld [ %i5 + 8 ], %i4 200c348: c4 00 40 00 ld [ %g1 ], %g2 200c34c: c2 00 60 04 ld [ %g1 + 4 ], %g1 loc.node_access = (void *)jnode; 200c350: fa 27 bf f0 st %i5, [ %fp + -16 ] IMFS_Set_handlers( &loc ); if ( !IMFS_is_directory( jnode ) || jnode_has_no_children( jnode ) ) { 200c354: 80 a0 a0 00 cmp %g2, 0 200c358: 02 bf ff f1 be 200c31c 200c35c: c2 27 bf f8 st %g1, [ %fp + -8 ] result = IMFS_rmnod( NULL, &loc ); 200c360: 90 10 20 00 clr %o0 200c364: 7f ff db 73 call 2003130 200c368: 92 07 bf e8 add %fp, -24, %o1 if ( result != 0 ) 200c36c: 80 a2 20 00 cmp %o0, 0 200c370: 12 80 00 15 bne 200c3c4 <== NEVER TAKEN 200c374: 11 37 ab 6f sethi %hi(0xdeadbc00), %o0 rtems_fatal_error_occurred( 0xdeadbeef ); IMFS_node_destroy( jnode ); 200c378: 7f ff da 8c call 2002da8 200c37c: 90 10 00 1d mov %i5, %o0 jnode = next; } if ( jnode != NULL ) { 200c380: 80 a7 20 00 cmp %i4, 0 200c384: 02 80 00 0e be 200c3bc 200c388: 01 00 00 00 nop 200c38c: c2 07 20 4c ld [ %i4 + 0x4c ], %g1 200c390: c4 00 40 00 ld [ %g1 ], %g2 if ( IMFS_is_directory( jnode ) ) { 200c394: 80 a0 a0 00 cmp %g2, 0 200c398: 12 bf ff db bne 200c304 <== NEVER TAKEN 200c39c: ba 10 00 1c mov %i4, %i5 200c3a0: 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 ); 200c3a4: 86 07 20 54 add %i4, 0x54, %g3 if ( jnode_has_children( jnode ) ) 200c3a8: 80 a7 40 03 cmp %i5, %g3 200c3ac: 12 bf ff e3 bne 200c338 200c3b0: 80 a7 60 00 cmp %i5, 0 200c3b4: 10 bf ff d4 b 200c304 200c3b8: ba 10 00 1c mov %i4, %i5 200c3bc: 81 c7 e0 08 ret 200c3c0: 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 ); 200c3c4: 7f ff ef cc call 20082f4 <== NOT EXECUTED 200c3c8: 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 77 sethi %hi(0x201dc00), %g1 IMFS_jnode_t *root_node; fs_info->instance = imfs_instance++; 2002cb0: c4 00 63 0c ld [ %g1 + 0x30c ], %g2 ! 201df0c 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 63 0c st %g3, [ %g1 + 0x30c ] memcpy( 2002cc8: 40 00 38 15 call 2010d1c 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 6e sethi %hi(0x201b800), %o2 2002ce0: 9a 10 20 00 clr %o5 2002ce4: 94 12 a2 78 or %o2, 0x278, %o2 2002ce8: 19 00 00 10 sethi %hi(0x4000), %o4 2002cec: 40 00 24 84 call 200befc 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 70 sethi %hi(0x201c000), %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 75 sethi %hi(0x201d400), %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 23 64 or %g4, 0x364, %g4 errno = ENOMEM; rv = -1; } if ( rv == 0 ) { IMFS_determine_bytes_per_block( 2002d1c: c4 00 a3 40 ld [ %g2 + 0x340 ], %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 77 sethi %hi(0x201dc00), %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 77 sethi %hi(0x201dc00), %g1 2002d6c: c4 20 63 08 st %g2, [ %g1 + 0x308 ] ! 201df08 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 35 98 call 20103d8 <__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 89 sethi %hi(0x2022400), %g1 2004914: c2 00 61 a4 ld [ %g1 + 0x1a4 ], %g1 ! 20225a4 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 41 e1 call 201513c <__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 53 call 2010b30 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 =============================================================================== 0200ed44 : */ MEMFILE_STATIC int IMFS_memfile_addblock( IMFS_jnode_t *the_jnode, unsigned int block ) { 200ed44: 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 ); 200ed48: 94 10 20 01 mov 1, %o2 200ed4c: 90 10 00 18 mov %i0, %o0 200ed50: 7f ff fe c9 call 200e874 200ed54: 92 10 00 19 mov %i1, %o1 if ( *block_entry_ptr ) 200ed58: 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 ); 200ed5c: ba 10 00 08 mov %o0, %i5 if ( *block_entry_ptr ) 200ed60: 80 a0 60 00 cmp %g1, 0 200ed64: 12 80 00 08 bne 200ed84 200ed68: b0 10 20 00 clr %i0 return 0; /* * There is no memory for this block number so allocate it. */ memory = memfile_alloc_block(); 200ed6c: 7f ff fe b5 call 200e840 200ed70: 01 00 00 00 nop if ( !memory ) 200ed74: 80 a2 20 00 cmp %o0, 0 200ed78: 02 80 00 05 be 200ed8c <== NEVER TAKEN 200ed7c: 01 00 00 00 nop return 1; *block_entry_ptr = memory; 200ed80: d0 27 40 00 st %o0, [ %i5 ] return 0; 200ed84: 81 c7 e0 08 ret 200ed88: 81 e8 00 00 restore } 200ed8c: 81 c7 e0 08 ret <== NOT EXECUTED 200ed90: 91 e8 20 01 restore %g0, 1, %o0 <== NOT EXECUTED =============================================================================== 0200efb8 : MEMFILE_STATIC int IMFS_memfile_extend( IMFS_jnode_t *the_jnode, bool zero_fill, off_t new_length ) { 200efb8: 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 ) 200efbc: 25 00 80 77 sethi %hi(0x201dc00), %l2 200efc0: fa 04 a3 08 ld [ %l2 + 0x308 ], %i5 ! 201df08 200efc4: b9 37 60 02 srl %i5, 2, %i4 200efc8: 92 10 00 1c mov %i4, %o1 200efcc: 40 00 28 46 call 20190e4 <.umul> 200efd0: 90 07 20 01 add %i4, 1, %o0 200efd4: 92 10 00 1c mov %i4, %o1 200efd8: 40 00 28 43 call 20190e4 <.umul> 200efdc: 90 02 20 01 inc %o0 200efe0: 92 10 00 1d mov %i5, %o1 200efe4: 40 00 28 40 call 20190e4 <.umul> 200efe8: 90 02 3f ff add %o0, -1, %o0 200efec: 82 10 20 00 clr %g1 200eff0: 80 a0 40 1a cmp %g1, %i2 200eff4: 04 80 00 58 ble 200f154 <== ALWAYS TAKEN 200eff8: 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 ) 200effc: e2 07 20 50 ld [ %i4 + 0x50 ], %l1 <== NOT EXECUTED 200f000: 80 a6 80 11 cmp %i2, %l1 200f004: 04 80 00 3f ble 200f100 <== ALWAYS TAKEN 200f008: 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; 200f00c: a7 3f 60 1f sra %i5, 0x1f, %l3 <== NOT EXECUTED 200f010: 96 10 00 1d mov %i5, %o3 200f014: 94 10 00 13 mov %l3, %o2 200f018: 90 10 00 1a mov %i2, %o0 200f01c: 40 00 29 c4 call 201972c <__divdi3> 200f020: 92 10 00 1b mov %i3, %o1 old_blocks = the_jnode->info.file.size / IMFS_MEMFILE_BYTES_PER_BLOCK; 200f024: 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; 200f028: b0 10 00 09 mov %o1, %i0 old_blocks = the_jnode->info.file.size / IMFS_MEMFILE_BYTES_PER_BLOCK; 200f02c: 90 10 00 11 mov %l1, %o0 200f030: 92 10 00 10 mov %l0, %o1 200f034: 40 00 29 be call 201972c <__divdi3> 200f038: 94 10 00 13 mov %l3, %o2 200f03c: a2 10 00 09 mov %o1, %l1 offset = the_jnode->info.file.size - old_blocks * IMFS_MEMFILE_BYTES_PER_BLOCK; 200f040: 90 10 00 09 mov %o1, %o0 200f044: 40 00 28 28 call 20190e4 <.umul> 200f048: 92 10 00 1d mov %i5, %o1 /* * Now allocate each of those blocks. */ for ( block=old_blocks ; block<=new_blocks ; block++ ) { 200f04c: ba 10 00 11 mov %l1, %i5 200f050: 80 a6 00 11 cmp %i0, %l1 200f054: 1a 80 00 07 bcc 200f070 <== ALWAYS TAKEN 200f058: 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); 200f05c: 10 80 00 1d b 200f0d0 <== NOT EXECUTED 200f060: 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++ ) { 200f064: 80 a6 00 1d cmp %i0, %i5 200f068: 0a 80 00 1a bcs 200f0d0 200f06c: 92 10 20 00 clr %o1 if ( !IMFS_memfile_addblock( the_jnode, block ) ) { 200f070: 92 10 00 1d mov %i5, %o1 200f074: 7f ff ff 34 call 200ed44 200f078: 90 10 00 1c mov %i4, %o0 200f07c: 80 a2 20 00 cmp %o0, 0 200f080: 12 80 00 26 bne 200f118 <== NEVER TAKEN 200f084: 80 a6 60 00 cmp %i1, 0 if ( zero_fill ) { 200f088: 22 bf ff f7 be,a 200f064 200f08c: ba 07 60 01 inc %i5 size_t count = IMFS_MEMFILE_BYTES_PER_BLOCK - offset; block_p *block_ptr = 200f090: 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; 200f094: e6 04 a3 08 ld [ %l2 + 0x308 ], %l3 block_p *block_ptr = 200f098: 94 10 20 00 clr %o2 200f09c: 7f ff fd f6 call 200e874 200f0a0: 90 10 00 1c mov %i4, %o0 IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); memset( &(*block_ptr) [offset], 0, count); 200f0a4: 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; 200f0a8: 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); 200f0ac: 90 02 00 10 add %o0, %l0, %o0 200f0b0: 92 10 20 00 clr %o1 200f0b4: 40 00 07 57 call 2010e10 200f0b8: 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++ ) { 200f0bc: ba 07 60 01 inc %i5 200f0c0: 80 a6 00 1d cmp %i0, %i5 200f0c4: 1a bf ff eb bcc 200f070 200f0c8: 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); 200f0cc: 92 10 20 00 clr %o1 } /* * Set the new length of the file. */ the_jnode->info.file.size = new_length; 200f0d0: f4 3f 20 50 std %i2, [ %i4 + 0x50 ] IMFS_update_ctime(the_jnode); 200f0d4: 7f ff d1 91 call 2003718 200f0d8: 90 07 bf f8 add %fp, -8, %o0 200f0dc: c2 07 bf f8 ld [ %fp + -8 ], %g1 IMFS_update_mtime(the_jnode); 200f0e0: 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); 200f0e4: c2 27 20 48 st %g1, [ %i4 + 0x48 ] IMFS_update_mtime(the_jnode); 200f0e8: 7f ff d1 8c call 2003718 200f0ec: 92 10 20 00 clr %o1 200f0f0: c2 07 bf f8 ld [ %fp + -8 ], %g1 200f0f4: c2 27 20 44 st %g1, [ %i4 + 0x44 ] return 0; 200f0f8: 81 c7 e0 08 ret 200f0fc: 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 ) 200f100: 12 80 00 04 bne 200f110 <== NEVER TAKEN 200f104: 80 a6 c0 10 cmp %i3, %l0 200f108: 18 bf ff c2 bgu 200f010 <== ALWAYS TAKEN 200f10c: 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; } 200f110: 81 c7 e0 08 ret <== NOT EXECUTED 200f114: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED memset( &(*block_ptr) [offset], 0, count); offset = 0; } } else { for ( ; block>=old_blocks ; block-- ) { 200f118: 80 a7 40 11 cmp %i5, %l1 <== NOT EXECUTED 200f11c: 0a 80 00 08 bcs 200f13c <== NOT EXECUTED 200f120: 92 10 00 1d mov %i5, %o1 <== NOT EXECUTED IMFS_memfile_remove_block( the_jnode, block ); 200f124: 7f ff ff 99 call 200ef88 <== NOT EXECUTED 200f128: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED memset( &(*block_ptr) [offset], 0, count); offset = 0; } } else { for ( ; block>=old_blocks ; block-- ) { 200f12c: ba 07 7f ff add %i5, -1, %i5 <== NOT EXECUTED 200f130: 80 a4 40 1d cmp %l1, %i5 <== NOT EXECUTED 200f134: 08 bf ff fc bleu 200f124 <== NOT EXECUTED 200f138: 92 10 00 1d mov %i5, %o1 <== NOT EXECUTED IMFS_memfile_remove_block( the_jnode, block ); } rtems_set_errno_and_return_minus_one( ENOSPC ); 200f13c: 40 00 04 a7 call 20103d8 <__errno> <== NOT EXECUTED 200f140: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 200f144: 82 10 20 1c mov 0x1c, %g1 <== NOT EXECUTED 200f148: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 200f14c: 81 c7 e0 08 ret <== NOT EXECUTED 200f150: 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 ) 200f154: 12 80 00 04 bne 200f164 <== NEVER TAKEN 200f158: 80 a2 00 1b cmp %o0, %i3 200f15c: 38 bf ff a9 bgu,a 200f000 200f160: e2 07 20 50 ld [ %i4 + 0x50 ], %l1 rtems_set_errno_and_return_minus_one( EFBIG ); 200f164: 40 00 04 9d call 20103d8 <__errno> 200f168: b0 10 3f ff mov -1, %i0 200f16c: 82 10 20 1b mov 0x1b, %g1 200f170: c2 22 00 00 st %g1, [ %o0 ] 200f174: 81 c7 e0 08 ret 200f178: 81 e8 00 00 restore =============================================================================== 0200e874 : #endif IMFS_jnode_t *the_jnode, unsigned int block, int malloc_it ) { 200e874: 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 ) { 200e878: 03 00 80 77 sethi %hi(0x201dc00), %g1 200e87c: fa 00 63 08 ld [ %g1 + 0x308 ], %i5 ! 201df08 200e880: bb 37 60 02 srl %i5, 2, %i5 200e884: 82 07 7f ff add %i5, -1, %g1 200e888: 80 a6 40 01 cmp %i1, %g1 200e88c: 38 80 00 0b bgu,a 200e8b8 200e890: 90 07 60 01 add %i5, 1, %o0 p = info->indirect; if ( malloc_it ) { 200e894: 80 a6 a0 00 cmp %i2, 0 200e898: 12 80 00 4e bne 200e9d0 200e89c: d0 06 20 58 ld [ %i0 + 0x58 ], %o0 info->indirect = p; } return &info->indirect[ my_block ]; } if ( !p ) 200e8a0: 80 a2 20 00 cmp %o0, 0 200e8a4: 02 80 00 6d be 200ea58 <== NEVER TAKEN 200e8a8: 01 00 00 00 nop return 0; return &info->indirect[ my_block ]; 200e8ac: b3 2e 60 02 sll %i1, 2, %i1 200e8b0: 81 c7 e0 08 ret 200e8b4: 91 ea 00 19 restore %o0, %i1, %o0 /* * Is the block number in the doubly indirect portion? */ if ( my_block <= LAST_DOUBLY_INDIRECT ) { 200e8b8: 40 00 2a 0b call 20190e4 <.umul> 200e8bc: 92 10 00 1d mov %i5, %o1 200e8c0: 82 02 3f ff add %o0, -1, %g1 200e8c4: 80 a6 40 01 cmp %i1, %g1 200e8c8: 08 80 00 2b bleu 200e974 200e8cc: b8 10 00 08 mov %o0, %i4 } /* * Is the block number in the triply indirect portion? */ if ( my_block <= LAST_TRIPLY_INDIRECT ) { 200e8d0: 90 02 20 01 inc %o0 200e8d4: 40 00 2a 04 call 20190e4 <.umul> 200e8d8: 92 10 00 1d mov %i5, %o1 200e8dc: 90 02 3f ff add %o0, -1, %o0 200e8e0: 80 a6 40 08 cmp %i1, %o0 200e8e4: 18 80 00 5d bgu 200ea58 <== NEVER TAKEN 200e8e8: b2 26 40 1c sub %i1, %i4, %i1 my_block -= FIRST_TRIPLY_INDIRECT; singly = my_block % IMFS_MEMFILE_BLOCK_SLOTS; 200e8ec: 92 10 00 1d mov %i5, %o1 200e8f0: 40 00 2a e3 call 201947c <.urem> 200e8f4: 90 10 00 19 mov %i1, %o0 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200e8f8: 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; 200e8fc: a0 10 00 08 mov %o0, %l0 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200e900: 40 00 2a 33 call 20191cc <.udiv> 200e904: 90 10 00 19 mov %i1, %o0 triply = doubly / IMFS_MEMFILE_BLOCK_SLOTS; 200e908: 92 10 00 1d mov %i5, %o1 200e90c: 40 00 2a 30 call 20191cc <.udiv> 200e910: b8 10 00 08 mov %o0, %i4 doubly %= IMFS_MEMFILE_BLOCK_SLOTS; 200e914: 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; 200e918: b6 10 00 08 mov %o0, %i3 doubly %= IMFS_MEMFILE_BLOCK_SLOTS; 200e91c: 40 00 2a d8 call 201947c <.urem> 200e920: 90 10 00 1c mov %i4, %o0 p = info->triply_indirect; if ( malloc_it ) { 200e924: 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; 200e928: ba 10 00 08 mov %o0, %i5 p = info->triply_indirect; if ( malloc_it ) { 200e92c: 02 80 00 3d be 200ea20 200e930: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 if ( !p ) { 200e934: 80 a2 20 00 cmp %o0, 0 200e938: 02 80 00 66 be 200ead0 200e93c: 01 00 00 00 nop if ( !p ) return 0; info->triply_indirect = p; } p1 = (block_p *) p[ triply ]; 200e940: b7 2e e0 02 sll %i3, 2, %i3 200e944: c4 02 00 1b ld [ %o0 + %i3 ], %g2 if ( !p1 ) { 200e948: 80 a0 a0 00 cmp %g2, 0 200e94c: 02 80 00 5a be 200eab4 200e950: b6 02 00 1b add %o0, %i3, %i3 if ( !p1 ) return 0; p[ triply ] = (block_p) p1; } p2 = (block_p *)p1[ doubly ]; 200e954: bb 2f 60 02 sll %i5, 2, %i5 200e958: d0 00 80 1d ld [ %g2 + %i5 ], %o0 if ( !p2 ) { 200e95c: 80 a2 20 00 cmp %o0, 0 200e960: 02 80 00 47 be 200ea7c 200e964: 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 ]; 200e968: b1 2c 20 02 sll %l0, 2, %i0 200e96c: 81 c7 e0 08 ret 200e970: 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; 200e974: b2 26 40 1d sub %i1, %i5, %i1 singly = my_block % IMFS_MEMFILE_BLOCK_SLOTS; 200e978: 92 10 00 1d mov %i5, %o1 200e97c: 40 00 2a c0 call 201947c <.urem> 200e980: 90 10 00 19 mov %i1, %o0 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200e984: 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; 200e988: b8 10 00 08 mov %o0, %i4 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200e98c: 40 00 2a 10 call 20191cc <.udiv> 200e990: 90 10 00 19 mov %i1, %o0 p = info->doubly_indirect; 200e994: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 if ( malloc_it ) { 200e998: 80 a6 a0 00 cmp %i2, 0 200e99c: 02 80 00 17 be 200e9f8 200e9a0: ba 10 00 08 mov %o0, %i5 if ( !p ) { 200e9a4: 80 a0 60 00 cmp %g1, 0 200e9a8: 02 80 00 3c be 200ea98 200e9ac: 01 00 00 00 nop if ( !p ) return 0; info->doubly_indirect = p; } p1 = (block_p *)p[ doubly ]; 200e9b0: bb 2f 60 02 sll %i5, 2, %i5 200e9b4: d0 00 40 1d ld [ %g1 + %i5 ], %o0 if ( !p1 ) { 200e9b8: 80 a2 20 00 cmp %o0, 0 200e9bc: 02 80 00 29 be 200ea60 200e9c0: ba 00 40 1d add %g1, %i5, %i5 if ( !p1 ) return 0; p[ doubly ] = (block_p) p1; } return (block_p *)&p1[ singly ]; 200e9c4: b1 2f 20 02 sll %i4, 2, %i0 200e9c8: 81 c7 e0 08 ret 200e9cc: 91 ea 00 18 restore %o0, %i0, %o0 if ( my_block <= LAST_INDIRECT ) { p = info->indirect; if ( malloc_it ) { if ( !p ) { 200e9d0: 80 a2 20 00 cmp %o0, 0 200e9d4: 32 bf ff b7 bne,a 200e8b0 200e9d8: b3 2e 60 02 sll %i1, 2, %i1 p = memfile_alloc_block(); 200e9dc: 7f ff ff 99 call 200e840 200e9e0: 01 00 00 00 nop if ( !p ) 200e9e4: 80 a2 20 00 cmp %o0, 0 200e9e8: 02 80 00 1c be 200ea58 <== NEVER TAKEN 200e9ec: 01 00 00 00 nop return 0; info->indirect = p; 200e9f0: 10 bf ff af b 200e8ac 200e9f4: d0 26 20 58 st %o0, [ %i0 + 0x58 ] } return (block_p *)&p1[ singly ]; } if ( !p ) 200e9f8: 80 a0 60 00 cmp %g1, 0 200e9fc: 02 80 00 17 be 200ea58 <== NEVER TAKEN 200ea00: bb 2a 20 02 sll %o0, 2, %i5 return 0; p = (block_p *)p[ doubly ]; 200ea04: c2 00 40 1d ld [ %g1 + %i5 ], %g1 if ( !p ) 200ea08: 80 a0 60 00 cmp %g1, 0 200ea0c: 02 80 00 13 be 200ea58 <== NEVER TAKEN 200ea10: 01 00 00 00 nop return 0; return (block_p *)&p[ singly ]; 200ea14: b1 2f 20 02 sll %i4, 2, %i0 200ea18: 81 c7 e0 08 ret 200ea1c: 91 e8 40 18 restore %g1, %i0, %o0 p1[ doubly ] = (block_p) p2; } return (block_p *)&p2[ singly ]; } if ( !p ) 200ea20: 80 a2 20 00 cmp %o0, 0 200ea24: 02 80 00 0d be 200ea58 <== NEVER TAKEN 200ea28: b7 2e e0 02 sll %i3, 2, %i3 return 0; p1 = (block_p *) p[ triply ]; 200ea2c: c2 02 00 1b ld [ %o0 + %i3 ], %g1 if ( !p1 ) 200ea30: 80 a0 60 00 cmp %g1, 0 200ea34: 02 80 00 09 be 200ea58 <== NEVER TAKEN 200ea38: bb 2f 60 02 sll %i5, 2, %i5 return 0; p2 = (block_p *)p1[ doubly ]; 200ea3c: c2 00 40 1d ld [ %g1 + %i5 ], %g1 if ( !p2 ) 200ea40: 80 a0 60 00 cmp %g1, 0 200ea44: 02 80 00 05 be 200ea58 <== NEVER TAKEN 200ea48: 01 00 00 00 nop return 0; return (block_p *)&p2[ singly ]; 200ea4c: b1 2c 20 02 sll %l0, 2, %i0 /* * This means the requested block number is out of range. */ return 0; } 200ea50: 81 c7 e0 08 ret 200ea54: 91 e8 40 18 restore %g1, %i0, %o0 if ( malloc_it ) { if ( !p ) { p = memfile_alloc_block(); if ( !p ) return 0; 200ea58: 81 c7 e0 08 ret <== NOT EXECUTED 200ea5c: 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(); 200ea60: 7f ff ff 78 call 200e840 200ea64: 01 00 00 00 nop if ( !p1 ) 200ea68: 80 a2 20 00 cmp %o0, 0 200ea6c: 02 bf ff fb be 200ea58 <== NEVER TAKEN 200ea70: 01 00 00 00 nop return 0; p[ doubly ] = (block_p) p1; 200ea74: 10 bf ff d4 b 200e9c4 200ea78: d0 27 40 00 st %o0, [ %i5 ] p[ triply ] = (block_p) p1; } p2 = (block_p *)p1[ doubly ]; if ( !p2 ) { p2 = memfile_alloc_block(); 200ea7c: 7f ff ff 71 call 200e840 200ea80: 01 00 00 00 nop if ( !p2 ) 200ea84: 80 a2 20 00 cmp %o0, 0 200ea88: 02 bf ff f4 be 200ea58 <== NEVER TAKEN 200ea8c: 01 00 00 00 nop return 0; p1[ doubly ] = (block_p) p2; 200ea90: 10 bf ff b6 b 200e968 200ea94: d0 27 40 00 st %o0, [ %i5 ] p = info->doubly_indirect; if ( malloc_it ) { if ( !p ) { p = memfile_alloc_block(); 200ea98: 7f ff ff 6a call 200e840 200ea9c: 01 00 00 00 nop if ( !p ) 200eaa0: 82 92 20 00 orcc %o0, 0, %g1 200eaa4: 02 bf ff ed be 200ea58 <== NEVER TAKEN 200eaa8: 01 00 00 00 nop return 0; info->doubly_indirect = p; 200eaac: 10 bf ff c1 b 200e9b0 200eab0: c2 26 20 5c st %g1, [ %i0 + 0x5c ] info->triply_indirect = p; } p1 = (block_p *) p[ triply ]; if ( !p1 ) { p1 = memfile_alloc_block(); 200eab4: 7f ff ff 63 call 200e840 200eab8: 01 00 00 00 nop if ( !p1 ) 200eabc: 84 92 20 00 orcc %o0, 0, %g2 200eac0: 02 bf ff e6 be 200ea58 <== NEVER TAKEN 200eac4: 01 00 00 00 nop return 0; p[ triply ] = (block_p) p1; 200eac8: 10 bf ff a3 b 200e954 200eacc: c4 26 c0 00 st %g2, [ %i3 ] p = info->triply_indirect; if ( malloc_it ) { if ( !p ) { p = memfile_alloc_block(); 200ead0: 7f ff ff 5c call 200e840 200ead4: 01 00 00 00 nop if ( !p ) 200ead8: 80 a2 20 00 cmp %o0, 0 200eadc: 02 bf ff df be 200ea58 <== NEVER TAKEN 200eae0: 01 00 00 00 nop return 0; info->triply_indirect = p; 200eae4: 10 bf ff 97 b 200e940 200eae8: d0 26 20 60 st %o0, [ %i0 + 0x60 ] =============================================================================== 0200eaec : IMFS_jnode_t *the_jnode, off_t start, unsigned char *destination, unsigned int length ) { 200eaec: 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; 200eaf0: c2 06 20 4c ld [ %i0 + 0x4c ], %g1 200eaf4: 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 ) { 200eaf8: c2 00 40 00 ld [ %g1 ], %g1 IMFS_jnode_t *the_jnode, off_t start, unsigned char *destination, unsigned int length ) { 200eafc: a0 10 00 19 mov %i1, %l0 200eb00: 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 ) { 200eb04: 80 a0 60 05 cmp %g1, 5 200eb08: 02 80 00 68 be 200eca8 200eb0c: 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 ) 200eb10: c4 06 20 50 ld [ %i0 + 0x50 ], %g2 200eb14: 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; 200eb18: 82 10 00 1a mov %i2, %g1 if ( last_byte > the_jnode->info.file.size ) 200eb1c: c8 06 20 54 ld [ %i0 + 0x54 ], %g4 200eb20: 80 a0 c0 02 cmp %g3, %g2 200eb24: 04 80 00 42 ble 200ec2c <== ALWAYS TAKEN 200eb28: ba 07 00 1a add %i4, %i2, %i5 my_length = the_jnode->info.file.size - start; 200eb2c: 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; 200eb30: 33 00 80 77 sethi %hi(0x201dc00), %i1 <== NOT EXECUTED 200eb34: fa 06 63 08 ld [ %i1 + 0x308 ], %i5 ! 201df08 200eb38: 90 10 00 10 mov %l0, %o0 200eb3c: b7 3f 60 1f sra %i5, 0x1f, %i3 200eb40: 96 10 00 1d mov %i5, %o3 200eb44: 94 10 00 1b mov %i3, %o2 200eb48: 40 00 2b e4 call 2019ad8 <__moddi3> 200eb4c: 92 10 00 11 mov %l1, %o1 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200eb50: 90 10 00 10 mov %l0, %o0 */ /* * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; 200eb54: a8 10 00 09 mov %o1, %l4 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200eb58: 94 10 00 1b mov %i3, %o2 200eb5c: 92 10 00 11 mov %l1, %o1 200eb60: 40 00 2a f3 call 201972c <__divdi3> 200eb64: 96 10 00 1d mov %i5, %o3 if ( start_offset ) { 200eb68: 80 a5 20 00 cmp %l4, 0 200eb6c: 02 80 00 37 be 200ec48 200eb70: b4 10 00 09 mov %o1, %i2 to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK - start_offset; 200eb74: ba 27 40 14 sub %i5, %l4, %i5 200eb78: 80 a7 00 1d cmp %i4, %i5 200eb7c: 18 80 00 59 bgu 200ece0 200eb80: 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 ); 200eb84: 90 10 00 12 mov %l2, %o0 200eb88: 92 10 00 1a mov %i2, %o1 200eb8c: 94 10 20 00 clr %o2 200eb90: 7f ff ff 39 call 200e874 200eb94: b0 10 20 00 clr %i0 if ( !block_ptr ) 200eb98: 80 a2 20 00 cmp %o0, 0 200eb9c: 02 80 00 22 be 200ec24 <== NEVER TAKEN 200eba0: 94 10 00 10 mov %l0, %o2 return copied; memcpy( dest, &(*block_ptr)[ start_offset ], to_copy ); 200eba4: d2 02 00 00 ld [ %o0 ], %o1 200eba8: 90 10 00 13 mov %l3, %o0 200ebac: 40 00 08 5c call 2010d1c 200ebb0: 92 02 40 14 add %o1, %l4, %o1 200ebb4: fa 06 63 08 ld [ %i1 + 0x308 ], %i5 dest += to_copy; 200ebb8: b6 04 c0 10 add %l3, %l0, %i3 block++; 200ebbc: b4 06 a0 01 inc %i2 my_length -= to_copy; 200ebc0: b8 27 00 10 sub %i4, %l0, %i4 copied += to_copy; 200ebc4: 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 ) { 200ebc8: 80 a7 00 1d cmp %i4, %i5 200ebcc: 1a 80 00 0e bcc 200ec04 200ebd0: 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 ) { 200ebd4: 10 80 00 21 b 200ec58 200ebd8: 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 ); 200ebdc: d2 00 40 00 ld [ %g1 ], %o1 200ebe0: 40 00 08 4f call 2010d1c 200ebe4: 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 ) { 200ebe8: c2 06 63 08 ld [ %i1 + 0x308 ], %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; 200ebec: b6 06 c0 1d add %i3, %i5, %i3 block++; 200ebf0: 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 ) { 200ebf4: 80 a0 40 1c cmp %g1, %i4 200ebf8: 18 80 00 17 bgu 200ec54 200ebfc: b0 06 00 1d add %i0, %i5, %i0 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200ec00: 94 10 20 00 clr %o2 200ec04: 92 10 00 1a mov %i2, %o1 200ec08: 7f ff ff 1b call 200e874 200ec0c: 90 10 00 12 mov %l2, %o0 if ( !block_ptr ) return copied; memcpy( dest, &(*block_ptr)[ 0 ], to_copy ); 200ec10: 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 ); 200ec14: 82 10 00 08 mov %o0, %g1 if ( !block_ptr ) 200ec18: 80 a0 60 00 cmp %g1, 0 200ec1c: 12 bf ff f0 bne 200ebdc <== ALWAYS TAKEN 200ec20: 90 10 00 1b mov %i3, %o0 } IMFS_update_atime( the_jnode ); return copied; } 200ec24: 81 c7 e0 08 ret <== NOT EXECUTED 200ec28: 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 ) 200ec2c: 12 bf ff c2 bne 200eb34 <== NEVER TAKEN 200ec30: 33 00 80 77 sethi %hi(0x201dc00), %i1 200ec34: 80 a7 40 04 cmp %i5, %g4 200ec38: 08 bf ff c0 bleu 200eb38 200ec3c: fa 06 63 08 ld [ %i1 + 0x308 ], %i5 my_length = the_jnode->info.file.size - start; 200ec40: 10 bf ff bd b 200eb34 200ec44: b8 21 00 01 sub %g4, %g1, %i4 unsigned int last_byte; unsigned int copied; unsigned int start_offset; unsigned char *dest; dest = destination; 200ec48: 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; 200ec4c: 10 bf ff df b 200ebc8 200ec50: 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 ) { 200ec54: 80 a7 20 00 cmp %i4, 0 200ec58: 02 80 00 0e be 200ec90 200ec5c: 90 07 bf f8 add %fp, -8, %o0 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200ec60: 90 10 00 12 mov %l2, %o0 200ec64: 92 10 00 1a mov %i2, %o1 200ec68: 7f ff ff 03 call 200e874 200ec6c: 94 10 20 00 clr %o2 if ( !block_ptr ) 200ec70: 80 a2 20 00 cmp %o0, 0 200ec74: 02 bf ff ec be 200ec24 <== NEVER TAKEN 200ec78: 94 10 00 1c mov %i4, %o2 return copied; memcpy( dest, &(*block_ptr)[ 0 ], my_length ); 200ec7c: d2 02 00 00 ld [ %o0 ], %o1 200ec80: 90 10 00 1b mov %i3, %o0 200ec84: 40 00 08 26 call 2010d1c 200ec88: b0 06 00 1c add %i0, %i4, %i0 copied += my_length; } IMFS_update_atime( the_jnode ); 200ec8c: 90 07 bf f8 add %fp, -8, %o0 200ec90: 7f ff d2 a2 call 2003718 200ec94: 92 10 20 00 clr %o1 200ec98: c2 07 bf f8 ld [ %fp + -8 ], %g1 200ec9c: c2 24 a0 40 st %g1, [ %l2 + 0x40 ] return copied; } 200eca0: 81 c7 e0 08 ret 200eca4: 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)) 200eca8: f4 1e 20 50 ldd [ %i0 + 0x50 ], %i2 200ecac: 82 10 20 00 clr %g1 200ecb0: 86 a6 c0 11 subcc %i3, %l1, %g3 200ecb4: 84 66 80 19 subx %i2, %i1, %g2 200ecb8: 80 a0 40 02 cmp %g1, %g2 200ecbc: 04 80 00 0b ble 200ece8 <== ALWAYS TAKEN 200ecc0: d2 06 20 58 ld [ %i0 + 0x58 ], %o1 my_length = the_jnode->info.linearfile.size - start; 200ecc4: b0 26 c0 11 sub %i3, %l1, %i0 <== NOT EXECUTED memcpy(dest, &file_ptr[start], my_length); 200ecc8: 92 02 40 11 add %o1, %l1, %o1 200eccc: 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 ); 200ecd0: 40 00 08 13 call 2010d1c 200ecd4: 90 10 00 13 mov %l3, %o0 copied += my_length; } IMFS_update_atime( the_jnode ); 200ecd8: 10 bf ff ee b 200ec90 200ecdc: 90 07 bf f8 add %fp, -8, %o0 200ece0: 10 bf ff a9 b 200eb84 200ece4: 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)) 200ece8: 12 80 00 04 bne 200ecf8 <== NEVER TAKEN 200ecec: 80 a7 00 03 cmp %i4, %g3 200ecf0: 38 bf ff f6 bgu,a 200ecc8 <== ALWAYS TAKEN 200ecf4: 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; 200ecf8: 10 bf ff f4 b 200ecc8 <== NOT EXECUTED 200ecfc: b0 10 00 1c mov %i4, %i0 <== NOT EXECUTED =============================================================================== 0200ee10 : * is better to stick to simple, easy to understand algorithms. */ IMFS_jnode_t *IMFS_memfile_remove( IMFS_jnode_t *the_jnode ) { 200ee10: 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; 200ee14: 39 00 80 77 sethi %hi(0x201dc00), %i4 * + doubly indirect * + triply indirect */ info = &the_jnode->info.file; if ( info->indirect ) { 200ee18: 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; 200ee1c: f4 07 23 08 ld [ %i4 + 0x308 ], %i2 * + doubly indirect * + triply indirect */ info = &the_jnode->info.file; if ( info->indirect ) { 200ee20: 80 a0 60 00 cmp %g1, 0 200ee24: 02 80 00 05 be 200ee38 200ee28: b5 36 a0 02 srl %i2, 2, %i2 memfile_free_blocks_in_table( &info->indirect, to_free ); 200ee2c: 90 06 20 58 add %i0, 0x58, %o0 200ee30: 7f ff ff e2 call 200edb8 200ee34: 92 10 00 1a mov %i2, %o1 } if ( info->doubly_indirect ) { 200ee38: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 200ee3c: 80 a0 60 00 cmp %g1, 0 200ee40: 02 80 00 1b be 200eeac 200ee44: c4 07 23 08 ld [ %i4 + 0x308 ], %g2 for ( i=0 ; i <== NEVER TAKEN 200ee54: 90 10 20 00 clr %o0 200ee58: 37 00 80 77 sethi %hi(0x201dc00), %i3 200ee5c: ba 10 20 00 clr %i5 200ee60: 10 80 00 03 b 200ee6c 200ee64: b6 16 e3 08 or %i3, 0x308, %i3 200ee68: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 if ( info->doubly_indirect[i] ) { 200ee6c: 91 2a 20 02 sll %o0, 2, %o0 200ee70: c4 00 40 08 ld [ %g1 + %o0 ], %g2 200ee74: 80 a0 a0 00 cmp %g2, 0 200ee78: 02 80 00 04 be 200ee88 <== NEVER TAKEN 200ee7c: 90 00 40 08 add %g1, %o0, %o0 memfile_free_blocks_in_table( 200ee80: 7f ff ff ce call 200edb8 200ee84: 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 200ee9c: 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 ); 200eea0: 90 06 20 5c add %i0, 0x5c, %o0 200eea4: 7f ff ff c5 call 200edb8 200eea8: 92 10 00 1a mov %i2, %o1 } if ( info->triply_indirect ) { 200eeac: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 200eeb0: 80 a2 20 00 cmp %o0, 0 200eeb4: 02 80 00 33 be 200ef80 200eeb8: c4 07 23 08 ld [ %i4 + 0x308 ], %g2 for ( i=0 ; i <== NEVER TAKEN 200eec8: 90 06 20 60 add %i0, 0x60, %o0 <== NOT EXECUTED p = (block_p *) info->triply_indirect[i]; 200eecc: f8 02 00 00 ld [ %o0 ], %i4 if ( !p ) /* ensure we have a valid pointer */ 200eed0: 80 a7 20 00 cmp %i4, 0 200eed4: 22 80 00 29 be,a 200ef78 <== NEVER TAKEN 200eed8: 90 06 20 60 add %i0, 0x60, %o0 <== NOT EXECUTED 200eedc: 37 00 80 77 sethi %hi(0x201dc00), %i3 } if ( info->triply_indirect ) { for ( i=0 ; itriply_indirect[i]; 200eee0: a0 10 20 00 clr %l0 if ( !p ) /* ensure we have a valid pointer */ 200eee4: b2 10 20 00 clr %i1 200eee8: b6 16 e3 08 or %i3, 0x308, %i3 break; for ( j=0 ; j <== NEVER TAKEN 200eef4: 90 02 00 10 add %o0, %l0, %o0 <== NOT EXECUTED 200eef8: 90 10 20 00 clr %o0 200eefc: ba 10 20 00 clr %i5 if ( p[j] ) { 200ef00: 91 2a 20 02 sll %o0, 2, %o0 200ef04: c2 07 00 08 ld [ %i4 + %o0 ], %g1 200ef08: 80 a0 60 00 cmp %g1, 0 200ef0c: 02 80 00 04 be 200ef1c <== NEVER TAKEN 200ef10: 90 07 00 08 add %i4, %o0, %o0 memfile_free_blocks_in_table( (block_p **)&p[j], to_free); 200ef14: 7f ff ff a9 call 200edb8 200ef18: 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 200ef30: 90 10 00 1d mov %i5, %o0 200ef34: 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( 200ef38: 90 02 00 10 add %o0, %l0, %o0 200ef3c: 7f ff ff 9f call 200edb8 200ef40: 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 200ef58: 90 06 20 60 add %i0, 0x60, %o0 p = (block_p *) info->triply_indirect[i]; 200ef5c: 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( 200ef60: a1 2e 60 02 sll %i1, 2, %l0 } if ( info->triply_indirect ) { for ( i=0 ; itriply_indirect[i]; 200ef64: f8 02 00 10 ld [ %o0 + %l0 ], %i4 if ( !p ) /* ensure we have a valid pointer */ 200ef68: 80 a7 20 00 cmp %i4, 0 200ef6c: 12 bf ff e1 bne 200eef0 <== ALWAYS TAKEN 200ef70: 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( 200ef74: 90 06 20 60 add %i0, 0x60, %o0 <== NOT EXECUTED 200ef78: 7f ff ff 90 call 200edb8 200ef7c: 92 10 00 1a mov %i2, %o1 (block_p **)&info->triply_indirect, to_free ); } return the_jnode; } 200ef80: 81 c7 e0 08 ret 200ef84: 81 e8 00 00 restore =============================================================================== 0200ef88 : */ MEMFILE_STATIC int IMFS_memfile_remove_block( IMFS_jnode_t *the_jnode, unsigned int block ) { 200ef88: 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 ); 200ef8c: 94 10 20 00 clr %o2 <== NOT EXECUTED 200ef90: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 200ef94: 7f ff fe 38 call 200e874 <== NOT EXECUTED 200ef98: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED 200ef9c: 82 10 00 08 mov %o0, %g1 <== NOT EXECUTED IMFS_assert( block_ptr ); ptr = *block_ptr; 200efa0: d0 02 00 00 ld [ %o0 ], %o0 <== NOT EXECUTED *block_ptr = 0; memfile_free_block( ptr ); return 1; } 200efa4: 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 ); 200efa8: 7f ff ff 7b call 200ed94 <== NOT EXECUTED 200efac: c0 20 40 00 clr [ %g1 ] <== NOT EXECUTED return 1; } 200efb0: 81 c7 e0 08 ret <== NOT EXECUTED 200efb4: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200f17c : IMFS_jnode_t *the_jnode, off_t start, const unsigned char *source, unsigned int length ) { 200f17c: 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 ) { 200f180: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 200f184: 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; 200f188: 96 07 00 1a add %i4, %i2, %o3 if ( last_byte > the_jnode->info.file.size ) { 200f18c: 80 a0 80 01 cmp %g2, %g1 200f190: 14 80 00 5e bg 200f308 <== NEVER TAKEN 200f194: c6 06 20 54 ld [ %i0 + 0x54 ], %g3 200f198: 80 a0 80 01 cmp %g2, %g1 200f19c: 02 80 00 59 be 200f300 <== ALWAYS TAKEN 200f1a0: 80 a2 c0 03 cmp %o3, %g3 */ /* * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; 200f1a4: 21 00 80 77 sethi %hi(0x201dc00), %l0 <== NOT EXECUTED 200f1a8: fa 04 23 08 ld [ %l0 + 0x308 ], %i5 ! 201df08 200f1ac: 90 10 00 19 mov %i1, %o0 200f1b0: a3 3f 60 1f sra %i5, 0x1f, %l1 200f1b4: 92 10 00 1a mov %i2, %o1 200f1b8: 94 10 00 11 mov %l1, %o2 200f1bc: 40 00 2a 47 call 2019ad8 <__moddi3> 200f1c0: 96 10 00 1d mov %i5, %o3 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200f1c4: 90 10 00 19 mov %i1, %o0 */ /* * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; 200f1c8: a4 10 00 09 mov %o1, %l2 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200f1cc: 94 10 00 11 mov %l1, %o2 200f1d0: 92 10 00 1a mov %i2, %o1 200f1d4: 40 00 29 56 call 201972c <__divdi3> 200f1d8: 96 10 00 1d mov %i5, %o3 status = IMFS_memfile_extend( the_jnode, zero_fill, last_byte ); if ( status ) return status; } copied = 0; 200f1dc: 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 ) { 200f1e0: 80 a4 a0 00 cmp %l2, 0 200f1e4: 02 80 00 16 be 200f23c 200f1e8: b4 10 00 09 mov %o1, %i2 to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK - start_offset; 200f1ec: b2 27 40 12 sub %i5, %l2, %i1 200f1f0: 80 a6 40 1c cmp %i1, %i4 200f1f4: 38 80 00 02 bgu,a 200f1fc 200f1f8: 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 ); 200f1fc: 90 10 00 18 mov %i0, %o0 200f200: 92 10 00 1a mov %i2, %o1 200f204: 7f ff fd 9c call 200e874 200f208: 94 10 20 00 clr %o2 if ( !block_ptr ) 200f20c: 80 a2 20 00 cmp %o0, 0 200f210: 02 80 00 22 be 200f298 <== NEVER TAKEN 200f214: 82 10 20 00 clr %g1 block, to_copy, src ); #endif memcpy( &(*block_ptr)[ start_offset ], src, to_copy ); 200f218: d0 02 00 00 ld [ %o0 ], %o0 200f21c: 92 10 00 1b mov %i3, %o1 200f220: 90 02 00 12 add %o0, %l2, %o0 200f224: 40 00 06 be call 2010d1c 200f228: 94 10 00 19 mov %i1, %o2 200f22c: fa 04 23 08 ld [ %l0 + 0x308 ], %i5 src += to_copy; 200f230: b6 06 c0 19 add %i3, %i1, %i3 block++; 200f234: b4 06 a0 01 inc %i2 my_length -= to_copy; 200f238: 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 ) { 200f23c: 80 a7 00 1d cmp %i4, %i5 200f240: 1a 80 00 0e bcc 200f278 200f244: 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 ) { 200f248: 10 80 00 17 b 200f2a4 200f24c: 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 ); 200f250: d0 02 00 00 ld [ %o0 ], %o0 200f254: 40 00 06 b2 call 2010d1c 200f258: 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 ) { 200f25c: c2 04 23 08 ld [ %l0 + 0x308 ], %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; 200f260: b6 06 c0 1d add %i3, %i5, %i3 block++; 200f264: 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 ) { 200f268: 80 a0 40 1c cmp %g1, %i4 200f26c: 18 80 00 0d bgu 200f2a0 200f270: b2 06 40 1d add %i1, %i5, %i1 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200f274: 92 10 00 1a mov %i2, %o1 200f278: 94 10 20 00 clr %o2 200f27c: 7f ff fd 7e call 200e874 200f280: 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 ); 200f284: 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 ) 200f288: 80 a2 20 00 cmp %o0, 0 200f28c: 12 bf ff f1 bne 200f250 <== ALWAYS TAKEN 200f290: 94 10 00 1d mov %i5, %o2 200f294: 82 10 00 19 mov %i1, %g1 <== NOT EXECUTED } IMFS_mtime_ctime_update( the_jnode ); return copied; } 200f298: 81 c7 e0 08 ret <== NOT EXECUTED 200f29c: 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 ) { 200f2a0: 80 a7 20 00 cmp %i4, 0 200f2a4: 02 80 00 0f be 200f2e0 200f2a8: 90 07 bf f8 add %fp, -8, %o0 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200f2ac: 90 10 00 18 mov %i0, %o0 200f2b0: 92 10 00 1a mov %i2, %o1 200f2b4: 7f ff fd 70 call 200e874 200f2b8: 94 10 20 00 clr %o2 if ( !block_ptr ) 200f2bc: 80 a2 20 00 cmp %o0, 0 200f2c0: 02 bf ff f6 be 200f298 <== NEVER TAKEN 200f2c4: 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 ); 200f2c8: d0 02 00 00 ld [ %o0 ], %o0 200f2cc: 92 10 00 1b mov %i3, %o1 200f2d0: 94 10 00 1c mov %i4, %o2 200f2d4: 40 00 06 92 call 2010d1c 200f2d8: b2 06 40 1c add %i1, %i4, %i1 my_length = 0; copied += to_copy; } IMFS_mtime_ctime_update( the_jnode ); 200f2dc: 90 07 bf f8 add %fp, -8, %o0 200f2e0: 7f ff d1 0e call 2003718 200f2e4: 92 10 20 00 clr %o1 200f2e8: c4 07 bf f8 ld [ %fp + -8 ], %g2 return copied; 200f2ec: 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 ); 200f2f0: c4 26 20 44 st %g2, [ %i0 + 0x44 ] 200f2f4: c4 26 20 48 st %g2, [ %i0 + 0x48 ] return copied; } 200f2f8: 81 c7 e0 08 ret 200f2fc: 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 ) { 200f300: 08 bf ff aa bleu 200f1a8 200f304: 21 00 80 77 sethi %hi(0x201dc00), %l0 bool zero_fill = start > the_jnode->info.file.size; 200f308: 80 a6 40 01 cmp %i1, %g1 200f30c: 04 80 00 0b ble 200f338 <== ALWAYS TAKEN 200f310: 92 10 20 01 mov 1, %o1 status = IMFS_memfile_extend( the_jnode, zero_fill, last_byte ); 200f314: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 200f318: 92 0a 60 01 and %o1, 1, %o1 200f31c: 7f ff ff 27 call 200efb8 200f320: 94 10 20 00 clr %o2 if ( status ) 200f324: 82 92 20 00 orcc %o0, 0, %g1 200f328: 02 bf ff a0 be 200f1a8 200f32c: 21 00 80 77 sethi %hi(0x201dc00), %l0 } IMFS_mtime_ctime_update( the_jnode ); return copied; } 200f330: 81 c7 e0 08 ret 200f334: 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; 200f338: 02 80 00 0b be 200f364 <== ALWAYS TAKEN 200f33c: 80 a6 80 03 cmp %i2, %g3 200f340: 92 10 20 00 clr %o1 <== NOT EXECUTED status = IMFS_memfile_extend( the_jnode, zero_fill, last_byte ); 200f344: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 200f348: 92 0a 60 01 and %o1, 1, %o1 200f34c: 7f ff ff 1b call 200efb8 200f350: 94 10 20 00 clr %o2 if ( status ) 200f354: 82 92 20 00 orcc %o0, 0, %g1 200f358: 02 bf ff 94 be 200f1a8 200f35c: 21 00 80 77 sethi %hi(0x201dc00), %l0 200f360: 30 bf ff f4 b,a 200f330 * 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; 200f364: 18 bf ff ed bgu 200f318 200f368: 90 10 00 18 mov %i0, %o0 200f36c: 10 bf ff f7 b 200f348 200f370: 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 24 2f call 200bfd0 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 35 0b call 20103d8 <__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 35 05 call 20103d8 <__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 =============================================================================== 0200c460 : } static IMFS_jnode_t *IMFS_node_remove_directory( IMFS_jnode_t *node ) { 200c460: 9d e3 bf a0 save %sp, -96, %sp if ( !rtems_chain_is_empty( &node->info.directory.Entries ) ) { 200c464: 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 ); 200c468: 82 06 20 54 add %i0, 0x54, %g1 200c46c: 80 a0 80 01 cmp %g2, %g1 200c470: 12 80 00 08 bne 200c490 200c474: 01 00 00 00 nop errno = ENOTEMPTY; node = NULL; } else if ( IMFS_is_mount_point( node ) ) { 200c478: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 200c47c: 80 a0 60 00 cmp %g1, 0 200c480: 12 80 00 0a bne 200c4a8 <== NEVER TAKEN 200c484: 01 00 00 00 nop errno = EBUSY; node = NULL; } return node; } 200c488: 81 c7 e0 08 ret 200c48c: 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; 200c490: 40 00 0f d2 call 20103d8 <__errno> 200c494: b0 10 20 00 clr %i0 200c498: 82 10 20 5a mov 0x5a, %g1 200c49c: c2 22 00 00 st %g1, [ %o0 ] 200c4a0: 81 c7 e0 08 ret 200c4a4: 81 e8 00 00 restore node = NULL; } else if ( IMFS_is_mount_point( node ) ) { errno = EBUSY; 200c4a8: 40 00 0f cc call 20103d8 <__errno> <== NOT EXECUTED 200c4ac: b0 10 20 00 clr %i0 <== NOT EXECUTED 200c4b0: 82 10 20 10 mov 0x10, %g1 <== NOT EXECUTED 200c4b4: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED node = NULL; } return node; } 200c4b8: 81 c7 e0 08 ret <== NOT EXECUTED 200c4bc: 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 37 1d call 2010d1c 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 34 b6 call 20103d8 <__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 34 b0 call 20103d8 <__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 34 60 call 20103d8 <__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 34 5a call 20103d8 <__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 6d sethi %hi(0x201b400), %g1 2003920: c2 08 60 f9 ldub [ %g1 + 0xf9 ], %g1 ! 201b4f9 const Heap_Area *areas, size_t area_count, Heap_Initialization_or_extend_handler extend ) { Heap_Control *heap = RTEMS_Malloc_Heap; 2003924: 05 00 80 75 sethi %hi(0x201d400), %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 a3 00 ld [ %g2 + 0x300 ], %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 22 6c or %l0, 0x26c, %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 77 sethi %hi(0x201dc00), %g1 200398c: c2 00 62 e0 ld [ %g1 + 0x2e0 ], %g1 ! 201dee0 2003990: 80 a0 60 00 cmp %g1, 0 2003994: 02 80 00 05 be 20039a8 2003998: 3b 00 80 78 sethi %hi(0x201e000), %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 61 a0 ld [ %i5 + 0x1a0 ], %i4 20039ac: 40 00 18 4c call 2009adc <_Protected_heap_Get_size> 20039b0: 90 10 00 1b mov %i3, %o0 20039b4: 90 02 00 1c add %o0, %i4, %o0 20039b8: d0 27 61 a0 st %o0, [ %i5 + 0x1a0 ] 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 c5 call 20090e0 <_Internal_error_Occurred> 20039d0: 94 10 20 17 mov 0x17, %o2 =============================================================================== 02025ce8 : static rtems_printk_plugin_t print_handler; static void Stack_check_Dump_threads_usage( Thread_Control *the_thread ) { 2025ce8: 9d e3 bf 98 save %sp, -104, %sp /* * Obtain interrupt stack information */ #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if (the_thread == (Thread_Control *) -1) { 2025cec: 80 a6 3f ff cmp %i0, -1 2025cf0: 02 80 00 56 be 2025e48 2025cf4: ba 06 20 b4 add %i0, 0xb4, %i5 current = 0; } else #endif { stack = &the_thread->Start.Initial_stack; current = (void *)_CPU_Context_Get_SP( &the_thread->Registers ); 2025cf8: e2 06 21 40 ld [ %i0 + 0x140 ], %l1 2025cfc: f8 06 20 b8 ld [ %i0 + 0xb8 ], %i4 } low = Stack_check_usable_stack_start(stack); size = Stack_check_usable_stack_size(stack); 2025d00: f4 07 40 00 ld [ %i5 ], %i2 /* * start at lower memory and find first word that does not * match pattern */ base += PATTERN_SIZE_WORDS; 2025d04: 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); 2025d08: 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++) 2025d0c: 86 0e bf fc and %i2, -4, %g3 2025d10: 86 00 40 03 add %g1, %g3, %g3 2025d14: 80 a0 40 03 cmp %g1, %g3 2025d18: 1a 80 00 10 bcc 2025d58 <== NEVER TAKEN 2025d1c: 05 29 69 69 sethi %hi(0xa5a5a400), %g2 if (*base != U32_PATTERN) 2025d20: c8 07 20 20 ld [ %i4 + 0x20 ], %g4 2025d24: 84 10 a1 a5 or %g2, 0x1a5, %g2 2025d28: 80 a1 00 02 cmp %g4, %g2 2025d2c: 22 80 00 08 be,a 2025d4c <== ALWAYS TAKEN 2025d30: 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); 2025d34: 10 80 00 37 b 2025e10 <== NOT EXECUTED 2025d38: 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) 2025d3c: 80 a0 80 04 cmp %g2, %g4 2025d40: 12 80 00 34 bne 2025e10 2025d44: 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++) 2025d48: 82 00 60 04 add %g1, 4, %g1 2025d4c: 80 a0 c0 01 cmp %g3, %g1 2025d50: 38 bf ff fb bgu,a 2025d3c <== ALWAYS TAKEN 2025d54: c4 00 40 00 ld [ %g1 ], %g2 else used = 0; #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if ( the_thread ) 2025d58: 80 a6 20 00 cmp %i0, 0 <== NOT EXECUTED 2025d5c: 02 80 00 31 be 2025e20 <== NOT EXECUTED 2025d60: a0 10 20 00 clr %l0 <== NOT EXECUTED #endif { (*print_handler)( 2025d64: f2 06 20 08 ld [ %i0 + 8 ], %i1 2025d68: 39 00 81 9a sethi %hi(0x2066800), %i4 2025d6c: 37 00 81 9a sethi %hi(0x2066800), %i3 2025d70: e4 07 23 c4 ld [ %i4 + 0x3c4 ], %l2 2025d74: f0 06 e3 c8 ld [ %i3 + 0x3c8 ], %i0 2025d78: 94 07 bf f8 add %fp, -8, %o2 2025d7c: 92 10 20 05 mov 5, %o1 2025d80: 7f ff a8 29 call 200fe24 2025d84: 90 10 00 19 mov %i1, %o0 2025d88: 13 00 81 76 sethi %hi(0x205d800), %o1 2025d8c: 96 10 00 08 mov %o0, %o3 2025d90: 94 10 00 19 mov %i1, %o2 2025d94: 90 10 00 12 mov %l2, %o0 2025d98: 9f c6 00 00 call %i0 2025d9c: 92 12 63 90 or %o1, 0x390, %o1 (*print_handler)( print_context, " %010p - %010p %010p %8" PRId32 " ", stack->area, stack->area + stack->size - 1, 2025da0: d4 07 60 04 ld [ %i5 + 4 ], %o2 2025da4: d6 07 40 00 ld [ %i5 ], %o3 else { (*print_handler)( print_context, "0x%08" PRIx32 " INTR", ~0 ); } #endif (*print_handler)( 2025da8: c4 06 e3 c8 ld [ %i3 + 0x3c8 ], %g2 2025dac: d0 07 23 c4 ld [ %i4 + 0x3c4 ], %o0 print_context, " %010p - %010p %010p %8" PRId32 " ", stack->area, stack->area + stack->size - 1, 2025db0: 96 02 ff ff add %o3, -1, %o3 else { (*print_handler)( print_context, "0x%08" PRIx32 " INTR", ~0 ); } #endif (*print_handler)( 2025db4: 13 00 81 76 sethi %hi(0x205d800), %o1 2025db8: 96 02 80 0b add %o2, %o3, %o3 2025dbc: 92 12 63 b0 or %o1, 0x3b0, %o1 2025dc0: 98 10 00 11 mov %l1, %o4 2025dc4: 9f c0 80 00 call %g2 2025dc8: 9a 10 00 1a mov %i2, %o5 stack->area + stack->size - 1, current, size ); if (Stack_check_Initialized == 0) { 2025dcc: 05 00 81 9a sethi %hi(0x2066800), %g2 2025dd0: c4 00 a3 c0 ld [ %g2 + 0x3c0 ], %g2 ! 2066bc0 (*print_handler)( print_context, "Unavailable\n" ); 2025dd4: c2 06 e3 c8 ld [ %i3 + 0x3c8 ], %g1 stack->area + stack->size - 1, current, size ); if (Stack_check_Initialized == 0) { 2025dd8: 80 a0 a0 00 cmp %g2, 0 2025ddc: 12 80 00 07 bne 2025df8 <== ALWAYS TAKEN 2025de0: d0 07 23 c4 ld [ %i4 + 0x3c4 ], %o0 (*print_handler)( print_context, "Unavailable\n" ); 2025de4: 13 00 81 76 sethi %hi(0x205d800), %o1 <== NOT EXECUTED 2025de8: 9f c0 40 00 call %g1 <== NOT EXECUTED 2025dec: 92 12 63 d0 or %o1, 0x3d0, %o1 ! 205dbd0 <== NOT EXECUTED 2025df0: 81 c7 e0 08 ret <== NOT EXECUTED 2025df4: 81 e8 00 00 restore <== NOT EXECUTED } else { (*print_handler)( print_context, "%8" PRId32 "\n", used ); 2025df8: 94 10 00 10 mov %l0, %o2 2025dfc: 13 00 81 76 sethi %hi(0x205d800), %o1 2025e00: 9f c0 40 00 call %g1 2025e04: 92 12 63 e0 or %o1, 0x3e0, %o1 ! 205dbe0 2025e08: 81 c7 e0 08 ret 2025e0c: 81 e8 00 00 restore else used = 0; #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if ( the_thread ) 2025e10: 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 ); 2025e14: a0 04 00 1a add %l0, %i2, %l0 else used = 0; #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if ( the_thread ) 2025e18: 12 bf ff d3 bne 2025d64 2025e1c: 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 ); 2025e20: 37 00 81 9a sethi %hi(0x2066800), %i3 2025e24: 39 00 81 9a sethi %hi(0x2066800), %i4 2025e28: c2 06 e3 c8 ld [ %i3 + 0x3c8 ], %g1 2025e2c: d0 07 23 c4 ld [ %i4 + 0x3c4 ], %o0 2025e30: 94 10 3f ff mov -1, %o2 2025e34: 13 00 81 76 sethi %hi(0x205d800), %o1 2025e38: 9f c0 40 00 call %g1 2025e3c: 92 12 63 a0 or %o1, 0x3a0, %o1 ! 205dba0 (*print_handler)( print_context, " %010p - %010p %010p %8" PRId32 " ", stack->area, stack->area + stack->size - 1, 2025e40: 10 bf ff d9 b 2025da4 2025e44: 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) 2025e48: 3b 00 81 9f sethi %hi(0x2067c00), %i5 2025e4c: ba 17 61 bc or %i5, 0x1bc, %i5 ! 2067dbc 2025e50: f8 07 60 04 ld [ %i5 + 4 ], %i4 2025e54: 80 a7 20 00 cmp %i4, 0 2025e58: 02 bf ff e6 be 2025df0 <== NEVER TAKEN 2025e5c: a2 10 20 00 clr %l1 return; stack = &Stack_check_Interrupt_stack; the_thread = 0; 2025e60: 10 bf ff a8 b 2025d00 2025e64: b0 10 20 00 clr %i0 =============================================================================== 02025f5c : Thread_Control *running, bool pattern_ok ) RTEMS_COMPILER_NO_RETURN_ATTRIBUTE; void Stack_check_report_blown_task(Thread_Control *running, bool pattern_ok) { 2025f5c: 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"); 2025f60: 11 00 81 76 sethi %hi(0x205d800), %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); 2025f64: fa 06 20 b8 ld [ %i0 + 0xb8 ], %i5 char name[32]; printk("BLOWN STACK!!!\n"); 2025f68: 7f ff 78 d8 call 20042c8 2025f6c: 90 12 23 e8 or %o0, 0x3e8, %o0 printk("task control block: 0x%08" PRIxPTR "\n", running); 2025f70: 92 10 00 18 mov %i0, %o1 2025f74: 11 00 81 76 sethi %hi(0x205d800), %o0 2025f78: 7f ff 78 d4 call 20042c8 2025f7c: 90 12 23 f8 or %o0, 0x3f8, %o0 ! 205dbf8 printk("task ID: 0x%08lx\n", (unsigned long) running->Object.id); 2025f80: d2 06 20 08 ld [ %i0 + 8 ], %o1 2025f84: 11 00 81 77 sethi %hi(0x205dc00), %o0 2025f88: 7f ff 78 d0 call 20042c8 2025f8c: 90 12 20 18 or %o0, 0x18, %o0 ! 205dc18 printk( 2025f90: d2 06 20 0c ld [ %i0 + 0xc ], %o1 2025f94: 11 00 81 77 sethi %hi(0x205dc00), %o0 2025f98: 7f ff 78 cc call 20042c8 2025f9c: 90 12 20 30 or %o0, 0x30, %o0 ! 205dc30 "task name: 0x%08" PRIx32 "\n", running->Object.name.name_u32 ); printk( 2025fa0: d0 06 20 08 ld [ %i0 + 8 ], %o0 2025fa4: 94 07 bf e0 add %fp, -32, %o2 2025fa8: 7f ff a7 9f call 200fe24 2025fac: 92 10 20 20 mov 0x20, %o1 2025fb0: 92 10 00 08 mov %o0, %o1 2025fb4: 11 00 81 77 sethi %hi(0x205dc00), %o0 2025fb8: 7f ff 78 c4 call 20042c8 2025fbc: 90 12 20 48 or %o0, 0x48, %o0 ! 205dc48 ); printk( "task stack area (%lu Bytes): 0x%08" PRIxPTR " .. 0x%08" PRIxPTR "\n", (unsigned long) stack->size, stack->area, ((char *) stack->area + stack->size) 2025fc0: d4 06 20 b8 ld [ %i0 + 0xb8 ], %o2 2025fc4: d2 06 20 b4 ld [ %i0 + 0xb4 ], %o1 ); printk( "task name string: %s\n", rtems_object_get_name(running->Object.id, sizeof(name), name) ); printk( 2025fc8: 11 00 81 77 sethi %hi(0x205dc00), %o0 2025fcc: 96 02 80 09 add %o2, %o1, %o3 2025fd0: 7f ff 78 be call 20042c8 2025fd4: 90 12 20 60 or %o0, 0x60, %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) { 2025fd8: 80 a6 60 00 cmp %i1, 0 2025fdc: 02 80 00 05 be 2025ff0 <== ALWAYS TAKEN 2025fe0: 92 10 20 10 mov 0x10, %o1 rtems_configuration_get_user_multiprocessing_table()->node ); } #endif rtems_fatal( 2025fe4: d2 06 20 0c ld [ %i0 + 0xc ], %o1 <== NOT EXECUTED 2025fe8: 7f ff 88 18 call 2008048 2025fec: 90 10 20 09 mov 9, %o0 (unsigned long) stack->size, stack->area, ((char *) stack->area + stack->size) ); if (!pattern_ok) { printk( 2025ff0: 11 00 81 77 sethi %hi(0x205dc00), %o0 2025ff4: 94 07 60 08 add %i5, 8, %o2 2025ff8: 90 12 20 90 or %o0, 0x90, %o0 2025ffc: 7f ff 78 b3 call 20042c8 2026000: 96 07 60 18 add %i5, 0x18, %o3 rtems_configuration_get_user_multiprocessing_table()->node ); } #endif rtems_fatal( 2026004: 10 bf ff f9 b 2025fe8 2026008: d2 06 20 0c ld [ %i0 + 0xc ], %o1 =============================================================================== 0200854c <_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); 200854c: c2 02 00 00 ld [ %o0 ], %g1 2008550: 80 a0 60 00 cmp %g1, 0 2008554: 22 80 00 04 be,a 2008564 <_API_extensions_Add_post_switch+0x18> 2008558: c2 02 20 04 ld [ %o0 + 4 ], %g1 200855c: 81 c3 e0 08 retl 2008560: 01 00 00 00 nop 2008564: 80 a0 60 00 cmp %g1, 0 2008568: 12 bf ff fd bne 200855c <_API_extensions_Add_post_switch+0x10><== NEVER TAKEN 200856c: 03 00 80 78 sethi %hi(0x201e000), %g1 Chain_Control *the_chain, Chain_Node *the_node ) { Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *old_last = tail->previous; 2008570: 82 10 63 94 or %g1, 0x394, %g1 ! 201e394 <_API_extensions_Post_switch_list> 2008574: c4 00 60 08 ld [ %g1 + 8 ], %g2 the_node->next = tail; 2008578: 86 00 60 04 add %g1, 4, %g3 tail->previous = the_node; 200857c: 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; 2008580: c6 22 00 00 st %g3, [ %o0 ] tail->previous = the_node; old_last->next = the_node; 2008584: d0 20 80 00 st %o0, [ %g2 ] the_node->previous = old_last; 2008588: 81 c3 e0 08 retl 200858c: c4 22 20 04 st %g2, [ %o0 + 4 ] =============================================================================== 02008590 <_API_extensions_Run_postdriver>: } } #endif void _API_extensions_Run_postdriver( void ) { 2008590: 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; 2008594: 39 00 80 79 sethi %hi(0x201e400), %i4 2008598: fa 07 20 e8 ld [ %i4 + 0xe8 ], %i5 ! 201e4e8 <_API_extensions_List> 200859c: b8 17 20 e8 or %i4, 0xe8, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 20085a0: b8 07 20 04 add %i4, 4, %i4 20085a4: 80 a7 40 1c cmp %i5, %i4 20085a8: 02 80 00 09 be 20085cc <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN 20085ac: 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)(); 20085b0: c2 07 60 08 ld [ %i5 + 8 ], %g1 20085b4: 9f c0 40 00 call %g1 20085b8: 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 ) { 20085bc: 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 ); 20085c0: 80 a7 40 1c cmp %i5, %i4 20085c4: 32 bf ff fc bne,a 20085b4 <_API_extensions_Run_postdriver+0x24> 20085c8: c2 07 60 08 ld [ %i5 + 8 ], %g1 20085cc: 81 c7 e0 08 ret 20085d0: 81 e8 00 00 restore =============================================================================== 0200ac38 <_CORE_RWLock_Release>: #include CORE_RWLock_Status _CORE_RWLock_Release( CORE_RWLock_Control *the_rwlock ) { 200ac38: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing = _Thread_Executing; 200ac3c: 03 00 80 86 sethi %hi(0x2021800), %g1 * Otherwise, we have to block. * If locked for reading and no waiters, then OK to read. * If any thread is waiting, then we wait. */ _ISR_Disable( level ); 200ac40: 7f ff e3 5d call 20039b4 200ac44: fa 00 60 70 ld [ %g1 + 0x70 ], %i5 ! 2021870 <_Per_CPU_Information+0x10> 200ac48: 84 10 00 08 mov %o0, %g2 if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){ 200ac4c: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 200ac50: 80 a0 60 00 cmp %g1, 0 200ac54: 02 80 00 2b be 200ad00 <_CORE_RWLock_Release+0xc8> 200ac58: 80 a0 60 01 cmp %g1, 1 _ISR_Enable( level ); executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; return CORE_RWLOCK_SUCCESSFUL; } if ( the_rwlock->current_state == CORE_RWLOCK_LOCKED_FOR_READING ) { 200ac5c: 22 80 00 22 be,a 200ace4 <_CORE_RWLock_Release+0xac> 200ac60: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 return CORE_RWLOCK_SUCCESSFUL; } } /* CORE_RWLOCK_LOCKED_FOR_WRITING or READING with readers */ executing->Wait.return_code = CORE_RWLOCK_SUCCESSFUL; 200ac64: c0 27 60 34 clr [ %i5 + 0x34 ] /* * Implicitly transition to "unlocked" and find another thread interested * in obtaining this rwlock. */ the_rwlock->current_state = CORE_RWLOCK_UNLOCKED; 200ac68: c0 26 20 44 clr [ %i0 + 0x44 ] _ISR_Enable( level ); 200ac6c: 7f ff e3 56 call 20039c4 200ac70: 90 10 00 02 mov %g2, %o0 next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue ); 200ac74: 40 00 08 28 call 200cd14 <_Thread_queue_Dequeue> 200ac78: 90 10 00 18 mov %i0, %o0 if ( next ) { 200ac7c: 80 a2 20 00 cmp %o0, 0 200ac80: 22 80 00 24 be,a 200ad10 <_CORE_RWLock_Release+0xd8> 200ac84: b0 10 20 00 clr %i0 if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) { 200ac88: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 200ac8c: 80 a0 60 01 cmp %g1, 1 200ac90: 02 80 00 22 be 200ad18 <_CORE_RWLock_Release+0xe0> 200ac94: 84 10 20 01 mov 1, %g2 } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 200ac98: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 200ac9c: 82 00 60 01 inc %g1 the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_READING; 200aca0: c4 26 20 44 st %g2, [ %i0 + 0x44 ] } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 200aca4: 10 80 00 09 b 200acc8 <_CORE_RWLock_Release+0x90> 200aca8: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* * Now see if more readers can be let go. */ while ( 1 ) { next = _Thread_queue_First( &the_rwlock->Wait_queue ); if ( !next || 200acac: 80 a0 60 01 cmp %g1, 1 200acb0: 02 80 00 0b be 200acdc <_CORE_RWLock_Release+0xa4> <== NEVER TAKEN 200acb4: 90 10 00 18 mov %i0, %o0 next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) return CORE_RWLOCK_SUCCESSFUL; the_rwlock->number_of_readers += 1; 200acb8: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 200acbc: 82 00 60 01 inc %g1 _Thread_queue_Extract( &the_rwlock->Wait_queue, next ); 200acc0: 40 00 09 25 call 200d154 <_Thread_queue_Extract> 200acc4: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* * Now see if more readers can be let go. */ while ( 1 ) { next = _Thread_queue_First( &the_rwlock->Wait_queue ); 200acc8: 40 00 09 74 call 200d298 <_Thread_queue_First> 200accc: 90 10 00 18 mov %i0, %o0 if ( !next || 200acd0: 92 92 20 00 orcc %o0, 0, %o1 200acd4: 32 bf ff f6 bne,a 200acac <_CORE_RWLock_Release+0x74> 200acd8: c2 02 60 30 ld [ %o1 + 0x30 ], %g1 } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200acdc: 81 c7 e0 08 ret 200ace0: 91 e8 20 00 restore %g0, 0, %o0 _ISR_Enable( level ); executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; return CORE_RWLOCK_SUCCESSFUL; } if ( the_rwlock->current_state == CORE_RWLOCK_LOCKED_FOR_READING ) { the_rwlock->number_of_readers -= 1; 200ace4: 82 00 7f ff add %g1, -1, %g1 if ( the_rwlock->number_of_readers != 0 ) { 200ace8: 80 a0 60 00 cmp %g1, 0 200acec: 02 bf ff de be 200ac64 <_CORE_RWLock_Release+0x2c> 200acf0: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* must be unlocked again */ _ISR_Enable( level ); 200acf4: 7f ff e3 34 call 20039c4 200acf8: b0 10 20 00 clr %i0 return CORE_RWLOCK_SUCCESSFUL; 200acfc: 30 80 00 05 b,a 200ad10 <_CORE_RWLock_Release+0xd8> * If any thread is waiting, then we wait. */ _ISR_Disable( level ); if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){ _ISR_Enable( level ); 200ad00: 7f ff e3 31 call 20039c4 200ad04: b0 10 20 00 clr %i0 executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; 200ad08: 82 10 20 02 mov 2, %g1 200ad0c: c2 27 60 34 st %g1, [ %i5 + 0x34 ] } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200ad10: 81 c7 e0 08 ret 200ad14: 81 e8 00 00 restore next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue ); if ( next ) { if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) { the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_WRITING; 200ad18: 82 10 20 02 mov 2, %g1 200ad1c: c2 26 20 44 st %g1, [ %i0 + 0x44 ] } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200ad20: 81 c7 e0 08 ret 200ad24: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200ad28 <_CORE_RWLock_Timeout>: void _CORE_RWLock_Timeout( Objects_Id id, void *ignored ) { 200ad28: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200ad2c: 90 10 00 18 mov %i0, %o0 200ad30: 40 00 07 1b call 200c99c <_Thread_Get> 200ad34: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200ad38: c2 07 bf fc ld [ %fp + -4 ], %g1 200ad3c: 80 a0 60 00 cmp %g1, 0 200ad40: 12 80 00 08 bne 200ad60 <_CORE_RWLock_Timeout+0x38> <== NEVER TAKEN 200ad44: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 200ad48: 40 00 09 95 call 200d39c <_Thread_queue_Process_timeout> 200ad4c: 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; 200ad50: 03 00 80 84 sethi %hi(0x2021000), %g1 200ad54: c4 00 63 40 ld [ %g1 + 0x340 ], %g2 ! 2021340 <_Thread_Dispatch_disable_level> --level; 200ad58: 84 00 bf ff add %g2, -1, %g2 _Thread_Dispatch_disable_level = level; 200ad5c: c4 20 63 40 st %g2, [ %g1 + 0x340 ] 200ad60: 81 c7 e0 08 ret 200ad64: 81 e8 00 00 restore =============================================================================== 020088f0 <_CORE_mutex_Seize>: Objects_Id _id, bool _wait, Watchdog_Interval _timeout, ISR_Level _level ) { 20088f0: 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 ) 20088f4: 3b 00 80 78 sethi %hi(0x201e000), %i5 20088f8: c2 07 63 20 ld [ %i5 + 0x320 ], %g1 ! 201e320 <_Thread_Dispatch_disable_level> 20088fc: 80 a0 60 00 cmp %g1, 0 2008900: 02 80 00 1f be 200897c <_CORE_mutex_Seize+0x8c> 2008904: f8 27 a0 54 st %i4, [ %fp + 0x54 ] _CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level ); 2008908: 80 a6 a0 00 cmp %i2, 0 200890c: 02 80 00 2c be 20089bc <_CORE_mutex_Seize+0xcc> 2008910: 90 10 00 18 mov %i0, %o0 2008914: 03 00 80 7a sethi %hi(0x201e800), %g1 2008918: c2 00 60 38 ld [ %g1 + 0x38 ], %g1 ! 201e838 <_System_state_Current> 200891c: 80 a0 60 01 cmp %g1, 1 2008920: 38 80 00 2e bgu,a 20089d8 <_CORE_mutex_Seize+0xe8> 2008924: 90 10 20 00 clr %o0 2008928: 40 00 15 00 call 200dd28 <_CORE_mutex_Seize_interrupt_trylock> 200892c: 92 07 a0 54 add %fp, 0x54, %o1 2008930: 80 a2 20 00 cmp %o0, 0 2008934: 02 80 00 27 be 20089d0 <_CORE_mutex_Seize+0xe0> <== ALWAYS TAKEN 2008938: 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; 200893c: c4 07 63 20 ld [ %i5 + 0x320 ], %g2 2008940: 03 00 80 7a sethi %hi(0x201e800), %g1 2008944: c2 00 60 50 ld [ %g1 + 0x50 ], %g1 ! 201e850 <_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; 2008948: 86 10 20 01 mov 1, %g3 200894c: c6 26 20 30 st %g3, [ %i0 + 0x30 ] 2008950: f0 20 60 44 st %i0, [ %g1 + 0x44 ] 2008954: f2 20 60 20 st %i1, [ %g1 + 0x20 ] ++level; 2008958: 82 00 a0 01 add %g2, 1, %g1 _Thread_Dispatch_disable_level = level; 200895c: c2 27 63 20 st %g1, [ %i5 + 0x320 ] 2008960: 7f ff e7 2f call 200261c 2008964: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 2008968: 90 10 00 18 mov %i0, %o0 200896c: 7f ff ff ba call 2008854 <_CORE_mutex_Seize_interrupt_blocking> 2008970: 92 10 00 1b mov %i3, %o1 2008974: 81 c7 e0 08 ret 2008978: 81 e8 00 00 restore 200897c: 90 10 00 18 mov %i0, %o0 2008980: 40 00 14 ea call 200dd28 <_CORE_mutex_Seize_interrupt_trylock> 2008984: 92 07 a0 54 add %fp, 0x54, %o1 2008988: 80 a2 20 00 cmp %o0, 0 200898c: 02 bf ff fa be 2008974 <_CORE_mutex_Seize+0x84> 2008990: 80 a6 a0 00 cmp %i2, 0 2008994: 12 bf ff ea bne 200893c <_CORE_mutex_Seize+0x4c> 2008998: 01 00 00 00 nop 200899c: 7f ff e7 20 call 200261c 20089a0: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 20089a4: 03 00 80 7a sethi %hi(0x201e800), %g1 20089a8: c2 00 60 50 ld [ %g1 + 0x50 ], %g1 ! 201e850 <_Per_CPU_Information+0x10> 20089ac: 84 10 20 01 mov 1, %g2 20089b0: c4 20 60 34 st %g2, [ %g1 + 0x34 ] 20089b4: 81 c7 e0 08 ret 20089b8: 81 e8 00 00 restore 20089bc: 40 00 14 db call 200dd28 <_CORE_mutex_Seize_interrupt_trylock> 20089c0: 92 07 a0 54 add %fp, 0x54, %o1 20089c4: 80 a2 20 00 cmp %o0, 0 20089c8: 12 bf ff f5 bne 200899c <_CORE_mutex_Seize+0xac> <== NEVER TAKEN 20089cc: 01 00 00 00 nop 20089d0: 81 c7 e0 08 ret 20089d4: 81 e8 00 00 restore 20089d8: 92 10 20 00 clr %o1 20089dc: 40 00 01 c1 call 20090e0 <_Internal_error_Occurred> 20089e0: 94 10 20 12 mov 0x12, %o2 =============================================================================== 02008b60 <_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 ) { 2008b60: 9d e3 bf a0 save %sp, -96, %sp 2008b64: ba 10 00 18 mov %i0, %i5 Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2008b68: b0 10 20 00 clr %i0 if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 2008b6c: 40 00 07 ed call 200ab20 <_Thread_queue_Dequeue> 2008b70: 90 10 00 1d mov %i5, %o0 2008b74: 80 a2 20 00 cmp %o0, 0 2008b78: 02 80 00 04 be 2008b88 <_CORE_semaphore_Surrender+0x28> 2008b7c: 01 00 00 00 nop status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); } return status; } 2008b80: 81 c7 e0 08 ret 2008b84: 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 ); 2008b88: 7f ff e6 a1 call 200260c 2008b8c: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 2008b90: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 2008b94: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 2008b98: 80 a0 40 02 cmp %g1, %g2 2008b9c: 1a 80 00 05 bcc 2008bb0 <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN 2008ba0: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 2008ba4: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2008ba8: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 2008bac: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 2008bb0: 7f ff e6 9b call 200261c 2008bb4: 01 00 00 00 nop } return status; } 2008bb8: 81 c7 e0 08 ret 2008bbc: 81 e8 00 00 restore =============================================================================== 02008720 <_Chain_Initialize>: Chain_Control *the_chain, void *starting_address, size_t number_nodes, size_t node_size ) { 2008720: 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; 2008724: 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 ); 2008728: ba 06 20 04 add %i0, 4, %i5 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200872c: 80 a6 a0 00 cmp %i2, 0 2008730: 02 80 00 13 be 200877c <_Chain_Initialize+0x5c> <== NEVER TAKEN 2008734: 92 06 bf ff add %i2, -1, %o1 2008738: 86 10 00 09 mov %o1, %g3 200873c: 82 10 00 19 mov %i1, %g1 2008740: 84 10 00 18 mov %i0, %g2 current->next = next; 2008744: c2 20 80 00 st %g1, [ %g2 ] next->previous = current; 2008748: c4 20 60 04 st %g2, [ %g1 + 4 ] Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200874c: 86 00 ff ff add %g3, -1, %g3 2008750: 84 10 00 01 mov %g1, %g2 2008754: 80 a0 ff ff cmp %g3, -1 2008758: 12 bf ff fb bne 2008744 <_Chain_Initialize+0x24> 200875c: 82 00 40 1b add %g1, %i3, %g1 #include #include #include #include void _Chain_Initialize( 2008760: 40 00 42 61 call 20190e4 <.umul> 2008764: 90 10 00 1b mov %i3, %o0 2008768: 90 06 40 08 add %i1, %o0, %o0 current = next; next = (Chain_Node *) _Addresses_Add_offset( (void *) next, node_size ); } current->next = tail; 200876c: fa 22 00 00 st %i5, [ %o0 ] tail->previous = current; 2008770: d0 26 20 08 st %o0, [ %i0 + 8 ] 2008774: 81 c7 e0 08 ret 2008778: 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; 200877c: 10 bf ff fc b 200876c <_Chain_Initialize+0x4c> <== NOT EXECUTED 2008780: 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 7a sethi %hi(0x201e800), %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 e0 40 or %g3, 0x40, %g3 ! 201e840 <_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 ff call 200a364 <_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 9a call 200b63c <_Watchdog_Remove> 20077d8: 90 06 20 48 add %i0, 0x48, %o0 20077dc: b2 16 63 f8 or %i1, 0x3f8, %i1 20077e0: 40 00 0a e1 call 200a364 <_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 ee call 200a7a8 <_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 7a sethi %hi(0x201e800), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 2007814: c2 00 60 50 ld [ %g1 + 0x50 ], %g1 ! 201e850 <_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 ca call 200a364 <_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 78 sethi %hi(0x201e000), %g1 2007848: c4 00 63 20 ld [ %g1 + 0x320 ], %g2 ! 201e320 <_Thread_Dispatch_disable_level> --level; 200784c: 84 00 bf ff add %g2, -1, %g2 _Thread_Dispatch_disable_level = level; 2007850: c4 20 63 20 st %g2, [ %g1 + 0x320 ] 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 ] =============================================================================== 0200de88 <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200de88: 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 200de8c: a2 06 60 04 add %i1, 4, %l1 Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200de90: 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 ) { 200de94: 80 a6 40 11 cmp %i1, %l1 200de98: 18 80 00 85 bgu 200e0ac <_Heap_Allocate_aligned_with_boundary+0x224> 200de9c: ea 06 20 10 ld [ %i0 + 0x10 ], %l5 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 200dea0: 80 a6 e0 00 cmp %i3, 0 200dea4: 12 80 00 7c bne 200e094 <_Heap_Allocate_aligned_with_boundary+0x20c> 200dea8: 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; 200deac: 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 ) { 200deb0: 80 a4 00 1d cmp %l0, %i5 200deb4: 02 80 00 18 be 200df14 <_Heap_Allocate_aligned_with_boundary+0x8c> 200deb8: 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; 200debc: 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 200dec0: ae 05 60 07 add %l5, 7, %l7 + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200dec4: ac 25 80 19 sub %l6, %i1, %l6 200dec8: 10 80 00 0b b 200def4 <_Heap_Allocate_aligned_with_boundary+0x6c> 200decc: 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 ) { 200ded0: 12 80 00 18 bne 200df30 <_Heap_Allocate_aligned_with_boundary+0xa8> 200ded4: b0 07 60 08 add %i5, 8, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200ded8: 80 a6 20 00 cmp %i0, 0 200dedc: 12 80 00 4d bne 200e010 <_Heap_Allocate_aligned_with_boundary+0x188><== ALWAYS TAKEN 200dee0: b8 07 20 01 inc %i4 break; } block = block->next; 200dee4: 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 ) { 200dee8: 80 a4 00 1d cmp %l0, %i5 200deec: 22 80 00 0b be,a 200df18 <_Heap_Allocate_aligned_with_boundary+0x90> 200def0: 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 ) { 200def4: c2 07 60 04 ld [ %i5 + 4 ], %g1 200def8: 80 a4 40 01 cmp %l1, %g1 200defc: 0a bf ff f5 bcs 200ded0 <_Heap_Allocate_aligned_with_boundary+0x48> 200df00: 80 a6 a0 00 cmp %i2, 0 if ( alloc_begin != 0 ) { break; } block = block->next; 200df04: 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 ) { 200df08: 80 a4 00 1d cmp %l0, %i5 200df0c: 12 bf ff fa bne 200def4 <_Heap_Allocate_aligned_with_boundary+0x6c> 200df10: b8 07 20 01 inc %i4 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200df14: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 200df18: 80 a0 40 1c cmp %g1, %i4 200df1c: 1a 80 00 03 bcc 200df28 <_Heap_Allocate_aligned_with_boundary+0xa0> 200df20: b0 10 20 00 clr %i0 stats->max_search = search_count; 200df24: f8 24 20 44 st %i4, [ %l0 + 0x44 ] } return (void *) alloc_begin; 200df28: 81 c7 e0 08 ret 200df2c: 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; 200df30: 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; 200df34: 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; 200df38: 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; 200df3c: 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; 200df40: 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); 200df44: 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; 200df48: 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 200df4c: a4 00 80 12 add %g2, %l2, %l2 200df50: 40 00 2d 4b call 201947c <.urem> 200df54: 90 10 00 18 mov %i0, %o0 200df58: 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 ) { 200df5c: 80 a4 80 18 cmp %l2, %i0 200df60: 1a 80 00 06 bcc 200df78 <_Heap_Allocate_aligned_with_boundary+0xf0> 200df64: a6 07 60 08 add %i5, 8, %l3 200df68: 90 10 00 12 mov %l2, %o0 200df6c: 40 00 2d 44 call 201947c <.urem> 200df70: 92 10 00 1a mov %i2, %o1 200df74: b0 24 80 08 sub %l2, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 200df78: 80 a6 e0 00 cmp %i3, 0 200df7c: 02 80 00 37 be 200e058 <_Heap_Allocate_aligned_with_boundary+0x1d0> 200df80: 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; 200df84: 86 06 00 19 add %i0, %i1, %g3 200df88: 92 10 00 1b mov %i3, %o1 200df8c: 90 10 00 03 mov %g3, %o0 200df90: 40 00 2d 3b call 201947c <.urem> 200df94: c6 27 bf f8 st %g3, [ %fp + -8 ] 200df98: c6 07 bf f8 ld [ %fp + -8 ], %g3 200df9c: 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 ) { 200dfa0: 80 a6 00 08 cmp %i0, %o0 200dfa4: 1a 80 00 2c bcc 200e054 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200dfa8: a4 04 c0 19 add %l3, %i1, %l2 200dfac: 80 a2 00 03 cmp %o0, %g3 200dfb0: 2a 80 00 12 bcs,a 200dff8 <_Heap_Allocate_aligned_with_boundary+0x170> 200dfb4: 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 ) { 200dfb8: 10 80 00 28 b 200e058 <_Heap_Allocate_aligned_with_boundary+0x1d0> 200dfbc: 80 a4 c0 18 cmp %l3, %i0 200dfc0: 92 10 00 1a mov %i2, %o1 200dfc4: 40 00 2d 2e call 201947c <.urem> 200dfc8: 90 10 00 18 mov %i0, %o0 200dfcc: 92 10 00 1b mov %i3, %o1 200dfd0: 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; 200dfd4: ac 06 00 19 add %i0, %i1, %l6 200dfd8: 40 00 2d 29 call 201947c <.urem> 200dfdc: 90 10 00 16 mov %l6, %o0 200dfe0: 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 ) { 200dfe4: 80 a2 00 16 cmp %o0, %l6 200dfe8: 1a 80 00 1b bcc 200e054 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200dfec: 80 a6 00 08 cmp %i0, %o0 200dff0: 1a 80 00 19 bcc 200e054 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200dff4: 80 a4 80 08 cmp %l2, %o0 if ( boundary_line < boundary_floor ) { 200dff8: 08 bf ff f2 bleu 200dfc0 <_Heap_Allocate_aligned_with_boundary+0x138> 200dffc: b0 22 00 19 sub %o0, %i1, %i0 return 0; 200e000: b0 10 20 00 clr %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200e004: 80 a6 20 00 cmp %i0, 0 200e008: 02 bf ff b7 be 200dee4 <_Heap_Allocate_aligned_with_boundary+0x5c><== ALWAYS TAKEN 200e00c: 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; 200e010: c6 04 20 48 ld [ %l0 + 0x48 ], %g3 stats->searches += search_count; 200e014: 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; 200e018: 86 00 e0 01 inc %g3 stats->searches += search_count; 200e01c: 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; 200e020: c6 24 20 48 st %g3, [ %l0 + 0x48 ] stats->searches += search_count; 200e024: c4 24 20 4c st %g2, [ %l0 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200e028: 90 10 00 10 mov %l0, %o0 200e02c: 92 10 00 1d mov %i5, %o1 200e030: 94 10 00 18 mov %i0, %o2 200e034: 7f ff eb df call 2008fb0 <_Heap_Block_allocate> 200e038: 96 10 00 19 mov %i1, %o3 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200e03c: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 200e040: 80 a0 40 1c cmp %g1, %i4 200e044: 2a bf ff b9 bcs,a 200df28 <_Heap_Allocate_aligned_with_boundary+0xa0> 200e048: f8 24 20 44 st %i4, [ %l0 + 0x44 ] stats->max_search = search_count; } return (void *) alloc_begin; } 200e04c: 81 c7 e0 08 ret 200e050: 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 ) { 200e054: 80 a4 c0 18 cmp %l3, %i0 200e058: 18 bf ff ea bgu 200e000 <_Heap_Allocate_aligned_with_boundary+0x178> 200e05c: 82 10 3f f8 mov -8, %g1 200e060: 90 10 00 18 mov %i0, %o0 200e064: a4 20 40 1d sub %g1, %i5, %l2 200e068: 92 10 00 15 mov %l5, %o1 200e06c: 40 00 2d 04 call 201947c <.urem> 200e070: 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 ) { 200e074: 90 a4 80 08 subcc %l2, %o0, %o0 200e078: 02 bf ff 99 be 200dedc <_Heap_Allocate_aligned_with_boundary+0x54> 200e07c: 80 a6 20 00 cmp %i0, 0 200e080: 80 a2 00 14 cmp %o0, %l4 200e084: 1a bf ff 96 bcc 200dedc <_Heap_Allocate_aligned_with_boundary+0x54> 200e088: 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; 200e08c: 10 bf ff de b 200e004 <_Heap_Allocate_aligned_with_boundary+0x17c> 200e090: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 200e094: 18 80 00 06 bgu 200e0ac <_Heap_Allocate_aligned_with_boundary+0x224> 200e098: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 200e09c: 22 bf ff 84 be,a 200deac <_Heap_Allocate_aligned_with_boundary+0x24> 200e0a0: 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; 200e0a4: 10 bf ff 83 b 200deb0 <_Heap_Allocate_aligned_with_boundary+0x28> 200e0a8: 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; 200e0ac: 81 c7 e0 08 ret 200e0b0: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200e0c0 <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t unused __attribute__((unused)) ) { 200e0c0: 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; 200e0c4: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200e0c8: 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)) ) { 200e0cc: b8 10 00 18 mov %i0, %i4 Heap_Statistics *const stats = &heap->stats; Heap_Block *const first_block = heap->first_block; 200e0d0: 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; 200e0d4: 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; 200e0d8: e4 06 20 10 ld [ %i0 + 0x10 ], %l2 uintptr_t const min_block_size = heap->min_block_size; 200e0dc: 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 ) { 200e0e0: 80 a6 40 10 cmp %i1, %l0 200e0e4: 08 80 00 04 bleu 200e0f4 <_Heap_Extend+0x34> 200e0e8: f0 06 20 30 ld [ %i0 + 0x30 ], %i0 return 0; 200e0ec: 81 c7 e0 08 ret 200e0f0: 91 e8 20 00 restore %g0, 0, %o0 } extend_area_ok = _Heap_Get_first_and_last_block( 200e0f4: 90 10 00 19 mov %i1, %o0 200e0f8: 92 10 00 1a mov %i2, %o1 200e0fc: 94 10 00 12 mov %l2, %o2 200e100: 98 07 bf f8 add %fp, -8, %o4 200e104: 7f ff eb 40 call 2008e04 <_Heap_Get_first_and_last_block> 200e108: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200e10c: 80 8a 20 ff btst 0xff, %o0 200e110: 02 bf ff f7 be 200e0ec <_Heap_Extend+0x2c> 200e114: ba 10 00 11 mov %l1, %i5 200e118: aa 10 20 00 clr %l5 200e11c: ac 10 20 00 clr %l6 200e120: a6 10 20 00 clr %l3 200e124: 10 80 00 10 b 200e164 <_Heap_Extend+0xa4> 200e128: 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 ) { 200e12c: 2a 80 00 02 bcs,a 200e134 <_Heap_Extend+0x74> 200e130: ac 10 00 1d mov %i5, %l6 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200e134: 80 a6 c0 19 cmp %i3, %i1 200e138: 22 80 00 1e be,a 200e1b0 <_Heap_Extend+0xf0> 200e13c: 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 ) { 200e140: 80 a6 40 1b cmp %i1, %i3 200e144: 38 80 00 02 bgu,a 200e14c <_Heap_Extend+0x8c> 200e148: 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; 200e14c: fa 02 20 04 ld [ %o0 + 4 ], %i5 200e150: 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); 200e154: 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 ); 200e158: 80 a4 40 1d cmp %l1, %i5 200e15c: 22 80 00 1c be,a 200e1cc <_Heap_Extend+0x10c> 200e160: 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; 200e164: 80 a7 40 11 cmp %i5, %l1 200e168: 22 80 00 03 be,a 200e174 <_Heap_Extend+0xb4> 200e16c: f4 07 20 18 ld [ %i4 + 0x18 ], %i2 200e170: b4 10 00 1d mov %i5, %i2 uintptr_t const sub_area_end = start_block->prev_size; 200e174: 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); 200e178: 92 10 00 12 mov %l2, %o1 200e17c: 40 00 2d 79 call 2019760 <.urem> 200e180: 90 10 00 1b mov %i3, %o0 200e184: 82 06 ff f8 add %i3, -8, %g1 Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 200e188: 80 a6 80 10 cmp %i2, %l0 200e18c: 0a 80 00 64 bcs 200e31c <_Heap_Extend+0x25c> 200e190: 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 ) { 200e194: 80 a6 80 10 cmp %i2, %l0 200e198: 12 bf ff e5 bne 200e12c <_Heap_Extend+0x6c> 200e19c: 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 ) { 200e1a0: 80 a6 c0 19 cmp %i3, %i1 200e1a4: 12 bf ff e7 bne 200e140 <_Heap_Extend+0x80> <== ALWAYS TAKEN 200e1a8: a8 10 00 1d mov %i5, %l4 start_block->prev_size = extend_area_end; 200e1ac: 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; 200e1b0: fa 02 20 04 ld [ %o0 + 4 ], %i5 200e1b4: 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); 200e1b8: 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 ); 200e1bc: 80 a4 40 1d cmp %l1, %i5 200e1c0: 12 bf ff e9 bne 200e164 <_Heap_Extend+0xa4> <== NEVER TAKEN 200e1c4: a6 10 00 08 mov %o0, %l3 if ( extend_area_begin < heap->area_begin ) { 200e1c8: c2 07 20 18 ld [ %i4 + 0x18 ], %g1 200e1cc: 80 a6 40 01 cmp %i1, %g1 200e1d0: 3a 80 00 4e bcc,a 200e308 <_Heap_Extend+0x248> 200e1d4: c2 07 20 1c ld [ %i4 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200e1d8: 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; 200e1dc: c2 07 bf f8 ld [ %fp + -8 ], %g1 200e1e0: 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 ) { 200e1e4: 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 = 200e1e8: 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; 200e1ec: e0 20 40 00 st %l0, [ %g1 ] extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 200e1f0: 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 = 200e1f4: 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; 200e1f8: 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 ) { 200e1fc: 80 a1 00 01 cmp %g4, %g1 200e200: 08 80 00 3c bleu 200e2f0 <_Heap_Extend+0x230> 200e204: c0 20 a0 04 clr [ %g2 + 4 ] heap->first_block = extend_first_block; 200e208: 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 ) { 200e20c: 80 a5 20 00 cmp %l4, 0 200e210: 02 80 00 47 be 200e32c <_Heap_Extend+0x26c> 200e214: 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; 200e218: 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; 200e21c: 92 10 00 1d mov %i5, %o1 200e220: 40 00 2d 50 call 2019760 <.urem> 200e224: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200e228: 80 a2 20 00 cmp %o0, 0 200e22c: 02 80 00 04 be 200e23c <_Heap_Extend+0x17c> 200e230: c4 05 00 00 ld [ %l4 ], %g2 return value - remainder + alignment; 200e234: b2 06 40 1d add %i1, %i5, %i1 200e238: 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 = 200e23c: 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; 200e240: 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 = 200e244: 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; 200e248: 84 10 a0 01 or %g2, 1, %g2 _Heap_Free_block( heap, new_first_block ); 200e24c: 90 10 00 1c mov %i4, %o0 200e250: 92 10 00 01 mov %g1, %o1 200e254: 7f ff ff 85 call 200e068 <_Heap_Free_block> 200e258: c4 26 7f fc st %g2, [ %i1 + -4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200e25c: 80 a4 e0 00 cmp %l3, 0 200e260: 02 80 00 3a be 200e348 <_Heap_Extend+0x288> 200e264: 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); 200e268: 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( 200e26c: a0 24 00 13 sub %l0, %l3, %l0 200e270: 40 00 2d 3c call 2019760 <.urem> 200e274: 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) 200e278: c2 04 e0 04 ld [ %l3 + 4 ], %g1 200e27c: a0 24 00 08 sub %l0, %o0, %l0 200e280: 82 20 40 10 sub %g1, %l0, %g1 | HEAP_PREV_BLOCK_USED; 200e284: 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 = 200e288: 84 04 00 13 add %l0, %l3, %g2 200e28c: 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; 200e290: 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 ); 200e294: 90 10 00 1c mov %i4, %o0 200e298: 82 08 60 01 and %g1, 1, %g1 200e29c: 92 10 00 13 mov %l3, %o1 block->size_and_flag = size | flag; 200e2a0: a0 14 00 01 or %l0, %g1, %l0 200e2a4: 7f ff ff 71 call 200e068 <_Heap_Free_block> 200e2a8: e0 24 e0 04 st %l0, [ %l3 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200e2ac: 80 a4 e0 00 cmp %l3, 0 200e2b0: 02 80 00 33 be 200e37c <_Heap_Extend+0x2bc> 200e2b4: 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 200e2b8: 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( 200e2bc: 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; 200e2c0: 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; 200e2c4: 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; 200e2c8: 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( 200e2cc: 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; 200e2d0: 88 09 20 01 and %g4, 1, %g4 block->size_and_flag = size | flag; 200e2d4: 88 17 40 04 or %i5, %g4, %g4 200e2d8: c8 20 60 04 st %g4, [ %g1 + 4 ] 200e2dc: b0 20 c0 18 sub %g3, %i0, %i0 /* Statistics */ stats->size += extended_size; 200e2e0: 82 00 80 18 add %g2, %i0, %g1 200e2e4: c2 27 20 2c st %g1, [ %i4 + 0x2c ] return extended_size; } 200e2e8: 81 c7 e0 08 ret 200e2ec: 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 ) { 200e2f0: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 200e2f4: 80 a0 40 02 cmp %g1, %g2 200e2f8: 2a bf ff c5 bcs,a 200e20c <_Heap_Extend+0x14c> 200e2fc: c4 27 20 24 st %g2, [ %i4 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200e300: 10 bf ff c4 b 200e210 <_Heap_Extend+0x150> 200e304: 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 ) { 200e308: 80 a4 00 01 cmp %l0, %g1 200e30c: 38 bf ff b4 bgu,a 200e1dc <_Heap_Extend+0x11c> 200e310: 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; 200e314: 10 bf ff b3 b 200e1e0 <_Heap_Extend+0x120> 200e318: 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 ( 200e31c: 80 a6 40 1b cmp %i1, %i3 200e320: 1a bf ff 9e bcc 200e198 <_Heap_Extend+0xd8> 200e324: 80 a6 80 10 cmp %i2, %l0 200e328: 30 bf ff 71 b,a 200e0ec <_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 ) { 200e32c: 80 a5 a0 00 cmp %l6, 0 200e330: 02 bf ff cc be 200e260 <_Heap_Extend+0x1a0> 200e334: 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; 200e338: ac 25 80 02 sub %l6, %g2, %l6 200e33c: 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 = 200e340: 10 bf ff c8 b 200e260 <_Heap_Extend+0x1a0> 200e344: 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 ) { 200e348: 80 a5 60 00 cmp %l5, 0 200e34c: 02 bf ff d8 be 200e2ac <_Heap_Extend+0x1ec> 200e350: 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; 200e354: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 200e358: c2 07 bf fc ld [ %fp + -4 ], %g1 200e35c: 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 ); 200e360: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 200e364: 84 10 80 03 or %g2, %g3, %g2 200e368: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200e36c: c4 00 60 04 ld [ %g1 + 4 ], %g2 200e370: 84 10 a0 01 or %g2, 1, %g2 200e374: 10 bf ff ce b 200e2ac <_Heap_Extend+0x1ec> 200e378: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200e37c: 32 bf ff d0 bne,a 200e2bc <_Heap_Extend+0x1fc> 200e380: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200e384: d2 07 bf f8 ld [ %fp + -8 ], %o1 200e388: 7f ff ff 38 call 200e068 <_Heap_Free_block> 200e38c: 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 200e390: 10 bf ff cb b 200e2bc <_Heap_Extend+0x1fc> 200e394: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 =============================================================================== 0200e0b4 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200e0b4: 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 ) { 200e0b8: 80 a6 60 00 cmp %i1, 0 200e0bc: 02 80 00 3c be 200e1ac <_Heap_Free+0xf8> 200e0c0: 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); 200e0c4: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200e0c8: 40 00 2c ed call 201947c <.urem> 200e0cc: 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 200e0d0: 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); 200e0d4: 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); 200e0d8: 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; 200e0dc: 80 a2 00 02 cmp %o0, %g2 200e0e0: 0a 80 00 30 bcs 200e1a0 <_Heap_Free+0xec> 200e0e4: 82 10 20 00 clr %g1 200e0e8: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 200e0ec: 80 a2 00 04 cmp %o0, %g4 200e0f0: 38 80 00 2d bgu,a 200e1a4 <_Heap_Free+0xf0> <== NEVER TAKEN 200e0f4: 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; 200e0f8: f6 02 20 04 ld [ %o0 + 4 ], %i3 200e0fc: 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); 200e100: 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; 200e104: 80 a0 80 03 cmp %g2, %g3 200e108: 38 80 00 27 bgu,a 200e1a4 <_Heap_Free+0xf0> <== NEVER TAKEN 200e10c: b0 08 60 ff and %g1, 0xff, %i0 <== NOT EXECUTED 200e110: 80 a1 00 03 cmp %g4, %g3 200e114: 2a 80 00 24 bcs,a 200e1a4 <_Heap_Free+0xf0> <== NEVER TAKEN 200e118: 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; 200e11c: f8 00 e0 04 ld [ %g3 + 4 ], %i4 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200e120: 80 8f 20 01 btst 1, %i4 200e124: 02 80 00 1f be 200e1a0 <_Heap_Free+0xec> <== NEVER TAKEN 200e128: 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 )); 200e12c: 02 80 00 23 be 200e1b8 <_Heap_Free+0x104> 200e130: b8 0f 3f fe and %i4, -2, %i4 200e134: 82 00 c0 1c add %g3, %i4, %g1 200e138: c2 00 60 04 ld [ %g1 + 4 ], %g1 200e13c: 80 88 60 01 btst 1, %g1 200e140: 12 80 00 1f bne 200e1bc <_Heap_Free+0x108> 200e144: 80 8e e0 01 btst 1, %i3 if ( !_Heap_Is_prev_used( block ) ) { 200e148: 02 80 00 20 be 200e1c8 <_Heap_Free+0x114> 200e14c: 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; 200e150: c4 00 e0 08 ld [ %g3 + 8 ], %g2 Heap_Block *prev = old_block->prev; 200e154: c2 00 e0 0c ld [ %g3 + 0xc ], %g1 new_block->next = next; 200e158: c4 22 20 08 st %g2, [ %o0 + 8 ] new_block->prev = prev; 200e15c: 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; 200e160: b8 07 00 1d add %i4, %i5, %i4 next->prev = new_block; 200e164: d0 20 a0 0c st %o0, [ %g2 + 0xc ] prev->next = new_block; 200e168: d0 20 60 08 st %o0, [ %g1 + 8 ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200e16c: 84 17 20 01 or %i4, 1, %g2 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200e170: 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; 200e174: c4 22 20 04 st %g2, [ %o0 + 4 ] } } /* Statistics */ --stats->used_blocks; ++stats->frees; 200e178: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200e17c: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 ++stats->frees; stats->free_size += block_size; 200e180: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 } } /* Statistics */ --stats->used_blocks; ++stats->frees; 200e184: 82 00 60 01 inc %g1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200e188: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; stats->free_size += block_size; 200e18c: ba 00 c0 1d add %g3, %i5, %i5 } } /* Statistics */ --stats->used_blocks; ++stats->frees; 200e190: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200e194: c4 26 20 40 st %g2, [ %i0 + 0x40 ] ++stats->frees; stats->free_size += block_size; 200e198: fa 26 20 30 st %i5, [ %i0 + 0x30 ] return( true ); 200e19c: 82 10 20 01 mov 1, %g1 200e1a0: b0 08 60 ff and %g1, 0xff, %i0 200e1a4: 81 c7 e0 08 ret 200e1a8: 81 e8 00 00 restore 200e1ac: b0 08 60 ff and %g1, 0xff, %i0 200e1b0: 81 c7 e0 08 ret 200e1b4: 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 ) ) { 200e1b8: 80 8e e0 01 btst 1, %i3 200e1bc: 32 80 00 1e bne,a 200e234 <_Heap_Free+0x180> 200e1c0: 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 200e1c4: 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; 200e1c8: 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); 200e1cc: 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; 200e1d0: 80 a0 80 1b cmp %g2, %i3 200e1d4: 18 bf ff f3 bgu 200e1a0 <_Heap_Free+0xec> <== NEVER TAKEN 200e1d8: 82 10 20 00 clr %g1 200e1dc: 80 a1 00 1b cmp %g4, %i3 200e1e0: 2a bf ff f1 bcs,a 200e1a4 <_Heap_Free+0xf0> <== NEVER TAKEN 200e1e4: 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; 200e1e8: 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) ) { 200e1ec: 80 88 a0 01 btst 1, %g2 200e1f0: 02 bf ff ec be 200e1a0 <_Heap_Free+0xec> <== NEVER TAKEN 200e1f4: 80 8e 60 ff btst 0xff, %i1 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200e1f8: 22 80 00 21 be,a 200e27c <_Heap_Free+0x1c8> 200e1fc: 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; 200e200: c2 00 e0 08 ld [ %g3 + 8 ], %g1 Heap_Block *prev = block->prev; 200e204: 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; 200e208: c6 06 20 38 ld [ %i0 + 0x38 ], %g3 prev->next = next; 200e20c: c2 20 a0 08 st %g1, [ %g2 + 8 ] next->prev = prev; 200e210: c4 20 60 0c st %g2, [ %g1 + 0xc ] 200e214: 82 00 ff ff add %g3, -1, %g1 200e218: 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; 200e21c: b8 07 40 1c add %i5, %i4, %i4 200e220: 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; 200e224: 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; 200e228: 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; 200e22c: 10 bf ff d3 b 200e178 <_Heap_Free+0xc4> 200e230: 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; 200e234: 82 17 60 01 or %i5, 1, %g1 200e238: c2 22 20 04 st %g1, [ %o0 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200e23c: c8 00 e0 04 ld [ %g3 + 4 ], %g4 ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200e240: f0 22 20 0c st %i0, [ %o0 + 0xc ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200e244: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200e248: c4 22 20 08 st %g2, [ %o0 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200e24c: 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; 200e250: 84 09 3f fe and %g4, -2, %g2 next_block->prev_size = block_size; 200e254: 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; 200e258: 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 ) { 200e25c: 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; 200e260: 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; 200e264: d0 26 20 08 st %o0, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200e268: 80 a0 40 02 cmp %g1, %g2 200e26c: 08 bf ff c3 bleu 200e178 <_Heap_Free+0xc4> 200e270: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200e274: 10 bf ff c1 b 200e178 <_Heap_Free+0xc4> 200e278: 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; 200e27c: 82 16 a0 01 or %i2, 1, %g1 200e280: c2 26 e0 04 st %g1, [ %i3 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200e284: c2 00 e0 04 ld [ %g3 + 4 ], %g1 next_block->prev_size = size; 200e288: 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; 200e28c: 82 08 7f fe and %g1, -2, %g1 200e290: 10 bf ff ba b 200e178 <_Heap_Free+0xc4> 200e294: c2 20 e0 04 st %g1, [ %g3 + 4 ] =============================================================================== 02012ee4 <_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; 2012ee4: 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; 2012ee8: c0 22 40 00 clr [ %o1 ] info->largest = 0; 2012eec: c0 22 60 04 clr [ %o1 + 4 ] info->total = 0; 2012ef0: c0 22 60 08 clr [ %o1 + 8 ] for(the_block = _Heap_Free_list_first(the_heap); 2012ef4: 88 10 20 01 mov 1, %g4 2012ef8: 9a 10 20 00 clr %o5 2012efc: 80 a2 00 01 cmp %o0, %g1 2012f00: 12 80 00 04 bne 2012f10 <_Heap_Get_free_information+0x2c> <== ALWAYS TAKEN 2012f04: 86 10 20 00 clr %g3 2012f08: 30 80 00 10 b,a 2012f48 <_Heap_Get_free_information+0x64><== NOT EXECUTED 2012f0c: 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; 2012f10: c4 00 60 04 ld [ %g1 + 4 ], %g2 2012f14: 98 01 20 01 add %g4, 1, %o4 2012f18: 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 ) 2012f1c: 80 a0 80 0d cmp %g2, %o5 2012f20: 08 80 00 03 bleu 2012f2c <_Heap_Get_free_information+0x48> 2012f24: 86 00 c0 02 add %g3, %g2, %g3 info->largest = the_size; 2012f28: 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) 2012f2c: 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); 2012f30: 80 a2 00 01 cmp %o0, %g1 2012f34: 32 bf ff f6 bne,a 2012f0c <_Heap_Get_free_information+0x28> 2012f38: da 02 60 04 ld [ %o1 + 4 ], %o5 2012f3c: c8 22 40 00 st %g4, [ %o1 ] 2012f40: 81 c3 e0 08 retl 2012f44: c6 22 60 08 st %g3, [ %o1 + 8 ] 2012f48: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 0200ad34 <_Heap_Greedy_allocate>: Heap_Block *_Heap_Greedy_allocate( Heap_Control *heap, const uintptr_t *block_sizes, size_t block_count ) { 200ad34: 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) { 200ad38: 80 a6 a0 00 cmp %i2, 0 200ad3c: 02 80 00 35 be 200ae10 <_Heap_Greedy_allocate+0xdc> 200ad40: b8 10 00 18 mov %i0, %i4 200ad44: ba 10 20 00 clr %i5 200ad48: b6 10 20 00 clr %i3 #include "config.h" #endif #include Heap_Block *_Heap_Greedy_allocate( 200ad4c: 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 ); 200ad50: d2 06 40 01 ld [ %i1 + %g1 ], %o1 200ad54: 94 10 20 00 clr %o2 200ad58: 96 10 20 00 clr %o3 200ad5c: 40 00 1f d6 call 2012cb4 <_Heap_Allocate_aligned_with_boundary> 200ad60: 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 ) { 200ad64: 82 92 20 00 orcc %o0, 0, %g1 200ad68: 22 80 00 09 be,a 200ad8c <_Heap_Greedy_allocate+0x58> <== NEVER TAKEN 200ad6c: 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); 200ad70: d2 07 20 10 ld [ %i4 + 0x10 ], %o1 200ad74: 40 00 4d 42 call 201e27c <.urem> 200ad78: 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); 200ad7c: 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; 200ad80: f6 22 20 08 st %i3, [ %o0 + 8 ] 200ad84: 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) { 200ad88: ba 07 60 01 inc %i5 200ad8c: 80 a7 40 1a cmp %i5, %i2 200ad90: 12 bf ff f0 bne 200ad50 <_Heap_Greedy_allocate+0x1c> 200ad94: 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; 200ad98: 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 ) { 200ad9c: 80 a7 00 1d cmp %i4, %i5 200ada0: 02 80 00 17 be 200adfc <_Heap_Greedy_allocate+0xc8> <== NEVER TAKEN 200ada4: b0 10 20 00 clr %i0 200ada8: 10 80 00 03 b 200adb4 <_Heap_Greedy_allocate+0x80> 200adac: b4 10 20 00 clr %i2 200adb0: 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; 200adb4: d6 07 60 04 ld [ %i5 + 4 ], %o3 _Heap_Block_allocate( 200adb8: 92 10 00 1d mov %i5, %o1 200adbc: 96 0a ff fe and %o3, -2, %o3 200adc0: 94 07 60 08 add %i5, 8, %o2 200adc4: 90 10 00 1c mov %i4, %o0 200adc8: 40 00 00 e0 call 200b148 <_Heap_Block_allocate> 200adcc: 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; 200add0: 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; 200add4: 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 ) { 200add8: 80 a7 00 01 cmp %i4, %g1 200addc: 12 bf ff f5 bne 200adb0 <_Heap_Greedy_allocate+0x7c> 200ade0: b4 10 00 1d mov %i5, %i2 200ade4: 10 80 00 06 b 200adfc <_Heap_Greedy_allocate+0xc8> 200ade8: 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 ) ); 200adec: 92 06 e0 08 add %i3, 8, %o1 200adf0: 90 10 00 1c mov %i4, %o0 200adf4: 40 00 20 3b call 2012ee0 <_Heap_Free> 200adf8: b6 10 00 1a mov %i2, %i3 current->next = blocks; blocks = current; } while ( allocated_blocks != NULL ) { 200adfc: 80 a6 e0 00 cmp %i3, 0 200ae00: 32 bf ff fb bne,a 200adec <_Heap_Greedy_allocate+0xb8> 200ae04: 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; } 200ae08: 81 c7 e0 08 ret 200ae0c: 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; 200ae10: 10 bf ff e2 b 200ad98 <_Heap_Greedy_allocate+0x64> 200ae14: b6 10 20 00 clr %i3 =============================================================================== 0200ae18 <_Heap_Greedy_free>: void _Heap_Greedy_free( Heap_Control *heap, Heap_Block *blocks ) { 200ae18: 9d e3 bf a0 save %sp, -96, %sp while ( blocks != NULL ) { 200ae1c: 80 a6 60 00 cmp %i1, 0 200ae20: 02 80 00 09 be 200ae44 <_Heap_Greedy_free+0x2c> <== NEVER TAKEN 200ae24: 01 00 00 00 nop Heap_Block *current = blocks; blocks = blocks->next; 200ae28: fa 06 60 08 ld [ %i1 + 8 ], %i5 _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) ); 200ae2c: 92 06 60 08 add %i1, 8, %o1 200ae30: 40 00 20 2c call 2012ee0 <_Heap_Free> 200ae34: 90 10 00 18 mov %i0, %o0 void _Heap_Greedy_free( Heap_Control *heap, Heap_Block *blocks ) { while ( blocks != NULL ) { 200ae38: b2 97 60 00 orcc %i5, 0, %i1 200ae3c: 32 bf ff fc bne,a 200ae2c <_Heap_Greedy_free+0x14> 200ae40: fa 06 60 08 ld [ %i1 + 8 ], %i5 200ae44: 81 c7 e0 08 ret 200ae48: 81 e8 00 00 restore =============================================================================== 02012fb0 <_Heap_Iterate>: void _Heap_Iterate( Heap_Control *heap, Heap_Block_visitor visitor, void *visitor_arg ) { 2012fb0: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *current = heap->first_block; 2012fb4: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 Heap_Block *end = heap->last_block; 2012fb8: f8 06 20 24 ld [ %i0 + 0x24 ], %i4 bool stop = false; while ( !stop && current != end ) { 2012fbc: 80 a0 40 1c cmp %g1, %i4 2012fc0: 32 80 00 08 bne,a 2012fe0 <_Heap_Iterate+0x30> <== ALWAYS TAKEN 2012fc4: d2 00 60 04 ld [ %g1 + 4 ], %o1 2012fc8: 30 80 00 10 b,a 2013008 <_Heap_Iterate+0x58> <== NOT EXECUTED 2012fcc: 90 1a 20 01 xor %o0, 1, %o0 2012fd0: 80 8a 20 ff btst 0xff, %o0 2012fd4: 02 80 00 0d be 2013008 <_Heap_Iterate+0x58> <== NEVER TAKEN 2012fd8: 01 00 00 00 nop 2012fdc: 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 ); 2012fe0: 90 10 00 01 mov %g1, %o0 2012fe4: 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); 2012fe8: 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; 2012fec: d4 07 60 04 ld [ %i5 + 4 ], %o2 2012ff0: 96 10 00 1a mov %i2, %o3 2012ff4: 9f c6 40 00 call %i1 2012ff8: 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 ) { 2012ffc: 80 a7 00 1d cmp %i4, %i5 2013000: 12 bf ff f3 bne 2012fcc <_Heap_Iterate+0x1c> 2013004: 82 10 00 1d mov %i5, %g1 2013008: 81 c7 e0 08 ret 201300c: 81 e8 00 00 restore =============================================================================== 0200e3c0 <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 200e3c0: 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); 200e3c4: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200e3c8: 40 00 2c 2d call 201947c <.urem> 200e3cc: 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 200e3d0: 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); 200e3d4: 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); 200e3d8: 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; 200e3dc: 80 a2 00 01 cmp %o0, %g1 200e3e0: 0a 80 00 16 bcs 200e438 <_Heap_Size_of_alloc_area+0x78> 200e3e4: 84 10 20 00 clr %g2 200e3e8: c6 06 20 24 ld [ %i0 + 0x24 ], %g3 200e3ec: 80 a2 00 03 cmp %o0, %g3 200e3f0: 18 80 00 13 bgu 200e43c <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200e3f4: 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; 200e3f8: c8 02 20 04 ld [ %o0 + 4 ], %g4 200e3fc: 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); 200e400: 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; 200e404: 80 a0 40 08 cmp %g1, %o0 200e408: 18 80 00 0d bgu 200e43c <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200e40c: 01 00 00 00 nop 200e410: 80 a0 c0 08 cmp %g3, %o0 200e414: 0a 80 00 0a bcs 200e43c <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200e418: 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; 200e41c: 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 ) 200e420: 80 88 60 01 btst 1, %g1 200e424: 02 80 00 06 be 200e43c <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200e428: 90 22 00 19 sub %o0, %i1, %o0 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 200e42c: 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; 200e430: 90 02 20 04 add %o0, 4, %o0 200e434: d0 26 80 00 st %o0, [ %i2 ] 200e438: b0 08 a0 ff and %g2, 0xff, %i0 200e43c: 81 c7 e0 08 ret 200e440: 81 e8 00 00 restore =============================================================================== 02009d80 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 2009d80: 9d e3 bf 80 save %sp, -128, %sp uintptr_t const page_size = heap->page_size; 2009d84: f6 06 20 10 ld [ %i0 + 0x10 ], %i3 uintptr_t const min_block_size = heap->min_block_size; 2009d88: e0 06 20 14 ld [ %i0 + 0x14 ], %l0 Heap_Block *const first_block = heap->first_block; 2009d8c: 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; 2009d90: 80 a6 a0 00 cmp %i2, 0 2009d94: 02 80 00 0c be 2009dc4 <_Heap_Walk+0x44> 2009d98: e2 06 20 24 ld [ %i0 + 0x24 ], %l1 if ( !_System_state_Is_up( _System_state_Get() ) ) { 2009d9c: 03 00 80 83 sethi %hi(0x2020c00), %g1 2009da0: c4 00 61 58 ld [ %g1 + 0x158 ], %g2 ! 2020d58 <_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; 2009da4: 07 00 80 27 sethi %hi(0x2009c00), %g3 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; 2009da8: 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() ) ) { 2009dac: 80 a0 a0 03 cmp %g2, 3 2009db0: 02 80 00 0c be 2009de0 <_Heap_Walk+0x60> <== ALWAYS TAKEN 2009db4: ae 10 e1 1c or %g3, 0x11c, %l7 2009db8: b0 08 60 ff and %g1, 0xff, %i0 2009dbc: 81 c7 e0 08 ret 2009dc0: 81 e8 00 00 restore 2009dc4: 03 00 80 83 sethi %hi(0x2020c00), %g1 2009dc8: c4 00 61 58 ld [ %g1 + 0x158 ], %g2 ! 2020d58 <_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; 2009dcc: 07 00 80 27 sethi %hi(0x2009c00), %g3 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; 2009dd0: 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() ) ) { 2009dd4: 80 a0 a0 03 cmp %g2, 3 2009dd8: 12 bf ff f8 bne 2009db8 <_Heap_Walk+0x38> 2009ddc: ae 10 e1 14 or %g3, 0x114, %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)( 2009de0: da 06 20 18 ld [ %i0 + 0x18 ], %o5 2009de4: c8 06 20 1c ld [ %i0 + 0x1c ], %g4 2009de8: c4 06 20 08 ld [ %i0 + 8 ], %g2 2009dec: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2009df0: 90 10 00 19 mov %i1, %o0 2009df4: c8 23 a0 5c st %g4, [ %sp + 0x5c ] 2009df8: f8 23 a0 60 st %i4, [ %sp + 0x60 ] 2009dfc: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 2009e00: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 2009e04: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2009e08: 92 10 20 00 clr %o1 2009e0c: 96 10 00 1b mov %i3, %o3 2009e10: 15 00 80 74 sethi %hi(0x201d000), %o2 2009e14: 98 10 00 10 mov %l0, %o4 2009e18: 9f c5 c0 00 call %l7 2009e1c: 94 12 a3 a0 or %o2, 0x3a0, %o2 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 2009e20: 80 a6 e0 00 cmp %i3, 0 2009e24: 02 80 00 2a be 2009ecc <_Heap_Walk+0x14c> 2009e28: 80 8e e0 07 btst 7, %i3 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 2009e2c: 12 80 00 2f bne 2009ee8 <_Heap_Walk+0x168> 2009e30: 90 10 00 10 mov %l0, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2009e34: 7f ff df 4f call 2001b70 <.urem> 2009e38: 92 10 00 1b mov %i3, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 2009e3c: 80 a2 20 00 cmp %o0, 0 2009e40: 12 80 00 32 bne 2009f08 <_Heap_Walk+0x188> 2009e44: 90 07 20 08 add %i4, 8, %o0 2009e48: 7f ff df 4a call 2001b70 <.urem> 2009e4c: 92 10 00 1b mov %i3, %o1 ); return false; } if ( 2009e50: 80 a2 20 00 cmp %o0, 0 2009e54: 32 80 00 35 bne,a 2009f28 <_Heap_Walk+0x1a8> 2009e58: 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; 2009e5c: ec 07 20 04 ld [ %i4 + 4 ], %l6 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 2009e60: b4 8d a0 01 andcc %l6, 1, %i2 2009e64: 22 80 00 38 be,a 2009f44 <_Heap_Walk+0x1c4> 2009e68: 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; 2009e6c: c2 04 60 04 ld [ %l1 + 4 ], %g1 2009e70: 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); 2009e74: 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; 2009e78: fa 00 60 04 ld [ %g1 + 4 ], %i5 ); return false; } if ( _Heap_Is_free( last_block ) ) { 2009e7c: 80 8f 60 01 btst 1, %i5 2009e80: 02 80 00 0c be 2009eb0 <_Heap_Walk+0x130> 2009e84: 80 a7 00 01 cmp %i4, %g1 ); return false; } if ( 2009e88: 02 80 00 35 be 2009f5c <_Heap_Walk+0x1dc> 2009e8c: 90 10 00 19 mov %i1, %o0 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 2009e90: 92 10 20 01 mov 1, %o1 2009e94: 15 00 80 75 sethi %hi(0x201d400), %o2 2009e98: 9f c5 c0 00 call %l7 2009e9c: 94 12 a1 18 or %o2, 0x118, %o2 ! 201d518 <__log2table+0x2d8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009ea0: 82 10 20 00 clr %g1 2009ea4: b0 08 60 ff and %g1, 0xff, %i0 2009ea8: 81 c7 e0 08 ret 2009eac: 81 e8 00 00 restore return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 2009eb0: 90 10 00 19 mov %i1, %o0 2009eb4: 92 10 20 01 mov 1, %o1 2009eb8: 15 00 80 75 sethi %hi(0x201d400), %o2 2009ebc: 9f c5 c0 00 call %l7 2009ec0: 94 12 a1 00 or %o2, 0x100, %o2 ! 201d500 <__log2table+0x2c0> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009ec4: 10 bf ff f8 b 2009ea4 <_Heap_Walk+0x124> 2009ec8: 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" ); 2009ecc: 90 10 00 19 mov %i1, %o0 2009ed0: 92 10 20 01 mov 1, %o1 2009ed4: 15 00 80 75 sethi %hi(0x201d400), %o2 2009ed8: 9f c5 c0 00 call %l7 2009edc: 94 12 a0 38 or %o2, 0x38, %o2 ! 201d438 <__log2table+0x1f8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009ee0: 10 bf ff f1 b 2009ea4 <_Heap_Walk+0x124> 2009ee4: 82 10 20 00 clr %g1 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 2009ee8: 90 10 00 19 mov %i1, %o0 2009eec: 92 10 20 01 mov 1, %o1 2009ef0: 15 00 80 75 sethi %hi(0x201d400), %o2 2009ef4: 96 10 00 1b mov %i3, %o3 2009ef8: 9f c5 c0 00 call %l7 2009efc: 94 12 a0 50 or %o2, 0x50, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009f00: 10 bf ff e9 b 2009ea4 <_Heap_Walk+0x124> 2009f04: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 2009f08: 90 10 00 19 mov %i1, %o0 2009f0c: 92 10 20 01 mov 1, %o1 2009f10: 15 00 80 75 sethi %hi(0x201d400), %o2 2009f14: 96 10 00 10 mov %l0, %o3 2009f18: 9f c5 c0 00 call %l7 2009f1c: 94 12 a0 70 or %o2, 0x70, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009f20: 10 bf ff e1 b 2009ea4 <_Heap_Walk+0x124> 2009f24: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 2009f28: 92 10 20 01 mov 1, %o1 2009f2c: 15 00 80 75 sethi %hi(0x201d400), %o2 2009f30: 96 10 00 1c mov %i4, %o3 2009f34: 9f c5 c0 00 call %l7 2009f38: 94 12 a0 98 or %o2, 0x98, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009f3c: 10 bf ff da b 2009ea4 <_Heap_Walk+0x124> 2009f40: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 2009f44: 92 10 20 01 mov 1, %o1 2009f48: 15 00 80 75 sethi %hi(0x201d400), %o2 2009f4c: 9f c5 c0 00 call %l7 2009f50: 94 12 a0 d0 or %o2, 0xd0, %o2 ! 201d4d0 <__log2table+0x290> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009f54: 10 bf ff d4 b 2009ea4 <_Heap_Walk+0x124> 2009f58: 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; 2009f5c: 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; 2009f60: 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 ) { 2009f64: 80 a6 00 1d cmp %i0, %i5 2009f68: 02 80 00 0d be 2009f9c <_Heap_Walk+0x21c> 2009f6c: 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; 2009f70: 80 a3 40 1d cmp %o5, %i5 2009f74: 28 80 00 bf bleu,a 200a270 <_Heap_Walk+0x4f0> <== ALWAYS TAKEN 2009f78: e6 06 20 24 ld [ %i0 + 0x24 ], %l3 if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 2009f7c: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 2009f80: 92 10 20 01 mov 1, %o1 2009f84: 15 00 80 75 sethi %hi(0x201d400), %o2 2009f88: 96 10 00 1d mov %i5, %o3 2009f8c: 9f c5 c0 00 call %l7 2009f90: 94 12 a1 48 or %o2, 0x148, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009f94: 10 bf ff c4 b 2009ea4 <_Heap_Walk+0x124> 2009f98: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2009f9c: 27 00 80 75 sethi %hi(0x201d400), %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)( 2009fa0: 25 00 80 75 sethi %hi(0x201d400), %l2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2009fa4: aa 10 00 1c mov %i4, %l5 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2009fa8: a6 14 e3 78 or %l3, 0x378, %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)( 2009fac: a4 14 a3 60 or %l2, 0x360, %l2 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2009fb0: 29 00 80 75 sethi %hi(0x201d400), %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; 2009fb4: 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); 2009fb8: 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; 2009fbc: 80 a3 40 1d cmp %o5, %i5 2009fc0: 28 80 00 0b bleu,a 2009fec <_Heap_Walk+0x26c> <== ALWAYS TAKEN 2009fc4: 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)( 2009fc8: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 2009fcc: 92 10 20 01 mov 1, %o1 2009fd0: 96 10 00 15 mov %l5, %o3 2009fd4: 15 00 80 75 sethi %hi(0x201d400), %o2 2009fd8: 98 10 00 1d mov %i5, %o4 2009fdc: 9f c5 c0 00 call %l7 2009fe0: 94 12 a1 f0 or %o2, 0x1f0, %o2 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 2009fe4: 10 bf ff 75 b 2009db8 <_Heap_Walk+0x38> 2009fe8: 82 10 20 00 clr %g1 2009fec: 80 a3 c0 1d cmp %o7, %i5 2009ff0: 0a bf ff f7 bcs 2009fcc <_Heap_Walk+0x24c> 2009ff4: 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; 2009ff8: 9e 1d 40 11 xor %l5, %l1, %o7 2009ffc: 80 a0 00 0f cmp %g0, %o7 200a000: 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; 200a004: 90 10 00 16 mov %l6, %o0 200a008: da 27 bf fc st %o5, [ %fp + -4 ] 200a00c: 7f ff de d9 call 2001b70 <.urem> 200a010: 92 10 00 1b mov %i3, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 200a014: 80 a2 20 00 cmp %o0, 0 200a018: 02 80 00 18 be 200a078 <_Heap_Walk+0x2f8> 200a01c: da 07 bf fc ld [ %fp + -4 ], %o5 200a020: 80 8b 60 ff btst 0xff, %o5 200a024: 12 80 00 8b bne 200a250 <_Heap_Walk+0x4d0> 200a028: 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; 200a02c: de 07 60 04 ld [ %i5 + 4 ], %o7 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 200a030: 80 8b e0 01 btst 1, %o7 200a034: 02 80 00 2b be 200a0e0 <_Heap_Walk+0x360> 200a038: 80 a6 a0 00 cmp %i2, 0 if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 200a03c: 22 80 00 21 be,a 200a0c0 <_Heap_Walk+0x340> 200a040: da 05 40 00 ld [ %l5 ], %o5 (*printer)( 200a044: 90 10 00 19 mov %i1, %o0 200a048: 92 10 20 00 clr %o1 200a04c: 94 10 00 12 mov %l2, %o2 200a050: 96 10 00 15 mov %l5, %o3 200a054: 9f c5 c0 00 call %l7 200a058: 98 10 00 16 mov %l6, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 200a05c: 80 a7 00 1d cmp %i4, %i5 200a060: 02 80 00 51 be 200a1a4 <_Heap_Walk+0x424> 200a064: aa 10 00 1d mov %i5, %l5 200a068: ec 07 60 04 ld [ %i5 + 4 ], %l6 200a06c: da 06 20 20 ld [ %i0 + 0x20 ], %o5 200a070: 10 bf ff d1 b 2009fb4 <_Heap_Walk+0x234> 200a074: b4 0d a0 01 and %l6, 1, %i2 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 200a078: 80 a5 80 10 cmp %l6, %l0 200a07c: 0a 80 00 69 bcs 200a220 <_Heap_Walk+0x4a0> 200a080: 80 8b 60 ff btst 0xff, %o5 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 200a084: 80 a5 40 1d cmp %l5, %i5 200a088: 2a bf ff ea bcs,a 200a030 <_Heap_Walk+0x2b0> 200a08c: de 07 60 04 ld [ %i5 + 4 ], %o7 200a090: 80 8b 60 ff btst 0xff, %o5 200a094: 22 bf ff e7 be,a 200a030 <_Heap_Walk+0x2b0> 200a098: de 07 60 04 ld [ %i5 + 4 ], %o7 (*printer)( 200a09c: 90 10 00 19 mov %i1, %o0 200a0a0: 92 10 20 01 mov 1, %o1 200a0a4: 96 10 00 15 mov %l5, %o3 200a0a8: 15 00 80 75 sethi %hi(0x201d400), %o2 200a0ac: 98 10 00 1d mov %i5, %o4 200a0b0: 9f c5 c0 00 call %l7 200a0b4: 94 12 a2 80 or %o2, 0x280, %o2 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 200a0b8: 10 bf ff 40 b 2009db8 <_Heap_Walk+0x38> 200a0bc: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 200a0c0: 96 10 00 15 mov %l5, %o3 200a0c4: 90 10 00 19 mov %i1, %o0 200a0c8: 92 10 20 00 clr %o1 200a0cc: 94 10 00 13 mov %l3, %o2 200a0d0: 9f c5 c0 00 call %l7 200a0d4: 98 10 00 16 mov %l6, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 200a0d8: 10 bf ff e2 b 200a060 <_Heap_Walk+0x2e0> 200a0dc: 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 ? 200a0e0: 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)( 200a0e4: de 06 20 08 ld [ %i0 + 8 ], %o7 200a0e8: 80 a3 c0 0d cmp %o7, %o5 200a0ec: 02 80 00 3d be 200a1e0 <_Heap_Walk+0x460> 200a0f0: 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)" : ""), 200a0f4: 80 a6 00 0d cmp %i0, %o5 200a0f8: 02 80 00 40 be 200a1f8 <_Heap_Walk+0x478> 200a0fc: 96 15 23 28 or %l4, 0x328, %o3 block->next, block->next == last_free_block ? 200a100: 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)( 200a104: 80 a3 00 0f cmp %o4, %o7 200a108: 02 80 00 33 be 200a1d4 <_Heap_Walk+0x454> 200a10c: 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)" : "") 200a110: 02 80 00 37 be 200a1ec <_Heap_Walk+0x46c> 200a114: 98 15 23 28 or %l4, 0x328, %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)( 200a118: d6 23 a0 5c st %o3, [ %sp + 0x5c ] 200a11c: d8 23 a0 64 st %o4, [ %sp + 0x64 ] 200a120: de 23 a0 60 st %o7, [ %sp + 0x60 ] 200a124: 90 10 00 19 mov %i1, %o0 200a128: 92 10 20 00 clr %o1 200a12c: 15 00 80 75 sethi %hi(0x201d400), %o2 200a130: 96 10 00 15 mov %l5, %o3 200a134: 94 12 a2 b8 or %o2, 0x2b8, %o2 200a138: 9f c5 c0 00 call %l7 200a13c: 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 ) { 200a140: da 07 40 00 ld [ %i5 ], %o5 200a144: 80 a5 80 0d cmp %l6, %o5 200a148: 12 80 00 19 bne 200a1ac <_Heap_Walk+0x42c> 200a14c: 80 a6 a0 00 cmp %i2, 0 ); return false; } if ( !prev_used ) { 200a150: 02 80 00 2d be 200a204 <_Heap_Walk+0x484> 200a154: 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; 200a158: 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 ) { 200a15c: 80 a6 00 02 cmp %i0, %g2 200a160: 02 80 00 0b be 200a18c <_Heap_Walk+0x40c> <== NEVER TAKEN 200a164: 92 10 20 01 mov 1, %o1 if ( free_block == block ) { 200a168: 80 a5 40 02 cmp %l5, %g2 200a16c: 02 bf ff bd be 200a060 <_Heap_Walk+0x2e0> 200a170: 80 a7 00 1d cmp %i4, %i5 return true; } free_block = free_block->next; 200a174: 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 ) { 200a178: 80 a6 00 02 cmp %i0, %g2 200a17c: 12 bf ff fc bne 200a16c <_Heap_Walk+0x3ec> 200a180: 80 a5 40 02 cmp %l5, %g2 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 200a184: 90 10 00 19 mov %i1, %o0 200a188: 92 10 20 01 mov 1, %o1 200a18c: 15 00 80 75 sethi %hi(0x201d400), %o2 200a190: 96 10 00 15 mov %l5, %o3 200a194: 9f c5 c0 00 call %l7 200a198: 94 12 a3 a0 or %o2, 0x3a0, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a19c: 10 bf ff 42 b 2009ea4 <_Heap_Walk+0x124> 200a1a0: 82 10 20 00 clr %g1 } block = next_block; } while ( block != first_block ); return true; 200a1a4: 10 bf ff 05 b 2009db8 <_Heap_Walk+0x38> 200a1a8: 82 10 20 01 mov 1, %g1 " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 200a1ac: fa 23 a0 5c st %i5, [ %sp + 0x5c ] 200a1b0: 90 10 00 19 mov %i1, %o0 200a1b4: 92 10 20 01 mov 1, %o1 200a1b8: 15 00 80 75 sethi %hi(0x201d400), %o2 200a1bc: 96 10 00 15 mov %l5, %o3 200a1c0: 94 12 a2 f0 or %o2, 0x2f0, %o2 200a1c4: 9f c5 c0 00 call %l7 200a1c8: 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; 200a1cc: 10 bf ff 36 b 2009ea4 <_Heap_Walk+0x124> 200a1d0: 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)( 200a1d4: 03 00 80 74 sethi %hi(0x201d000), %g1 200a1d8: 10 bf ff d0 b 200a118 <_Heap_Walk+0x398> 200a1dc: 98 10 63 80 or %g1, 0x380, %o4 ! 201d380 <__log2table+0x140> 200a1e0: 03 00 80 74 sethi %hi(0x201d000), %g1 200a1e4: 10 bf ff c7 b 200a100 <_Heap_Walk+0x380> 200a1e8: 96 10 63 60 or %g1, 0x360, %o3 ! 201d360 <__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)" : "") 200a1ec: 03 00 80 74 sethi %hi(0x201d000), %g1 200a1f0: 10 bf ff ca b 200a118 <_Heap_Walk+0x398> 200a1f4: 98 10 63 90 or %g1, 0x390, %o4 ! 201d390 <__log2table+0x150> block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 200a1f8: 17 00 80 74 sethi %hi(0x201d000), %o3 200a1fc: 10 bf ff c1 b 200a100 <_Heap_Walk+0x380> 200a200: 96 12 e3 70 or %o3, 0x370, %o3 ! 201d370 <__log2table+0x130> return false; } if ( !prev_used ) { (*printer)( 200a204: 92 10 20 01 mov 1, %o1 200a208: 15 00 80 75 sethi %hi(0x201d400), %o2 200a20c: 96 10 00 15 mov %l5, %o3 200a210: 9f c5 c0 00 call %l7 200a214: 94 12 a3 30 or %o2, 0x330, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a218: 10 bf ff 23 b 2009ea4 <_Heap_Walk+0x124> 200a21c: 82 10 20 00 clr %g1 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 200a220: 02 bf ff 9a be 200a088 <_Heap_Walk+0x308> <== NEVER TAKEN 200a224: 80 a5 40 1d cmp %l5, %i5 (*printer)( 200a228: 90 10 00 19 mov %i1, %o0 200a22c: 92 10 20 01 mov 1, %o1 200a230: 96 10 00 15 mov %l5, %o3 200a234: 15 00 80 75 sethi %hi(0x201d400), %o2 200a238: 98 10 00 16 mov %l6, %o4 200a23c: 94 12 a2 50 or %o2, 0x250, %o2 200a240: 9f c5 c0 00 call %l7 200a244: 9a 10 00 10 mov %l0, %o5 block, block_size, min_block_size ); return false; 200a248: 10 bf fe dc b 2009db8 <_Heap_Walk+0x38> 200a24c: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 200a250: 92 10 20 01 mov 1, %o1 200a254: 96 10 00 15 mov %l5, %o3 200a258: 15 00 80 75 sethi %hi(0x201d400), %o2 200a25c: 98 10 00 16 mov %l6, %o4 200a260: 9f c5 c0 00 call %l7 200a264: 94 12 a2 20 or %o2, 0x220, %o2 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 200a268: 10 bf fe d4 b 2009db8 <_Heap_Walk+0x38> 200a26c: 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; 200a270: 80 a4 c0 1d cmp %l3, %i5 200a274: 0a bf ff 43 bcs 2009f80 <_Heap_Walk+0x200> <== NEVER TAKEN 200a278: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200a27c: da 27 bf fc st %o5, [ %fp + -4 ] 200a280: 90 07 60 08 add %i5, 8, %o0 200a284: 7f ff de 3b call 2001b70 <.urem> 200a288: 92 10 00 14 mov %l4, %o1 ); return false; } if ( 200a28c: 80 a2 20 00 cmp %o0, 0 200a290: 12 80 00 36 bne 200a368 <_Heap_Walk+0x5e8> <== NEVER TAKEN 200a294: 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; 200a298: c2 07 60 04 ld [ %i5 + 4 ], %g1 200a29c: 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; 200a2a0: 82 07 40 01 add %i5, %g1, %g1 200a2a4: c2 00 60 04 ld [ %g1 + 4 ], %g1 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200a2a8: 80 88 60 01 btst 1, %g1 200a2ac: 12 80 00 27 bne 200a348 <_Heap_Walk+0x5c8> <== NEVER TAKEN 200a2b0: a4 10 00 1d mov %i5, %l2 200a2b4: 10 80 00 19 b 200a318 <_Heap_Walk+0x598> 200a2b8: 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 ) { 200a2bc: 80 a6 00 1d cmp %i0, %i5 200a2c0: 02 bf ff 37 be 2009f9c <_Heap_Walk+0x21c> 200a2c4: 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; 200a2c8: 0a bf ff 2e bcs 2009f80 <_Heap_Walk+0x200> 200a2cc: 90 10 00 19 mov %i1, %o0 200a2d0: 80 a7 40 13 cmp %i5, %l3 200a2d4: 18 bf ff 2c bgu 2009f84 <_Heap_Walk+0x204> <== NEVER TAKEN 200a2d8: 92 10 20 01 mov 1, %o1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200a2dc: da 27 bf fc st %o5, [ %fp + -4 ] 200a2e0: 90 07 60 08 add %i5, 8, %o0 200a2e4: 7f ff de 23 call 2001b70 <.urem> 200a2e8: 92 10 00 14 mov %l4, %o1 ); return false; } if ( 200a2ec: 80 a2 20 00 cmp %o0, 0 200a2f0: 12 80 00 1e bne 200a368 <_Heap_Walk+0x5e8> 200a2f4: 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; 200a2f8: de 07 60 04 ld [ %i5 + 4 ], %o7 200a2fc: 82 10 00 12 mov %l2, %g1 200a300: 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; 200a304: 9e 03 c0 1d add %o7, %i5, %o7 200a308: de 03 e0 04 ld [ %o7 + 4 ], %o7 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200a30c: 80 8b e0 01 btst 1, %o7 200a310: 12 80 00 0e bne 200a348 <_Heap_Walk+0x5c8> 200a314: a4 10 00 1d mov %i5, %l2 ); return false; } if ( free_block->prev != prev_block ) { 200a318: d8 07 60 0c ld [ %i5 + 0xc ], %o4 200a31c: 80 a3 00 01 cmp %o4, %g1 200a320: 22 bf ff e7 be,a 200a2bc <_Heap_Walk+0x53c> 200a324: fa 07 60 08 ld [ %i5 + 8 ], %i5 (*printer)( 200a328: 90 10 00 19 mov %i1, %o0 200a32c: 92 10 20 01 mov 1, %o1 200a330: 15 00 80 75 sethi %hi(0x201d400), %o2 200a334: 96 10 00 1d mov %i5, %o3 200a338: 9f c5 c0 00 call %l7 200a33c: 94 12 a1 b8 or %o2, 0x1b8, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a340: 10 bf fe d9 b 2009ea4 <_Heap_Walk+0x124> 200a344: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 200a348: 90 10 00 19 mov %i1, %o0 200a34c: 92 10 20 01 mov 1, %o1 200a350: 15 00 80 75 sethi %hi(0x201d400), %o2 200a354: 96 10 00 1d mov %i5, %o3 200a358: 9f c5 c0 00 call %l7 200a35c: 94 12 a1 98 or %o2, 0x198, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a360: 10 bf fe d1 b 2009ea4 <_Heap_Walk+0x124> 200a364: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 200a368: 90 10 00 19 mov %i1, %o0 200a36c: 92 10 20 01 mov 1, %o1 200a370: 15 00 80 75 sethi %hi(0x201d400), %o2 200a374: 96 10 00 1d mov %i5, %o3 200a378: 9f c5 c0 00 call %l7 200a37c: 94 12 a1 68 or %o2, 0x168, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a380: 10 bf fe c9 b 2009ea4 <_Heap_Walk+0x124> 200a384: 82 10 20 00 clr %g1 =============================================================================== 020083e8 <_IO_Initialize_all_drivers>: _IO_Driver_address_table[index] = driver_table[index]; } void _IO_Initialize_all_drivers( void ) { 20083e8: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 20083ec: 39 00 80 7b sethi %hi(0x201ec00), %i4 20083f0: c2 07 20 88 ld [ %i4 + 0x88 ], %g1 ! 201ec88 <_IO_Number_of_drivers> 20083f4: ba 10 20 00 clr %i5 20083f8: 80 a0 60 00 cmp %g1, 0 20083fc: 02 80 00 0b be 2008428 <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN 2008400: b8 17 20 88 or %i4, 0x88, %i4 (void) rtems_io_initialize( major, 0, NULL ); 2008404: 90 10 00 1d mov %i5, %o0 2008408: 92 10 20 00 clr %o1 200840c: 40 00 16 27 call 200dca8 2008410: 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 ++ ) 2008414: c2 07 00 00 ld [ %i4 ], %g1 2008418: ba 07 60 01 inc %i5 200841c: 80 a0 40 1d cmp %g1, %i5 2008420: 18 bf ff fa bgu 2008408 <_IO_Initialize_all_drivers+0x20> 2008424: 90 10 00 1d mov %i5, %o0 2008428: 81 c7 e0 08 ret 200842c: 81 e8 00 00 restore =============================================================================== 02008318 <_IO_Manager_initialization>: #include #include void _IO_Manager_initialization(void) { 2008318: 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(); 200831c: 03 00 80 6d sethi %hi(0x201b400), %g1 2008320: 82 10 60 c8 or %g1, 0xc8, %g1 ! 201b4c8 drivers_in_table = rtems_configuration_get_number_of_device_drivers(); 2008324: f8 00 60 38 ld [ %g1 + 0x38 ], %i4 number_of_drivers = rtems_configuration_get_maximum_drivers(); 2008328: 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 ) 200832c: 80 a7 00 1b cmp %i4, %i3 2008330: 0a 80 00 08 bcs 2008350 <_IO_Manager_initialization+0x38> 2008334: 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; 2008338: 03 00 80 7b sethi %hi(0x201ec00), %g1 200833c: fa 20 60 8c st %i5, [ %g1 + 0x8c ] ! 201ec8c <_IO_Driver_address_table> _IO_Number_of_drivers = number_of_drivers; 2008340: 03 00 80 7b sethi %hi(0x201ec00), %g1 2008344: f8 20 60 88 st %i4, [ %g1 + 0x88 ] ! 201ec88 <_IO_Number_of_drivers> return; 2008348: 81 c7 e0 08 ret 200834c: 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 ) 2008350: 83 2e e0 03 sll %i3, 3, %g1 2008354: b5 2e e0 05 sll %i3, 5, %i2 2008358: 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( 200835c: 40 00 0d 7c call 200b94c <_Workspace_Allocate_or_fatal_error> 2008360: 90 10 00 1a mov %i2, %o0 sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 2008364: 03 00 80 7b sethi %hi(0x201ec00), %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 *) 2008368: 33 00 80 7b sethi %hi(0x201ec00), %i1 _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 200836c: f6 20 60 88 st %i3, [ %g1 + 0x88 ] /* * 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 *) 2008370: d0 26 60 8c st %o0, [ %i1 + 0x8c ] _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; memset( 2008374: 92 10 20 00 clr %o1 2008378: 40 00 22 a6 call 2010e10 200837c: 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++ ) 2008380: 80 a7 20 00 cmp %i4, 0 2008384: 02 bf ff f1 be 2008348 <_IO_Manager_initialization+0x30> <== NEVER TAKEN 2008388: c8 06 60 8c ld [ %i1 + 0x8c ], %g4 #include #include #include void _IO_Manager_initialization(void) 200838c: 85 2f 20 03 sll %i4, 3, %g2 2008390: b7 2f 20 05 sll %i4, 5, %i3 2008394: 82 10 20 00 clr %g1 2008398: 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]; 200839c: c4 07 40 01 ld [ %i5 + %g1 ], %g2 20083a0: 86 07 40 01 add %i5, %g1, %g3 20083a4: c4 21 00 01 st %g2, [ %g4 + %g1 ] 20083a8: f8 00 e0 04 ld [ %g3 + 4 ], %i4 20083ac: 84 01 00 01 add %g4, %g1, %g2 20083b0: f8 20 a0 04 st %i4, [ %g2 + 4 ] 20083b4: f8 00 e0 08 ld [ %g3 + 8 ], %i4 20083b8: 82 00 60 18 add %g1, 0x18, %g1 20083bc: f8 20 a0 08 st %i4, [ %g2 + 8 ] 20083c0: 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++ ) 20083c4: 80 a0 40 1b cmp %g1, %i3 _IO_Driver_address_table[index] = driver_table[index]; 20083c8: f8 20 a0 0c st %i4, [ %g2 + 0xc ] 20083cc: f8 00 e0 10 ld [ %g3 + 0x10 ], %i4 20083d0: f8 20 a0 10 st %i4, [ %g2 + 0x10 ] 20083d4: 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++ ) 20083d8: 12 bf ff f1 bne 200839c <_IO_Manager_initialization+0x84> 20083dc: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] 20083e0: 81 c7 e0 08 ret 20083e4: 81 e8 00 00 restore =============================================================================== 020090e0 <_Internal_error_Occurred>: void _Internal_error_Occurred( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 20090e0: 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 ); 20090e4: 13 00 80 2c sethi %hi(0x200b000), %o1 20090e8: 90 07 bf f4 add %fp, -12, %o0 20090ec: 92 12 63 84 or %o1, 0x384, %o1 Internal_errors_Source source, bool is_internal, Internal_errors_t error ) { User_extensions_Fatal_context ctx = { source, is_internal, error }; 20090f0: f0 27 bf f4 st %i0, [ %fp + -12 ] 20090f4: f2 2f bf f8 stb %i1, [ %fp + -8 ] _User_extensions_Iterate( &ctx, _User_extensions_Fatal_visitor ); 20090f8: 40 00 08 ae call 200b3b0 <_User_extensions_Iterate> 20090fc: 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; 2009100: 05 00 80 7a sethi %hi(0x201e800), %g2 <== NOT EXECUTED 2009104: 82 10 a0 2c or %g2, 0x2c, %g1 ! 201e82c <_Internal_errors_What_happened><== NOT EXECUTED 2009108: f0 20 a0 2c st %i0, [ %g2 + 0x2c ] <== NOT EXECUTED _Internal_errors_What_happened.is_internal = is_internal; 200910c: f2 28 60 04 stb %i1, [ %g1 + 4 ] <== NOT EXECUTED _Internal_errors_What_happened.the_error = the_error; 2009110: 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; 2009114: 84 10 20 05 mov 5, %g2 <== NOT EXECUTED 2009118: 03 00 80 7a sethi %hi(0x201e800), %g1 <== NOT EXECUTED _System_state_Set( SYSTEM_STATE_FAILED ); _CPU_Fatal_halt( the_error ); 200911c: 7f ff e5 3c call 200260c <== NOT EXECUTED 2009120: c4 20 60 38 st %g2, [ %g1 + 0x38 ] ! 201e838 <_System_state_Current><== NOT EXECUTED 2009124: 82 10 00 08 mov %o0, %g1 <== NOT EXECUTED 2009128: 30 80 00 00 b,a 2009128 <_Internal_error_Occurred+0x48> <== NOT EXECUTED =============================================================================== 02009198 <_Objects_Allocate>: #endif Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2009198: 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 ) 200919c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 20091a0: 80 a0 60 00 cmp %g1, 0 20091a4: 02 80 00 26 be 200923c <_Objects_Allocate+0xa4> <== NEVER TAKEN 20091a8: 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 ); 20091ac: b8 06 20 20 add %i0, 0x20, %i4 20091b0: 7f ff fd 4c call 20086e0 <_Chain_Get> 20091b4: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 20091b8: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 20091bc: 80 a0 60 00 cmp %g1, 0 20091c0: 02 80 00 16 be 2009218 <_Objects_Allocate+0x80> 20091c4: 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 ) { 20091c8: 80 a2 20 00 cmp %o0, 0 20091cc: 02 80 00 15 be 2009220 <_Objects_Allocate+0x88> 20091d0: 01 00 00 00 nop } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 20091d4: c4 07 60 08 ld [ %i5 + 8 ], %g2 20091d8: d0 06 20 08 ld [ %i0 + 8 ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 20091dc: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 20091e0: 03 00 00 3f sethi %hi(0xfc00), %g1 20091e4: 82 10 63 ff or %g1, 0x3ff, %g1 ! ffff 20091e8: 90 0a 00 01 and %o0, %g1, %o0 20091ec: 82 08 80 01 and %g2, %g1, %g1 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 20091f0: 40 00 3f f7 call 20191cc <.udiv> 20091f4: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 20091f8: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 20091fc: 91 2a 20 02 sll %o0, 2, %o0 2009200: c6 00 40 08 ld [ %g1 + %o0 ], %g3 information->inactive--; 2009204: 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 ]--; 2009208: 86 00 ff ff add %g3, -1, %g3 200920c: c6 20 40 08 st %g3, [ %g1 + %o0 ] information->inactive--; 2009210: 82 00 bf ff add %g2, -1, %g1 2009214: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 2009218: 81 c7 e0 08 ret 200921c: 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 ); 2009220: 40 00 00 10 call 2009260 <_Objects_Extend_information> 2009224: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 2009228: 7f ff fd 2e call 20086e0 <_Chain_Get> 200922c: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 2009230: b0 92 20 00 orcc %o0, 0, %i0 2009234: 32 bf ff e9 bne,a 20091d8 <_Objects_Allocate+0x40> 2009238: 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; 200923c: 81 c7 e0 08 ret 2009240: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 02009260 <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 2009260: 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 ) 2009264: 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 ); 2009268: e0 16 20 0a lduh [ %i0 + 0xa ], %l0 index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 200926c: 80 a6 60 00 cmp %i1, 0 2009270: 02 80 00 a1 be 20094f4 <_Objects_Extend_information+0x294> 2009274: e2 16 20 10 lduh [ %i0 + 0x10 ], %l1 block_count = 0; else { block_count = information->maximum / information->allocation_size; 2009278: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3 200927c: a3 2c 60 10 sll %l1, 0x10, %l1 2009280: 92 10 00 1b mov %i3, %o1 2009284: 40 00 3f d2 call 20191cc <.udiv> 2009288: 91 34 60 10 srl %l1, 0x10, %o0 200928c: 91 2a 20 10 sll %o0, 0x10, %o0 2009290: b5 32 20 10 srl %o0, 0x10, %i2 for ( ; block < block_count; block++ ) { 2009294: 80 a6 a0 00 cmp %i2, 0 2009298: 02 80 00 af be 2009554 <_Objects_Extend_information+0x2f4><== NEVER TAKEN 200929c: 90 10 00 1b mov %i3, %o0 if ( information->object_blocks[ block ] == NULL ) { 20092a0: c2 06 40 00 ld [ %i1 ], %g1 20092a4: 80 a0 60 00 cmp %g1, 0 20092a8: 02 80 00 b1 be 200956c <_Objects_Extend_information+0x30c><== NEVER TAKEN 20092ac: 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; 20092b0: 10 80 00 06 b 20092c8 <_Objects_Extend_information+0x68> 20092b4: 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 ) { 20092b8: c2 06 40 01 ld [ %i1 + %g1 ], %g1 20092bc: 80 a0 60 00 cmp %g1, 0 20092c0: 22 80 00 08 be,a 20092e0 <_Objects_Extend_information+0x80> 20092c4: 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++ ) { 20092c8: ba 07 60 01 inc %i5 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 20092cc: 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++ ) { 20092d0: 80 a6 80 1d cmp %i2, %i5 20092d4: 18 bf ff f9 bgu 20092b8 <_Objects_Extend_information+0x58> 20092d8: 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; 20092dc: b6 10 20 01 mov 1, %i3 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 20092e0: 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 ) { 20092e4: 03 00 00 3f sethi %hi(0xfc00), %g1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 20092e8: 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 ) { 20092ec: 82 10 63 ff or %g1, 0x3ff, %g1 20092f0: 80 a6 40 01 cmp %i1, %g1 20092f4: 18 80 00 9c bgu 2009564 <_Objects_Extend_information+0x304> 20092f8: 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; 20092fc: 40 00 3f 7a call 20190e4 <.umul> 2009300: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 2009304: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 2009308: 80 a0 60 00 cmp %g1, 0 200930c: 02 80 00 6d be 20094c0 <_Objects_Extend_information+0x260> 2009310: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 2009314: 40 00 09 80 call 200b914 <_Workspace_Allocate> 2009318: 01 00 00 00 nop if ( !new_object_block ) 200931c: a2 92 20 00 orcc %o0, 0, %l1 2009320: 02 80 00 91 be 2009564 <_Objects_Extend_information+0x304> 2009324: 01 00 00 00 nop } /* * Do we need to grow the tables? */ if ( do_extend ) { 2009328: 80 8e e0 ff btst 0xff, %i3 200932c: 22 80 00 42 be,a 2009434 <_Objects_Extend_information+0x1d4> 2009330: 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 ) { 2009334: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 */ /* * Up the block count and maximum */ block_count++; 2009338: 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 ) { 200933c: 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 *)) + 2009340: 91 2e e0 01 sll %i3, 1, %o0 2009344: 90 02 00 1b add %o0, %i3, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); 2009348: 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 *)) + 200934c: 90 02 00 10 add %o0, %l0, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); if ( information->auto_extend ) { 2009350: 12 80 00 60 bne 20094d0 <_Objects_Extend_information+0x270> 2009354: 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 ); 2009358: 40 00 09 7d call 200b94c <_Workspace_Allocate_or_fatal_error> 200935c: 01 00 00 00 nop 2009360: 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 ) { 2009364: 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*) ); 2009368: 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 ) { 200936c: 80 a4 00 01 cmp %l0, %g1 2009370: a6 04 80 1b add %l2, %i3, %l3 2009374: 0a 80 00 67 bcs 2009510 <_Objects_Extend_information+0x2b0> 2009378: b6 04 c0 1b add %l3, %i3, %i3 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 200937c: 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++ ) { 2009380: 80 a4 20 00 cmp %l0, 0 2009384: 02 80 00 07 be 20093a0 <_Objects_Extend_information+0x140><== NEVER TAKEN 2009388: 82 10 20 00 clr %g1 local_table[ index ] = NULL; 200938c: c0 20 40 1b clr [ %g1 + %i3 ] 2009390: 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++ ) { 2009394: 80 a0 40 02 cmp %g1, %g2 2009398: 32 bf ff fe bne,a 2009390 <_Objects_Extend_information+0x130><== NEVER TAKEN 200939c: c0 20 40 1b clr [ %g1 + %i3 ] <== NOT EXECUTED 20093a0: 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 ); 20093a4: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 20093a8: c0 24 80 1a clr [ %l2 + %i2 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 20093ac: 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 ; 20093b0: 80 a7 00 01 cmp %i4, %g1 20093b4: 1a 80 00 0b bcc 20093e0 <_Objects_Extend_information+0x180><== NEVER TAKEN 20093b8: c0 24 c0 1a clr [ %l3 + %i2 ] * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 20093bc: 85 2f 20 02 sll %i4, 2, %g2 20093c0: 87 28 e0 02 sll %g3, 2, %g3 20093c4: 84 06 c0 02 add %i3, %g2, %g2 20093c8: 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; 20093cc: c0 20 80 01 clr [ %g2 + %g1 ] 20093d0: 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 ; 20093d4: 80 a0 40 03 cmp %g1, %g3 20093d8: 32 bf ff fe bne,a 20093d0 <_Objects_Extend_information+0x170> 20093dc: c0 20 80 01 clr [ %g2 + %g1 ] index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 20093e0: 7f ff e4 8b call 200260c 20093e4: 01 00 00 00 nop uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 20093e8: 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( 20093ec: c4 16 20 04 lduh [ %i0 + 4 ], %g2 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 20093f0: 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; 20093f4: f2 36 20 10 sth %i1, [ %i0 + 0x10 ] 20093f8: 87 28 e0 18 sll %g3, 0x18, %g3 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 20093fc: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 2009400: e4 26 20 34 st %l2, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; 2009404: e6 26 20 30 st %l3, [ %i0 + 0x30 ] information->local_table = local_table; 2009408: 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) | 200940c: 03 00 00 40 sethi %hi(0x10000), %g1 2009410: 82 10 c0 01 or %g3, %g1, %g1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2009414: 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) | 2009418: b2 10 40 19 or %g1, %i1, %i1 information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 200941c: f2 26 20 0c st %i1, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 2009420: 7f ff e4 7f call 200261c 2009424: 01 00 00 00 nop _Workspace_Free( old_tables ); 2009428: 40 00 09 43 call 200b934 <_Workspace_Free> 200942c: 90 10 00 1a mov %i2, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 2009430: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 2009434: bb 2f 60 02 sll %i5, 2, %i5 2009438: e2 20 40 1d st %l1, [ %g1 + %i5 ] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 200943c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 2009440: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 2009444: d2 00 40 1d ld [ %g1 + %i5 ], %o1 2009448: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 200944c: 90 07 bf f4 add %fp, -12, %o0 2009450: 7f ff fc b4 call 2008720 <_Chain_Initialize> 2009454: 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 ) { 2009458: 10 80 00 0d b 200948c <_Objects_Extend_information+0x22c> 200945c: b6 06 20 20 add %i0, 0x20, %i3 the_object->id = _Objects_Build_id( 2009460: c6 16 20 04 lduh [ %i0 + 4 ], %g3 2009464: 85 28 a0 18 sll %g2, 0x18, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2009468: 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) | 200946c: 84 10 80 1a or %g2, %i2, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2009470: 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) | 2009474: 84 10 80 1c or %g2, %i4, %g2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2009478: 90 10 00 1b mov %i3, %o0 200947c: 92 10 00 01 mov %g1, %o1 index++; 2009480: b8 07 20 01 inc %i4 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2009484: 7f ff fc 8c call 20086b4 <_Chain_Append> 2009488: 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 ) { 200948c: 7f ff fc 95 call 20086e0 <_Chain_Get> 2009490: 90 07 bf f4 add %fp, -12, %o0 2009494: 82 92 20 00 orcc %o0, 0, %g1 2009498: 32 bf ff f2 bne,a 2009460 <_Objects_Extend_information+0x200> 200949c: c4 06 00 00 ld [ %i0 ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 20094a0: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 20094a4: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 20094a8: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 20094ac: c8 20 c0 1d st %g4, [ %g3 + %i5 ] information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 20094b0: 82 00 80 04 add %g2, %g4, %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 20094b4: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 20094b8: 81 c7 e0 08 ret 20094bc: 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 ); 20094c0: 40 00 09 23 call 200b94c <_Workspace_Allocate_or_fatal_error> 20094c4: 01 00 00 00 nop 20094c8: 10 bf ff 98 b 2009328 <_Objects_Extend_information+0xc8> 20094cc: 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 ); 20094d0: 40 00 09 11 call 200b914 <_Workspace_Allocate> 20094d4: 01 00 00 00 nop if ( !object_blocks ) { 20094d8: a4 92 20 00 orcc %o0, 0, %l2 20094dc: 32 bf ff a3 bne,a 2009368 <_Objects_Extend_information+0x108> 20094e0: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 _Workspace_Free( new_object_block ); 20094e4: 40 00 09 14 call 200b934 <_Workspace_Free> 20094e8: 90 10 00 11 mov %l1, %o0 20094ec: 81 c7 e0 08 ret 20094f0: 81 e8 00 00 restore 20094f4: 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 ); 20094f8: 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; 20094fc: b6 10 20 01 mov 1, %i3 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2009500: ba 10 20 00 clr %i5 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 2009504: b4 10 20 00 clr %i2 2009508: 10 bf ff 76 b 20092e0 <_Objects_Extend_information+0x80> 200950c: 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, 2009510: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 2009514: 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, 2009518: 90 10 00 12 mov %l2, %o0 200951c: 40 00 1e 00 call 2010d1c 2009520: 94 10 00 1a mov %i2, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 2009524: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 2009528: 94 10 00 1a mov %i2, %o2 200952c: 40 00 1d fc call 2010d1c 2009530: 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 *) ); 2009534: 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, 2009538: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 200953c: 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, 2009540: 90 10 00 1b mov %i3, %o0 2009544: 40 00 1d f6 call 2010d1c 2009548: 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 ); 200954c: 10 bf ff 97 b 20093a8 <_Objects_Extend_information+0x148> 2009550: 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 ); 2009554: 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; 2009558: b6 10 20 01 mov 1, %i3 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 200955c: 10 bf ff 61 b 20092e0 <_Objects_Extend_information+0x80> <== NOT EXECUTED 2009560: ba 10 20 00 clr %i5 <== NOT EXECUTED 2009564: 81 c7 e0 08 ret 2009568: 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; 200956c: 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; 2009570: 10 bf ff 5c b 20092e0 <_Objects_Extend_information+0x80> <== NOT EXECUTED 2009574: ba 10 20 00 clr %i5 <== NOT EXECUTED =============================================================================== 02009628 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 2009628: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 200962c: 80 a6 60 00 cmp %i1, 0 2009630: 02 80 00 19 be 2009694 <_Objects_Get_information+0x6c> 2009634: 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 ); 2009638: 40 00 13 83 call 200e444 <_Objects_API_maximum_class> 200963c: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 2009640: 80 a2 20 00 cmp %o0, 0 2009644: 02 80 00 14 be 2009694 <_Objects_Get_information+0x6c> 2009648: 80 a2 00 19 cmp %o0, %i1 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 200964c: 0a 80 00 12 bcs 2009694 <_Objects_Get_information+0x6c> 2009650: 03 00 80 78 sethi %hi(0x201e000), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 2009654: b1 2e 20 02 sll %i0, 2, %i0 2009658: 82 10 62 84 or %g1, 0x284, %g1 200965c: c2 00 40 18 ld [ %g1 + %i0 ], %g1 2009660: 80 a0 60 00 cmp %g1, 0 2009664: 02 80 00 0c be 2009694 <_Objects_Get_information+0x6c> <== NEVER TAKEN 2009668: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 200966c: f0 00 40 19 ld [ %g1 + %i1 ], %i0 if ( !info ) 2009670: 80 a6 20 00 cmp %i0, 0 2009674: 02 80 00 08 be 2009694 <_Objects_Get_information+0x6c> <== NEVER TAKEN 2009678: 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 ) 200967c: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2009680: 80 a0 60 00 cmp %g1, 0 2009684: 02 80 00 04 be 2009694 <_Objects_Get_information+0x6c> 2009688: 01 00 00 00 nop return NULL; #endif return info; } 200968c: 81 c7 e0 08 ret 2009690: 81 e8 00 00 restore { Objects_Information *info; int the_class_api_maximum; if ( !the_class ) return NULL; 2009694: 81 c7 e0 08 ret 2009698: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 02017d90 <_Objects_Get_name_as_string>: char *_Objects_Get_name_as_string( Objects_Id id, size_t length, char *name ) { 2017d90: 9d e3 bf 90 save %sp, -112, %sp char lname[5]; Objects_Control *the_object; Objects_Locations location; Objects_Id tmpId; if ( length == 0 ) 2017d94: 80 a6 60 00 cmp %i1, 0 2017d98: 02 80 00 11 be 2017ddc <_Objects_Get_name_as_string+0x4c> 2017d9c: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( name == NULL ) 2017da0: 02 80 00 0f be 2017ddc <_Objects_Get_name_as_string+0x4c> 2017da4: ba 96 20 00 orcc %i0, 0, %i5 return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 2017da8: 02 80 00 3d be 2017e9c <_Objects_Get_name_as_string+0x10c> 2017dac: 03 00 80 c6 sethi %hi(0x2031800), %g1 information = _Objects_Get_information_id( tmpId ); 2017db0: 7f ff df e4 call 200fd40 <_Objects_Get_information_id> 2017db4: 90 10 00 1d mov %i5, %o0 if ( !information ) 2017db8: b8 92 20 00 orcc %o0, 0, %i4 2017dbc: 02 80 00 08 be 2017ddc <_Objects_Get_name_as_string+0x4c> 2017dc0: 92 10 00 1d mov %i5, %o1 return NULL; the_object = _Objects_Get( information, tmpId, &location ); 2017dc4: 7f ff e0 1f call 200fe40 <_Objects_Get> 2017dc8: 94 07 bf f4 add %fp, -12, %o2 switch ( location ) { 2017dcc: c2 07 bf f4 ld [ %fp + -12 ], %g1 2017dd0: 80 a0 60 00 cmp %g1, 0 2017dd4: 22 80 00 05 be,a 2017de8 <_Objects_Get_name_as_string+0x58> 2017dd8: c2 0f 20 38 ldub [ %i4 + 0x38 ], %g1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* not supported */ #endif case OBJECTS_ERROR: return NULL; 2017ddc: b4 10 20 00 clr %i2 _Thread_Enable_dispatch(); return name; } return NULL; /* unreachable path */ } 2017de0: 81 c7 e0 08 ret 2017de4: 91 e8 00 1a restore %g0, %i2, %o0 return NULL; case OBJECTS_LOCAL: #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) { 2017de8: 80 a0 60 00 cmp %g1, 0 2017dec: 12 80 00 2f bne 2017ea8 <_Objects_Get_name_as_string+0x118> 2017df0: c2 02 20 0c ld [ %o0 + 0xc ], %g1 } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 2017df4: 89 30 60 18 srl %g1, 0x18, %g4 lname[ 1 ] = (u32_name >> 16) & 0xff; 2017df8: 87 30 60 10 srl %g1, 0x10, %g3 lname[ 2 ] = (u32_name >> 8) & 0xff; 2017dfc: 85 30 60 08 srl %g1, 8, %g2 lname[ 3 ] = (u32_name >> 0) & 0xff; 2017e00: c2 2f bf fb stb %g1, [ %fp + -5 ] lname[ 4 ] = '\0'; 2017e04: 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; 2017e08: c8 2f bf f8 stb %g4, [ %fp + -8 ] lname[ 1 ] = (u32_name >> 16) & 0xff; 2017e0c: c6 2f bf f9 stb %g3, [ %fp + -7 ] lname[ 2 ] = (u32_name >> 8) & 0xff; 2017e10: c4 2f bf fa stb %g2, [ %fp + -6 ] lname[ 3 ] = (u32_name >> 0) & 0xff; lname[ 4 ] = '\0'; s = lname; 2017e14: 82 07 bf f8 add %fp, -8, %g1 } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2017e18: 80 a6 60 01 cmp %i1, 1 2017e1c: 02 80 00 27 be 2017eb8 <_Objects_Get_name_as_string+0x128><== NEVER TAKEN 2017e20: 86 10 00 1a mov %i2, %g3 2017e24: c6 48 40 00 ldsb [ %g1 ], %g3 2017e28: 80 a0 e0 00 cmp %g3, 0 2017e2c: 02 80 00 22 be 2017eb4 <_Objects_Get_name_as_string+0x124> 2017e30: c4 08 40 00 ldub [ %g1 ], %g2 * This method objects the name of an object and returns its name * in the form of a C string. It attempts to be careful about * overflowing the user's string and about returning unprintable characters. */ char *_Objects_Get_name_as_string( 2017e34: b6 06 7f ff add %i1, -1, %i3 2017e38: 39 00 80 c1 sethi %hi(0x2030400), %i4 2017e3c: b6 00 40 1b add %g1, %i3, %i3 2017e40: 86 10 00 1a mov %i2, %g3 2017e44: 10 80 00 06 b 2017e5c <_Objects_Get_name_as_string+0xcc> 2017e48: b8 17 21 c0 or %i4, 0x1c0, %i4 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2017e4c: c8 48 40 00 ldsb [ %g1 ], %g4 2017e50: 80 a1 20 00 cmp %g4, 0 2017e54: 02 80 00 0e be 2017e8c <_Objects_Get_name_as_string+0xfc> 2017e58: c4 08 40 00 ldub [ %g1 ], %g2 *d = (isprint((unsigned char)*s)) ? *s : '*'; 2017e5c: fa 07 00 00 ld [ %i4 ], %i5 2017e60: 88 08 a0 ff and %g2, 0xff, %g4 2017e64: 88 07 40 04 add %i5, %g4, %g4 2017e68: c8 49 20 01 ldsb [ %g4 + 1 ], %g4 2017e6c: 80 89 20 97 btst 0x97, %g4 2017e70: 12 80 00 03 bne 2017e7c <_Objects_Get_name_as_string+0xec> 2017e74: 82 00 60 01 inc %g1 2017e78: 84 10 20 2a mov 0x2a, %g2 2017e7c: c4 28 c0 00 stb %g2, [ %g3 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2017e80: 80 a0 40 1b cmp %g1, %i3 2017e84: 12 bf ff f2 bne 2017e4c <_Objects_Get_name_as_string+0xbc> 2017e88: 86 00 e0 01 inc %g3 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 2017e8c: 7f ff e4 30 call 2010f4c <_Thread_Enable_dispatch> 2017e90: c0 28 c0 00 clrb [ %g3 ] return name; } return NULL; /* unreachable path */ } 2017e94: 81 c7 e0 08 ret 2017e98: 91 e8 00 1a restore %g0, %i2, %o0 return NULL; if ( name == NULL ) return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 2017e9c: c2 00 63 b0 ld [ %g1 + 0x3b0 ], %g1 2017ea0: 10 bf ff c4 b 2017db0 <_Objects_Get_name_as_string+0x20> 2017ea4: fa 00 60 08 ld [ %g1 + 8 ], %i5 lname[ 4 ] = '\0'; s = lname; } d = name; if ( s ) { 2017ea8: 80 a0 60 00 cmp %g1, 0 2017eac: 12 bf ff dc bne 2017e1c <_Objects_Get_name_as_string+0x8c> 2017eb0: 80 a6 60 01 cmp %i1, 1 for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { *d = (isprint((unsigned char)*s)) ? *s : '*'; 2017eb4: 86 10 00 1a mov %i2, %g3 } } *d = '\0'; _Thread_Enable_dispatch(); 2017eb8: 7f ff e4 25 call 2010f4c <_Thread_Enable_dispatch> 2017ebc: c0 28 c0 00 clrb [ %g3 ] 2017ec0: 30 bf ff f5 b,a 2017e94 <_Objects_Get_name_as_string+0x104> =============================================================================== 0201aac4 <_Objects_Get_next>: Objects_Information *information, Objects_Id id, Objects_Locations *location_p, Objects_Id *next_id_p ) { 201aac4: 9d e3 bf a0 save %sp, -96, %sp Objects_Control *object; Objects_Id next_id; if ( !information ) 201aac8: 80 a6 20 00 cmp %i0, 0 201aacc: 02 80 00 29 be 201ab70 <_Objects_Get_next+0xac> 201aad0: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( !location_p ) 201aad4: 02 80 00 27 be 201ab70 <_Objects_Get_next+0xac> 201aad8: 80 a6 e0 00 cmp %i3, 0 return NULL; if ( !next_id_p ) 201aadc: 02 80 00 25 be 201ab70 <_Objects_Get_next+0xac> 201aae0: 83 2e 60 10 sll %i1, 0x10, %g1 return NULL; if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX) 201aae4: 80 a0 60 00 cmp %g1, 0 201aae8: 22 80 00 13 be,a 201ab34 <_Objects_Get_next+0x70> 201aaec: 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) 201aaf0: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2 201aaf4: 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); 201aaf8: 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) 201aafc: 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); 201ab00: 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) 201ab04: 80 a0 80 01 cmp %g2, %g1 201ab08: 0a 80 00 13 bcs 201ab54 <_Objects_Get_next+0x90> 201ab0c: 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); 201ab10: 7f ff d4 cc call 200fe40 <_Objects_Get> 201ab14: b2 06 60 01 inc %i1 next_id++; } while (*location_p != OBJECTS_LOCAL); 201ab18: c2 06 80 00 ld [ %i2 ], %g1 201ab1c: 80 a0 60 00 cmp %g1, 0 201ab20: 32 bf ff f5 bne,a 201aaf4 <_Objects_Get_next+0x30> 201ab24: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2 *next_id_p = next_id; 201ab28: f2 26 c0 00 st %i1, [ %i3 ] return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; } 201ab2c: 81 c7 e0 08 ret 201ab30: 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) 201ab34: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2 201ab38: 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); 201ab3c: 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) 201ab40: 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); 201ab44: 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) 201ab48: 80 a0 80 01 cmp %g2, %g1 201ab4c: 1a bf ff f1 bcc 201ab10 <_Objects_Get_next+0x4c> <== ALWAYS TAKEN 201ab50: 94 10 00 1a mov %i2, %o2 { *location_p = OBJECTS_ERROR; 201ab54: 82 10 20 01 mov 1, %g1 201ab58: c2 26 80 00 st %g1, [ %i2 ] *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; 201ab5c: 90 10 20 00 clr %o0 *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; 201ab60: 82 10 3f ff mov -1, %g1 201ab64: c2 26 c0 00 st %g1, [ %i3 ] return 0; } 201ab68: 81 c7 e0 08 ret 201ab6c: 91 e8 00 08 restore %g0, %o0, %o0 { Objects_Control *object; Objects_Id next_id; if ( !information ) return NULL; 201ab70: 10 bf ff ef b 201ab2c <_Objects_Get_next+0x68> 201ab74: 90 10 20 00 clr %o0 =============================================================================== 0201ac10 <_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; 201ac10: c4 02 20 08 ld [ %o0 + 8 ], %g2 if ( information->maximum >= index ) { 201ac14: 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; 201ac18: 92 22 40 02 sub %o1, %g2, %o1 201ac1c: 92 02 60 01 inc %o1 if ( information->maximum >= index ) { 201ac20: 80 a2 40 01 cmp %o1, %g1 201ac24: 18 80 00 09 bgu 201ac48 <_Objects_Get_no_protection+0x38> 201ac28: 93 2a 60 02 sll %o1, 2, %o1 if ( (the_object = information->local_table[ index ]) != NULL ) { 201ac2c: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 201ac30: d0 00 40 09 ld [ %g1 + %o1 ], %o0 201ac34: 80 a2 20 00 cmp %o0, 0 201ac38: 02 80 00 05 be 201ac4c <_Objects_Get_no_protection+0x3c> <== NEVER TAKEN 201ac3c: 82 10 20 01 mov 1, %g1 *location = OBJECTS_LOCAL; return the_object; 201ac40: 81 c3 e0 08 retl 201ac44: 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; 201ac48: 82 10 20 01 mov 1, %g1 return NULL; 201ac4c: 90 10 20 00 clr %o0 } 201ac50: 81 c3 e0 08 retl 201ac54: c2 22 80 00 st %g1, [ %o2 ] =============================================================================== 0200feb4 <_Objects_Id_to_name>: Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 200feb4: 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; 200feb8: 80 a6 20 00 cmp %i0, 0 200febc: 12 80 00 06 bne 200fed4 <_Objects_Id_to_name+0x20> 200fec0: 83 36 20 18 srl %i0, 0x18, %g1 200fec4: 03 00 80 c6 sethi %hi(0x2031800), %g1 200fec8: c2 00 63 b0 ld [ %g1 + 0x3b0 ], %g1 ! 2031bb0 <_Per_CPU_Information+0x10> 200fecc: f0 00 60 08 ld [ %g1 + 8 ], %i0 200fed0: 83 36 20 18 srl %i0, 0x18, %g1 200fed4: 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 ) 200fed8: 84 00 7f ff add %g1, -1, %g2 200fedc: 80 a0 a0 02 cmp %g2, 2 200fee0: 18 80 00 11 bgu 200ff24 <_Objects_Id_to_name+0x70> 200fee4: 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 ] ) 200fee8: 05 00 80 c5 sethi %hi(0x2031400), %g2 200feec: 84 10 a1 a4 or %g2, 0x1a4, %g2 ! 20315a4 <_Objects_Information_table> 200fef0: c2 00 80 01 ld [ %g2 + %g1 ], %g1 200fef4: 80 a0 60 00 cmp %g1, 0 200fef8: 02 80 00 0b be 200ff24 <_Objects_Id_to_name+0x70> 200fefc: 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 ]; 200ff00: 85 28 a0 02 sll %g2, 2, %g2 200ff04: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 200ff08: 80 a2 20 00 cmp %o0, 0 200ff0c: 02 80 00 06 be 200ff24 <_Objects_Id_to_name+0x70> <== NEVER TAKEN 200ff10: 01 00 00 00 nop return OBJECTS_INVALID_ID; #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) 200ff14: c2 0a 20 38 ldub [ %o0 + 0x38 ], %g1 200ff18: 80 a0 60 00 cmp %g1, 0 200ff1c: 02 80 00 04 be 200ff2c <_Objects_Id_to_name+0x78> <== ALWAYS TAKEN 200ff20: 92 10 00 18 mov %i0, %o1 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; 200ff24: 81 c7 e0 08 ret 200ff28: 91 e8 20 03 restore %g0, 3, %o0 #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 ); 200ff2c: 7f ff ff c5 call 200fe40 <_Objects_Get> 200ff30: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 200ff34: 80 a2 20 00 cmp %o0, 0 200ff38: 02 bf ff fb be 200ff24 <_Objects_Id_to_name+0x70> 200ff3c: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 200ff40: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 200ff44: 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(); 200ff48: 40 00 04 01 call 2010f4c <_Thread_Enable_dispatch> 200ff4c: c2 26 40 00 st %g1, [ %i1 ] 200ff50: 81 c7 e0 08 ret 200ff54: 81 e8 00 00 restore =============================================================================== 02009938 <_Objects_Shrink_information>: #include void _Objects_Shrink_information( Objects_Information *information ) { 2009938: 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 ); 200993c: f8 16 20 0a lduh [ %i0 + 0xa ], %i4 block_count = (information->maximum - index_base) / 2009940: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3 2009944: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 2009948: 92 10 00 1b mov %i3, %o1 200994c: 40 00 3e 20 call 20191cc <.udiv> 2009950: 90 22 00 1c sub %o0, %i4, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2009954: 80 a2 20 00 cmp %o0, 0 2009958: 02 80 00 36 be 2009a30 <_Objects_Shrink_information+0xf8> <== NEVER TAKEN 200995c: 01 00 00 00 nop if ( information->inactive_per_block[ block ] == 2009960: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 2009964: c2 01 00 00 ld [ %g4 ], %g1 2009968: 80 a6 c0 01 cmp %i3, %g1 200996c: 02 80 00 0f be 20099a8 <_Objects_Shrink_information+0x70> <== NEVER TAKEN 2009970: 82 10 20 00 clr %g1 2009974: 10 80 00 07 b 2009990 <_Objects_Shrink_information+0x58> 2009978: ba 10 20 04 mov 4, %i5 200997c: c4 01 00 1d ld [ %g4 + %i5 ], %g2 2009980: 80 a6 c0 02 cmp %i3, %g2 2009984: 02 80 00 0a be 20099ac <_Objects_Shrink_information+0x74> 2009988: 86 07 60 04 add %i5, 4, %g3 200998c: 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++ ) { 2009990: 82 00 60 01 inc %g1 2009994: 80 a0 40 08 cmp %g1, %o0 2009998: 12 bf ff f9 bne 200997c <_Objects_Shrink_information+0x44> 200999c: b8 07 00 1b add %i4, %i3, %i4 20099a0: 81 c7 e0 08 ret 20099a4: 81 e8 00 00 restore if ( information->inactive_per_block[ block ] == 20099a8: 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 ); 20099ac: 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; 20099b0: d0 06 20 20 ld [ %i0 + 0x20 ], %o0 20099b4: 10 80 00 05 b 20099c8 <_Objects_Shrink_information+0x90> 20099b8: 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 ); 20099bc: 90 96 e0 00 orcc %i3, 0, %o0 20099c0: 22 80 00 12 be,a 2009a08 <_Objects_Shrink_information+0xd0> 20099c4: 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 ); 20099c8: c2 02 20 08 ld [ %o0 + 8 ], %g1 20099cc: 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) && 20099d0: 80 a0 40 1c cmp %g1, %i4 20099d4: 0a bf ff fa bcs 20099bc <_Objects_Shrink_information+0x84> 20099d8: f6 02 00 00 ld [ %o0 ], %i3 (index < (index_base + information->allocation_size))) { 20099dc: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 20099e0: 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) && 20099e4: 80 a0 40 02 cmp %g1, %g2 20099e8: 3a bf ff f6 bcc,a 20099c0 <_Objects_Shrink_information+0x88> 20099ec: 90 96 e0 00 orcc %i3, 0, %o0 (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 20099f0: 40 00 10 c5 call 200dd04 <_Chain_Extract> 20099f4: 01 00 00 00 nop } } while ( the_object ); 20099f8: 90 96 e0 00 orcc %i3, 0, %o0 20099fc: 32 bf ff f4 bne,a 20099cc <_Objects_Shrink_information+0x94><== ALWAYS TAKEN 2009a00: 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 ] ); 2009a04: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 2009a08: 40 00 07 cb call 200b934 <_Workspace_Free> 2009a0c: d0 00 40 1d ld [ %g1 + %i5 ], %o0 information->object_blocks[ block ] = NULL; 2009a10: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 2009a14: 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; 2009a18: c0 20 40 1d clr [ %g1 + %i5 ] information->inactive_per_block[ block ] = 0; 2009a1c: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive -= information->allocation_size; 2009a20: 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; 2009a24: c0 20 c0 1d clr [ %g3 + %i5 ] information->inactive -= information->allocation_size; 2009a28: 82 20 80 01 sub %g2, %g1, %g1 2009a2c: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] return; 2009a30: 81 c7 e0 08 ret 2009a34: 81 e8 00 00 restore =============================================================================== 0200fb78 <_POSIX_Keys_Run_destructors>: */ void _POSIX_Keys_Run_destructors( Thread_Control *thread ) { 200fb78: 9d e3 bf a0 save %sp, -96, %sp Objects_Maximum thread_index = _Objects_Get_index( thread->Object.id ); 200fb7c: c2 06 20 08 ld [ %i0 + 8 ], %g1 for ( index = 1 ; index <= max ; ++index ) { POSIX_Keys_Control *key = (POSIX_Keys_Control *) _POSIX_Keys_Information.local_table [ index ]; if ( key != NULL && key->destructor != NULL ) { void *value = key->Values [ thread_api ][ thread_index ]; 200fb80: 35 00 00 3f sethi %hi(0xfc00), %i2 200fb84: b3 30 60 18 srl %g1, 0x18, %i1 200fb88: b4 16 a3 ff or %i2, 0x3ff, %i2 200fb8c: b2 0e 60 07 and %i1, 7, %i1 200fb90: b4 08 40 1a and %g1, %i2, %i2 200fb94: b2 06 60 04 add %i1, 4, %i1 200fb98: 3b 00 80 79 sethi %hi(0x201e400), %i5 200fb9c: b5 2e a0 02 sll %i2, 2, %i2 200fba0: ba 17 63 0c or %i5, 0x30c, %i5 200fba4: b3 2e 60 02 sll %i1, 2, %i1 Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { 200fba8: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 200fbac: 80 a0 60 00 cmp %g1, 0 200fbb0: 02 80 00 21 be 200fc34 <_POSIX_Keys_Run_destructors+0xbc> 200fbb4: b8 10 20 01 mov 1, %i4 200fbb8: 86 10 20 01 mov 1, %g3 200fbbc: b6 10 00 01 mov %g1, %i3 POSIX_Keys_Control *key = (POSIX_Keys_Control *) 200fbc0: c8 07 60 1c ld [ %i5 + 0x1c ], %g4 _POSIX_Keys_Information.local_table [ index ]; 200fbc4: 85 2f 20 10 sll %i4, 0x10, %g2 Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { POSIX_Keys_Control *key = (POSIX_Keys_Control *) 200fbc8: 85 30 a0 0e srl %g2, 0xe, %g2 200fbcc: c4 01 00 02 ld [ %g4 + %g2 ], %g2 _POSIX_Keys_Information.local_table [ index ]; if ( key != NULL && key->destructor != NULL ) { 200fbd0: 80 a0 a0 00 cmp %g2, 0 200fbd4: 02 80 00 10 be 200fc14 <_POSIX_Keys_Run_destructors+0x9c> 200fbd8: 82 00 80 19 add %g2, %i1, %g1 200fbdc: c8 00 a0 10 ld [ %g2 + 0x10 ], %g4 200fbe0: 80 a1 20 00 cmp %g4, 0 200fbe4: 22 80 00 0d be,a 200fc18 <_POSIX_Keys_Run_destructors+0xa0> 200fbe8: b8 07 20 01 inc %i4 void *value = key->Values [ thread_api ][ thread_index ]; 200fbec: c8 00 60 04 ld [ %g1 + 4 ], %g4 200fbf0: d0 01 00 1a ld [ %g4 + %i2 ], %o0 if ( value != NULL ) { 200fbf4: 80 a2 20 00 cmp %o0, 0 200fbf8: 22 80 00 08 be,a 200fc18 <_POSIX_Keys_Run_destructors+0xa0><== ALWAYS TAKEN 200fbfc: b8 07 20 01 inc %i4 key->Values [ thread_api ][ thread_index ] = NULL; 200fc00: c0 21 00 1a clr [ %g4 + %i2 ] <== NOT EXECUTED (*key->destructor)( value ); 200fc04: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 <== NOT EXECUTED 200fc08: 9f c0 40 00 call %g1 <== NOT EXECUTED 200fc0c: 01 00 00 00 nop <== NOT EXECUTED done = false; 200fc10: 86 10 20 00 clr %g3 ! 0 <== NOT EXECUTED Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { 200fc14: b8 07 20 01 inc %i4 200fc18: 85 2f 20 10 sll %i4, 0x10, %g2 200fc1c: 85 30 a0 10 srl %g2, 0x10, %g2 200fc20: 80 a6 c0 02 cmp %i3, %g2 200fc24: 1a bf ff e7 bcc 200fbc0 <_POSIX_Keys_Run_destructors+0x48> 200fc28: 80 88 e0 ff btst 0xff, %g3 * number of iterations. An infinite loop may happen if destructors set * thread specific data. This can be considered dubious. * * Reference: 17.1.1.2 P1003.1c/Draft 10, p. 163, line 99. */ while ( !done ) { 200fc2c: 22 bf ff e0 be,a 200fbac <_POSIX_Keys_Run_destructors+0x34><== NEVER TAKEN 200fc30: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 <== NOT EXECUTED 200fc34: 81 c7 e0 08 ret 200fc38: 81 e8 00 00 restore =============================================================================== 0200ccec <_POSIX_Message_queue_Receive_support>: size_t msg_len, unsigned int *msg_prio, bool wait, Watchdog_Interval timeout ) { 200ccec: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd *_POSIX_Message_queue_Get_fd ( mqd_t id, Objects_Locations *location ) { return (POSIX_Message_queue_Control_fd *) _Objects_Get( 200ccf0: 11 00 80 ad sethi %hi(0x202b400), %o0 200ccf4: 92 10 00 18 mov %i0, %o1 200ccf8: 90 12 22 a0 or %o0, 0x2a0, %o0 200ccfc: 40 00 0d 9f call 2010378 <_Objects_Get> 200cd00: 94 07 bf f8 add %fp, -8, %o2 Objects_Locations location; size_t length_out; bool do_wait; the_mq_fd = _POSIX_Message_queue_Get_fd( mqdes, &location ); switch ( location ) { 200cd04: c2 07 bf f8 ld [ %fp + -8 ], %g1 200cd08: 80 a0 60 00 cmp %g1, 0 200cd0c: 22 80 00 08 be,a 200cd2c <_POSIX_Message_queue_Receive_support+0x40> 200cd10: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EBADF ); 200cd14: 40 00 2a d5 call 2017868 <__errno> 200cd18: b0 10 3f ff mov -1, %i0 200cd1c: 82 10 20 09 mov 9, %g1 200cd20: c2 22 00 00 st %g1, [ %o0 ] } 200cd24: 81 c7 e0 08 ret 200cd28: 81 e8 00 00 restore the_mq_fd = _POSIX_Message_queue_Get_fd( mqdes, &location ); switch ( location ) { case OBJECTS_LOCAL: if ( (the_mq_fd->oflag & O_ACCMODE) == O_WRONLY ) { 200cd2c: 84 08 60 03 and %g1, 3, %g2 200cd30: 80 a0 a0 01 cmp %g2, 1 200cd34: 02 80 00 39 be 200ce18 <_POSIX_Message_queue_Receive_support+0x12c> 200cd38: 01 00 00 00 nop _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EBADF ); } the_mq = the_mq_fd->Queue; 200cd3c: d0 02 20 10 ld [ %o0 + 0x10 ], %o0 if ( msg_len < the_mq->Message_queue.maximum_message_size ) { 200cd40: c4 02 20 68 ld [ %o0 + 0x68 ], %g2 200cd44: 80 a0 80 1a cmp %g2, %i2 200cd48: 18 80 00 23 bgu 200cdd4 <_POSIX_Message_queue_Receive_support+0xe8> 200cd4c: 84 10 3f ff mov -1, %g2 /* * Now if something goes wrong, we return a "length" of -1 * to indicate an error. */ length_out = -1; 200cd50: c4 27 bf fc st %g2, [ %fp + -4 ] /* * A timed receive with a bad time will do a poll regardless. */ if ( wait ) 200cd54: 80 a7 20 00 cmp %i4, 0 200cd58: 12 80 00 1b bne 200cdc4 <_POSIX_Message_queue_Receive_support+0xd8> 200cd5c: 98 10 20 00 clr %o4 do_wait = wait; /* * Now perform the actual message receive */ _CORE_message_queue_Seize( 200cd60: 9a 10 00 1d mov %i5, %o5 200cd64: 90 02 20 1c add %o0, 0x1c, %o0 200cd68: 92 10 00 18 mov %i0, %o1 200cd6c: 94 10 00 19 mov %i1, %o2 200cd70: 96 07 bf fc add %fp, -4, %o3 200cd74: 40 00 09 04 call 200f184 <_CORE_message_queue_Seize> 200cd78: 98 0b 20 01 and %o4, 1, %o4 &length_out, do_wait, timeout ); _Thread_Enable_dispatch(); 200cd7c: 40 00 11 91 call 20113c0 <_Thread_Enable_dispatch> 200cd80: 3b 00 80 ad sethi %hi(0x202b400), %i5 if (msg_prio) { 200cd84: 80 a6 e0 00 cmp %i3, 0 *msg_prio = _POSIX_Message_queue_Priority_from_core( _Thread_Executing->Wait.count 200cd88: ba 17 63 20 or %i5, 0x320, %i5 do_wait, timeout ); _Thread_Enable_dispatch(); if (msg_prio) { 200cd8c: 02 80 00 07 be 200cda8 <_POSIX_Message_queue_Receive_support+0xbc><== NEVER TAKEN 200cd90: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 RTEMS_INLINE_ROUTINE unsigned int _POSIX_Message_queue_Priority_from_core( CORE_message_queue_Submit_types priority ) { /* absolute value without a library dependency */ return (unsigned int) ((priority >= 0) ? priority : -priority); 200cd94: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 200cd98: 85 38 e0 1f sra %g3, 0x1f, %g2 200cd9c: 86 18 80 03 xor %g2, %g3, %g3 200cda0: 84 20 c0 02 sub %g3, %g2, %g2 *msg_prio = _POSIX_Message_queue_Priority_from_core( 200cda4: c4 26 c0 00 st %g2, [ %i3 ] _Thread_Executing->Wait.count ); } if ( !_Thread_Executing->Wait.return_code ) 200cda8: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 200cdac: 80 a0 60 00 cmp %g1, 0 200cdb0: 12 80 00 11 bne 200cdf4 <_POSIX_Message_queue_Receive_support+0x108> 200cdb4: 01 00 00 00 nop return length_out; 200cdb8: f0 07 bf fc ld [ %fp + -4 ], %i0 200cdbc: 81 c7 e0 08 ret 200cdc0: 81 e8 00 00 restore /* * A timed receive with a bad time will do a poll regardless. */ if ( wait ) do_wait = (the_mq_fd->oflag & O_NONBLOCK) ? false : true; 200cdc4: 99 30 60 0e srl %g1, 0xe, %o4 200cdc8: 98 1b 20 01 xor %o4, 1, %o4 200cdcc: 10 bf ff e5 b 200cd60 <_POSIX_Message_queue_Receive_support+0x74> 200cdd0: 98 0b 20 01 and %o4, 1, %o4 } the_mq = the_mq_fd->Queue; if ( msg_len < the_mq->Message_queue.maximum_message_size ) { _Thread_Enable_dispatch(); 200cdd4: 40 00 11 7b call 20113c0 <_Thread_Enable_dispatch> 200cdd8: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EMSGSIZE ); 200cddc: 40 00 2a a3 call 2017868 <__errno> 200cde0: 01 00 00 00 nop 200cde4: 82 10 20 7a mov 0x7a, %g1 ! 7a 200cde8: c2 22 00 00 st %g1, [ %o0 ] 200cdec: 81 c7 e0 08 ret 200cdf0: 81 e8 00 00 restore } if ( !_Thread_Executing->Wait.return_code ) return length_out; rtems_set_errno_and_return_minus_one( 200cdf4: 40 00 2a 9d call 2017868 <__errno> 200cdf8: b0 10 3f ff mov -1, %i0 200cdfc: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200ce00: b8 10 00 08 mov %o0, %i4 200ce04: 40 00 00 a2 call 200d08c <_POSIX_Message_queue_Translate_core_message_queue_return_code> 200ce08: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200ce0c: d0 27 00 00 st %o0, [ %i4 ] 200ce10: 81 c7 e0 08 ret 200ce14: 81 e8 00 00 restore the_mq_fd = _POSIX_Message_queue_Get_fd( mqdes, &location ); switch ( location ) { case OBJECTS_LOCAL: if ( (the_mq_fd->oflag & O_ACCMODE) == O_WRONLY ) { _Thread_Enable_dispatch(); 200ce18: 40 00 11 6a call 20113c0 <_Thread_Enable_dispatch> 200ce1c: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EBADF ); 200ce20: 40 00 2a 92 call 2017868 <__errno> 200ce24: 01 00 00 00 nop 200ce28: 82 10 20 09 mov 9, %g1 ! 9 200ce2c: c2 22 00 00 st %g1, [ %o0 ] 200ce30: 81 c7 e0 08 ret 200ce34: 81 e8 00 00 restore =============================================================================== 0200f71c <_POSIX_Semaphore_Create_support>: size_t name_len, int pshared, unsigned int value, POSIX_Semaphore_Control **the_sem ) { 200f71c: 9d e3 bf a0 save %sp, -96, %sp POSIX_Semaphore_Control *the_semaphore; CORE_semaphore_Attributes *the_sem_attr; char *name; /* Sharing semaphores among processes is not currently supported */ if (pshared != 0) 200f720: 80 a6 a0 00 cmp %i2, 0 200f724: 12 80 00 2f bne 200f7e0 <_POSIX_Semaphore_Create_support+0xc4> 200f728: 03 00 80 8b sethi %hi(0x2022c00), %g1 * * 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; 200f72c: c4 00 61 d0 ld [ %g1 + 0x1d0 ], %g2 ! 2022dd0 <_Thread_Dispatch_disable_level> ++level; 200f730: 84 00 a0 01 inc %g2 _Thread_Dispatch_disable_level = level; 200f734: c4 20 61 d0 st %g2, [ %g1 + 0x1d0 ] * _POSIX_Semaphore_Allocate */ RTEMS_INLINE_ROUTINE POSIX_Semaphore_Control *_POSIX_Semaphore_Allocate( void ) { return (POSIX_Semaphore_Control *) 200f738: 35 00 80 8c sethi %hi(0x2023000), %i2 200f73c: 7f ff ed b2 call 200ae04 <_Objects_Allocate> 200f740: 90 16 a0 a4 or %i2, 0xa4, %o0 ! 20230a4 <_POSIX_Semaphore_Information> rtems_set_errno_and_return_minus_one( ENOSYS ); _Thread_Disable_dispatch(); the_semaphore = _POSIX_Semaphore_Allocate(); if ( !the_semaphore ) { 200f744: ba 92 20 00 orcc %o0, 0, %i5 200f748: 02 80 00 2c be 200f7f8 <_POSIX_Semaphore_Create_support+0xdc> 200f74c: 80 a6 20 00 cmp %i0, 0 /* * Make a copy of the user's string for name just in case it was * dynamically constructed. */ if ( name_arg != NULL ) { 200f750: 02 80 00 1e be 200f7c8 <_POSIX_Semaphore_Create_support+0xac> 200f754: 92 10 00 19 mov %i1, %o1 name = _Workspace_String_duplicate( name_arg, name_len ); 200f758: 40 00 04 92 call 20109a0 <_Workspace_String_duplicate> 200f75c: 90 10 00 18 mov %i0, %o0 if ( !name ) { 200f760: b2 92 20 00 orcc %o0, 0, %i1 200f764: 02 80 00 2d be 200f818 <_POSIX_Semaphore_Create_support+0xfc><== NEVER TAKEN 200f768: 82 10 20 01 mov 1, %g1 } the_semaphore->process_shared = pshared; if ( name ) { the_semaphore->named = true; 200f76c: 84 10 20 01 mov 1, %g2 } } else { name = NULL; } the_semaphore->process_shared = pshared; 200f770: c0 27 60 10 clr [ %i5 + 0x10 ] if ( name ) { the_semaphore->named = true; 200f774: c4 2f 60 14 stb %g2, [ %i5 + 0x14 ] the_semaphore->open_count = 1; 200f778: c2 27 60 18 st %g1, [ %i5 + 0x18 ] the_semaphore->linked = true; 200f77c: c2 2f 60 15 stb %g1, [ %i5 + 0x15 ] the_sem_attr->discipline = CORE_SEMAPHORE_DISCIPLINES_FIFO; /* * This effectively disables limit checking. */ the_sem_attr->maximum_count = 0xFFFFFFFF; 200f780: 82 10 3f ff mov -1, %g1 _CORE_semaphore_Initialize( &the_semaphore->Semaphore, the_sem_attr, value ); 200f784: 90 07 60 1c add %i5, 0x1c, %o0 200f788: 92 07 60 5c add %i5, 0x5c, %o1 200f78c: 94 10 00 1b mov %i3, %o2 the_sem_attr->discipline = CORE_SEMAPHORE_DISCIPLINES_FIFO; /* * This effectively disables limit checking. */ the_sem_attr->maximum_count = 0xFFFFFFFF; 200f790: c2 27 60 5c st %g1, [ %i5 + 0x5c ] _CORE_semaphore_Initialize( &the_semaphore->Semaphore, the_sem_attr, value ); 200f794: 7f ff eb f9 call 200a778 <_CORE_semaphore_Initialize> 200f798: c0 27 60 60 clr [ %i5 + 0x60 ] Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 200f79c: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200f7a0: b4 16 a0 a4 or %i2, 0xa4, %i2 200f7a4: c4 06 a0 1c ld [ %i2 + 0x1c ], %g2 200f7a8: 83 28 60 02 sll %g1, 2, %g1 200f7ac: fa 20 80 01 st %i5, [ %g2 + %g1 ] the_object ); #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) /* ASSERT: information->is_string */ the_object->name.name_p = name; 200f7b0: f2 27 60 0c st %i1, [ %i5 + 0xc ] &_POSIX_Semaphore_Information, &the_semaphore->Object, name ); *the_sem = the_semaphore; 200f7b4: fa 27 00 00 st %i5, [ %i4 ] _Thread_Enable_dispatch(); 200f7b8: 7f ff f3 16 call 200c410 <_Thread_Enable_dispatch> 200f7bc: b0 10 20 00 clr %i0 return 0; 200f7c0: 81 c7 e0 08 ret 200f7c4: 81 e8 00 00 restore } } else { name = NULL; } the_semaphore->process_shared = pshared; 200f7c8: c0 27 60 10 clr [ %i5 + 0x10 ] if ( name ) { the_semaphore->named = true; the_semaphore->open_count = 1; the_semaphore->linked = true; } else { the_semaphore->named = false; 200f7cc: c0 2f 60 14 clrb [ %i5 + 0x14 ] the_semaphore->open_count = 0; 200f7d0: c0 27 60 18 clr [ %i5 + 0x18 ] the_semaphore->linked = false; 200f7d4: c0 2f 60 15 clrb [ %i5 + 0x15 ] _POSIX_Semaphore_Free( the_semaphore ); _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( ENOMEM ); } } else { name = NULL; 200f7d8: 10 bf ff ea b 200f780 <_POSIX_Semaphore_Create_support+0x64> 200f7dc: b2 10 20 00 clr %i1 CORE_semaphore_Attributes *the_sem_attr; char *name; /* Sharing semaphores among processes is not currently supported */ if (pshared != 0) rtems_set_errno_and_return_minus_one( ENOSYS ); 200f7e0: 40 00 0a c5 call 20122f4 <__errno> 200f7e4: b0 10 3f ff mov -1, %i0 200f7e8: 82 10 20 58 mov 0x58, %g1 200f7ec: c2 22 00 00 st %g1, [ %o0 ] 200f7f0: 81 c7 e0 08 ret 200f7f4: 81 e8 00 00 restore _Thread_Disable_dispatch(); the_semaphore = _POSIX_Semaphore_Allocate(); if ( !the_semaphore ) { _Thread_Enable_dispatch(); 200f7f8: 7f ff f3 06 call 200c410 <_Thread_Enable_dispatch> 200f7fc: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( ENOSPC ); 200f800: 40 00 0a bd call 20122f4 <__errno> 200f804: 01 00 00 00 nop 200f808: 82 10 20 1c mov 0x1c, %g1 ! 1c 200f80c: c2 22 00 00 st %g1, [ %o0 ] 200f810: 81 c7 e0 08 ret 200f814: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE void _POSIX_Semaphore_Free ( POSIX_Semaphore_Control *the_semaphore ) { _Objects_Free( &_POSIX_Semaphore_Information, &the_semaphore->Object ); 200f818: 90 16 a0 a4 or %i2, 0xa4, %o0 <== NOT EXECUTED 200f81c: 7f ff ee 72 call 200b1e4 <_Objects_Free> <== NOT EXECUTED 200f820: 92 10 00 1d mov %i5, %o1 <== NOT EXECUTED */ if ( name_arg != NULL ) { name = _Workspace_String_duplicate( name_arg, name_len ); if ( !name ) { _POSIX_Semaphore_Free( the_semaphore ); _Thread_Enable_dispatch(); 200f824: 7f ff f2 fb call 200c410 <_Thread_Enable_dispatch> <== NOT EXECUTED 200f828: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 200f82c: 40 00 0a b2 call 20122f4 <__errno> <== NOT EXECUTED 200f830: 01 00 00 00 nop <== NOT EXECUTED 200f834: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED 200f838: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 200f83c: 81 c7 e0 08 ret <== NOT EXECUTED 200f840: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200d1c8 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch>: Thread_Control *the_thread ) { POSIX_API_Control *thread_support; thread_support = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200d1c8: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 200d1cc: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2 200d1d0: 80 a0 a0 00 cmp %g2, 0 200d1d4: 12 80 00 06 bne 200d1ec <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24><== NEVER TAKEN 200d1d8: 01 00 00 00 nop 200d1dc: c4 00 60 dc ld [ %g1 + 0xdc ], %g2 200d1e0: 80 a0 a0 01 cmp %g2, 1 200d1e4: 22 80 00 05 be,a 200d1f8 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x30> 200d1e8: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 thread_support->cancelability_type == PTHREAD_CANCEL_ASYNCHRONOUS && thread_support->cancelation_requested ) { _Thread_Unnest_dispatch(); _POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED ); } else _Thread_Enable_dispatch(); 200d1ec: 82 13 c0 00 mov %o7, %g1 200d1f0: 7f ff f5 ad call 200a8a4 <_Thread_Enable_dispatch> 200d1f4: 9e 10 40 00 mov %g1, %o7 POSIX_API_Control *thread_support; thread_support = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && thread_support->cancelability_type == PTHREAD_CANCEL_ASYNCHRONOUS && 200d1f8: 80 a0 60 00 cmp %g1, 0 200d1fc: 02 bf ff fc be 200d1ec <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24> 200d200: 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; 200d204: 03 00 80 7a sethi %hi(0x201e800), %g1 200d208: c4 00 60 50 ld [ %g1 + 0x50 ], %g2 ! 201e850 <_Thread_Dispatch_disable_level> thread_support->cancelation_requested ) { _Thread_Unnest_dispatch(); _POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED ); 200d20c: 92 10 3f ff mov -1, %o1 --level; 200d210: 84 00 bf ff add %g2, -1, %g2 _Thread_Dispatch_disable_level = level; 200d214: c4 20 60 50 st %g2, [ %g1 + 0x50 ] 200d218: 82 13 c0 00 mov %o7, %g1 200d21c: 40 00 01 d9 call 200d980 <_POSIX_Thread_Exit> 200d220: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200e6c4 <_POSIX_Thread_Translate_sched_param>: int policy, struct sched_param *param, Thread_CPU_budget_algorithms *budget_algorithm, Thread_CPU_budget_algorithm_callout *budget_callout ) { 200e6c4: 9d e3 bf a0 save %sp, -96, %sp if ( !_POSIX_Priority_Is_valid( param->sched_priority ) ) 200e6c8: 7f ff ff f2 call 200e690 <_POSIX_Priority_Is_valid> 200e6cc: d0 06 40 00 ld [ %i1 ], %o0 200e6d0: 80 8a 20 ff btst 0xff, %o0 200e6d4: 32 80 00 04 bne,a 200e6e4 <_POSIX_Thread_Translate_sched_param+0x20><== ALWAYS TAKEN 200e6d8: c0 26 80 00 clr [ %i2 ] return EINVAL; 200e6dc: 81 c7 e0 08 ret 200e6e0: 91 e8 20 16 restore %g0, 0x16, %o0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; *budget_callout = NULL; if ( policy == SCHED_OTHER ) { 200e6e4: 80 a6 20 00 cmp %i0, 0 200e6e8: 02 80 00 2c be 200e798 <_POSIX_Thread_Translate_sched_param+0xd4> 200e6ec: c0 26 c0 00 clr [ %i3 ] *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; return 0; } if ( policy == SCHED_FIFO ) { 200e6f0: 80 a6 20 01 cmp %i0, 1 200e6f4: 02 80 00 2d be 200e7a8 <_POSIX_Thread_Translate_sched_param+0xe4> 200e6f8: 80 a6 20 02 cmp %i0, 2 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { 200e6fc: 02 80 00 2d be 200e7b0 <_POSIX_Thread_Translate_sched_param+0xec> 200e700: 80 a6 20 04 cmp %i0, 4 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; return 0; } if ( policy == SCHED_SPORADIC ) { 200e704: 12 bf ff f6 bne 200e6dc <_POSIX_Thread_Translate_sched_param+0x18> 200e708: 01 00 00 00 nop if ( (param->sched_ss_repl_period.tv_sec == 0) && 200e70c: c2 06 60 08 ld [ %i1 + 8 ], %g1 200e710: 80 a0 60 00 cmp %g1, 0 200e714: 32 80 00 07 bne,a 200e730 <_POSIX_Thread_Translate_sched_param+0x6c> 200e718: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200e71c: c2 06 60 0c ld [ %i1 + 0xc ], %g1 200e720: 80 a0 60 00 cmp %g1, 0 200e724: 02 bf ff ee be 200e6dc <_POSIX_Thread_Translate_sched_param+0x18> 200e728: 01 00 00 00 nop (param->sched_ss_repl_period.tv_nsec == 0) ) return EINVAL; if ( (param->sched_ss_init_budget.tv_sec == 0) && 200e72c: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200e730: 80 a0 60 00 cmp %g1, 0 200e734: 12 80 00 06 bne 200e74c <_POSIX_Thread_Translate_sched_param+0x88> 200e738: 01 00 00 00 nop 200e73c: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200e740: 80 a0 60 00 cmp %g1, 0 200e744: 02 bf ff e6 be 200e6dc <_POSIX_Thread_Translate_sched_param+0x18> 200e748: 01 00 00 00 nop (param->sched_ss_init_budget.tv_nsec == 0) ) return EINVAL; if ( _Timespec_To_ticks( ¶m->sched_ss_repl_period ) < 200e74c: 7f ff f6 cc call 200c27c <_Timespec_To_ticks> 200e750: 90 06 60 08 add %i1, 8, %o0 200e754: ba 10 00 08 mov %o0, %i5 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) 200e758: 7f ff f6 c9 call 200c27c <_Timespec_To_ticks> 200e75c: 90 06 60 10 add %i1, 0x10, %o0 if ( (param->sched_ss_init_budget.tv_sec == 0) && (param->sched_ss_init_budget.tv_nsec == 0) ) return EINVAL; if ( _Timespec_To_ticks( ¶m->sched_ss_repl_period ) < 200e760: 80 a7 40 08 cmp %i5, %o0 200e764: 0a bf ff de bcs 200e6dc <_POSIX_Thread_Translate_sched_param+0x18> 200e768: 01 00 00 00 nop _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) return EINVAL; if ( !_POSIX_Priority_Is_valid( param->sched_ss_low_priority ) ) 200e76c: 7f ff ff c9 call 200e690 <_POSIX_Priority_Is_valid> 200e770: d0 06 60 04 ld [ %i1 + 4 ], %o0 200e774: 80 8a 20 ff btst 0xff, %o0 200e778: 02 bf ff d9 be 200e6dc <_POSIX_Thread_Translate_sched_param+0x18> 200e77c: 82 10 20 03 mov 3, %g1 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT; 200e780: c2 26 80 00 st %g1, [ %i2 ] *budget_callout = _POSIX_Threads_Sporadic_budget_callout; 200e784: 03 00 80 20 sethi %hi(0x2008000), %g1 200e788: 82 10 61 70 or %g1, 0x170, %g1 ! 2008170 <_POSIX_Threads_Sporadic_budget_callout> 200e78c: c2 26 c0 00 st %g1, [ %i3 ] return 0; 200e790: 81 c7 e0 08 ret 200e794: 91 e8 20 00 restore %g0, 0, %o0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; *budget_callout = NULL; if ( policy == SCHED_OTHER ) { *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 200e798: 82 10 20 01 mov 1, %g1 200e79c: c2 26 80 00 st %g1, [ %i2 ] return 0; 200e7a0: 81 c7 e0 08 ret 200e7a4: 81 e8 00 00 restore *budget_callout = _POSIX_Threads_Sporadic_budget_callout; return 0; } return EINVAL; } 200e7a8: 81 c7 e0 08 ret 200e7ac: 91 e8 20 00 restore %g0, 0, %o0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; 200e7b0: f0 26 80 00 st %i0, [ %i2 ] return 0; 200e7b4: 81 c7 e0 08 ret 200e7b8: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200d508 <_POSIX_Threads_Delete_extension>: */ static void _POSIX_Threads_Delete_extension( Thread_Control *executing __attribute__((unused)), Thread_Control *deleted ) { 200d508: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *the_thread; POSIX_API_Control *api; void **value_ptr; api = deleted->API_Extensions[ THREAD_API_POSIX ]; 200d50c: f0 06 61 5c ld [ %i1 + 0x15c ], %i0 /* * Run the POSIX cancellation handlers */ _POSIX_Threads_cancel_run( deleted ); 200d510: 40 00 09 7e call 200fb08 <_POSIX_Threads_cancel_run> 200d514: 90 10 00 19 mov %i1, %o0 /* * Run all the key destructors */ _POSIX_Keys_Run_destructors( deleted ); 200d518: 90 10 00 19 mov %i1, %o0 200d51c: 40 00 09 97 call 200fb78 <_POSIX_Keys_Run_destructors> 200d520: ba 06 20 44 add %i0, 0x44, %i5 /* * Wakeup all the tasks which joined with this one */ value_ptr = (void **) deleted->Wait.return_argument; while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) ) 200d524: 10 80 00 03 b 200d530 <_POSIX_Threads_Delete_extension+0x28> 200d528: f8 06 60 28 ld [ %i1 + 0x28 ], %i4 *(void **)the_thread->Wait.return_argument = value_ptr; 200d52c: f8 20 40 00 st %i4, [ %g1 ] <== NOT EXECUTED /* * Wakeup all the tasks which joined with this one */ value_ptr = (void **) deleted->Wait.return_argument; while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) ) 200d530: 7f ff f5 7c call 200ab20 <_Thread_queue_Dequeue> 200d534: 90 10 00 1d mov %i5, %o0 200d538: 80 a2 20 00 cmp %o0, 0 200d53c: 32 bf ff fc bne,a 200d52c <_POSIX_Threads_Delete_extension+0x24><== NEVER TAKEN 200d540: c2 02 20 28 ld [ %o0 + 0x28 ], %g1 <== NOT EXECUTED *(void **)the_thread->Wait.return_argument = value_ptr; if ( api->schedpolicy == SCHED_SPORADIC ) 200d544: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 200d548: 80 a0 60 04 cmp %g1, 4 200d54c: 02 80 00 05 be 200d560 <_POSIX_Threads_Delete_extension+0x58> 200d550: 01 00 00 00 nop (void) _Watchdog_Remove( &api->Sporadic_timer ); deleted->API_Extensions[ THREAD_API_POSIX ] = NULL; 200d554: c0 26 61 5c clr [ %i1 + 0x15c ] _Workspace_Free( api ); 200d558: 7f ff f8 f7 call 200b934 <_Workspace_Free> 200d55c: 81 e8 00 00 restore while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) ) *(void **)the_thread->Wait.return_argument = value_ptr; if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); 200d560: 7f ff f8 37 call 200b63c <_Watchdog_Remove> 200d564: 90 06 20 a8 add %i0, 0xa8, %o0 deleted->API_Extensions[ THREAD_API_POSIX ] = NULL; 200d568: c0 26 61 5c clr [ %i1 + 0x15c ] _Workspace_Free( api ); 200d56c: 7f ff f8 f2 call 200b934 <_Workspace_Free> 200d570: 81 e8 00 00 restore =============================================================================== 02007e84 <_POSIX_Threads_Initialize_user_threads_body>: #include #include #include void _POSIX_Threads_Initialize_user_threads_body(void) { 2007e84: 9d e3 bf 58 save %sp, -168, %sp uint32_t maximum; posix_initialization_threads_table *user_threads; pthread_t thread_id; pthread_attr_t attr; user_threads = Configuration_POSIX_API.User_initialization_threads_table; 2007e88: 03 00 80 89 sethi %hi(0x2022400), %g1 2007e8c: 82 10 61 c4 or %g1, 0x1c4, %g1 ! 20225c4 maximum = Configuration_POSIX_API.number_of_initialization_threads; 2007e90: f6 00 60 30 ld [ %g1 + 0x30 ], %i3 if ( !user_threads || maximum == 0 ) 2007e94: 80 a6 e0 00 cmp %i3, 0 2007e98: 02 80 00 18 be 2007ef8 <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN 2007e9c: fa 00 60 34 ld [ %g1 + 0x34 ], %i5 2007ea0: 80 a7 60 00 cmp %i5, 0 2007ea4: 02 80 00 15 be 2007ef8 <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN 2007ea8: b8 10 20 00 clr %i4 for ( index=0 ; index < maximum ; index++ ) { /* * There is no way for these calls to fail in this situation. */ (void) pthread_attr_init( &attr ); 2007eac: 40 00 1a 44 call 200e7bc 2007eb0: 90 07 bf c0 add %fp, -64, %o0 (void) pthread_attr_setinheritsched( &attr, PTHREAD_EXPLICIT_SCHED ); 2007eb4: 92 10 20 02 mov 2, %o1 2007eb8: 40 00 1a 4d call 200e7ec 2007ebc: 90 07 bf c0 add %fp, -64, %o0 (void) pthread_attr_setstacksize(&attr, user_threads[ index ].stack_size); 2007ec0: d2 07 60 04 ld [ %i5 + 4 ], %o1 2007ec4: 40 00 1a 5a call 200e82c 2007ec8: 90 07 bf c0 add %fp, -64, %o0 status = pthread_create( 2007ecc: d4 07 40 00 ld [ %i5 ], %o2 2007ed0: 90 07 bf bc add %fp, -68, %o0 2007ed4: 92 07 bf c0 add %fp, -64, %o1 2007ed8: 7f ff ff 00 call 2007ad8 2007edc: 96 10 20 00 clr %o3 &thread_id, &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) 2007ee0: 94 92 20 00 orcc %o0, 0, %o2 2007ee4: 12 80 00 07 bne 2007f00 <_POSIX_Threads_Initialize_user_threads_body+0x7c> 2007ee8: b8 07 20 01 inc %i4 * * Setting the attributes explicitly is critical, since we don't want * to inherit the idle tasks attributes. */ for ( index=0 ; index < maximum ; index++ ) { 2007eec: 80 a7 00 1b cmp %i4, %i3 2007ef0: 12 bf ff ef bne 2007eac <_POSIX_Threads_Initialize_user_threads_body+0x28><== NEVER TAKEN 2007ef4: ba 07 60 08 add %i5, 8, %i5 2007ef8: 81 c7 e0 08 ret 2007efc: 81 e8 00 00 restore &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) _Internal_error_Occurred( INTERNAL_ERROR_POSIX_API, true, status ); 2007f00: 90 10 20 02 mov 2, %o0 2007f04: 40 00 08 8b call 200a130 <_Internal_error_Occurred> 2007f08: 92 10 20 01 mov 1, %o1 =============================================================================== 0200d694 <_POSIX_Threads_Sporadic_budget_TSR>: */ void _POSIX_Threads_Sporadic_budget_TSR( Objects_Id id __attribute__((unused)), void *argument ) { 200d694: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *the_thread; POSIX_API_Control *api; the_thread = argument; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200d698: fa 06 61 5c ld [ %i1 + 0x15c ], %i5 /* ticks is guaranteed to be at least one */ ticks = _Timespec_To_ticks( &api->schedparam.sched_ss_init_budget ); 200d69c: 40 00 04 3d call 200e790 <_Timespec_To_ticks> 200d6a0: 90 07 60 98 add %i5, 0x98, %o0 RTEMS_INLINE_ROUTINE Priority_Control _POSIX_Priority_To_core( int priority ) { return (Priority_Control) (POSIX_SCHEDULER_MAXIMUM_PRIORITY - priority + 1); 200d6a4: c4 07 60 88 ld [ %i5 + 0x88 ], %g2 200d6a8: 03 00 80 75 sethi %hi(0x201d400), %g1 200d6ac: d2 08 62 7c ldub [ %g1 + 0x27c ], %o1 ! 201d67c */ #if 0 printk( "TSR %d %d %d\n", the_thread->resource_count, the_thread->current_priority, new_priority ); #endif if ( the_thread->resource_count == 0 ) { 200d6b0: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 200d6b4: 92 22 40 02 sub %o1, %g2, %o1 api = the_thread->API_Extensions[ THREAD_API_POSIX ]; /* ticks is guaranteed to be at least one */ ticks = _Timespec_To_ticks( &api->schedparam.sched_ss_init_budget ); the_thread->cpu_time_budget = ticks; 200d6b8: d0 26 60 74 st %o0, [ %i1 + 0x74 ] */ #if 0 printk( "TSR %d %d %d\n", the_thread->resource_count, the_thread->current_priority, new_priority ); #endif if ( the_thread->resource_count == 0 ) { 200d6bc: 80 a0 60 00 cmp %g1, 0 200d6c0: 12 80 00 06 bne 200d6d8 <_POSIX_Threads_Sporadic_budget_TSR+0x44><== NEVER TAKEN 200d6c4: d2 26 60 18 st %o1, [ %i1 + 0x18 ] /* * If this would make them less important, then do not change it. */ if ( the_thread->current_priority > new_priority ) { 200d6c8: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200d6cc: 80 a0 40 09 cmp %g1, %o1 200d6d0: 18 80 00 09 bgu 200d6f4 <_POSIX_Threads_Sporadic_budget_TSR+0x60> 200d6d4: 90 10 00 19 mov %i1, %o0 #endif } } /* ticks is guaranteed to be at least one */ ticks = _Timespec_To_ticks( &api->schedparam.sched_ss_repl_period ); 200d6d8: 90 07 60 90 add %i5, 0x90, %o0 200d6dc: 40 00 04 2d call 200e790 <_Timespec_To_ticks> 200d6e0: 31 00 80 78 sethi %hi(0x201e000), %i0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200d6e4: b2 07 60 a8 add %i5, 0xa8, %i1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200d6e8: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200d6ec: 7f ff f7 75 call 200b4c0 <_Watchdog_Insert> 200d6f0: 91 ee 23 bc restore %i0, 0x3bc, %o0 if ( the_thread->resource_count == 0 ) { /* * If this would make them less important, then do not change it. */ if ( the_thread->current_priority > new_priority ) { _Thread_Change_priority( the_thread, new_priority, true ); 200d6f4: 7f ff f2 cf call 200a230 <_Thread_Change_priority> 200d6f8: 94 10 20 01 mov 1, %o2 #endif } } /* ticks is guaranteed to be at least one */ ticks = _Timespec_To_ticks( &api->schedparam.sched_ss_repl_period ); 200d6fc: 90 07 60 90 add %i5, 0x90, %o0 200d700: 40 00 04 24 call 200e790 <_Timespec_To_ticks> 200d704: 31 00 80 78 sethi %hi(0x201e000), %i0 200d708: b2 07 60 a8 add %i5, 0xa8, %i1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200d70c: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200d710: 7f ff f7 6c call 200b4c0 <_Watchdog_Insert> 200d714: 91 ee 23 bc restore %i0, 0x3bc, %o0 =============================================================================== 0200d718 <_POSIX_Threads_Sporadic_budget_callout>: ) { POSIX_API_Control *api; uint32_t new_priority; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200d718: c4 02 21 5c ld [ %o0 + 0x15c ], %g2 200d71c: c6 00 a0 8c ld [ %g2 + 0x8c ], %g3 200d720: 05 00 80 75 sethi %hi(0x201d400), %g2 200d724: d2 08 a2 7c ldub [ %g2 + 0x27c ], %o1 ! 201d67c */ #if 0 printk( "callout %d %d %d\n", the_thread->resource_count, the_thread->current_priority, new_priority ); #endif if ( the_thread->resource_count == 0 ) { 200d728: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 200d72c: 92 22 40 03 sub %o1, %g3, %o1 /* * This will prevent the thread from consuming its entire "budget" * while at low priority. */ the_thread->cpu_time_budget = 0xFFFFFFFF; /* XXX should be based on MAX_U32 */ 200d730: 86 10 3f ff mov -1, %g3 new_priority = _POSIX_Priority_To_core(api->schedparam.sched_ss_low_priority); the_thread->real_priority = new_priority; 200d734: d2 22 20 18 st %o1, [ %o0 + 0x18 ] */ #if 0 printk( "callout %d %d %d\n", the_thread->resource_count, the_thread->current_priority, new_priority ); #endif if ( the_thread->resource_count == 0 ) { 200d738: 80 a0 a0 00 cmp %g2, 0 200d73c: 12 80 00 06 bne 200d754 <_POSIX_Threads_Sporadic_budget_callout+0x3c><== NEVER TAKEN 200d740: c6 22 20 74 st %g3, [ %o0 + 0x74 ] /* * Make sure we are actually lowering it. If they have lowered it * to logically lower than sched_ss_low_priority, then we do not want to * change it. */ if ( the_thread->current_priority < new_priority ) { 200d744: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200d748: 80 a0 40 09 cmp %g1, %o1 200d74c: 0a 80 00 04 bcs 200d75c <_POSIX_Threads_Sporadic_budget_callout+0x44><== ALWAYS TAKEN 200d750: 94 10 20 01 mov 1, %o2 200d754: 81 c3 e0 08 retl <== NOT EXECUTED 200d758: 01 00 00 00 nop <== NOT EXECUTED _Thread_Change_priority( the_thread, new_priority, true ); 200d75c: 82 13 c0 00 mov %o7, %g1 200d760: 7f ff f2 b4 call 200a230 <_Thread_Change_priority> 200d764: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200fb08 <_POSIX_Threads_cancel_run>: #include void _POSIX_Threads_cancel_run( Thread_Control *the_thread ) { 200fb08: 9d e3 bf a0 save %sp, -96, %sp POSIX_Cancel_Handler_control *handler; Chain_Control *handler_stack; POSIX_API_Control *thread_support; ISR_Level level; thread_support = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200fb0c: f8 06 21 5c ld [ %i0 + 0x15c ], %i4 handler_stack = &thread_support->Cancellation_Handlers; thread_support->cancelability_state = PTHREAD_CANCEL_DISABLE; 200fb10: 84 10 20 01 mov 1, %g2 while ( !_Chain_Is_empty( handler_stack ) ) { 200fb14: c2 07 20 e4 ld [ %i4 + 0xe4 ], %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200fb18: b6 07 20 e8 add %i4, 0xe8, %i3 200fb1c: 80 a0 40 1b cmp %g1, %i3 200fb20: 02 80 00 14 be 200fb70 <_POSIX_Threads_cancel_run+0x68> 200fb24: c4 27 20 d8 st %g2, [ %i4 + 0xd8 ] _ISR_Disable( level ); 200fb28: 7f ff ca b9 call 200260c 200fb2c: 01 00 00 00 nop handler = (POSIX_Cancel_Handler_control *) 200fb30: fa 07 20 ec ld [ %i4 + 0xec ], %i5 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 200fb34: c4 07 40 00 ld [ %i5 ], %g2 previous = the_node->previous; 200fb38: c2 07 60 04 ld [ %i5 + 4 ], %g1 next->previous = previous; 200fb3c: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 200fb40: c4 20 40 00 st %g2, [ %g1 ] _Chain_Tail( handler_stack )->previous; _Chain_Extract_unprotected( &handler->Node ); _ISR_Enable( level ); 200fb44: 7f ff ca b6 call 200261c 200fb48: 01 00 00 00 nop (*handler->routine)( handler->arg ); 200fb4c: c2 07 60 08 ld [ %i5 + 8 ], %g1 200fb50: 9f c0 40 00 call %g1 200fb54: d0 07 60 0c ld [ %i5 + 0xc ], %o0 _Workspace_Free( handler ); 200fb58: 7f ff ef 77 call 200b934 <_Workspace_Free> 200fb5c: 90 10 00 1d mov %i5, %o0 handler_stack = &thread_support->Cancellation_Handlers; thread_support->cancelability_state = PTHREAD_CANCEL_DISABLE; while ( !_Chain_Is_empty( handler_stack ) ) { 200fb60: c2 07 20 e4 ld [ %i4 + 0xe4 ], %g1 200fb64: 80 a0 40 1b cmp %g1, %i3 200fb68: 12 bf ff f0 bne 200fb28 <_POSIX_Threads_cancel_run+0x20> <== NEVER TAKEN 200fb6c: 01 00 00 00 nop 200fb70: 81 c7 e0 08 ret 200fb74: 81 e8 00 00 restore =============================================================================== 02007920 <_POSIX_Timer_TSR>: * This is the operation that is run when a timer expires */ void _POSIX_Timer_TSR( Objects_Id timer __attribute__((unused)), void *data) { 2007920: 9d e3 bf 98 save %sp, -104, %sp bool activated; ptimer = (POSIX_Timer_Control *)data; /* Increment the number of expirations. */ ptimer->overrun = ptimer->overrun + 1; 2007924: c4 06 60 68 ld [ %i1 + 0x68 ], %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 2007928: c2 06 60 54 ld [ %i1 + 0x54 ], %g1 bool activated; ptimer = (POSIX_Timer_Control *)data; /* Increment the number of expirations. */ ptimer->overrun = ptimer->overrun + 1; 200792c: 84 00 a0 01 inc %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 2007930: 80 a0 60 00 cmp %g1, 0 2007934: 12 80 00 0e bne 200796c <_POSIX_Timer_TSR+0x4c> 2007938: c4 26 60 68 st %g2, [ %i1 + 0x68 ] 200793c: c2 06 60 58 ld [ %i1 + 0x58 ], %g1 2007940: 80 a0 60 00 cmp %g1, 0 2007944: 32 80 00 0b bne,a 2007970 <_POSIX_Timer_TSR+0x50> <== ALWAYS TAKEN 2007948: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 /* The state really did not change but just to be safe */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; } else { /* Indicates that the timer is stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; 200794c: 82 10 20 04 mov 4, %g1 <== NOT EXECUTED 2007950: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] <== NOT EXECUTED /* * The sending of the signal to the process running the handling function * specified for that signal is simulated */ if ( pthread_kill ( ptimer->thread_id, ptimer->inf.sigev_signo ) ) { 2007954: d0 06 60 38 ld [ %i1 + 0x38 ], %o0 2007958: 40 00 18 b2 call 200dc20 200795c: d2 06 60 44 ld [ %i1 + 0x44 ], %o1 } /* After the signal handler returns, the count of expirations of the * timer must be set to 0. */ ptimer->overrun = 0; 2007960: c0 26 60 68 clr [ %i1 + 0x68 ] 2007964: 81 c7 e0 08 ret 2007968: 81 e8 00 00 restore ptimer->overrun = ptimer->overrun + 1; /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || ( ptimer->timer_data.it_interval.tv_nsec != 0 ) ) { activated = _POSIX_Timer_Insert_helper( 200796c: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 2007970: d4 06 60 08 ld [ %i1 + 8 ], %o2 2007974: 90 06 60 10 add %i1, 0x10, %o0 2007978: 98 10 00 19 mov %i1, %o4 200797c: 17 00 80 1e sethi %hi(0x2007800), %o3 2007980: 40 00 19 cf call 200e0bc <_POSIX_Timer_Insert_helper> 2007984: 96 12 e1 20 or %o3, 0x120, %o3 ! 2007920 <_POSIX_Timer_TSR> ptimer->ticks, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) 2007988: 80 8a 20 ff btst 0xff, %o0 200798c: 02 bf ff f6 be 2007964 <_POSIX_Timer_TSR+0x44> <== NEVER TAKEN 2007990: 90 07 bf f8 add %fp, -8, %o0 2007994: 13 00 80 7b sethi %hi(0x201ec00), %o1 2007998: 40 00 06 3b call 2009284 <_TOD_Get_with_nanoseconds> 200799c: 92 12 61 98 or %o1, 0x198, %o1 ! 201ed98 <_TOD> /* After the signal handler returns, the count of expirations of the * timer must be set to 0. */ ptimer->overrun = 0; } 20079a0: f8 1a 00 00 ldd [ %o0 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 20079a4: 94 10 20 00 clr %o2 20079a8: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 20079ac: 90 10 00 1c mov %i4, %o0 20079b0: 96 12 e2 00 or %o3, 0x200, %o3 20079b4: 40 00 4a 95 call 201a408 <__divdi3> 20079b8: 92 10 00 1d mov %i5, %o1 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 20079bc: 94 10 20 00 clr %o2 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 20079c0: d2 26 60 6c st %o1, [ %i1 + 0x6c ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 20079c4: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 20079c8: 90 10 00 1c mov %i4, %o0 20079cc: 96 12 e2 00 or %o3, 0x200, %o3 20079d0: 40 00 4b 79 call 201a7b4 <__moddi3> 20079d4: 92 10 00 1d mov %i5, %o1 /* Store the time when the timer was started again */ _TOD_Get( &ptimer->time ); /* The state really did not change but just to be safe */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 20079d8: 82 10 20 03 mov 3, %g1 20079dc: d2 26 60 70 st %o1, [ %i1 + 0x70 ] 20079e0: 10 bf ff dd b 2007954 <_POSIX_Timer_TSR+0x34> 20079e4: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] =============================================================================== 0200fc3c <_POSIX_signals_Check_signal>: bool _POSIX_signals_Check_signal( POSIX_API_Control *api, int signo, bool is_global ) { 200fc3c: 9d e3 bf 68 save %sp, -152, %sp siginfo_t siginfo_struct; sigset_t saved_signals_blocked; Thread_Wait_information stored_thread_wait_information; if ( ! _POSIX_signals_Clear_signals( api, signo, &siginfo_struct, 200fc40: 98 10 20 01 mov 1, %o4 200fc44: 90 10 00 18 mov %i0, %o0 200fc48: 92 10 00 19 mov %i1, %o1 200fc4c: 94 07 bf cc add %fp, -52, %o2 200fc50: 40 00 00 2e call 200fd08 <_POSIX_signals_Clear_signals> 200fc54: 96 10 00 1a mov %i2, %o3 200fc58: 80 8a 20 ff btst 0xff, %o0 200fc5c: 02 80 00 23 be 200fce8 <_POSIX_signals_Check_signal+0xac> 200fc60: 82 10 20 00 clr %g1 #endif /* * Just to prevent sending a signal which is currently being ignored. */ if ( _POSIX_signals_Vectors[ signo ].sa_handler == SIG_IGN ) 200fc64: 85 2e 60 02 sll %i1, 2, %g2 200fc68: 37 00 80 7a sethi %hi(0x201e800), %i3 200fc6c: b9 2e 60 04 sll %i1, 4, %i4 200fc70: b6 16 e0 a0 or %i3, 0xa0, %i3 200fc74: b8 27 00 02 sub %i4, %g2, %i4 200fc78: 84 06 c0 1c add %i3, %i4, %g2 200fc7c: fa 00 a0 08 ld [ %g2 + 8 ], %i5 200fc80: 80 a7 60 01 cmp %i5, 1 200fc84: 02 80 00 19 be 200fce8 <_POSIX_signals_Check_signal+0xac> <== NEVER TAKEN 200fc88: 21 00 80 7a sethi %hi(0x201e800), %l0 return false; /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; 200fc8c: f4 06 20 d0 ld [ %i0 + 0xd0 ], %i2 api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200fc90: c2 00 a0 04 ld [ %g2 + 4 ], %g1 /* * We have to save the blocking information of the current wait queue * because the signal handler may subsequently go on and put the thread * on a wait queue, for its own purposes. */ memcpy( &stored_thread_wait_information, &_Thread_Executing->Wait, 200fc94: a0 14 20 40 or %l0, 0x40, %l0 200fc98: d2 04 20 10 ld [ %l0 + 0x10 ], %o1 /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200fc9c: 82 10 40 1a or %g1, %i2, %g1 /* * We have to save the blocking information of the current wait queue * because the signal handler may subsequently go on and put the thread * on a wait queue, for its own purposes. */ memcpy( &stored_thread_wait_information, &_Thread_Executing->Wait, 200fca0: 90 07 bf d8 add %fp, -40, %o0 /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200fca4: c2 26 20 d0 st %g1, [ %i0 + 0xd0 ] /* * We have to save the blocking information of the current wait queue * because the signal handler may subsequently go on and put the thread * on a wait queue, for its own purposes. */ memcpy( &stored_thread_wait_information, &_Thread_Executing->Wait, 200fca8: 92 02 60 20 add %o1, 0x20, %o1 200fcac: 40 00 04 1c call 2010d1c 200fcb0: 94 10 20 28 mov 0x28, %o2 sizeof( Thread_Wait_information )); /* * Here, the signal handler function executes */ switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) { 200fcb4: c2 06 c0 1c ld [ %i3 + %i4 ], %g1 200fcb8: 80 a0 60 02 cmp %g1, 2 200fcbc: 02 80 00 0e be 200fcf4 <_POSIX_signals_Check_signal+0xb8> 200fcc0: 90 10 00 19 mov %i1, %o0 &siginfo_struct, NULL /* context is undefined per 1003.1b-1993, p. 66 */ ); break; default: (*_POSIX_signals_Vectors[ signo ].sa_handler)( signo ); 200fcc4: 9f c7 40 00 call %i5 200fcc8: 01 00 00 00 nop } /* * Restore the blocking information */ memcpy( &_Thread_Executing->Wait, &stored_thread_wait_information, 200fccc: d0 04 20 10 ld [ %l0 + 0x10 ], %o0 200fcd0: 92 07 bf d8 add %fp, -40, %o1 200fcd4: 90 02 20 20 add %o0, 0x20, %o0 200fcd8: 40 00 04 11 call 2010d1c 200fcdc: 94 10 20 28 mov 0x28, %o2 /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; return true; 200fce0: 82 10 20 01 mov 1, %g1 sizeof( Thread_Wait_information )); /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; 200fce4: f4 26 20 d0 st %i2, [ %i0 + 0xd0 ] return true; } 200fce8: b0 08 60 01 and %g1, 1, %i0 200fcec: 81 c7 e0 08 ret 200fcf0: 81 e8 00 00 restore /* * Here, the signal handler function executes */ switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) { case SA_SIGINFO: (*_POSIX_signals_Vectors[ signo ].sa_sigaction)( 200fcf4: 92 07 bf cc add %fp, -52, %o1 200fcf8: 9f c7 40 00 call %i5 200fcfc: 94 10 20 00 clr %o2 signo, &siginfo_struct, NULL /* context is undefined per 1003.1b-1993, p. 66 */ ); break; 200fd00: 10 bf ff f4 b 200fcd0 <_POSIX_signals_Check_signal+0x94> 200fd04: d0 04 20 10 ld [ %l0 + 0x10 ], %o0 =============================================================================== 02010330 <_POSIX_signals_Clear_process_signals>: */ void _POSIX_signals_Clear_process_signals( int signo ) { 2010330: 9d e3 bf a0 save %sp, -96, %sp 2010334: 84 10 20 01 mov 1, %g2 2010338: 82 06 3f ff add %i0, -1, %g1 clear_signal = true; mask = signo_to_mask( signo ); ISR_Level level; _ISR_Disable( level ); 201033c: 7f ff c8 b4 call 200260c 2010340: bb 28 80 01 sll %g2, %g1, %i5 if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { 2010344: 05 00 80 7a sethi %hi(0x201e800), %g2 2010348: 83 2e 20 02 sll %i0, 2, %g1 201034c: 84 10 a0 a0 or %g2, 0xa0, %g2 2010350: b1 2e 20 04 sll %i0, 4, %i0 2010354: 82 26 00 01 sub %i0, %g1, %g1 2010358: c4 00 80 01 ld [ %g2 + %g1 ], %g2 201035c: 80 a0 a0 02 cmp %g2, 2 2010360: 02 80 00 08 be 2010380 <_POSIX_signals_Clear_process_signals+0x50> 2010364: 31 00 80 7a sethi %hi(0x201e800), %i0 if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; 2010368: 03 00 80 7a sethi %hi(0x201e800), %g1 201036c: c4 00 62 94 ld [ %g1 + 0x294 ], %g2 ! 201ea94 <_POSIX_signals_Pending> 2010370: ba 28 80 1d andn %g2, %i5, %i5 2010374: fa 20 62 94 st %i5, [ %g1 + 0x294 ] } _ISR_Enable( level ); 2010378: 7f ff c8 a9 call 200261c 201037c: 91 e8 00 08 restore %g0, %o0, %o0 ISR_Level level; _ISR_Disable( level ); if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) 2010380: b0 16 22 98 or %i0, 0x298, %i0 2010384: c4 00 40 18 ld [ %g1 + %i0 ], %g2 2010388: b0 00 40 18 add %g1, %i0, %i0 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 201038c: b0 06 20 04 add %i0, 4, %i0 2010390: 80 a0 80 18 cmp %g2, %i0 2010394: 02 bf ff f6 be 201036c <_POSIX_signals_Clear_process_signals+0x3c><== ALWAYS TAKEN 2010398: 03 00 80 7a sethi %hi(0x201e800), %g1 clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; } _ISR_Enable( level ); 201039c: 7f ff c8 a0 call 200261c <== NOT EXECUTED 20103a0: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED =============================================================================== 02008784 <_POSIX_signals_Get_lowest>: sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 2008784: 82 10 20 1b mov 0x1b, %g1 2008788: 86 10 20 01 mov 1, %g3 #include #include #include #include static int _POSIX_signals_Get_lowest( 200878c: 84 00 7f ff add %g1, -1, %g2 2008790: 85 28 c0 02 sll %g3, %g2, %g2 ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 2008794: 80 88 80 08 btst %g2, %o0 2008798: 12 80 00 11 bne 20087dc <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN 200879c: 01 00 00 00 nop sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 20087a0: 82 00 60 01 inc %g1 20087a4: 80 a0 60 20 cmp %g1, 0x20 20087a8: 12 bf ff fa bne 2008790 <_POSIX_signals_Get_lowest+0xc> 20087ac: 84 00 7f ff add %g1, -1, %g2 20087b0: 82 10 20 01 mov 1, %g1 20087b4: 10 80 00 05 b 20087c8 <_POSIX_signals_Get_lowest+0x44> 20087b8: 86 10 20 01 mov 1, %g3 */ #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 20087bc: 80 a0 60 1b cmp %g1, 0x1b 20087c0: 02 80 00 07 be 20087dc <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN 20087c4: 01 00 00 00 nop #include #include #include #include static int _POSIX_signals_Get_lowest( 20087c8: 84 00 7f ff add %g1, -1, %g2 20087cc: 85 28 c0 02 sll %g3, %g2, %g2 #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 20087d0: 80 88 80 08 btst %g2, %o0 20087d4: 22 bf ff fa be,a 20087bc <_POSIX_signals_Get_lowest+0x38> 20087d8: 82 00 60 01 inc %g1 * a return 0. This routine will NOT be called unless a signal * is pending in the set passed in. */ found_it: return signo; } 20087dc: 81 c3 e0 08 retl 20087e0: 90 10 00 01 mov %g1, %o0 =============================================================================== 0200d248 <_POSIX_signals_Post_switch_hook>: */ static void _POSIX_signals_Post_switch_hook( Thread_Control *the_thread ) { 200d248: 9d e3 bf a0 save %sp, -96, %sp /* * We need to ensure that if the signal handler executes a call * which overwrites the unblocking status, we restore it. */ hold_errno = _Thread_Executing->Wait.return_code; 200d24c: 35 00 80 7a sethi %hi(0x201e800), %i2 POSIX_API_Control *api; int signo; ISR_Level level; int hold_errno; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200d250: f8 06 21 5c ld [ %i0 + 0x15c ], %i4 /* * We need to ensure that if the signal handler executes a call * which overwrites the unblocking status, we restore it. */ hold_errno = _Thread_Executing->Wait.return_code; 200d254: b4 16 a0 40 or %i2, 0x40, %i2 200d258: c2 06 a0 10 ld [ %i2 + 0x10 ], %g1 /* * api may be NULL in case of a thread close in progress */ if ( !api ) 200d25c: 80 a7 20 00 cmp %i4, 0 200d260: 02 80 00 34 be 200d330 <_POSIX_signals_Post_switch_hook+0xe8><== NEVER TAKEN 200d264: f2 00 60 34 ld [ %g1 + 0x34 ], %i1 * * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); 200d268: 7f ff d4 e9 call 200260c 200d26c: 37 00 80 7a sethi %hi(0x201e800), %i3 200d270: b6 16 e2 94 or %i3, 0x294, %i3 ! 201ea94 <_POSIX_signals_Pending> if ( !(~api->signals_blocked & (api->signals_pending | _POSIX_signals_Pending)) ) { 200d274: c6 06 c0 00 ld [ %i3 ], %g3 200d278: c2 07 20 d4 ld [ %i4 + 0xd4 ], %g1 * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); if ( !(~api->signals_blocked & 200d27c: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 (api->signals_pending | _POSIX_signals_Pending)) ) { 200d280: 82 10 c0 01 or %g3, %g1, %g1 * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); if ( !(~api->signals_blocked & 200d284: 80 a8 40 02 andncc %g1, %g2, %g0 200d288: 02 80 00 26 be 200d320 <_POSIX_signals_Post_switch_hook+0xd8> 200d28c: 01 00 00 00 nop (api->signals_pending | _POSIX_signals_Pending)) ) { _ISR_Enable( level ); break; } _ISR_Enable( level ); 200d290: 7f ff d4 e3 call 200261c 200d294: ba 10 20 1b mov 0x1b, %i5 ! 1b for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { _POSIX_signals_Check_signal( api, signo, false ); 200d298: 92 10 00 1d mov %i5, %o1 200d29c: 94 10 20 00 clr %o2 200d2a0: 40 00 0a 67 call 200fc3c <_POSIX_signals_Check_signal> 200d2a4: 90 10 00 1c mov %i4, %o0 _POSIX_signals_Check_signal( api, signo, true ); 200d2a8: 92 10 00 1d mov %i5, %o1 200d2ac: 90 10 00 1c mov %i4, %o0 200d2b0: 40 00 0a 63 call 200fc3c <_POSIX_signals_Check_signal> 200d2b4: 94 10 20 01 mov 1, %o2 _ISR_Enable( level ); break; } _ISR_Enable( level ); for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 200d2b8: ba 07 60 01 inc %i5 200d2bc: 80 a7 60 20 cmp %i5, 0x20 200d2c0: 12 bf ff f7 bne 200d29c <_POSIX_signals_Post_switch_hook+0x54> 200d2c4: 92 10 00 1d mov %i5, %o1 200d2c8: ba 10 20 01 mov 1, %i5 _POSIX_signals_Check_signal( api, signo, true ); } /* Unfortunately - nothing like __SIGFIRSTNOTRT in newlib signal .h */ for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { _POSIX_signals_Check_signal( api, signo, false ); 200d2cc: 92 10 00 1d mov %i5, %o1 200d2d0: 94 10 20 00 clr %o2 200d2d4: 40 00 0a 5a call 200fc3c <_POSIX_signals_Check_signal> 200d2d8: 90 10 00 1c mov %i4, %o0 _POSIX_signals_Check_signal( api, signo, true ); 200d2dc: 92 10 00 1d mov %i5, %o1 200d2e0: 90 10 00 1c mov %i4, %o0 200d2e4: 40 00 0a 56 call 200fc3c <_POSIX_signals_Check_signal> 200d2e8: 94 10 20 01 mov 1, %o2 _POSIX_signals_Check_signal( api, signo, false ); _POSIX_signals_Check_signal( api, signo, true ); } /* Unfortunately - nothing like __SIGFIRSTNOTRT in newlib signal .h */ for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 200d2ec: ba 07 60 01 inc %i5 200d2f0: 80 a7 60 1b cmp %i5, 0x1b 200d2f4: 12 bf ff f7 bne 200d2d0 <_POSIX_signals_Post_switch_hook+0x88> 200d2f8: 92 10 00 1d mov %i5, %o1 * * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); 200d2fc: 7f ff d4 c4 call 200260c 200d300: 01 00 00 00 nop if ( !(~api->signals_blocked & (api->signals_pending | _POSIX_signals_Pending)) ) { 200d304: c6 06 c0 00 ld [ %i3 ], %g3 200d308: c2 07 20 d4 ld [ %i4 + 0xd4 ], %g1 * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); if ( !(~api->signals_blocked & 200d30c: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 (api->signals_pending | _POSIX_signals_Pending)) ) { 200d310: 82 10 c0 01 or %g3, %g1, %g1 * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); if ( !(~api->signals_blocked & 200d314: 80 a8 40 02 andncc %g1, %g2, %g0 200d318: 12 bf ff de bne 200d290 <_POSIX_signals_Post_switch_hook+0x48><== NEVER TAKEN 200d31c: 01 00 00 00 nop (api->signals_pending | _POSIX_signals_Pending)) ) { _ISR_Enable( level ); 200d320: 7f ff d4 bf call 200261c 200d324: 01 00 00 00 nop _POSIX_signals_Check_signal( api, signo, false ); _POSIX_signals_Check_signal( api, signo, true ); } } _Thread_Executing->Wait.return_code = hold_errno; 200d328: c2 06 a0 10 ld [ %i2 + 0x10 ], %g1 200d32c: f2 20 60 34 st %i1, [ %g1 + 0x34 ] 200d330: 81 c7 e0 08 ret 200d334: 81 e8 00 00 restore =============================================================================== 0201afd4 <_POSIX_signals_Unblock_thread>: bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 201afd4: 9d e3 bf a0 save %sp, -96, %sp /* * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { 201afd8: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 201afdc: 05 04 00 20 sethi %hi(0x10008000), %g2 201afe0: 88 10 20 01 mov 1, %g4 201afe4: 86 06 7f ff add %i1, -1, %g3 201afe8: ba 08 40 02 and %g1, %g2, %i5 { POSIX_API_Control *api; sigset_t mask; siginfo_t *the_info = NULL; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 201afec: f8 06 21 5c ld [ %i0 + 0x15c ], %i4 /* * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { 201aff0: 80 a7 40 02 cmp %i5, %g2 201aff4: 02 80 00 2c be 201b0a4 <_POSIX_signals_Unblock_thread+0xd0> 201aff8: 87 29 00 03 sll %g4, %g3, %g3 } /* * Thread is not waiting due to a sigwait. */ if ( ~api->signals_blocked & mask ) { 201affc: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 201b000: 80 a8 c0 02 andncc %g3, %g2, %g0 201b004: 02 80 00 24 be 201b094 <_POSIX_signals_Unblock_thread+0xc0> 201b008: 05 04 00 00 sethi %hi(0x10000000), %g2 * it is not blocked, THEN * we need to dispatch at the end of this ISR. * + Any other combination, do nothing. */ if ( _States_Is_interruptible_by_signal( the_thread->current_state ) ) { 201b00c: 80 88 40 02 btst %g1, %g2 201b010: 02 80 00 15 be 201b064 <_POSIX_signals_Unblock_thread+0x90> 201b014: 80 a0 60 00 cmp %g1, 0 the_thread->Wait.return_code = EINTR; 201b018: 84 10 20 04 mov 4, %g2 201b01c: c4 26 20 34 st %g2, [ %i0 + 0x34 ] */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_on_thread_queue ( States_Control the_states ) { return (the_states & STATES_WAITING_ON_THREAD_QUEUE); 201b020: 05 00 00 ef sethi %hi(0x3bc00), %g2 201b024: 84 10 a2 e0 or %g2, 0x2e0, %g2 ! 3bee0 /* * In pthread_cond_wait, a thread will be blocking on a thread * queue, but is also interruptible by a POSIX signal. */ if ( _States_Is_waiting_on_thread_queue(the_thread->current_state) ) 201b028: 80 88 40 02 btst %g1, %g2 201b02c: 12 80 00 38 bne 201b10c <_POSIX_signals_Unblock_thread+0x138> 201b030: 80 88 60 08 btst 8, %g1 _Thread_queue_Extract_with_proxy( the_thread ); else if ( _States_Is_delaying(the_thread->current_state) ) { 201b034: 22 80 00 19 be,a 201b098 <_POSIX_signals_Unblock_thread+0xc4><== NEVER TAKEN 201b038: b0 10 20 00 clr %i0 <== NOT EXECUTED (void) _Watchdog_Remove( &the_thread->Timer ); 201b03c: 7f ff c1 80 call 200b63c <_Watchdog_Remove> 201b040: 90 06 20 48 add %i0, 0x48, %o0 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 201b044: 90 10 00 18 mov %i0, %o0 201b048: 13 04 01 ff sethi %hi(0x1007fc00), %o1 } else if ( the_thread->current_state == STATES_READY ) { if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; 201b04c: b0 10 20 00 clr %i0 201b050: 7f ff bc c5 call 200a364 <_Thread_Clear_state> 201b054: 92 12 63 f8 or %o1, 0x3f8, %o1 201b058: b0 0e 20 01 and %i0, 1, %i0 201b05c: 81 c7 e0 08 ret 201b060: 81 e8 00 00 restore else if ( _States_Is_delaying(the_thread->current_state) ) { (void) _Watchdog_Remove( &the_thread->Timer ); _Thread_Unblock( the_thread ); } } else if ( the_thread->current_state == STATES_READY ) { 201b064: 32 80 00 0d bne,a 201b098 <_POSIX_signals_Unblock_thread+0xc4><== NEVER TAKEN 201b068: b0 10 20 00 clr %i0 <== NOT EXECUTED if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201b06c: 03 00 80 7a sethi %hi(0x201e800), %g1 201b070: 82 10 60 40 or %g1, 0x40, %g1 ! 201e840 <_Per_CPU_Information> 201b074: c4 00 60 08 ld [ %g1 + 8 ], %g2 201b078: 80 a0 a0 00 cmp %g2, 0 201b07c: 22 80 00 07 be,a 201b098 <_POSIX_signals_Unblock_thread+0xc4> 201b080: b0 10 20 00 clr %i0 201b084: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 201b088: 80 a6 00 02 cmp %i0, %g2 201b08c: 22 80 00 02 be,a 201b094 <_POSIX_signals_Unblock_thread+0xc0><== ALWAYS TAKEN 201b090: c8 28 60 0c stb %g4, [ %g1 + 0xc ] _Thread_Dispatch_necessary = true; } } return false; 201b094: b0 10 20 00 clr %i0 } 201b098: b0 0e 20 01 and %i0, 1, %i0 201b09c: 81 c7 e0 08 ret 201b0a0: 81 e8 00 00 restore * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { 201b0a4: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 201b0a8: 80 88 c0 01 btst %g3, %g1 201b0ac: 22 80 00 13 be,a 201b0f8 <_POSIX_signals_Unblock_thread+0x124> 201b0b0: c2 07 20 d0 ld [ %i4 + 0xd0 ], %g1 the_thread->Wait.return_code = EINTR; 201b0b4: 82 10 20 04 mov 4, %g1 201b0b8: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { 201b0bc: 80 a6 a0 00 cmp %i2, 0 201b0c0: 02 80 00 19 be 201b124 <_POSIX_signals_Unblock_thread+0x150> 201b0c4: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 the_info->si_signo = signo; the_info->si_code = SI_USER; the_info->si_value.sival_int = 0; } else { *the_info = *info; 201b0c8: c4 06 80 00 ld [ %i2 ], %g2 201b0cc: c4 20 40 00 st %g2, [ %g1 ] 201b0d0: c4 06 a0 04 ld [ %i2 + 4 ], %g2 201b0d4: c4 20 60 04 st %g2, [ %g1 + 4 ] 201b0d8: c4 06 a0 08 ld [ %i2 + 8 ], %g2 201b0dc: c4 20 60 08 st %g2, [ %g1 + 8 ] } _Thread_queue_Extract_with_proxy( the_thread ); 201b0e0: 90 10 00 18 mov %i0, %o0 201b0e4: 7f ff bf 9f call 200af60 <_Thread_queue_Extract_with_proxy> 201b0e8: b0 10 20 01 mov 1, %i0 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; } 201b0ec: b0 0e 20 01 and %i0, 1, %i0 201b0f0: 81 c7 e0 08 ret 201b0f4: 81 e8 00 00 restore * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { 201b0f8: 80 a8 c0 01 andncc %g3, %g1, %g0 201b0fc: 32 bf ff ef bne,a 201b0b8 <_POSIX_signals_Unblock_thread+0xe4> 201b100: 82 10 20 04 mov 4, %g1 } else if ( the_thread->current_state == STATES_READY ) { if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; 201b104: 10 bf ff e5 b 201b098 <_POSIX_signals_Unblock_thread+0xc4> 201b108: b0 10 20 00 clr %i0 /* * In pthread_cond_wait, a thread will be blocking on a thread * queue, but is also interruptible by a POSIX signal. */ if ( _States_Is_waiting_on_thread_queue(the_thread->current_state) ) _Thread_queue_Extract_with_proxy( the_thread ); 201b10c: 90 10 00 18 mov %i0, %o0 201b110: 7f ff bf 94 call 200af60 <_Thread_queue_Extract_with_proxy> 201b114: b0 10 20 00 clr %i0 201b118: b0 0e 20 01 and %i0, 1, %i0 201b11c: 81 c7 e0 08 ret 201b120: 81 e8 00 00 restore the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { the_info->si_signo = signo; the_info->si_code = SI_USER; 201b124: 84 10 20 01 mov 1, %g2 the_thread->Wait.return_code = EINTR; the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { the_info->si_signo = signo; 201b128: f2 20 40 00 st %i1, [ %g1 ] the_info->si_code = SI_USER; 201b12c: c4 20 60 04 st %g2, [ %g1 + 4 ] the_info->si_value.sival_int = 0; 201b130: 10 bf ff ec b 201b0e0 <_POSIX_signals_Unblock_thread+0x10c> 201b134: c0 20 60 08 clr [ %g1 + 8 ] =============================================================================== 0200a97c <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 200a97c: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if (!the_node) return; 200a980: 80 a6 60 00 cmp %i1, 0 200a984: 02 80 00 4c be 200aab4 <_RBTree_Extract_unprotected+0x138> 200a988: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 200a98c: c2 06 20 08 ld [ %i0 + 8 ], %g1 200a990: 80 a0 40 19 cmp %g1, %i1 200a994: 02 80 00 56 be 200aaec <_RBTree_Extract_unprotected+0x170> 200a998: 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]) { 200a99c: c2 06 20 0c ld [ %i0 + 0xc ], %g1 200a9a0: 80 a0 40 19 cmp %g1, %i1 200a9a4: 02 80 00 56 be 200aafc <_RBTree_Extract_unprotected+0x180> 200a9a8: 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]) { 200a9ac: fa 06 60 04 ld [ %i1 + 4 ], %i5 200a9b0: 80 a7 60 00 cmp %i5, 0 200a9b4: 22 80 00 5a be,a 200ab1c <_RBTree_Extract_unprotected+0x1a0> 200a9b8: f8 06 60 08 ld [ %i1 + 8 ], %i4 200a9bc: c2 06 60 08 ld [ %i1 + 8 ], %g1 200a9c0: 80 a0 60 00 cmp %g1, 0 200a9c4: 32 80 00 05 bne,a 200a9d8 <_RBTree_Extract_unprotected+0x5c> 200a9c8: c2 07 60 08 ld [ %i5 + 8 ], %g1 200a9cc: 10 80 00 3c b 200aabc <_RBTree_Extract_unprotected+0x140> 200a9d0: 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]; 200a9d4: c2 07 60 08 ld [ %i5 + 8 ], %g1 200a9d8: 80 a0 60 00 cmp %g1, 0 200a9dc: 32 bf ff fe bne,a 200a9d4 <_RBTree_Extract_unprotected+0x58> 200a9e0: 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]; 200a9e4: f8 07 60 04 ld [ %i5 + 4 ], %i4 if(leaf) { 200a9e8: 80 a7 20 00 cmp %i4, 0 200a9ec: 02 80 00 48 be 200ab0c <_RBTree_Extract_unprotected+0x190> 200a9f0: 01 00 00 00 nop leaf->parent = target->parent; 200a9f4: c2 07 40 00 ld [ %i5 ], %g1 200a9f8: 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]; 200a9fc: 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]; 200aa00: 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]; 200aa04: 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; 200aa08: c6 07 60 0c ld [ %i5 + 0xc ], %g3 dir = target != target->parent->child[0]; 200aa0c: 88 1f 40 04 xor %i5, %g4, %g4 200aa10: 80 a0 00 04 cmp %g0, %g4 200aa14: 88 40 20 00 addx %g0, 0, %g4 target->parent->child[dir] = leaf; 200aa18: 89 29 20 02 sll %g4, 2, %g4 200aa1c: 84 00 80 04 add %g2, %g4, %g2 200aa20: f8 20 a0 04 st %i4, [ %g2 + 4 ] /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 200aa24: c4 00 60 04 ld [ %g1 + 4 ], %g2 200aa28: 84 18 80 19 xor %g2, %i1, %g2 200aa2c: 80 a0 00 02 cmp %g0, %g2 200aa30: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = target; 200aa34: 85 28 a0 02 sll %g2, 2, %g2 200aa38: 82 00 40 02 add %g1, %g2, %g1 200aa3c: 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]; 200aa40: c2 06 60 08 ld [ %i1 + 8 ], %g1 200aa44: c2 27 60 08 st %g1, [ %i5 + 8 ] if (the_node->child[RBT_RIGHT]) 200aa48: c2 06 60 08 ld [ %i1 + 8 ], %g1 200aa4c: 80 a0 60 00 cmp %g1, 0 200aa50: 32 80 00 02 bne,a 200aa58 <_RBTree_Extract_unprotected+0xdc><== ALWAYS TAKEN 200aa54: fa 20 40 00 st %i5, [ %g1 ] the_node->child[RBT_RIGHT]->parent = target; target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 200aa58: c2 06 60 04 ld [ %i1 + 4 ], %g1 200aa5c: c2 27 60 04 st %g1, [ %i5 + 4 ] if (the_node->child[RBT_LEFT]) 200aa60: c2 06 60 04 ld [ %i1 + 4 ], %g1 200aa64: 80 a0 60 00 cmp %g1, 0 200aa68: 32 80 00 02 bne,a 200aa70 <_RBTree_Extract_unprotected+0xf4> 200aa6c: 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; 200aa70: c4 06 40 00 ld [ %i1 ], %g2 target->color = the_node->color; 200aa74: 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; 200aa78: c4 27 40 00 st %g2, [ %i5 ] target->color = the_node->color; 200aa7c: 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 */ 200aa80: 80 a0 e0 00 cmp %g3, 0 200aa84: 32 80 00 06 bne,a 200aa9c <_RBTree_Extract_unprotected+0x120> 200aa88: c2 06 20 04 ld [ %i0 + 4 ], %g1 if (leaf) { 200aa8c: 80 a7 20 00 cmp %i4, 0 200aa90: 32 80 00 02 bne,a 200aa98 <_RBTree_Extract_unprotected+0x11c> 200aa94: 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; 200aa98: 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; 200aa9c: c0 26 60 08 clr [ %i1 + 8 ] 200aaa0: c0 26 60 04 clr [ %i1 + 4 ] 200aaa4: 80 a0 60 00 cmp %g1, 0 200aaa8: 02 80 00 03 be 200aab4 <_RBTree_Extract_unprotected+0x138> 200aaac: c0 26 40 00 clr [ %i1 ] 200aab0: c0 20 60 0c clr [ %g1 + 0xc ] 200aab4: 81 c7 e0 08 ret 200aab8: 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; 200aabc: c2 06 40 00 ld [ %i1 ], %g1 200aac0: 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]; 200aac4: 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; 200aac8: c6 06 60 0c ld [ %i1 + 0xc ], %g3 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 200aacc: c4 00 60 04 ld [ %g1 + 4 ], %g2 200aad0: 84 18 80 19 xor %g2, %i1, %g2 200aad4: 80 a0 00 02 cmp %g0, %g2 200aad8: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = leaf; 200aadc: 85 28 a0 02 sll %g2, 2, %g2 200aae0: 82 00 40 02 add %g1, %g2, %g1 200aae4: 10 bf ff e7 b 200aa80 <_RBTree_Extract_unprotected+0x104> 200aae8: 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 ); 200aaec: 40 00 00 eb call 200ae98 <_RBTree_Next_unprotected> 200aaf0: 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; 200aaf4: 10 bf ff aa b 200a99c <_RBTree_Extract_unprotected+0x20> 200aaf8: 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 ); 200aafc: 40 00 00 e7 call 200ae98 <_RBTree_Next_unprotected> 200ab00: 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; 200ab04: 10 bf ff aa b 200a9ac <_RBTree_Extract_unprotected+0x30> 200ab08: 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); 200ab0c: 7f ff fe d3 call 200a658 <_RBTree_Extract_validate_unprotected> 200ab10: 90 10 00 1d mov %i5, %o0 } victim_color = target->color; dir = target != target->parent->child[0]; 200ab14: 10 bf ff bb b 200aa00 <_RBTree_Extract_unprotected+0x84> 200ab18: 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 ) { 200ab1c: 80 a7 20 00 cmp %i4, 0 200ab20: 32 bf ff e8 bne,a 200aac0 <_RBTree_Extract_unprotected+0x144> 200ab24: 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); 200ab28: 7f ff fe cc call 200a658 <_RBTree_Extract_validate_unprotected> 200ab2c: 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]; 200ab30: 10 bf ff e6 b 200aac8 <_RBTree_Extract_unprotected+0x14c> 200ab34: c2 06 40 00 ld [ %i1 ], %g1 =============================================================================== 0200a658 <_RBTree_Extract_validate_unprotected>: ) { RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 200a658: c2 02 00 00 ld [ %o0 ], %g1 if(!parent->parent) return; 200a65c: c4 00 40 00 ld [ %g1 ], %g2 200a660: 80 a0 a0 00 cmp %g2, 0 200a664: 02 80 00 3f be 200a760 <_RBTree_Extract_validate_unprotected+0x108> 200a668: 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]) 200a66c: c4 00 60 04 ld [ %g1 + 4 ], %g2 200a670: 80 a2 00 02 cmp %o0, %g2 200a674: 22 80 00 02 be,a 200a67c <_RBTree_Extract_validate_unprotected+0x24> 200a678: 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); 200a67c: c6 02 20 0c ld [ %o0 + 0xc ], %g3 200a680: 80 a0 e0 01 cmp %g3, 1 200a684: 02 80 00 32 be 200a74c <_RBTree_Extract_validate_unprotected+0xf4> 200a688: 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) { 200a68c: c6 00 40 00 ld [ %g1 ], %g3 200a690: 80 a0 e0 00 cmp %g3, 0 200a694: 02 80 00 2e be 200a74c <_RBTree_Extract_validate_unprotected+0xf4> 200a698: 80 a0 a0 00 cmp %g2, 0 200a69c: 22 80 00 07 be,a 200a6b8 <_RBTree_Extract_validate_unprotected+0x60><== NEVER TAKEN 200a6a0: c6 00 a0 08 ld [ %g2 + 8 ], %g3 <== NOT EXECUTED 200a6a4: c8 00 a0 0c ld [ %g2 + 0xc ], %g4 200a6a8: 80 a1 20 01 cmp %g4, 1 200a6ac: 22 80 00 63 be,a 200a838 <_RBTree_Extract_validate_unprotected+0x1e0> 200a6b0: 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]) && 200a6b4: c6 00 a0 08 ld [ %g2 + 8 ], %g3 200a6b8: 80 a0 e0 00 cmp %g3, 0 200a6bc: 22 80 00 07 be,a 200a6d8 <_RBTree_Extract_validate_unprotected+0x80> 200a6c0: c6 00 a0 04 ld [ %g2 + 4 ], %g3 200a6c4: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 200a6c8: 80 a0 e0 01 cmp %g3, 1 200a6cc: 22 80 00 29 be,a 200a770 <_RBTree_Extract_validate_unprotected+0x118> 200a6d0: c6 00 60 04 ld [ %g1 + 4 ], %g3 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 200a6d4: c6 00 a0 04 ld [ %g2 + 4 ], %g3 200a6d8: 80 a0 e0 00 cmp %g3, 0 200a6dc: 22 80 00 07 be,a 200a6f8 <_RBTree_Extract_validate_unprotected+0xa0> 200a6e0: da 20 a0 0c st %o5, [ %g2 + 0xc ] 200a6e4: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 200a6e8: 80 a0 e0 01 cmp %g3, 1 200a6ec: 22 80 00 21 be,a 200a770 <_RBTree_Extract_validate_unprotected+0x118> 200a6f0: c6 00 60 04 ld [ %g1 + 4 ], %g3 sibling->color = RBT_RED; 200a6f4: da 20 a0 0c st %o5, [ %g2 + 0xc ] 200a6f8: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200a6fc: 80 a0 a0 01 cmp %g2, 1 200a700: 22 80 00 99 be,a 200a964 <_RBTree_Extract_validate_unprotected+0x30c> 200a704: 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; 200a708: 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; 200a70c: 80 a0 e0 00 cmp %g3, 0 200a710: 02 80 00 6c be 200a8c0 <_RBTree_Extract_validate_unprotected+0x268><== NEVER TAKEN 200a714: 90 10 00 01 mov %g1, %o0 if(!(the_node->parent->parent)) return NULL; 200a718: c4 00 c0 00 ld [ %g3 ], %g2 200a71c: 80 a0 a0 00 cmp %g2, 0 200a720: 02 80 00 69 be 200a8c4 <_RBTree_Extract_validate_unprotected+0x26c> 200a724: 84 10 20 00 clr %g2 if(the_node == the_node->parent->child[RBT_LEFT]) 200a728: c4 00 e0 04 ld [ %g3 + 4 ], %g2 200a72c: 80 a0 40 02 cmp %g1, %g2 200a730: 22 80 00 0e be,a 200a768 <_RBTree_Extract_validate_unprotected+0x110> 200a734: 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; 200a738: 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); 200a73c: c6 02 20 0c ld [ %o0 + 0xc ], %g3 200a740: 80 a0 e0 01 cmp %g3, 1 200a744: 32 bf ff d3 bne,a 200a690 <_RBTree_Extract_validate_unprotected+0x38><== ALWAYS TAKEN 200a748: 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; 200a74c: c2 02 00 00 ld [ %o0 ], %g1 200a750: c2 00 40 00 ld [ %g1 ], %g1 200a754: 80 a0 60 00 cmp %g1, 0 200a758: 02 80 00 5f be 200a8d4 <_RBTree_Extract_validate_unprotected+0x27c> 200a75c: 01 00 00 00 nop 200a760: 81 c3 e0 08 retl 200a764: 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; 200a768: 10 bf ff f5 b 200a73c <_RBTree_Extract_validate_unprotected+0xe4> 200a76c: 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]; 200a770: 86 1a 00 03 xor %o0, %g3, %g3 200a774: 80 a0 00 03 cmp %g0, %g3 200a778: 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); 200a77c: 86 1b 60 01 xor %o5, 1, %g3 if (!_RBTree_Is_red(sibling->child[_RBTree_Opposite_direction(dir)])) { 200a780: 87 28 e0 02 sll %g3, 2, %g3 200a784: 88 00 80 03 add %g2, %g3, %g4 200a788: 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); 200a78c: 80 a1 20 00 cmp %g4, 0 200a790: 22 80 00 07 be,a 200a7ac <_RBTree_Extract_validate_unprotected+0x154> 200a794: 9b 2b 60 02 sll %o5, 2, %o5 200a798: d8 01 20 0c ld [ %g4 + 0xc ], %o4 200a79c: 80 a3 20 01 cmp %o4, 1 200a7a0: 22 80 00 4f be,a 200a8dc <_RBTree_Extract_validate_unprotected+0x284> 200a7a4: d6 00 60 0c ld [ %g1 + 0xc ], %o3 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; 200a7a8: 9b 2b 60 02 sll %o5, 2, %o5 200a7ac: 98 00 80 0d add %g2, %o5, %o4 200a7b0: 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; 200a7b4: 96 10 20 01 mov 1, %o3 200a7b8: 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; 200a7bc: 80 a1 20 00 cmp %g4, 0 200a7c0: 02 80 00 15 be 200a814 <_RBTree_Extract_validate_unprotected+0x1bc><== NEVER TAKEN 200a7c4: 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]; 200a7c8: 96 01 00 03 add %g4, %g3, %o3 200a7cc: d4 02 e0 04 ld [ %o3 + 4 ], %o2 200a7d0: d4 23 20 04 st %o2, [ %o4 + 4 ] if (c->child[dir]) 200a7d4: d8 02 e0 04 ld [ %o3 + 4 ], %o4 200a7d8: 80 a3 20 00 cmp %o4, 0 200a7dc: 32 80 00 02 bne,a 200a7e4 <_RBTree_Extract_validate_unprotected+0x18c> 200a7e0: 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; 200a7e4: 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; 200a7e8: 96 01 00 03 add %g4, %g3, %o3 200a7ec: c4 22 e0 04 st %g2, [ %o3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a7f0: d6 03 20 04 ld [ %o4 + 4 ], %o3 c->parent = the_node->parent; 200a7f4: 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; 200a7f8: 96 18 80 0b xor %g2, %o3, %o3 c->parent = the_node->parent; the_node->parent = c; 200a7fc: 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; 200a800: 80 a0 00 0b cmp %g0, %o3 200a804: 84 40 20 00 addx %g0, 0, %g2 200a808: 85 28 a0 02 sll %g2, 2, %g2 200a80c: 98 03 00 02 add %o4, %g2, %o4 200a810: 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; 200a814: 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)]; 200a818: 84 00 40 03 add %g1, %g3, %g2 200a81c: c4 00 a0 04 ld [ %g2 + 4 ], %g2 } sibling->color = parent->color; 200a820: c8 20 a0 0c st %g4, [ %g2 + 0xc ] 200a824: 88 00 80 03 add %g2, %g3, %g4 200a828: c8 01 20 04 ld [ %g4 + 4 ], %g4 parent->color = RBT_BLACK; 200a82c: c0 20 60 0c clr [ %g1 + 0xc ] sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK; 200a830: 10 80 00 33 b 200a8fc <_RBTree_Extract_validate_unprotected+0x2a4> 200a834: 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; 200a838: c8 20 60 0c st %g4, [ %g1 + 0xc ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 200a83c: 88 1b 00 08 xor %o4, %o0, %g4 200a840: 80 a0 00 04 cmp %g0, %g4 200a844: 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); 200a848: 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; 200a84c: 97 2a e0 02 sll %o3, 2, %o3 200a850: 98 00 40 0b add %g1, %o3, %o4 200a854: c8 03 20 04 ld [ %o4 + 4 ], %g4 200a858: 80 a1 20 00 cmp %g4, 0 200a85c: 02 80 00 1c be 200a8cc <_RBTree_Extract_validate_unprotected+0x274><== NEVER TAKEN 200a860: 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]; 200a864: 95 2a a0 02 sll %o2, 2, %o2 200a868: 84 01 00 0a add %g4, %o2, %g2 200a86c: d2 00 a0 04 ld [ %g2 + 4 ], %o1 200a870: d2 23 20 04 st %o1, [ %o4 + 4 ] if (c->child[dir]) 200a874: c4 00 a0 04 ld [ %g2 + 4 ], %g2 200a878: 80 a0 a0 00 cmp %g2, 0 200a87c: 02 80 00 04 be 200a88c <_RBTree_Extract_validate_unprotected+0x234><== NEVER TAKEN 200a880: 94 01 00 0a add %g4, %o2, %o2 c->child[dir]->parent = the_node; 200a884: c2 20 80 00 st %g1, [ %g2 ] 200a888: c6 00 40 00 ld [ %g1 ], %g3 c->child[dir] = the_node; 200a88c: c2 22 a0 04 st %g1, [ %o2 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a890: c4 00 e0 04 ld [ %g3 + 4 ], %g2 c->parent = the_node->parent; 200a894: 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; 200a898: 84 18 40 02 xor %g1, %g2, %g2 200a89c: 80 a0 00 02 cmp %g0, %g2 200a8a0: 84 40 20 00 addx %g0, 0, %g2 200a8a4: 85 28 a0 02 sll %g2, 2, %g2 200a8a8: 96 00 40 0b add %g1, %o3, %o3 200a8ac: 86 00 c0 02 add %g3, %g2, %g3 c->parent = the_node->parent; the_node->parent = c; 200a8b0: 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; 200a8b4: c8 20 e0 04 st %g4, [ %g3 + 4 ] 200a8b8: 10 bf ff 7f b 200a6b4 <_RBTree_Extract_validate_unprotected+0x5c> 200a8bc: 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; 200a8c0: 84 10 20 00 clr %g2 <== NOT EXECUTED 200a8c4: 10 bf ff 9e b 200a73c <_RBTree_Extract_validate_unprotected+0xe4> 200a8c8: 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; 200a8cc: 10 bf ff 7a b 200a6b4 <_RBTree_Extract_validate_unprotected+0x5c><== NOT EXECUTED 200a8d0: 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; 200a8d4: 81 c3 e0 08 retl 200a8d8: c0 22 20 0c clr [ %o0 + 0xc ] 200a8dc: 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; 200a8e0: d6 20 a0 0c st %o3, [ %g2 + 0xc ] parent->color = RBT_BLACK; 200a8e4: c0 20 60 0c clr [ %g1 + 0xc ] 200a8e8: c4 03 20 04 ld [ %o4 + 4 ], %g2 200a8ec: 80 a0 a0 00 cmp %g2, 0 200a8f0: 02 bf ff 97 be 200a74c <_RBTree_Extract_validate_unprotected+0xf4><== NEVER TAKEN 200a8f4: c0 21 20 0c clr [ %g4 + 0xc ] 200a8f8: 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]; 200a8fc: 88 00 80 0d add %g2, %o5, %g4 200a900: d8 01 20 04 ld [ %g4 + 4 ], %o4 200a904: 86 00 40 03 add %g1, %g3, %g3 200a908: d8 20 e0 04 st %o4, [ %g3 + 4 ] if (c->child[dir]) 200a90c: c6 01 20 04 ld [ %g4 + 4 ], %g3 200a910: 80 a0 e0 00 cmp %g3, 0 200a914: 32 80 00 02 bne,a 200a91c <_RBTree_Extract_validate_unprotected+0x2c4> 200a918: 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; 200a91c: 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; 200a920: 9a 00 80 0d add %g2, %o5, %o5 200a924: c2 23 60 04 st %g1, [ %o5 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a928: c8 00 e0 04 ld [ %g3 + 4 ], %g4 c->parent = the_node->parent; 200a92c: c6 20 80 00 st %g3, [ %g2 ] the_node->parent = c; 200a930: 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; 200a934: 88 18 40 04 xor %g1, %g4, %g4 200a938: 80 a0 00 04 cmp %g0, %g4 200a93c: 82 40 20 00 addx %g0, 0, %g1 200a940: 83 28 60 02 sll %g1, 2, %g1 200a944: 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; 200a948: c2 02 00 00 ld [ %o0 ], %g1 200a94c: c4 20 e0 04 st %g2, [ %g3 + 4 ] 200a950: c2 00 40 00 ld [ %g1 ], %g1 200a954: 80 a0 60 00 cmp %g1, 0 200a958: 12 bf ff 82 bne 200a760 <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN 200a95c: 01 00 00 00 nop 200a960: 30 bf ff dd b,a 200a8d4 <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED 200a964: c2 02 00 00 ld [ %o0 ], %g1 200a968: c2 00 40 00 ld [ %g1 ], %g1 200a96c: 80 a0 60 00 cmp %g1, 0 200a970: 12 bf ff 7c bne 200a760 <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN 200a974: 01 00 00 00 nop 200a978: 30 bf ff d7 b,a 200a8d4 <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED =============================================================================== 0200b570 <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, RBTree_Node *search_node ) { 200b570: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 200b574: 7f ff e1 c8 call 2003c94 200b578: b8 10 00 18 mov %i0, %i4 200b57c: 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; 200b580: fa 06 20 04 ld [ %i0 + 4 ], %i5 RBTree_Node* found = NULL; int compare_result; while (iter_node) { 200b584: 80 a7 60 00 cmp %i5, 0 200b588: 02 80 00 15 be 200b5dc <_RBTree_Find+0x6c> <== NEVER TAKEN 200b58c: b0 10 20 00 clr %i0 compare_result = the_rbtree->compare_function(the_node, iter_node); 200b590: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 200b594: 92 10 00 1d mov %i5, %o1 200b598: 9f c0 40 00 call %g1 200b59c: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater( int compare_result ) { return compare_result > 0; 200b5a0: 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 ) ) { 200b5a4: 80 a2 20 00 cmp %o0, 0 RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater( int compare_result ) { return compare_result > 0; 200b5a8: 82 20 40 08 sub %g1, %o0, %g1 200b5ac: 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]; 200b5b0: 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 ) ) { 200b5b4: 12 80 00 06 bne 200b5cc <_RBTree_Find+0x5c> 200b5b8: 82 07 40 01 add %i5, %g1, %g1 found = iter_node; if ( the_rbtree->is_unique ) 200b5bc: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2 200b5c0: 80 a0 a0 00 cmp %g2, 0 200b5c4: 12 80 00 0a bne 200b5ec <_RBTree_Find+0x7c> 200b5c8: b0 10 00 1d mov %i5, %i0 break; } RBTree_Direction dir = (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 200b5cc: 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) { 200b5d0: 80 a7 60 00 cmp %i5, 0 200b5d4: 32 bf ff f0 bne,a 200b594 <_RBTree_Find+0x24> 200b5d8: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 return_node = _RBTree_Find_unprotected( the_rbtree, search_node ); _ISR_Enable( level ); 200b5dc: 7f ff e1 b2 call 2003ca4 200b5e0: 90 10 00 1b mov %i3, %o0 return return_node; } 200b5e4: 81 c7 e0 08 ret 200b5e8: 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 ); 200b5ec: 7f ff e1 ae call 2003ca4 200b5f0: 90 10 00 1b mov %i3, %o0 return return_node; } 200b5f4: 81 c7 e0 08 ret 200b5f8: 81 e8 00 00 restore =============================================================================== 0200b9dc <_RBTree_Initialize>: void *starting_address, size_t number_nodes, size_t node_size, bool is_unique ) { 200b9dc: 9d e3 bf a0 save %sp, -96, %sp size_t count; RBTree_Node *next; /* TODO: Error message? */ if (!the_rbtree) return; 200b9e0: 80 a6 20 00 cmp %i0, 0 200b9e4: 02 80 00 0f be 200ba20 <_RBTree_Initialize+0x44> <== NEVER TAKEN 200b9e8: 80 a6 e0 00 cmp %i3, 0 RBTree_Control *the_rbtree, RBTree_Compare_function compare_function, bool is_unique ) { the_rbtree->permanent_null = NULL; 200b9ec: c0 26 00 00 clr [ %i0 ] the_rbtree->root = NULL; 200b9f0: c0 26 20 04 clr [ %i0 + 4 ] the_rbtree->first[0] = NULL; 200b9f4: c0 26 20 08 clr [ %i0 + 8 ] the_rbtree->first[1] = NULL; 200b9f8: c0 26 20 0c clr [ %i0 + 0xc ] the_rbtree->compare_function = compare_function; 200b9fc: 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-- ) { 200ba00: 02 80 00 08 be 200ba20 <_RBTree_Initialize+0x44> <== NEVER TAKEN 200ba04: fa 2e 20 14 stb %i5, [ %i0 + 0x14 ] _RBTree_Insert_unprotected(the_rbtree, next); 200ba08: 92 10 00 1a mov %i2, %o1 200ba0c: 7f ff ff 0b call 200b638 <_RBTree_Insert_unprotected> 200ba10: 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-- ) { 200ba14: b6 86 ff ff addcc %i3, -1, %i3 200ba18: 12 bf ff fc bne 200ba08 <_RBTree_Initialize+0x2c> 200ba1c: b4 06 80 1c add %i2, %i4, %i2 200ba20: 81 c7 e0 08 ret 200ba24: 81 e8 00 00 restore =============================================================================== 0200ab5c <_RBTree_Insert_unprotected>: */ RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 200ab5c: 9d e3 bf a0 save %sp, -96, %sp if(!the_node) return (RBTree_Node*)-1; 200ab60: 80 a6 60 00 cmp %i1, 0 200ab64: 02 80 00 9c be 200add4 <_RBTree_Insert_unprotected+0x278> 200ab68: b8 10 00 18 mov %i0, %i4 RBTree_Node *iter_node = the_rbtree->root; 200ab6c: fa 06 20 04 ld [ %i0 + 4 ], %i5 int compare_result; if (!iter_node) { /* special case: first node inserted */ 200ab70: 80 a7 60 00 cmp %i5, 0 200ab74: 32 80 00 05 bne,a 200ab88 <_RBTree_Insert_unprotected+0x2c> 200ab78: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 the_node->color = RBT_BLACK; 200ab7c: 10 80 00 9a b 200ade4 <_RBTree_Insert_unprotected+0x288> 200ab80: 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); 200ab84: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 200ab88: 92 10 00 1d mov %i5, %o1 200ab8c: 9f c0 40 00 call %g1 200ab90: 90 10 00 19 mov %i1, %o0 if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 200ab94: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2 return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); 200ab98: 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 ) ) 200ab9c: 80 a0 a0 00 cmp %g2, 0 return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); 200aba0: b7 36 e0 1f srl %i3, 0x1f, %i3 if (!iter_node->child[dir]) { 200aba4: 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 ) ) 200aba8: 02 80 00 05 be 200abbc <_RBTree_Insert_unprotected+0x60> 200abac: 82 07 40 01 add %i5, %g1, %g1 200abb0: 80 a2 20 00 cmp %o0, 0 200abb4: 02 80 00 8a be 200addc <_RBTree_Insert_unprotected+0x280> 200abb8: 01 00 00 00 nop return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); if (!iter_node->child[dir]) { 200abbc: f0 00 60 04 ld [ %g1 + 4 ], %i0 200abc0: 80 a6 20 00 cmp %i0, 0 200abc4: 32 bf ff f0 bne,a 200ab84 <_RBTree_Insert_unprotected+0x28> 200abc8: 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( 200abcc: 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]; 200abd0: b4 06 e0 02 add %i3, 2, %i2 200abd4: 87 2e a0 02 sll %i2, 2, %g3 200abd8: 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; 200abdc: c0 26 60 08 clr [ %i1 + 8 ] 200abe0: c0 26 60 04 clr [ %i1 + 4 ] the_node->color = RBT_RED; iter_node->child[dir] = the_node; 200abe4: 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; 200abe8: 82 10 20 01 mov 1, %g1 iter_node->child[dir] = the_node; the_node->parent = iter_node; 200abec: 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; 200abf0: 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( 200abf4: 9f c0 80 00 call %g2 200abf8: 90 10 00 19 mov %i1, %o0 the_node, _RBTree_First(the_rbtree, dir) ); if ( (!dir && _RBTree_Is_lesser(compare_result)) || 200abfc: 80 a6 e0 00 cmp %i3, 0 200ac00: 12 80 00 10 bne 200ac40 <_RBTree_Insert_unprotected+0xe4> 200ac04: 80 a2 20 00 cmp %o0, 0 200ac08: 06 80 00 10 bl 200ac48 <_RBTree_Insert_unprotected+0xec> 200ac0c: b5 2e a0 02 sll %i2, 2, %i2 200ac10: 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; 200ac14: 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; 200ac18: c4 00 40 00 ld [ %g1 ], %g2 200ac1c: 86 90 a0 00 orcc %g2, 0, %g3 200ac20: 22 80 00 06 be,a 200ac38 <_RBTree_Insert_unprotected+0xdc> 200ac24: 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); 200ac28: c8 00 60 0c ld [ %g1 + 0xc ], %g4 200ac2c: 80 a1 20 01 cmp %g4, 1 200ac30: 22 80 00 08 be,a 200ac50 <_RBTree_Insert_unprotected+0xf4> 200ac34: f6 00 80 00 ld [ %g2 ], %i3 /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; } 200ac38: 81 c7 e0 08 ret 200ac3c: 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)) ) { 200ac40: 04 bf ff f4 ble 200ac10 <_RBTree_Insert_unprotected+0xb4> 200ac44: b5 2e a0 02 sll %i2, 2, %i2 the_rbtree->first[dir] = the_node; 200ac48: 10 bf ff f2 b 200ac10 <_RBTree_Insert_unprotected+0xb4> 200ac4c: 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; 200ac50: 80 a6 e0 00 cmp %i3, 0 200ac54: 02 80 00 0c be 200ac84 <_RBTree_Insert_unprotected+0x128> <== NEVER TAKEN 200ac58: 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]) 200ac5c: 80 a1 00 01 cmp %g4, %g1 200ac60: 02 80 00 5b be 200adcc <_RBTree_Insert_unprotected+0x270> 200ac64: 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); 200ac68: 80 a7 60 00 cmp %i5, 0 200ac6c: 22 80 00 07 be,a 200ac88 <_RBTree_Insert_unprotected+0x12c> 200ac70: fa 00 60 04 ld [ %g1 + 4 ], %i5 200ac74: f8 07 60 0c ld [ %i5 + 0xc ], %i4 200ac78: 80 a7 20 01 cmp %i4, 1 200ac7c: 22 80 00 4f be,a 200adb8 <_RBTree_Insert_unprotected+0x25c> 200ac80: 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]; 200ac84: fa 00 60 04 ld [ %g1 + 4 ], %i5 RBTree_Direction pdir = the_node->parent != g->child[0]; 200ac88: 88 18 40 04 xor %g1, %g4, %g4 200ac8c: 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]; 200ac90: ba 1e 40 1d xor %i1, %i5, %i5 RBTree_Direction pdir = the_node->parent != g->child[0]; 200ac94: 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]; 200ac98: 80 a0 00 1d cmp %g0, %i5 200ac9c: 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) { 200aca0: 80 a7 40 04 cmp %i5, %g4 200aca4: 02 80 00 20 be 200ad24 <_RBTree_Insert_unprotected+0x1c8> 200aca8: 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); 200acac: 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; 200acb0: b7 2e e0 02 sll %i3, 2, %i3 200acb4: b6 00 40 1b add %g1, %i3, %i3 200acb8: fa 06 e0 04 ld [ %i3 + 4 ], %i5 200acbc: 80 a7 60 00 cmp %i5, 0 200acc0: 02 80 00 16 be 200ad18 <_RBTree_Insert_unprotected+0x1bc> <== NEVER TAKEN 200acc4: 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]; 200acc8: 9e 07 40 1c add %i5, %i4, %o7 200accc: da 03 e0 04 ld [ %o7 + 4 ], %o5 200acd0: da 26 e0 04 st %o5, [ %i3 + 4 ] if (c->child[dir]) 200acd4: f6 03 e0 04 ld [ %o7 + 4 ], %i3 200acd8: 80 a6 e0 00 cmp %i3, 0 200acdc: 22 80 00 05 be,a 200acf0 <_RBTree_Insert_unprotected+0x194> 200ace0: b6 07 40 1c add %i5, %i4, %i3 c->child[dir]->parent = the_node; 200ace4: c2 26 c0 00 st %g1, [ %i3 ] 200ace8: c4 00 40 00 ld [ %g1 ], %g2 c->child[dir] = the_node; 200acec: b6 07 40 1c add %i5, %i4, %i3 200acf0: c2 26 e0 04 st %g1, [ %i3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200acf4: f6 00 a0 04 ld [ %g2 + 4 ], %i3 c->parent = the_node->parent; 200acf8: 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; 200acfc: b6 1e c0 01 xor %i3, %g1, %i3 c->parent = the_node->parent; the_node->parent = c; 200ad00: 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; 200ad04: 80 a0 00 1b cmp %g0, %i3 200ad08: 82 40 20 00 addx %g0, 0, %g1 200ad0c: 83 28 60 02 sll %g1, 2, %g1 200ad10: 84 00 80 01 add %g2, %g1, %g2 200ad14: fa 20 a0 04 st %i5, [ %g2 + 4 ] _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; 200ad18: b2 06 40 1c add %i1, %i4, %i1 200ad1c: f2 06 60 04 ld [ %i1 + 4 ], %i1 200ad20: c2 06 40 00 ld [ %i1 ], %g1 } the_node->parent->color = RBT_BLACK; 200ad24: 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)); 200ad28: 88 26 80 04 sub %i2, %g4, %g4 200ad2c: 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; 200ad30: bb 2f 60 02 sll %i5, 2, %i5 200ad34: ba 00 c0 1d add %g3, %i5, %i5 200ad38: c4 07 60 04 ld [ %i5 + 4 ], %g2 200ad3c: 80 a0 a0 00 cmp %g2, 0 200ad40: 02 bf ff b6 be 200ac18 <_RBTree_Insert_unprotected+0xbc> <== NEVER TAKEN 200ad44: 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]; 200ad48: 89 29 20 02 sll %g4, 2, %g4 200ad4c: 82 00 80 04 add %g2, %g4, %g1 200ad50: f8 00 60 04 ld [ %g1 + 4 ], %i4 200ad54: f8 27 60 04 st %i4, [ %i5 + 4 ] if (c->child[dir]) 200ad58: c2 00 60 04 ld [ %g1 + 4 ], %g1 200ad5c: 80 a0 60 00 cmp %g1, 0 200ad60: 32 80 00 02 bne,a 200ad68 <_RBTree_Insert_unprotected+0x20c> 200ad64: 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; 200ad68: 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; 200ad6c: 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; 200ad70: 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; 200ad74: c6 21 20 04 st %g3, [ %g4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200ad78: c8 07 60 04 ld [ %i5 + 4 ], %g4 c->parent = the_node->parent; the_node->parent = c; 200ad7c: c4 20 c0 00 st %g2, [ %g3 ] 200ad80: 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; 200ad84: 86 18 c0 04 xor %g3, %g4, %g3 200ad88: 80 a0 00 03 cmp %g0, %g3 200ad8c: 86 40 20 00 addx %g0, 0, %g3 200ad90: 87 28 e0 02 sll %g3, 2, %g3 200ad94: ba 07 40 03 add %i5, %g3, %i5 200ad98: 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; 200ad9c: c4 00 40 00 ld [ %g1 ], %g2 200ada0: 86 90 a0 00 orcc %g2, 0, %g3 200ada4: 32 bf ff a2 bne,a 200ac2c <_RBTree_Insert_unprotected+0xd0><== ALWAYS TAKEN 200ada8: c8 00 60 0c ld [ %g1 + 0xc ], %g4 } } if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200adac: c0 26 60 0c clr [ %i1 + 0xc ] <== NOT EXECUTED /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; } 200adb0: 81 c7 e0 08 ret <== NOT EXECUTED 200adb4: 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; 200adb8: c0 27 60 0c clr [ %i5 + 0xc ] g->color = RBT_RED; 200adbc: f8 20 a0 0c st %i4, [ %g2 + 0xc ] 200adc0: 82 10 00 1b mov %i3, %g1 200adc4: 10 bf ff 95 b 200ac18 <_RBTree_Insert_unprotected+0xbc> 200adc8: 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]; 200adcc: 10 bf ff a7 b 200ac68 <_RBTree_Insert_unprotected+0x10c> 200add0: 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; 200add4: 81 c7 e0 08 ret 200add8: 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 ) ) 200addc: 81 c7 e0 08 ret 200ade0: 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; 200ade4: f2 26 20 04 st %i1, [ %i0 + 4 ] the_rbtree->first[0] = the_rbtree->first[1] = the_node; 200ade8: f2 26 20 0c st %i1, [ %i0 + 0xc ] 200adec: f2 26 20 08 st %i1, [ %i0 + 8 ] the_node->parent = (RBTree_Node *) the_rbtree; 200adf0: f0 26 40 00 st %i0, [ %i1 ] the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 200adf4: c0 26 60 08 clr [ %i1 + 8 ] 200adf8: c0 26 60 04 clr [ %i1 + 4 ] } /* while(iter_node) */ /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; 200adfc: 81 c7 e0 08 ret 200ae00: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200ae34 <_RBTree_Iterate_unprotected>: const RBTree_Control *rbtree, RBTree_Direction dir, RBTree_Visitor visitor, void *visitor_arg ) { 200ae34: 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); 200ae38: 80 a0 00 19 cmp %g0, %i1 200ae3c: 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]; 200ae40: 82 00 60 02 add %g1, 2, %g1 200ae44: 83 28 60 02 sll %g1, 2, %g1 200ae48: 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 ) { 200ae4c: 80 a7 60 00 cmp %i5, 0 200ae50: 12 80 00 06 bne 200ae68 <_RBTree_Iterate_unprotected+0x34><== ALWAYS TAKEN 200ae54: 94 10 00 1b mov %i3, %o2 200ae58: 30 80 00 0e b,a 200ae90 <_RBTree_Iterate_unprotected+0x5c><== NOT EXECUTED 200ae5c: 80 8f 20 ff btst 0xff, %i4 200ae60: 02 80 00 0c be 200ae90 <_RBTree_Iterate_unprotected+0x5c> <== NEVER TAKEN 200ae64: 94 10 00 1b mov %i3, %o2 stop = (*visitor)( current, dir, visitor_arg ); 200ae68: 90 10 00 1d mov %i5, %o0 200ae6c: 9f c6 80 00 call %i2 200ae70: 92 10 00 19 mov %i1, %o1 current = _RBTree_Next_unprotected( current, dir ); 200ae74: 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 ); 200ae78: b8 10 00 08 mov %o0, %i4 current = _RBTree_Next_unprotected( current, dir ); 200ae7c: 40 00 00 07 call 200ae98 <_RBTree_Next_unprotected> 200ae80: 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 ) { 200ae84: ba 92 20 00 orcc %o0, 0, %i5 200ae88: 12 bf ff f5 bne 200ae5c <_RBTree_Iterate_unprotected+0x28> 200ae8c: b8 1f 20 01 xor %i4, 1, %i4 200ae90: 81 c7 e0 08 ret 200ae94: 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 58 ld [ %i0 + 0x158 ], %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 75 sethi %hi(0x201d400), %g1 2007fa8: 82 10 62 84 or %g1, 0x284, %g1 ! 201d684 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 30 call 20090e0 <_Internal_error_Occurred> 2008024: 92 10 20 01 mov 1, %o1 =============================================================================== 0200da4c <_RTEMS_tasks_Switch_extension>: /* * Per Task Variables */ tvp = executing->task_variables; 200da4c: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 200da50: 80 a0 60 00 cmp %g1, 0 200da54: 22 80 00 0c be,a 200da84 <_RTEMS_tasks_Switch_extension+0x38> 200da58: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 tvp->tval = *tvp->ptr; 200da5c: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->gval; 200da60: c6 00 60 08 ld [ %g1 + 8 ], %g3 * Per Task Variables */ tvp = executing->task_variables; while (tvp) { tvp->tval = *tvp->ptr; 200da64: c8 00 80 00 ld [ %g2 ], %g4 200da68: c8 20 60 0c st %g4, [ %g1 + 0xc ] *tvp->ptr = tvp->gval; 200da6c: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200da70: c2 00 40 00 ld [ %g1 ], %g1 /* * Per Task Variables */ tvp = executing->task_variables; while (tvp) { 200da74: 80 a0 60 00 cmp %g1, 0 200da78: 32 bf ff fa bne,a 200da60 <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN 200da7c: 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; 200da80: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 while (tvp) { 200da84: 80 a0 60 00 cmp %g1, 0 200da88: 02 80 00 0d be 200dabc <_RTEMS_tasks_Switch_extension+0x70> 200da8c: 01 00 00 00 nop tvp->gval = *tvp->ptr; 200da90: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->tval; 200da94: 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; 200da98: c8 00 80 00 ld [ %g2 ], %g4 200da9c: c8 20 60 08 st %g4, [ %g1 + 8 ] *tvp->ptr = tvp->tval; 200daa0: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200daa4: c2 00 40 00 ld [ %g1 ], %g1 *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { 200daa8: 80 a0 60 00 cmp %g1, 0 200daac: 32 bf ff fa bne,a 200da94 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN 200dab0: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED 200dab4: 81 c3 e0 08 retl 200dab8: 01 00 00 00 nop 200dabc: 81 c3 e0 08 retl =============================================================================== 02037f40 <_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 ) { 2037f40: 9d e3 bf 98 save %sp, -104, %sp */ static inline void _TOD_Get_uptime( Timestamp_Control *time ) { _TOD_Get_with_nanoseconds( time, &_TOD.uptime ); 2037f44: 13 00 81 9c sethi %hi(0x2067000), %o1 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ Timestamp_Control uptime; #endif Thread_Control *owning_thread = the_period->owner; 2037f48: f6 06 20 40 ld [ %i0 + 0x40 ], %i3 2037f4c: 90 07 bf f8 add %fp, -8, %o0 2037f50: 7f ff 42 77 call 200892c <_TOD_Get_with_nanoseconds> 2037f54: 92 12 62 b0 or %o1, 0x2b0, %o1 /* * Determine elapsed wall time since period initiated. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 2037f58: c4 1f bf f8 ldd [ %fp + -8 ], %g2 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 2037f5c: 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) { 2037f60: 03 00 81 9e sethi %hi(0x2067800), %g1 2037f64: 82 10 60 80 or %g1, 0x80, %g1 ! 2067880 <_Per_CPU_Information> 2037f68: de 00 60 10 ld [ %g1 + 0x10 ], %o7 2037f6c: ba a0 c0 1d subcc %g3, %i5, %i5 2037f70: b8 60 80 1c subx %g2, %i4, %i4 2037f74: 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; 2037f78: 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) { 2037f7c: 80 a3 c0 1b cmp %o7, %i3 2037f80: 02 80 00 05 be 2037f94 <_Rate_monotonic_Get_status+0x54> 2037f84: f8 1e e0 80 ldd [ %i3 + 0x80 ], %i4 return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; } 2037f88: b0 09 20 01 and %g4, 1, %i0 2037f8c: 81 c7 e0 08 ret 2037f90: 81 e8 00 00 restore 2037f94: d8 18 60 20 ldd [ %g1 + 0x20 ], %o4 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2037f98: f0 1e 20 48 ldd [ %i0 + 0x48 ], %i0 2037f9c: 86 a0 c0 0d subcc %g3, %o5, %g3 2037fa0: 84 60 80 0c subx %g2, %o4, %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2037fa4: 9a 87 40 03 addcc %i5, %g3, %o5 2037fa8: 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)) 2037fac: 80 a6 00 0c cmp %i0, %o4 2037fb0: 14 bf ff f6 bg 2037f88 <_Rate_monotonic_Get_status+0x48> <== NEVER TAKEN 2037fb4: 88 10 20 00 clr %g4 2037fb8: 02 80 00 09 be 2037fdc <_Rate_monotonic_Get_status+0x9c> 2037fbc: 80 a6 40 0d cmp %i1, %o5 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 2037fc0: 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; 2037fc4: 88 10 20 01 mov 1, %g4 2037fc8: 98 63 00 18 subx %o4, %i0, %o4 } 2037fcc: b0 09 20 01 and %g4, 1, %i0 2037fd0: d8 3e 80 00 std %o4, [ %i2 ] 2037fd4: 81 c7 e0 08 ret 2037fd8: 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)) 2037fdc: 28 bf ff fa bleu,a 2037fc4 <_Rate_monotonic_Get_status+0x84> 2037fe0: 9a a3 40 19 subcc %o5, %i1, %o5 return false; 2037fe4: 10 bf ff e9 b 2037f88 <_Rate_monotonic_Get_status+0x48> 2037fe8: 88 10 20 00 clr %g4 =============================================================================== 02038390 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 2038390: 9d e3 bf 98 save %sp, -104, %sp 2038394: 11 00 81 9f sethi %hi(0x2067c00), %o0 2038398: 92 10 00 18 mov %i0, %o1 203839c: 90 12 22 44 or %o0, 0x244, %o0 20383a0: 7f ff 44 37 call 200947c <_Objects_Get> 20383a4: 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 ) { 20383a8: c2 07 bf fc ld [ %fp + -4 ], %g1 20383ac: 80 a0 60 00 cmp %g1, 0 20383b0: 12 80 00 16 bne 2038408 <_Rate_monotonic_Timeout+0x78> <== NEVER TAKEN 20383b4: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 20383b8: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 20383bc: 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); 20383c0: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 20383c4: 80 88 80 01 btst %g2, %g1 20383c8: 22 80 00 08 be,a 20383e8 <_Rate_monotonic_Timeout+0x58> 20383cc: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 20383d0: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 20383d4: c2 07 60 08 ld [ %i5 + 8 ], %g1 20383d8: 80 a0 80 01 cmp %g2, %g1 20383dc: 02 80 00 19 be 2038440 <_Rate_monotonic_Timeout+0xb0> 20383e0: 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 ) { 20383e4: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 20383e8: 80 a0 60 01 cmp %g1, 1 20383ec: 02 80 00 09 be 2038410 <_Rate_monotonic_Timeout+0x80> 20383f0: 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; 20383f4: 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; 20383f8: 03 00 81 9c sethi %hi(0x2067000), %g1 20383fc: c4 00 63 60 ld [ %g1 + 0x360 ], %g2 ! 2067360 <_Thread_Dispatch_disable_level> --level; 2038400: 84 00 bf ff add %g2, -1, %g2 _Thread_Dispatch_disable_level = level; 2038404: c4 20 63 60 st %g2, [ %g1 + 0x360 ] 2038408: 81 c7 e0 08 ret 203840c: 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; 2038410: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 2038414: 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; 2038418: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 203841c: 7f ff ff 43 call 2038128 <_Rate_monotonic_Initiate_statistics> 2038420: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2038424: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2038428: 11 00 81 9c sethi %hi(0x2067000), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 203842c: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2038430: 90 12 23 fc or %o0, 0x3fc, %o0 2038434: 7f ff 4b 52 call 200b17c <_Watchdog_Insert> 2038438: 92 07 60 10 add %i5, 0x10, %o1 203843c: 30 bf ff ef b,a 20383f8 <_Rate_monotonic_Timeout+0x68> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2038440: 7f ff 46 f8 call 200a020 <_Thread_Clear_state> 2038444: 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 ); 2038448: 10 bf ff f5 b 203841c <_Rate_monotonic_Timeout+0x8c> 203844c: 90 10 00 1d mov %i5, %o0 =============================================================================== 02037fec <_Rate_monotonic_Update_statistics>: } static void _Rate_monotonic_Update_statistics( Rate_monotonic_Control *the_period ) { 2037fec: 9d e3 bf 90 save %sp, -112, %sp /* * Update the counts. */ stats = &the_period->Statistics; stats->count++; 2037ff0: c4 06 20 58 ld [ %i0 + 0x58 ], %g2 if ( the_period->state == RATE_MONOTONIC_EXPIRED ) 2037ff4: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 /* * Update the counts. */ stats = &the_period->Statistics; stats->count++; 2037ff8: 84 00 a0 01 inc %g2 if ( the_period->state == RATE_MONOTONIC_EXPIRED ) 2037ffc: 80 a0 60 04 cmp %g1, 4 2038000: 02 80 00 32 be 20380c8 <_Rate_monotonic_Update_statistics+0xdc> 2038004: c4 26 20 58 st %g2, [ %i0 + 0x58 ] stats->missed_count++; /* * Grab status for time statistics. */ valid_status = 2038008: 90 10 00 18 mov %i0, %o0 203800c: 92 07 bf f8 add %fp, -8, %o1 2038010: 7f ff ff cc call 2037f40 <_Rate_monotonic_Get_status> 2038014: 94 07 bf f0 add %fp, -16, %o2 _Rate_monotonic_Get_status( the_period, &since_last_period, &executed ); if (!valid_status) 2038018: 80 8a 20 ff btst 0xff, %o0 203801c: 02 80 00 21 be 20380a0 <_Rate_monotonic_Update_statistics+0xb4> 2038020: c4 1f bf f0 ldd [ %fp + -16 ], %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2038024: 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 ) ) 2038028: c2 06 20 60 ld [ %i0 + 0x60 ], %g1 203802c: b6 87 40 03 addcc %i5, %g3, %i3 2038030: b4 47 00 02 addx %i4, %g2, %i2 2038034: 80 a0 40 02 cmp %g1, %g2 2038038: 04 80 00 1c ble 20380a8 <_Rate_monotonic_Update_statistics+0xbc> 203803c: f4 3e 20 70 std %i2, [ %i0 + 0x70 ] stats->min_cpu_time = executed; 2038040: c4 3e 20 60 std %g2, [ %i0 + 0x60 ] if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) ) 2038044: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 2038048: 80 a0 40 02 cmp %g1, %g2 203804c: 26 80 00 05 bl,a 2038060 <_Rate_monotonic_Update_statistics+0x74><== NEVER TAKEN 2038050: c4 3e 20 68 std %g2, [ %i0 + 0x68 ] <== NOT EXECUTED 2038054: 80 a0 40 02 cmp %g1, %g2 2038058: 22 80 00 28 be,a 20380f8 <_Rate_monotonic_Update_statistics+0x10c><== ALWAYS TAKEN 203805c: 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 ); 2038060: c4 1f bf f8 ldd [ %fp + -8 ], %g2 2038064: f8 1e 20 88 ldd [ %i0 + 0x88 ], %i4 if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) 2038068: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 203806c: b6 87 40 03 addcc %i5, %g3, %i3 2038070: b4 47 00 02 addx %i4, %g2, %i2 2038074: 80 a0 40 02 cmp %g1, %g2 2038078: 14 80 00 1b bg 20380e4 <_Rate_monotonic_Update_statistics+0xf8> 203807c: f4 3e 20 88 std %i2, [ %i0 + 0x88 ] 2038080: 80 a0 40 02 cmp %g1, %g2 2038084: 22 80 00 15 be,a 20380d8 <_Rate_monotonic_Update_statistics+0xec><== ALWAYS TAKEN 2038088: 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 ) ) 203808c: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED 2038090: 80 a0 40 02 cmp %g1, %g2 2038094: 16 80 00 1e bge 203810c <_Rate_monotonic_Update_statistics+0x120><== ALWAYS TAKEN 2038098: 01 00 00 00 nop stats->max_wall_time = since_last_period; 203809c: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] <== NOT EXECUTED 20380a0: 81 c7 e0 08 ret 20380a4: 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 ) ) 20380a8: 32 bf ff e8 bne,a 2038048 <_Rate_monotonic_Update_statistics+0x5c><== NEVER TAKEN 20380ac: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 <== NOT EXECUTED 20380b0: c2 06 20 64 ld [ %i0 + 0x64 ], %g1 20380b4: 80 a0 40 03 cmp %g1, %g3 20380b8: 28 bf ff e4 bleu,a 2038048 <_Rate_monotonic_Update_statistics+0x5c> 20380bc: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 stats->min_cpu_time = executed; 20380c0: 10 bf ff e1 b 2038044 <_Rate_monotonic_Update_statistics+0x58> 20380c4: c4 3e 20 60 std %g2, [ %i0 + 0x60 ] */ stats = &the_period->Statistics; stats->count++; if ( the_period->state == RATE_MONOTONIC_EXPIRED ) stats->missed_count++; 20380c8: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 20380cc: 82 00 60 01 inc %g1 20380d0: 10 bf ff ce b 2038008 <_Rate_monotonic_Update_statistics+0x1c> 20380d4: 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 ) ) 20380d8: 80 a0 40 03 cmp %g1, %g3 20380dc: 28 bf ff ed bleu,a 2038090 <_Rate_monotonic_Update_statistics+0xa4> 20380e0: 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 ) ) 20380e4: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 20380e8: 80 a0 40 02 cmp %g1, %g2 20380ec: 06 bf ff ec bl 203809c <_Rate_monotonic_Update_statistics+0xb0><== NEVER TAKEN 20380f0: c4 3e 20 78 std %g2, [ %i0 + 0x78 ] 20380f4: 30 80 00 06 b,a 203810c <_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 ) ) 20380f8: 80 a0 40 03 cmp %g1, %g3 20380fc: 3a bf ff da bcc,a 2038064 <_Rate_monotonic_Update_statistics+0x78> 2038100: c4 1f bf f8 ldd [ %fp + -8 ], %g2 stats->max_cpu_time = executed; 2038104: 10 bf ff d7 b 2038060 <_Rate_monotonic_Update_statistics+0x74> 2038108: 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 ) ) 203810c: 12 bf ff e5 bne 20380a0 <_Rate_monotonic_Update_statistics+0xb4><== NEVER TAKEN 2038110: 01 00 00 00 nop 2038114: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 2038118: 80 a0 40 03 cmp %g1, %g3 203811c: 2a bf ff e1 bcs,a 20380a0 <_Rate_monotonic_Update_statistics+0xb4> 2038120: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] 2038124: 30 bf ff df b,a 20380a0 <_Rate_monotonic_Update_statistics+0xb4> =============================================================================== 0200a60c <_Scheduler_CBS_Allocate>: #include void *_Scheduler_CBS_Allocate( Thread_Control *the_thread ) { 200a60c: 9d e3 bf a0 save %sp, -96, %sp void *sched; Scheduler_CBS_Per_thread *schinfo; sched = _Workspace_Allocate(sizeof(Scheduler_CBS_Per_thread)); 200a610: 40 00 07 3f call 200c30c <_Workspace_Allocate> 200a614: 90 10 20 1c mov 0x1c, %o0 if ( sched ) { 200a618: 80 a2 20 00 cmp %o0, 0 200a61c: 02 80 00 06 be 200a634 <_Scheduler_CBS_Allocate+0x28> <== NEVER TAKEN 200a620: 82 10 20 02 mov 2, %g1 the_thread->scheduler_info = sched; 200a624: d0 26 20 88 st %o0, [ %i0 + 0x88 ] schinfo = (Scheduler_CBS_Per_thread *)(the_thread->scheduler_info); schinfo->edf_per_thread.thread = the_thread; 200a628: f0 22 00 00 st %i0, [ %o0 ] schinfo->edf_per_thread.queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN; 200a62c: c2 22 20 14 st %g1, [ %o0 + 0x14 ] schinfo->cbs_server = NULL; 200a630: c0 22 20 18 clr [ %o0 + 0x18 ] } return sched; } 200a634: 81 c7 e0 08 ret 200a638: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200b9e0 <_Scheduler_CBS_Budget_callout>: Scheduler_CBS_Server **_Scheduler_CBS_Server_list; void _Scheduler_CBS_Budget_callout( Thread_Control *the_thread ) { 200b9e0: 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; 200b9e4: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 200b9e8: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200b9ec: 80 a0 40 09 cmp %g1, %o1 200b9f0: 32 80 00 02 bne,a 200b9f8 <_Scheduler_CBS_Budget_callout+0x18><== ALWAYS TAKEN 200b9f4: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 200b9f8: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200b9fc: 80 a0 40 09 cmp %g1, %o1 200ba00: 02 80 00 04 be 200ba10 <_Scheduler_CBS_Budget_callout+0x30><== NEVER TAKEN 200ba04: 90 10 00 18 mov %i0, %o0 _Thread_Change_priority(the_thread, new_priority, true); 200ba08: 40 00 01 92 call 200c050 <_Thread_Change_priority> 200ba0c: 94 10 20 01 mov 1, %o2 /* Invoke callback function if any. */ sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; 200ba10: fa 06 20 88 ld [ %i0 + 0x88 ], %i5 if ( sched_info->cbs_server->cbs_budget_overrun ) { 200ba14: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200ba18: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200ba1c: 80 a0 a0 00 cmp %g2, 0 200ba20: 02 80 00 09 be 200ba44 <_Scheduler_CBS_Budget_callout+0x64><== NEVER TAKEN 200ba24: 01 00 00 00 nop _Scheduler_CBS_Get_server_id( 200ba28: d0 00 40 00 ld [ %g1 ], %o0 200ba2c: 7f ff ff d5 call 200b980 <_Scheduler_CBS_Get_server_id> 200ba30: 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 ); 200ba34: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200ba38: c2 00 60 0c ld [ %g1 + 0xc ], %g1 200ba3c: 9f c0 40 00 call %g1 200ba40: d0 07 bf fc ld [ %fp + -4 ], %o0 200ba44: 81 c7 e0 08 ret 200ba48: 81 e8 00 00 restore =============================================================================== 0200b538 <_Scheduler_CBS_Cleanup>: #include #include #include int _Scheduler_CBS_Cleanup (void) { 200b538: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b53c: 39 00 80 83 sethi %hi(0x2020c00), %i4 200b540: c2 07 22 c0 ld [ %i4 + 0x2c0 ], %g1 ! 2020ec0 <_Scheduler_CBS_Maximum_servers> 200b544: 80 a0 60 00 cmp %g1, 0 200b548: 02 80 00 18 be 200b5a8 <_Scheduler_CBS_Cleanup+0x70> <== NEVER TAKEN 200b54c: 03 00 80 88 sethi %hi(0x2022000), %g1 200b550: 37 00 80 88 sethi %hi(0x2022000), %i3 200b554: c4 06 e0 a8 ld [ %i3 + 0xa8 ], %g2 ! 20220a8 <_Scheduler_CBS_Server_list> 200b558: ba 10 20 00 clr %i5 200b55c: b8 17 22 c0 or %i4, 0x2c0, %i4 if ( _Scheduler_CBS_Server_list[ i ] ) 200b560: 83 2f 60 02 sll %i5, 2, %g1 200b564: c2 00 80 01 ld [ %g2 + %g1 ], %g1 200b568: 80 a0 60 00 cmp %g1, 0 200b56c: 02 80 00 05 be 200b580 <_Scheduler_CBS_Cleanup+0x48> 200b570: 90 10 00 1d mov %i5, %o0 _Scheduler_CBS_Destroy_server( i ); 200b574: 40 00 00 46 call 200b68c <_Scheduler_CBS_Destroy_server> 200b578: 01 00 00 00 nop 200b57c: c4 06 e0 a8 ld [ %i3 + 0xa8 ], %g2 int _Scheduler_CBS_Cleanup (void) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b580: c2 07 00 00 ld [ %i4 ], %g1 200b584: ba 07 60 01 inc %i5 200b588: 80 a0 40 1d cmp %g1, %i5 200b58c: 18 bf ff f6 bgu 200b564 <_Scheduler_CBS_Cleanup+0x2c> 200b590: 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; } 200b594: 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 ); 200b598: 40 00 08 6f call 200d754 <_Workspace_Free> 200b59c: 90 10 00 02 mov %g2, %o0 return SCHEDULER_CBS_OK; } 200b5a0: 81 c7 e0 08 ret 200b5a4: 81 e8 00 00 restore 200b5a8: 10 bf ff fb b 200b594 <_Scheduler_CBS_Cleanup+0x5c> <== NOT EXECUTED 200b5ac: c4 00 60 a8 ld [ %g1 + 0xa8 ], %g2 <== NOT EXECUTED =============================================================================== 0200b5b0 <_Scheduler_CBS_Create_server>: int _Scheduler_CBS_Create_server ( Scheduler_CBS_Parameters *params, Scheduler_CBS_Budget_overrun budget_overrun_callback, rtems_id *server_id ) { 200b5b0: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; Scheduler_CBS_Server *the_server; if ( params->budget <= 0 || 200b5b4: c2 06 20 04 ld [ %i0 + 4 ], %g1 200b5b8: 80 a0 60 00 cmp %g1, 0 200b5bc: 04 80 00 30 ble 200b67c <_Scheduler_CBS_Create_server+0xcc> 200b5c0: b8 10 00 18 mov %i0, %i4 200b5c4: c2 06 00 00 ld [ %i0 ], %g1 200b5c8: 80 a0 60 00 cmp %g1, 0 200b5cc: 04 80 00 2c ble 200b67c <_Scheduler_CBS_Create_server+0xcc> 200b5d0: 03 00 80 83 sethi %hi(0x2020c00), %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++ ) { 200b5d4: c8 00 62 c0 ld [ %g1 + 0x2c0 ], %g4 ! 2020ec0 <_Scheduler_CBS_Maximum_servers> 200b5d8: 80 a1 20 00 cmp %g4, 0 200b5dc: 02 80 00 11 be 200b620 <_Scheduler_CBS_Create_server+0x70><== NEVER TAKEN 200b5e0: 37 00 80 88 sethi %hi(0x2022000), %i3 if ( !_Scheduler_CBS_Server_list[i] ) 200b5e4: fa 06 e0 a8 ld [ %i3 + 0xa8 ], %i5 ! 20220a8 <_Scheduler_CBS_Server_list> 200b5e8: c2 07 40 00 ld [ %i5 ], %g1 200b5ec: 80 a0 60 00 cmp %g1, 0 200b5f0: 02 80 00 21 be 200b674 <_Scheduler_CBS_Create_server+0xc4> 200b5f4: b0 10 20 00 clr %i0 200b5f8: 10 80 00 06 b 200b610 <_Scheduler_CBS_Create_server+0x60> 200b5fc: 82 10 20 00 clr %g1 200b600: c6 07 40 02 ld [ %i5 + %g2 ], %g3 200b604: 80 a0 e0 00 cmp %g3, 0 200b608: 02 80 00 08 be 200b628 <_Scheduler_CBS_Create_server+0x78> 200b60c: 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++ ) { 200b610: 82 00 60 01 inc %g1 200b614: 80 a0 40 04 cmp %g1, %g4 200b618: 12 bf ff fa bne 200b600 <_Scheduler_CBS_Create_server+0x50> 200b61c: 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; 200b620: 81 c7 e0 08 ret 200b624: 91 e8 3f e6 restore %g0, -26, %o0 *server_id = i; 200b628: c2 26 80 00 st %g1, [ %i2 ] _Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *) _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); 200b62c: 40 00 08 42 call 200d734 <_Workspace_Allocate> 200b630: 90 10 20 10 mov 0x10, %o0 the_server = _Scheduler_CBS_Server_list[*server_id]; 200b634: 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 *) 200b638: d0 27 40 18 st %o0, [ %i5 + %i0 ] _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; 200b63c: c4 06 e0 a8 ld [ %i3 + 0xa8 ], %g2 200b640: 83 28 60 02 sll %g1, 2, %g1 200b644: c2 00 80 01 ld [ %g2 + %g1 ], %g1 if ( !the_server ) 200b648: 80 a0 60 00 cmp %g1, 0 200b64c: 02 80 00 0e be 200b684 <_Scheduler_CBS_Create_server+0xd4><== NEVER TAKEN 200b650: 86 10 3f ff mov -1, %g3 return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 200b654: c4 07 00 00 ld [ %i4 ], %g2 200b658: c4 20 60 04 st %g2, [ %g1 + 4 ] 200b65c: c4 07 20 04 ld [ %i4 + 4 ], %g2 the_server->task_id = -1; 200b660: 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; 200b664: c4 20 60 08 st %g2, [ %g1 + 8 ] the_server->task_id = -1; the_server->cbs_budget_overrun = budget_overrun_callback; 200b668: f2 20 60 0c st %i1, [ %g1 + 0xc ] return SCHEDULER_CBS_OK; 200b66c: 81 c7 e0 08 ret 200b670: 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] ) 200b674: 10 bf ff ed b 200b628 <_Scheduler_CBS_Create_server+0x78> 200b678: 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; 200b67c: 81 c7 e0 08 ret 200b680: 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; } 200b684: 81 c7 e0 08 ret <== NOT EXECUTED 200b688: 91 e8 3f ef restore %g0, -17, %o0 <== NOT EXECUTED =============================================================================== 0200b70c <_Scheduler_CBS_Detach_thread>: int _Scheduler_CBS_Detach_thread ( Scheduler_CBS_Server_id server_id, rtems_id task_id ) { 200b70c: 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); 200b710: 92 07 bf fc add %fp, -4, %o1 200b714: 40 00 03 ad call 200c5c8 <_Thread_Get> 200b718: 90 10 00 19 mov %i1, %o0 /* The routine _Thread_Get may disable dispatch and not enable again. */ if ( the_thread ) { 200b71c: ba 92 20 00 orcc %o0, 0, %i5 200b720: 02 80 00 1e be 200b798 <_Scheduler_CBS_Detach_thread+0x8c> 200b724: 01 00 00 00 nop _Thread_Enable_dispatch(); 200b728: 40 00 03 9c call 200c598 <_Thread_Enable_dispatch> 200b72c: 01 00 00 00 nop } if ( server_id >= _Scheduler_CBS_Maximum_servers ) 200b730: 03 00 80 83 sethi %hi(0x2020c00), %g1 200b734: c2 00 62 c0 ld [ %g1 + 0x2c0 ], %g1 ! 2020ec0 <_Scheduler_CBS_Maximum_servers> 200b738: 80 a6 00 01 cmp %i0, %g1 200b73c: 1a 80 00 17 bcc 200b798 <_Scheduler_CBS_Detach_thread+0x8c> 200b740: 03 00 80 88 sethi %hi(0x2022000), %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] ) 200b744: c2 00 60 a8 ld [ %g1 + 0xa8 ], %g1 ! 20220a8 <_Scheduler_CBS_Server_list> 200b748: b1 2e 20 02 sll %i0, 2, %i0 200b74c: c2 00 40 18 ld [ %g1 + %i0 ], %g1 200b750: 80 a0 60 00 cmp %g1, 0 200b754: 02 80 00 13 be 200b7a0 <_Scheduler_CBS_Detach_thread+0x94> 200b758: 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 ) 200b75c: c4 00 40 00 ld [ %g1 ], %g2 200b760: 80 a0 80 19 cmp %g2, %i1 200b764: 12 80 00 0d bne 200b798 <_Scheduler_CBS_Detach_thread+0x8c><== NEVER TAKEN 200b768: 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; 200b76c: c8 07 60 88 ld [ %i5 + 0x88 ], %g4 the_thread->budget_algorithm = the_thread->Start.budget_algorithm; 200b770: 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; 200b774: 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; 200b778: c4 07 60 a4 ld [ %i5 + 0xa4 ], %g2 the_thread->is_preemptible = the_thread->Start.is_preemptible; 200b77c: 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; 200b780: c0 21 20 18 clr [ %g4 + 0x18 ] the_thread->budget_algorithm = the_thread->Start.budget_algorithm; 200b784: c6 27 60 78 st %g3, [ %i5 + 0x78 ] the_thread->budget_callout = the_thread->Start.budget_callout; 200b788: c4 27 60 7c st %g2, [ %i5 + 0x7c ] the_thread->is_preemptible = the_thread->Start.is_preemptible; 200b78c: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ] return SCHEDULER_CBS_OK; 200b790: 81 c7 e0 08 ret 200b794: 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; 200b798: 81 c7 e0 08 ret 200b79c: 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; } 200b7a0: 81 c7 e0 08 ret 200b7a4: 91 e8 3f e7 restore %g0, -25, %o0 =============================================================================== 0200b980 <_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++ ) { 200b980: 03 00 80 83 sethi %hi(0x2020c00), %g1 200b984: c6 00 62 c0 ld [ %g1 + 0x2c0 ], %g3 ! 2020ec0 <_Scheduler_CBS_Maximum_servers> 200b988: 80 a0 e0 00 cmp %g3, 0 200b98c: 02 80 00 11 be 200b9d0 <_Scheduler_CBS_Get_server_id+0x50><== NEVER TAKEN 200b990: 03 00 80 88 sethi %hi(0x2022000), %g1 200b994: c8 00 60 a8 ld [ %g1 + 0xa8 ], %g4 ! 20220a8 <_Scheduler_CBS_Server_list> 200b998: 82 10 20 00 clr %g1 #include #include #include #include int _Scheduler_CBS_Get_server_id ( 200b99c: 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] && 200b9a0: c4 01 00 02 ld [ %g4 + %g2 ], %g2 200b9a4: 80 a0 a0 00 cmp %g2, 0 200b9a8: 22 80 00 07 be,a 200b9c4 <_Scheduler_CBS_Get_server_id+0x44> 200b9ac: 82 00 60 01 inc %g1 200b9b0: c4 00 80 00 ld [ %g2 ], %g2 200b9b4: 80 a0 80 08 cmp %g2, %o0 200b9b8: 22 80 00 08 be,a 200b9d8 <_Scheduler_CBS_Get_server_id+0x58> 200b9bc: 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++ ) { 200b9c0: 82 00 60 01 inc %g1 200b9c4: 80 a0 40 03 cmp %g1, %g3 200b9c8: 12 bf ff f6 bne 200b9a0 <_Scheduler_CBS_Get_server_id+0x20> 200b9cc: 85 28 60 02 sll %g1, 2, %g2 *server_id = i; return SCHEDULER_CBS_OK; } } return SCHEDULER_CBS_ERROR_NOSERVER; } 200b9d0: 81 c3 e0 08 retl 200b9d4: 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; 200b9d8: 81 c3 e0 08 retl 200b9dc: 90 10 20 00 clr %o0 =============================================================================== 0200ba4c <_Scheduler_CBS_Initialize>: } } int _Scheduler_CBS_Initialize(void) { 200ba4c: 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*) ); 200ba50: 3b 00 80 83 sethi %hi(0x2020c00), %i5 200ba54: d0 07 62 c0 ld [ %i5 + 0x2c0 ], %o0 ! 2020ec0 <_Scheduler_CBS_Maximum_servers> } int _Scheduler_CBS_Initialize(void) { unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( 200ba58: 40 00 07 37 call 200d734 <_Workspace_Allocate> 200ba5c: 91 2a 20 02 sll %o0, 2, %o0 200ba60: 09 00 80 88 sethi %hi(0x2022000), %g4 _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) 200ba64: 80 a2 20 00 cmp %o0, 0 200ba68: 02 80 00 10 be 200baa8 <_Scheduler_CBS_Initialize+0x5c> <== NEVER TAKEN 200ba6c: d0 21 20 a8 st %o0, [ %g4 + 0xa8 ] return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { 200ba70: c6 07 62 c0 ld [ %i5 + 0x2c0 ], %g3 200ba74: 80 a0 e0 00 cmp %g3, 0 200ba78: 12 80 00 05 bne 200ba8c <_Scheduler_CBS_Initialize+0x40> <== ALWAYS TAKEN 200ba7c: 82 10 20 00 clr %g1 _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; 200ba80: 81 c7 e0 08 ret <== NOT EXECUTED 200ba84: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED 200ba88: d0 01 20 a8 ld [ %g4 + 0xa8 ], %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; 200ba8c: 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++) { 200ba90: 82 00 60 01 inc %g1 200ba94: 80 a0 40 03 cmp %g1, %g3 200ba98: 12 bf ff fc bne 200ba88 <_Scheduler_CBS_Initialize+0x3c> 200ba9c: c0 22 00 02 clr [ %o0 + %g2 ] _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; 200baa0: 81 c7 e0 08 ret 200baa4: 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; 200baa8: 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; } 200baac: 81 c7 e0 08 ret <== NOT EXECUTED 200bab0: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200a63c <_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; 200a63c: c2 02 20 88 ld [ %o0 + 0x88 ], %g1 if (deadline) { 200a640: 80 a2 60 00 cmp %o1, 0 200a644: 02 80 00 11 be 200a688 <_Scheduler_CBS_Release_job+0x4c> 200a648: c2 00 60 18 ld [ %g1 + 0x18 ], %g1 /* Initializing or shifting deadline. */ if (serv_info) 200a64c: 80 a0 60 00 cmp %g1, 0 200a650: 02 80 00 13 be 200a69c <_Scheduler_CBS_Release_job+0x60> 200a654: 07 00 80 80 sethi %hi(0x2020000), %g3 new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline) 200a658: c4 00 60 04 ld [ %g1 + 4 ], %g2 200a65c: d2 00 e0 7c ld [ %g3 + 0x7c ], %o1 200a660: 92 02 40 02 add %o1, %g2, %o1 200a664: 05 20 00 00 sethi %hi(0x80000000), %g2 200a668: 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; 200a66c: c2 00 60 08 ld [ %g1 + 8 ], %g1 200a670: c2 22 20 74 st %g1, [ %o0 + 0x74 ] the_thread->real_priority = new_priority; 200a674: d2 22 20 18 st %o1, [ %o0 + 0x18 ] _Thread_Change_priority(the_thread, new_priority, true); 200a678: 94 10 20 01 mov 1, %o2 200a67c: 82 13 c0 00 mov %o7, %g1 200a680: 40 00 01 3a call 200ab68 <_Thread_Change_priority> 200a684: 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) 200a688: 80 a0 60 00 cmp %g1, 0 200a68c: 12 bf ff f8 bne 200a66c <_Scheduler_CBS_Release_job+0x30> <== ALWAYS TAKEN 200a690: d2 02 20 ac ld [ %o0 + 0xac ], %o1 the_thread->cpu_time_budget = serv_info->parameters.budget; the_thread->real_priority = new_priority; 200a694: 10 bf ff f9 b 200a678 <_Scheduler_CBS_Release_job+0x3c> <== NOT EXECUTED 200a698: 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) 200a69c: 03 00 80 80 sethi %hi(0x2020000), %g1 200a6a0: c2 00 60 7c ld [ %g1 + 0x7c ], %g1 ! 202007c <_Watchdog_Ticks_since_boot> 200a6a4: 92 02 40 01 add %o1, %g1, %o1 200a6a8: 03 20 00 00 sethi %hi(0x80000000), %g1 200a6ac: 10 bf ff f2 b 200a674 <_Scheduler_CBS_Release_job+0x38> 200a6b0: 92 2a 40 01 andn %o1, %g1, %o1 =============================================================================== 0200a6b4 <_Scheduler_CBS_Unblock>: #include void _Scheduler_CBS_Unblock( Thread_Control *the_thread ) { 200a6b4: 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); 200a6b8: 40 00 00 50 call 200a7f8 <_Scheduler_EDF_Enqueue> 200a6bc: 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; 200a6c0: c2 06 20 88 ld [ %i0 + 0x88 ], %g1 200a6c4: 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) { 200a6c8: 80 a7 60 00 cmp %i5, 0 200a6cc: 02 80 00 19 be 200a730 <_Scheduler_CBS_Unblock+0x7c> 200a6d0: 03 00 80 80 sethi %hi(0x2020000), %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 ) { 200a6d4: 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 - 200a6d8: d0 00 60 7c ld [ %g1 + 0x7c ], %o0 200a6dc: f8 06 20 18 ld [ %i0 + 0x18 ], %i4 _Watchdog_Ticks_since_boot; if ( deadline*budget_left > budget*deadline_left ) { 200a6e0: 40 00 41 03 call 201aaec <.umul> 200a6e4: 90 27 00 08 sub %i4, %o0, %o0 200a6e8: d2 06 20 74 ld [ %i0 + 0x74 ], %o1 200a6ec: b6 10 00 08 mov %o0, %i3 200a6f0: 40 00 40 ff call 201aaec <.umul> 200a6f4: d0 07 60 08 ld [ %i5 + 8 ], %o0 200a6f8: 80 a6 c0 08 cmp %i3, %o0 200a6fc: 24 80 00 0e ble,a 200a734 <_Scheduler_CBS_Unblock+0x80> 200a700: 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; 200a704: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 200a708: 80 a7 00 09 cmp %i4, %o1 200a70c: 32 80 00 02 bne,a 200a714 <_Scheduler_CBS_Unblock+0x60> 200a710: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 200a714: d0 06 20 14 ld [ %i0 + 0x14 ], %o0 200a718: 80 a2 00 09 cmp %o0, %o1 200a71c: 02 80 00 07 be 200a738 <_Scheduler_CBS_Unblock+0x84> 200a720: 3b 00 80 81 sethi %hi(0x2020400), %i5 _Thread_Change_priority(the_thread, new_priority, true); 200a724: 90 10 00 18 mov %i0, %o0 200a728: 40 00 01 10 call 200ab68 <_Thread_Change_priority> 200a72c: 94 10 20 01 mov 1, %o2 200a730: 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, 200a734: 3b 00 80 81 sethi %hi(0x2020400), %i5 200a738: ba 17 60 b0 or %i5, 0xb0, %i5 ! 20204b0 <_Per_CPU_Information> 200a73c: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200a740: d2 00 60 14 ld [ %g1 + 0x14 ], %o1 200a744: 03 00 80 7c sethi %hi(0x201f000), %g1 200a748: c2 00 63 24 ld [ %g1 + 0x324 ], %g1 ! 201f324 <_Scheduler+0x30> 200a74c: 9f c0 40 00 call %g1 200a750: 01 00 00 00 nop 200a754: 80 a2 20 00 cmp %o0, 0 200a758: 04 80 00 0a ble 200a780 <_Scheduler_CBS_Unblock+0xcc> 200a75c: 01 00 00 00 nop _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 200a760: 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; 200a764: f0 27 60 14 st %i0, [ %i5 + 0x14 ] if ( _Thread_Executing->is_preemptible || 200a768: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 200a76c: 80 a0 60 00 cmp %g1, 0 200a770: 22 80 00 06 be,a 200a788 <_Scheduler_CBS_Unblock+0xd4> 200a774: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a778: 82 10 20 01 mov 1, %g1 200a77c: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] 200a780: 81 c7 e0 08 ret 200a784: 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 || 200a788: 80 a0 60 00 cmp %g1, 0 200a78c: 12 bf ff fd bne 200a780 <_Scheduler_CBS_Unblock+0xcc> <== ALWAYS TAKEN 200a790: 82 10 20 01 mov 1, %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a794: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] <== NOT EXECUTED 200a798: 30 bf ff fa b,a 200a780 <_Scheduler_CBS_Unblock+0xcc> <== NOT EXECUTED =============================================================================== 0200a60c <_Scheduler_EDF_Allocate>: #include void *_Scheduler_EDF_Allocate( Thread_Control *the_thread ) { 200a60c: 9d e3 bf a0 save %sp, -96, %sp void *sched; Scheduler_EDF_Per_thread *schinfo; sched = _Workspace_Allocate( sizeof(Scheduler_EDF_Per_thread) ); 200a610: 40 00 07 16 call 200c268 <_Workspace_Allocate> 200a614: 90 10 20 18 mov 0x18, %o0 if ( sched ) { 200a618: 80 a2 20 00 cmp %o0, 0 200a61c: 02 80 00 05 be 200a630 <_Scheduler_EDF_Allocate+0x24> <== NEVER TAKEN 200a620: 82 10 20 02 mov 2, %g1 the_thread->scheduler_info = sched; 200a624: d0 26 20 88 st %o0, [ %i0 + 0x88 ] schinfo = (Scheduler_EDF_Per_thread *)(the_thread->scheduler_info); schinfo->thread = the_thread; 200a628: f0 22 00 00 st %i0, [ %o0 ] schinfo->queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN; 200a62c: c2 22 20 14 st %g1, [ %o0 + 0x14 ] } return sched; } 200a630: 81 c7 e0 08 ret 200a634: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200a7f0 <_Scheduler_EDF_Unblock>: #include void _Scheduler_EDF_Unblock( Thread_Control *the_thread ) { 200a7f0: 9d e3 bf a0 save %sp, -96, %sp _Scheduler_EDF_Enqueue(the_thread); 200a7f4: 7f ff ff a8 call 200a694 <_Scheduler_EDF_Enqueue> 200a7f8: 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( 200a7fc: 3b 00 80 80 sethi %hi(0x2020000), %i5 200a800: ba 17 63 f0 or %i5, 0x3f0, %i5 ! 20203f0 <_Per_CPU_Information> 200a804: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200a808: d0 00 60 14 ld [ %g1 + 0x14 ], %o0 200a80c: 03 00 80 7c sethi %hi(0x201f000), %g1 200a810: c2 00 62 74 ld [ %g1 + 0x274 ], %g1 ! 201f274 <_Scheduler+0x30> 200a814: 9f c0 40 00 call %g1 200a818: d2 06 20 14 ld [ %i0 + 0x14 ], %o1 200a81c: 80 a2 20 00 cmp %o0, 0 200a820: 26 80 00 04 bl,a 200a830 <_Scheduler_EDF_Unblock+0x40> 200a824: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200a828: 81 c7 e0 08 ret 200a82c: 81 e8 00 00 restore _Thread_Heir->current_priority, the_thread->current_priority )) { _Thread_Heir = the_thread; 200a830: f0 27 60 14 st %i0, [ %i5 + 0x14 ] if ( _Thread_Executing->is_preemptible || 200a834: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 200a838: 80 a0 60 00 cmp %g1, 0 200a83c: 22 80 00 06 be,a 200a854 <_Scheduler_EDF_Unblock+0x64> 200a840: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a844: 82 10 20 01 mov 1, %g1 200a848: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] 200a84c: 81 c7 e0 08 ret 200a850: 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 || 200a854: 80 a0 60 00 cmp %g1, 0 200a858: 12 bf ff f4 bne 200a828 <_Scheduler_EDF_Unblock+0x38> <== ALWAYS TAKEN 200a85c: 82 10 20 01 mov 1, %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a860: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] <== NOT EXECUTED 200a864: 30 bf ff fa b,a 200a84c <_Scheduler_EDF_Unblock+0x5c> <== NOT EXECUTED =============================================================================== 02009f60 <_Scheduler_priority_Tick>: #include #include void _Scheduler_priority_Tick( void ) { 2009f60: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *executing; executing = _Thread_Executing; 2009f64: 03 00 80 7a sethi %hi(0x201e800), %g1 2009f68: d0 00 60 50 ld [ %g1 + 0x50 ], %o0 ! 201e850 <_Per_CPU_Information+0x10> /* * If the thread is not preemptible or is not ready, then * just return. */ if ( !executing->is_preemptible ) 2009f6c: c2 0a 20 70 ldub [ %o0 + 0x70 ], %g1 2009f70: 80 a0 60 00 cmp %g1, 0 2009f74: 02 80 00 26 be 200a00c <_Scheduler_priority_Tick+0xac> 2009f78: 01 00 00 00 nop return; if ( !_States_Is_ready( executing->current_state ) ) 2009f7c: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 2009f80: 80 a0 60 00 cmp %g1, 0 2009f84: 12 80 00 22 bne 200a00c <_Scheduler_priority_Tick+0xac> 2009f88: 01 00 00 00 nop /* * The cpu budget algorithm determines what happens next. */ switch ( executing->budget_algorithm ) { 2009f8c: c2 02 20 78 ld [ %o0 + 0x78 ], %g1 2009f90: 80 a0 60 01 cmp %g1, 1 2009f94: 0a 80 00 07 bcs 2009fb0 <_Scheduler_priority_Tick+0x50> 2009f98: 80 a0 60 02 cmp %g1, 2 2009f9c: 28 80 00 10 bleu,a 2009fdc <_Scheduler_priority_Tick+0x7c> 2009fa0: c2 02 20 74 ld [ %o0 + 0x74 ], %g1 2009fa4: 80 a0 60 03 cmp %g1, 3 2009fa8: 22 80 00 04 be,a 2009fb8 <_Scheduler_priority_Tick+0x58> <== ALWAYS TAKEN 2009fac: c2 02 20 74 ld [ %o0 + 0x74 ], %g1 2009fb0: 81 c7 e0 08 ret 2009fb4: 81 e8 00 00 restore } break; #if defined(RTEMS_SCORE_THREAD_ENABLE_SCHEDULER_CALLOUT) case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: if ( --executing->cpu_time_budget == 0 ) 2009fb8: 82 00 7f ff add %g1, -1, %g1 2009fbc: 80 a0 60 00 cmp %g1, 0 2009fc0: 12 bf ff fc bne 2009fb0 <_Scheduler_priority_Tick+0x50> 2009fc4: c2 22 20 74 st %g1, [ %o0 + 0x74 ] (*executing->budget_callout)( executing ); 2009fc8: c2 02 20 7c ld [ %o0 + 0x7c ], %g1 2009fcc: 9f c0 40 00 call %g1 2009fd0: 01 00 00 00 nop 2009fd4: 81 c7 e0 08 ret 2009fd8: 81 e8 00 00 restore case THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE: #if defined(RTEMS_SCORE_THREAD_ENABLE_EXHAUST_TIMESLICE) case THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE: #endif if ( (int)(--executing->cpu_time_budget) <= 0 ) { 2009fdc: 82 00 7f ff add %g1, -1, %g1 2009fe0: 80 a0 60 00 cmp %g1, 0 2009fe4: 14 bf ff f3 bg 2009fb0 <_Scheduler_priority_Tick+0x50> 2009fe8: c2 22 20 74 st %g1, [ %o0 + 0x74 ] * always operates on the scheduler that 'owns' the currently executing * thread. */ RTEMS_INLINE_ROUTINE void _Scheduler_Yield( void ) { _Scheduler.Operations.yield(); 2009fec: 03 00 80 75 sethi %hi(0x201d400), %g1 2009ff0: c2 00 63 10 ld [ %g1 + 0x310 ], %g1 ! 201d710 <_Scheduler+0xc> 2009ff4: 9f c0 40 00 call %g1 2009ff8: d0 27 bf fc st %o0, [ %fp + -4 ] * executing thread's timeslice is reset. Otherwise, the * currently executing thread is placed at the rear of the * FIFO for this priority and a new heir is selected. */ _Scheduler_Yield(); executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 2009ffc: 03 00 80 78 sethi %hi(0x201e000), %g1 200a000: d0 07 bf fc ld [ %fp + -4 ], %o0 200a004: c2 00 62 80 ld [ %g1 + 0x280 ], %g1 200a008: c2 22 20 74 st %g1, [ %o0 + 0x74 ] 200a00c: 81 c7 e0 08 ret 200a010: 81 e8 00 00 restore =============================================================================== 0200a808 <_Scheduler_simple_Ready_queue_enqueue_first>: { Chain_Control *ready; Chain_Node *the_node; Thread_Control *current; ready = (Chain_Control *)_Scheduler.information; 200a808: 03 00 80 79 sethi %hi(0x201e400), %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200a80c: c2 00 63 04 ld [ %g1 + 0x304 ], %g1 ! 201e704 <_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 ) { 200a810: c6 02 20 14 ld [ %o0 + 0x14 ], %g3 200a814: c2 00 40 00 ld [ %g1 ], %g1 200a818: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 200a81c: 80 a0 80 03 cmp %g2, %g3 200a820: 3a 80 00 08 bcc,a 200a840 <_Scheduler_simple_Ready_queue_enqueue_first+0x38> 200a824: 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 ) { 200a828: 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 ) { 200a82c: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 200a830: 80 a0 80 03 cmp %g2, %g3 200a834: 2a bf ff fe bcs,a 200a82c <_Scheduler_simple_Ready_queue_enqueue_first+0x24><== NEVER TAKEN 200a838: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED current = (Thread_Control *)current->Object.Node.previous; 200a83c: c2 00 60 04 ld [ %g1 + 4 ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 200a840: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 200a844: c2 22 20 04 st %g1, [ %o0 + 4 ] before_node = after_node->next; after_node->next = the_node; 200a848: d0 20 40 00 st %o0, [ %g1 ] the_node->next = before_node; 200a84c: c4 22 00 00 st %g2, [ %o0 ] before_node->previous = the_node; 200a850: 81 c3 e0 08 retl 200a854: d0 20 a0 04 st %o0, [ %g2 + 4 ] =============================================================================== 02008808 <_TOD_Validate>: }; bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 2008808: 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(); 200880c: 03 00 80 75 sethi %hi(0x201d400), %g1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 2008810: d2 00 63 2c ld [ %g1 + 0x32c ], %o1 ! 201d72c 2008814: 11 00 03 d0 sethi %hi(0xf4000), %o0 2008818: 40 00 4a d8 call 201b378 <.udiv> 200881c: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 2008820: 80 a6 20 00 cmp %i0, 0 2008824: 02 80 00 2c be 20088d4 <_TOD_Validate+0xcc> <== NEVER TAKEN 2008828: 82 10 20 00 clr %g1 200882c: c4 06 20 18 ld [ %i0 + 0x18 ], %g2 2008830: 80 a2 00 02 cmp %o0, %g2 2008834: 28 80 00 26 bleu,a 20088cc <_TOD_Validate+0xc4> 2008838: b0 08 60 01 and %g1, 1, %i0 (the_tod->ticks >= ticks_per_second) || 200883c: c4 06 20 14 ld [ %i0 + 0x14 ], %g2 2008840: 80 a0 a0 3b cmp %g2, 0x3b 2008844: 38 80 00 22 bgu,a 20088cc <_TOD_Validate+0xc4> 2008848: b0 08 60 01 and %g1, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 200884c: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 2008850: 80 a0 a0 3b cmp %g2, 0x3b 2008854: 38 80 00 1e bgu,a 20088cc <_TOD_Validate+0xc4> 2008858: b0 08 60 01 and %g1, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 200885c: c4 06 20 0c ld [ %i0 + 0xc ], %g2 2008860: 80 a0 a0 17 cmp %g2, 0x17 2008864: 38 80 00 1a bgu,a 20088cc <_TOD_Validate+0xc4> 2008868: b0 08 60 01 and %g1, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 200886c: 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) || 2008870: 80 a0 a0 00 cmp %g2, 0 2008874: 02 80 00 15 be 20088c8 <_TOD_Validate+0xc0> <== NEVER TAKEN 2008878: 80 a0 a0 0c cmp %g2, 0xc (the_tod->month == 0) || 200887c: 38 80 00 14 bgu,a 20088cc <_TOD_Validate+0xc4> 2008880: b0 08 60 01 and %g1, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2008884: 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) || 2008888: 80 a0 e7 c3 cmp %g3, 0x7c3 200888c: 28 80 00 10 bleu,a 20088cc <_TOD_Validate+0xc4> 2008890: b0 08 60 01 and %g1, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 2008894: 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) || 2008898: 80 a1 20 00 cmp %g4, 0 200889c: 02 80 00 0b be 20088c8 <_TOD_Validate+0xc0> <== NEVER TAKEN 20088a0: 80 88 e0 03 btst 3, %g3 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 20088a4: 32 80 00 0f bne,a 20088e0 <_TOD_Validate+0xd8> 20088a8: 85 28 a0 02 sll %g2, 2, %g2 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 20088ac: 82 00 a0 0d add %g2, 0xd, %g1 20088b0: 05 00 80 7a sethi %hi(0x201e800), %g2 20088b4: 83 28 60 02 sll %g1, 2, %g1 20088b8: 84 10 a1 20 or %g2, 0x120, %g2 20088bc: 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 ) 20088c0: 80 a0 40 04 cmp %g1, %g4 20088c4: 82 60 3f ff subx %g0, -1, %g1 return false; return true; } 20088c8: b0 08 60 01 and %g1, 1, %i0 20088cc: 81 c7 e0 08 ret 20088d0: 81 e8 00 00 restore 20088d4: b0 08 60 01 and %g1, 1, %i0 <== NOT EXECUTED 20088d8: 81 c7 e0 08 ret <== NOT EXECUTED 20088dc: 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 ]; 20088e0: 03 00 80 7a sethi %hi(0x201e800), %g1 20088e4: 82 10 61 20 or %g1, 0x120, %g1 ! 201e920 <_TOD_Days_per_month> 20088e8: c2 00 40 02 ld [ %g1 + %g2 ], %g1 if ( the_tod->day > days_in_month ) 20088ec: 80 a0 40 04 cmp %g1, %g4 20088f0: 10 bf ff f6 b 20088c8 <_TOD_Validate+0xc0> 20088f4: 82 60 3f ff subx %g0, -1, %g1 =============================================================================== 0200a230 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 200a230: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 200a234: 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 ); 200a238: 40 00 03 c3 call 200b144 <_Thread_Set_transient> 200a23c: 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 ) 200a240: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200a244: 80 a0 40 19 cmp %g1, %i1 200a248: 02 80 00 05 be 200a25c <_Thread_Change_priority+0x2c> 200a24c: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 200a250: 90 10 00 18 mov %i0, %o0 200a254: 40 00 03 a2 call 200b0dc <_Thread_Set_priority> 200a258: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 200a25c: 7f ff e0 ec call 200260c 200a260: 01 00 00 00 nop 200a264: 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; 200a268: f8 07 60 10 ld [ %i5 + 0x10 ], %i4 if ( state != STATES_TRANSIENT ) { 200a26c: 80 a7 20 04 cmp %i4, 4 200a270: 02 80 00 18 be 200a2d0 <_Thread_Change_priority+0xa0> 200a274: 80 8e e0 04 btst 4, %i3 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 200a278: 02 80 00 0b be 200a2a4 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN 200a27c: 82 0f 3f fb and %i4, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 200a280: 7f ff e0 e7 call 200261c <== NOT EXECUTED 200a284: 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); 200a288: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 200a28c: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 200a290: 80 8f 00 01 btst %i4, %g1 <== NOT EXECUTED 200a294: 32 80 00 0d bne,a 200a2c8 <_Thread_Change_priority+0x98> <== NOT EXECUTED 200a298: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED 200a29c: 81 c7 e0 08 ret 200a2a0: 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 ); 200a2a4: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 200a2a8: 7f ff e0 dd call 200261c 200a2ac: 90 10 00 19 mov %i1, %o0 200a2b0: 03 00 00 ef sethi %hi(0x3bc00), %g1 200a2b4: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 200a2b8: 80 8f 00 01 btst %i4, %g1 200a2bc: 02 bf ff f8 be 200a29c <_Thread_Change_priority+0x6c> 200a2c0: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 200a2c4: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 200a2c8: 40 00 03 55 call 200b01c <_Thread_queue_Requeue> 200a2cc: 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 ) ) { 200a2d0: 22 80 00 19 be,a 200a334 <_Thread_Change_priority+0x104> <== ALWAYS TAKEN 200a2d4: c0 27 60 10 clr [ %i5 + 0x10 ] 200a2d8: 39 00 80 75 sethi %hi(0x201d400), %i4 <== NOT EXECUTED 200a2dc: b8 17 23 04 or %i4, 0x304, %i4 ! 201d704 <_Scheduler> <== NOT EXECUTED _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 200a2e0: 7f ff e0 cf call 200261c 200a2e4: 90 10 00 19 mov %i1, %o0 200a2e8: 7f ff e0 c9 call 200260c 200a2ec: 01 00 00 00 nop 200a2f0: 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(); 200a2f4: c2 07 20 08 ld [ %i4 + 8 ], %g1 200a2f8: 9f c0 40 00 call %g1 200a2fc: 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 ); 200a300: 03 00 80 7a sethi %hi(0x201e800), %g1 200a304: 82 10 60 40 or %g1, 0x40, %g1 ! 201e840 <_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() && 200a308: c4 18 60 10 ldd [ %g1 + 0x10 ], %g2 200a30c: 80 a0 80 03 cmp %g2, %g3 200a310: 02 80 00 07 be 200a32c <_Thread_Change_priority+0xfc> 200a314: 01 00 00 00 nop 200a318: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2 200a31c: 80 a0 a0 00 cmp %g2, 0 200a320: 02 80 00 03 be 200a32c <_Thread_Change_priority+0xfc> 200a324: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 200a328: c4 28 60 0c stb %g2, [ %g1 + 0xc ] _ISR_Enable( level ); 200a32c: 7f ff e0 bc call 200261c 200a330: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 200a334: 39 00 80 75 sethi %hi(0x201d400), %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 ) 200a338: 80 a6 a0 00 cmp %i2, 0 200a33c: 02 80 00 06 be 200a354 <_Thread_Change_priority+0x124> 200a340: b8 17 23 04 or %i4, 0x304, %i4 200a344: c2 07 20 28 ld [ %i4 + 0x28 ], %g1 200a348: 9f c0 40 00 call %g1 200a34c: 90 10 00 1d mov %i5, %o0 200a350: 30 bf ff e4 b,a 200a2e0 <_Thread_Change_priority+0xb0> */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 200a354: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 200a358: 9f c0 40 00 call %g1 200a35c: 90 10 00 1d mov %i5, %o0 200a360: 30 bf ff e0 b,a 200a2e0 <_Thread_Change_priority+0xb0> =============================================================================== 0200a574 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 200a574: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200a578: 90 10 00 18 mov %i0, %o0 200a57c: 40 00 00 8b call 200a7a8 <_Thread_Get> 200a580: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200a584: c2 07 bf fc ld [ %fp + -4 ], %g1 200a588: 80 a0 60 00 cmp %g1, 0 200a58c: 12 80 00 08 bne 200a5ac <_Thread_Delay_ended+0x38> <== NEVER TAKEN 200a590: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 200a594: 7f ff ff 74 call 200a364 <_Thread_Clear_state> 200a598: 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; 200a59c: 03 00 80 78 sethi %hi(0x201e000), %g1 200a5a0: c4 00 63 20 ld [ %g1 + 0x320 ], %g2 ! 201e320 <_Thread_Dispatch_disable_level> --level; 200a5a4: 84 00 bf ff add %g2, -1, %g2 _Thread_Dispatch_disable_level = level; 200a5a8: c4 20 63 20 st %g2, [ %g1 + 0x320 ] 200a5ac: 81 c7 e0 08 ret 200a5b0: 81 e8 00 00 restore =============================================================================== 0200a5b4 <_Thread_Dispatch>: #if defined(RTEMS_SMP) #include #endif void _Thread_Dispatch( void ) { 200a5b4: 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; 200a5b8: 35 00 80 7a sethi %hi(0x201e800), %i2 200a5bc: b4 16 a0 40 or %i2, 0x40, %i2 ! 201e840 <_Per_CPU_Information> _ISR_Disable( level ); 200a5c0: 7f ff e0 13 call 200260c 200a5c4: fa 06 a0 10 ld [ %i2 + 0x10 ], %i5 while ( _Thread_Dispatch_necessary == true ) { 200a5c8: c2 0e a0 0c ldub [ %i2 + 0xc ], %g1 200a5cc: 80 a0 60 00 cmp %g1, 0 200a5d0: 02 80 00 55 be 200a724 <_Thread_Dispatch+0x170> 200a5d4: 31 00 80 78 sethi %hi(0x201e000), %i0 heir = _Thread_Heir; 200a5d8: 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; 200a5dc: 82 10 20 01 mov 1, %g1 200a5e0: c2 26 23 20 st %g1, [ %i0 + 0x320 ] #ifndef RTEMS_SMP _Thread_Dispatch_set_disable_level( 1 ); #endif _Thread_Dispatch_necessary = false; 200a5e4: 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 ) 200a5e8: 80 a7 40 1c cmp %i5, %i4 200a5ec: 02 80 00 4e be 200a724 <_Thread_Dispatch+0x170> 200a5f0: f8 26 a0 10 st %i4, [ %i2 + 0x10 ] 200a5f4: 21 00 80 76 sethi %hi(0x201d800), %l0 200a5f8: 25 00 80 78 sethi %hi(0x201e000), %l2 200a5fc: a0 14 20 d8 or %l0, 0xd8, %l0 */ static inline void _TOD_Get_uptime( Timestamp_Control *time ) { _TOD_Get_with_nanoseconds( time, &_TOD.uptime ); 200a600: 23 00 80 78 sethi %hi(0x201e000), %l1 200a604: a4 14 a3 90 or %l2, 0x390, %l2 200a608: 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; 200a60c: 29 00 80 78 sethi %hi(0x201e000), %l4 200a610: a2 14 62 70 or %l1, 0x270, %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 ); 200a614: 33 00 80 78 sethi %hi(0x201e000), %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; 200a618: 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 ) 200a61c: c2 07 20 78 ld [ %i4 + 0x78 ], %g1 200a620: 80 a0 60 01 cmp %g1, 1 200a624: 02 80 00 53 be 200a770 <_Thread_Dispatch+0x1bc> 200a628: c2 05 22 80 ld [ %l4 + 0x280 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; _ISR_Enable( level ); 200a62c: 7f ff df fc call 200261c 200a630: 01 00 00 00 nop 200a634: 92 10 00 11 mov %l1, %o1 200a638: 7f ff f9 62 call 2008bc0 <_TOD_Get_with_nanoseconds> 200a63c: 90 07 bf f8 add %fp, -8, %o0 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 200a640: d8 1e a0 20 ldd [ %i2 + 0x20 ], %o4 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 200a644: c4 1f 60 80 ldd [ %i5 + 0x80 ], %g2 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 200a648: d4 1f bf f8 ldd [ %fp + -8 ], %o2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 200a64c: c2 04 80 00 ld [ %l2 ], %g1 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 200a650: 9a a2 c0 0d subcc %o3, %o5, %o5 200a654: 98 62 80 0c subx %o2, %o4, %o4 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 200a658: 92 80 c0 0d addcc %g3, %o5, %o1 200a65c: 90 40 80 0c addx %g2, %o4, %o0 200a660: d0 3f 60 80 std %o0, [ %i5 + 0x80 ] 200a664: 80 a0 60 00 cmp %g1, 0 200a668: 02 80 00 06 be 200a680 <_Thread_Dispatch+0xcc> <== NEVER TAKEN 200a66c: d4 3e a0 20 std %o2, [ %i2 + 0x20 ] executing->libc_reent = *_Thread_libc_reent; 200a670: c4 00 40 00 ld [ %g1 ], %g2 200a674: c4 27 61 54 st %g2, [ %i5 + 0x154 ] *_Thread_libc_reent = heir->libc_reent; 200a678: c4 07 21 54 ld [ %i4 + 0x154 ], %g2 200a67c: 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; 200a680: 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 ) { 200a684: 80 a5 40 1b cmp %l5, %i3 200a688: 02 80 00 0b be 200a6b4 <_Thread_Dispatch+0x100> <== NEVER TAKEN 200a68c: 90 07 60 c8 add %i5, 0xc8, %o0 const User_extensions_Switch_control *extension = (const User_extensions_Switch_control *) node; (*extension->thread_switch)( executing, heir ); 200a690: c2 05 60 08 ld [ %l5 + 8 ], %g1 200a694: 90 10 00 1d mov %i5, %o0 200a698: 9f c0 40 00 call %g1 200a69c: 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; 200a6a0: 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 ) { 200a6a4: 80 a5 40 1b cmp %l5, %i3 200a6a8: 32 bf ff fb bne,a 200a694 <_Thread_Dispatch+0xe0> 200a6ac: 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 ); 200a6b0: 90 07 60 c8 add %i5, 0xc8, %o0 200a6b4: 40 00 04 ef call 200ba70 <_CPU_Context_switch> 200a6b8: 92 07 20 c8 add %i4, 0xc8, %o1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200a6bc: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 200a6c0: 80 a0 60 00 cmp %g1, 0 200a6c4: 02 80 00 0c be 200a6f4 <_Thread_Dispatch+0x140> 200a6c8: d0 06 63 8c ld [ %i1 + 0x38c ], %o0 200a6cc: 80 a7 40 08 cmp %i5, %o0 200a6d0: 02 80 00 09 be 200a6f4 <_Thread_Dispatch+0x140> 200a6d4: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200a6d8: 02 80 00 04 be 200a6e8 <_Thread_Dispatch+0x134> 200a6dc: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200a6e0: 40 00 04 aa call 200b988 <_CPU_Context_save_fp> 200a6e4: 90 02 21 50 add %o0, 0x150, %o0 _Context_Restore_fp( &executing->fp_context ); 200a6e8: 40 00 04 c5 call 200b9fc <_CPU_Context_restore_fp> 200a6ec: 90 07 61 50 add %i5, 0x150, %o0 _Thread_Allocated_fp = executing; 200a6f0: fa 26 63 8c st %i5, [ %i1 + 0x38c ] #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 200a6f4: 7f ff df c6 call 200260c 200a6f8: 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 ) { 200a6fc: c2 0e a0 0c ldub [ %i2 + 0xc ], %g1 200a700: 80 a0 60 00 cmp %g1, 0 200a704: 02 80 00 08 be 200a724 <_Thread_Dispatch+0x170> 200a708: 01 00 00 00 nop heir = _Thread_Heir; 200a70c: f8 06 a0 14 ld [ %i2 + 0x14 ], %i4 200a710: e6 26 23 20 st %l3, [ %i0 + 0x320 ] #ifndef RTEMS_SMP _Thread_Dispatch_set_disable_level( 1 ); #endif _Thread_Dispatch_necessary = false; 200a714: 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 ) 200a718: 80 a7 00 1d cmp %i4, %i5 200a71c: 12 bf ff c0 bne 200a61c <_Thread_Dispatch+0x68> <== ALWAYS TAKEN 200a720: f8 26 a0 10 st %i4, [ %i2 + 0x10 ] 200a724: c0 26 23 20 clr [ %i0 + 0x320 ] post_switch: #ifndef RTEMS_SMP _Thread_Dispatch_set_disable_level( 0 ); #endif _ISR_Enable( level ); 200a728: 7f ff df bd call 200261c 200a72c: 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; 200a730: 03 00 80 78 sethi %hi(0x201e000), %g1 200a734: f8 00 63 94 ld [ %g1 + 0x394 ], %i4 ! 201e394 <_API_extensions_Post_switch_list> 200a738: 82 10 63 94 or %g1, 0x394, %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 ) { 200a73c: b6 00 60 04 add %g1, 4, %i3 200a740: 80 a7 00 1b cmp %i4, %i3 200a744: 02 80 00 09 be 200a768 <_Thread_Dispatch+0x1b4> 200a748: 01 00 00 00 nop const API_extensions_Post_switch_control *post_switch = (const API_extensions_Post_switch_control *) node; (*post_switch->hook)( executing ); 200a74c: c2 07 20 08 ld [ %i4 + 8 ], %g1 200a750: 9f c0 40 00 call %g1 200a754: 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; 200a758: 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 ) { 200a75c: 80 a7 00 1b cmp %i4, %i3 200a760: 32 bf ff fc bne,a 200a750 <_Thread_Dispatch+0x19c> <== NEVER TAKEN 200a764: c2 07 20 08 ld [ %i4 + 8 ], %g1 <== NOT EXECUTED 200a768: 81 c7 e0 08 ret 200a76c: 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; 200a770: 10 bf ff af b 200a62c <_Thread_Dispatch+0x78> 200a774: c2 27 20 74 st %g1, [ %i4 + 0x74 ] =============================================================================== 02010168 <_Thread_Handler>: #define INIT_NAME __main #define EXECUTE_GLOBAL_CONSTRUCTORS #endif void _Thread_Handler( void ) { 2010168: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static bool doneConstructors; bool doCons; #endif executing = _Thread_Executing; 201016c: 03 00 80 7a sethi %hi(0x201e800), %g1 2010170: fa 00 60 50 ld [ %g1 + 0x50 ], %i5 ! 201e850 <_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(); 2010174: 3f 00 80 40 sethi %hi(0x2010000), %i7 2010178: be 17 e1 68 or %i7, 0x168, %i7 ! 2010168 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 201017c: d0 07 60 a8 ld [ %i5 + 0xa8 ], %o0 _ISR_Set_level(level); 2010180: 7f ff c9 27 call 200261c 2010184: 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) && 2010188: c4 07 61 50 ld [ %i5 + 0x150 ], %g2 doCons = !doneConstructors && _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API; if (doCons) doneConstructors = true; #else doCons = !doneConstructors; 201018c: 03 00 80 78 sethi %hi(0x201e000), %g1 doneConstructors = true; 2010190: 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; 2010194: f6 08 60 20 ldub [ %g1 + 0x20 ], %i3 #endif #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 2010198: 80 a0 a0 00 cmp %g2, 0 201019c: 02 80 00 0c be 20101cc <_Thread_Handler+0x64> 20101a0: c6 28 60 20 stb %g3, [ %g1 + 0x20 ] #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 ); 20101a4: 39 00 80 78 sethi %hi(0x201e000), %i4 20101a8: d0 07 23 8c ld [ %i4 + 0x38c ], %o0 ! 201e38c <_Thread_Allocated_fp> 20101ac: 80 a7 40 08 cmp %i5, %o0 20101b0: 02 80 00 07 be 20101cc <_Thread_Handler+0x64> 20101b4: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 20101b8: 22 80 00 05 be,a 20101cc <_Thread_Handler+0x64> 20101bc: fa 27 23 8c st %i5, [ %i4 + 0x38c ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 20101c0: 7f ff ed f2 call 200b988 <_CPU_Context_save_fp> 20101c4: 90 02 21 50 add %o0, 0x150, %o0 _Thread_Allocated_fp = executing; 20101c8: fa 27 23 8c st %i5, [ %i4 + 0x38c ] ); } static inline void _User_extensions_Thread_begin( Thread_Control *executing ) { _User_extensions_Iterate( 20101cc: 90 10 00 1d mov %i5, %o0 20101d0: 13 00 80 2c sethi %hi(0x200b000), %o1 20101d4: 7f ff ec 77 call 200b3b0 <_User_extensions_Iterate> 20101d8: 92 12 63 3c or %o1, 0x33c, %o1 ! 200b33c <_User_extensions_Thread_begin_visitor> _User_extensions_Thread_begin( executing ); /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 20101dc: 7f ff e9 67 call 200a778 <_Thread_Enable_dispatch> 20101e0: 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) */ { 20101e4: 80 8e e0 ff btst 0xff, %i3 20101e8: 02 80 00 10 be 2010228 <_Thread_Handler+0xc0> 20101ec: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 20101f0: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 20101f4: 80 a0 60 00 cmp %g1, 0 20101f8: 02 80 00 10 be 2010238 <_Thread_Handler+0xd0> 20101fc: 80 a0 60 01 cmp %g1, 1 (*(Thread_Entry_numeric) executing->Start.entry_point)( executing->Start.numeric_argument ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { 2010200: 22 80 00 13 be,a 201024c <_Thread_Handler+0xe4> <== ALWAYS TAKEN 2010204: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 } } static inline void _User_extensions_Thread_exitted( Thread_Control *executing ) { _User_extensions_Iterate( 2010208: 90 10 00 1d mov %i5, %o0 201020c: 13 00 80 2c sethi %hi(0x200b000), %o1 2010210: 7f ff ec 68 call 200b3b0 <_User_extensions_Iterate> 2010214: 92 12 63 60 or %o1, 0x360, %o1 ! 200b360 <_User_extensions_Thread_exitted_visitor> * able to fit in a (void *). */ _User_extensions_Thread_exitted( executing ); _Internal_error_Occurred( 2010218: 90 10 20 00 clr %o0 201021c: 92 10 20 01 mov 1, %o1 2010220: 7f ff e3 b0 call 20090e0 <_Internal_error_Occurred> 2010224: 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 (); 2010228: 40 00 35 04 call 201d638 <_init> 201022c: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 2010230: 10 bf ff f1 b 20101f4 <_Thread_Handler+0x8c> 2010234: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 2010238: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 201023c: 9f c0 40 00 call %g1 2010240: d0 07 60 98 ld [ %i5 + 0x98 ], %o0 #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 2010244: 10 bf ff f1 b 2010208 <_Thread_Handler+0xa0> 2010248: d0 27 60 28 st %o0, [ %i5 + 0x28 ] ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { executing->Wait.return_argument = (*(Thread_Entry_pointer) executing->Start.entry_point)( 201024c: 9f c0 40 00 call %g1 2010250: d0 07 60 94 ld [ %i5 + 0x94 ], %o0 executing->Start.numeric_argument ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { executing->Wait.return_argument = 2010254: 10 bf ff ed b 2010208 <_Thread_Handler+0xa0> 2010258: d0 27 60 28 st %o0, [ %i5 + 0x28 ] =============================================================================== 0200aa6c <_Thread_Handler_initialization>: #if defined(RTEMS_SMP) #include #endif void _Thread_Handler_initialization(void) { 200aa6c: 9d e3 bf 98 save %sp, -104, %sp uint32_t ticks_per_timeslice = 200aa70: 03 00 80 6d sethi %hi(0x201b400), %g1 200aa74: 82 10 60 c8 or %g1, 0xc8, %g1 ! 201b4c8 #if defined(RTEMS_MULTIPROCESSING) uint32_t maximum_proxies = _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || 200aa78: c6 00 60 28 ld [ %g1 + 0x28 ], %g3 #include #endif void _Thread_Handler_initialization(void) { uint32_t ticks_per_timeslice = 200aa7c: fa 00 60 14 ld [ %g1 + 0x14 ], %i5 rtems_configuration_get_ticks_per_timeslice(); uint32_t maximum_extensions = 200aa80: 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 || 200aa84: 80 a0 e0 00 cmp %g3, 0 200aa88: 02 80 00 21 be 200ab0c <_Thread_Handler_initialization+0xa0><== NEVER TAKEN 200aa8c: c4 00 60 24 ld [ %g1 + 0x24 ], %g2 200aa90: c6 00 60 2c ld [ %g1 + 0x2c ], %g3 200aa94: 80 a0 e0 00 cmp %g3, 0 200aa98: 02 80 00 1d be 200ab0c <_Thread_Handler_initialization+0xa0> 200aa9c: 80 a0 a0 00 cmp %g2, 0 INTERNAL_ERROR_CORE, true, INTERNAL_ERROR_BAD_STACK_HOOK ); if ( stack_allocate_init_hook != NULL ) 200aaa0: 22 80 00 05 be,a 200aab4 <_Thread_Handler_initialization+0x48> 200aaa4: 03 00 80 7a sethi %hi(0x201e800), %g1 (*stack_allocate_init_hook)( rtems_configuration_get_stack_space_size() ); 200aaa8: 9f c0 80 00 call %g2 200aaac: d0 00 60 04 ld [ %g1 + 4 ], %o0 ! 201e804 <_RTEMS_Objects+0x4> _Thread_Dispatch_necessary = false; 200aab0: 03 00 80 7a sethi %hi(0x201e800), %g1 200aab4: 82 10 60 40 or %g1, 0x40, %g1 ! 201e840 <_Per_CPU_Information> 200aab8: c0 28 60 0c clrb [ %g1 + 0xc ] _Thread_Executing = NULL; 200aabc: c0 20 60 10 clr [ %g1 + 0x10 ] _Thread_Heir = NULL; 200aac0: c0 20 60 14 clr [ %g1 + 0x14 ] #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Thread_Allocated_fp = NULL; 200aac4: 03 00 80 78 sethi %hi(0x201e000), %g1 200aac8: c0 20 63 8c clr [ %g1 + 0x38c ] ! 201e38c <_Thread_Allocated_fp> #endif _Thread_Maximum_extensions = maximum_extensions; 200aacc: 03 00 80 78 sethi %hi(0x201e000), %g1 200aad0: f8 20 63 a0 st %i4, [ %g1 + 0x3a0 ] ! 201e3a0 <_Thread_Maximum_extensions> _Thread_Ticks_per_timeslice = ticks_per_timeslice; 200aad4: 03 00 80 78 sethi %hi(0x201e000), %g1 200aad8: fa 20 62 80 st %i5, [ %g1 + 0x280 ] ! 201e280 <_Thread_Ticks_per_timeslice> #if defined(RTEMS_MULTIPROCESSING) if ( _System_state_Is_multiprocessing ) maximum_internal_threads += 1; #endif _Objects_Initialize_information( 200aadc: 82 10 20 08 mov 8, %g1 200aae0: 11 00 80 79 sethi %hi(0x201e400), %o0 200aae4: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 200aae8: 90 12 20 14 or %o0, 0x14, %o0 200aaec: 92 10 20 01 mov 1, %o1 200aaf0: 94 10 20 01 mov 1, %o2 200aaf4: 96 10 20 01 mov 1, %o3 200aaf8: 98 10 21 68 mov 0x168, %o4 200aafc: 7f ff fb 22 call 2009784 <_Objects_Initialize_information> 200ab00: 9a 10 20 00 clr %o5 200ab04: 81 c7 e0 08 ret 200ab08: 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( 200ab0c: 90 10 20 00 clr %o0 200ab10: 92 10 20 01 mov 1, %o1 200ab14: 7f ff f9 73 call 20090e0 <_Internal_error_Occurred> 200ab18: 94 10 20 0e mov 0xe, %o2 =============================================================================== 0200a854 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 200a854: 9d e3 bf 98 save %sp, -104, %sp 200a858: c2 07 a0 6c ld [ %fp + 0x6c ], %g1 /* * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; 200a85c: c0 26 61 58 clr [ %i1 + 0x158 ] 200a860: c0 26 61 5c clr [ %i1 + 0x15c ] extensions_area = NULL; the_thread->libc_reent = NULL; 200a864: c0 26 61 54 clr [ %i1 + 0x154 ] Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 200a868: e0 07 a0 60 ld [ %fp + 0x60 ], %l0 200a86c: e2 00 40 00 ld [ %g1 ], %l1 if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ stack = the_thread->Start.stack; #else if ( !stack_area ) { 200a870: 80 a6 a0 00 cmp %i2, 0 200a874: 02 80 00 6f be 200aa30 <_Thread_Initialize+0x1dc> 200a878: e4 0f a0 5f ldub [ %fp + 0x5f ], %l2 stack = the_thread->Start.stack; the_thread->Start.core_allocated_stack = true; } else { stack = stack_area; actual_stack_size = stack_size; the_thread->Start.core_allocated_stack = false; 200a87c: c0 2e 60 b0 clrb [ %i1 + 0xb0 ] 200a880: 90 10 00 1b mov %i3, %o0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 200a884: f4 26 60 b8 st %i2, [ %i1 + 0xb8 ] the_stack->size = size; 200a888: d0 26 60 b4 st %o0, [ %i1 + 0xb4 ] /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { 200a88c: 80 a7 20 00 cmp %i4, 0 200a890: 12 80 00 4c bne 200a9c0 <_Thread_Initialize+0x16c> 200a894: b6 10 20 00 clr %i3 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 200a898: 39 00 80 78 sethi %hi(0x201e000), %i4 200a89c: c2 07 23 a0 ld [ %i4 + 0x3a0 ], %g1 ! 201e3a0 <_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; 200a8a0: f6 26 61 50 st %i3, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 200a8a4: f6 26 60 bc st %i3, [ %i1 + 0xbc ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 200a8a8: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 200a8ac: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 200a8b0: c0 26 60 68 clr [ %i1 + 0x68 ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 200a8b4: 80 a0 60 00 cmp %g1, 0 200a8b8: 12 80 00 4a bne 200a9e0 <_Thread_Initialize+0x18c> 200a8bc: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 200a8c0: c0 26 61 60 clr [ %i1 + 0x160 ] * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; extensions_area = NULL; 200a8c4: b4 10 20 00 clr %i2 * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; the_thread->Start.budget_callout = budget_callout; 200a8c8: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 200a8cc: e4 2e 60 9c stb %l2, [ %i1 + 0x9c ] the_thread->Start.budget_algorithm = budget_algorithm; 200a8d0: e0 26 60 a0 st %l0, [ %i1 + 0xa0 ] the_thread->Start.budget_callout = budget_callout; switch ( budget_algorithm ) { 200a8d4: 80 a4 20 02 cmp %l0, 2 200a8d8: 12 80 00 05 bne 200a8ec <_Thread_Initialize+0x98> 200a8dc: c2 26 60 a4 st %g1, [ %i1 + 0xa4 ] case THREAD_CPU_BUDGET_ALGORITHM_NONE: case THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE: break; #if defined(RTEMS_SCORE_THREAD_ENABLE_EXHAUST_TIMESLICE) case THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 200a8e0: 03 00 80 78 sethi %hi(0x201e000), %g1 200a8e4: c2 00 62 80 ld [ %g1 + 0x280 ], %g1 ! 201e280 <_Thread_Ticks_per_timeslice> 200a8e8: c2 26 60 74 st %g1, [ %i1 + 0x74 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 200a8ec: c4 07 a0 68 ld [ %fp + 0x68 ], %g2 */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 200a8f0: 03 00 80 75 sethi %hi(0x201d400), %g1 200a8f4: c2 00 63 1c ld [ %g1 + 0x31c ], %g1 ! 201d71c <_Scheduler+0x18> 200a8f8: c4 26 60 a8 st %g2, [ %i1 + 0xa8 ] the_thread->current_state = STATES_DORMANT; 200a8fc: a0 10 20 01 mov 1, %l0 the_thread->Wait.queue = NULL; 200a900: c0 26 60 44 clr [ %i1 + 0x44 ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 200a904: e0 26 60 10 st %l0, [ %i1 + 0x10 ] the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 200a908: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 200a90c: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 200a910: fa 26 60 ac st %i5, [ %i1 + 0xac ] 200a914: 9f c0 40 00 call %g1 200a918: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 200a91c: b8 92 20 00 orcc %o0, 0, %i4 200a920: 22 80 00 17 be,a 200a97c <_Thread_Initialize+0x128> 200a924: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 200a928: 90 10 00 19 mov %i1, %o0 200a92c: 40 00 01 ec call 200b0dc <_Thread_Set_priority> 200a930: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200a934: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 200a938: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 static inline void _Timestamp64_implementation_Set_to_zero( Timestamp64_Control *_time ) { *_time = 0; 200a93c: c0 26 60 80 clr [ %i1 + 0x80 ] 200a940: c0 26 60 84 clr [ %i1 + 0x84 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200a944: 83 28 60 02 sll %g1, 2, %g1 200a948: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 200a94c: e2 26 60 0c st %l1, [ %i1 + 0xc ] * @{ */ static inline bool _User_extensions_Thread_create( Thread_Control *created ) { User_extensions_Thread_create_context ctx = { created, true }; 200a950: f2 27 bf f8 st %i1, [ %fp + -8 ] 200a954: e0 2f bf fc stb %l0, [ %fp + -4 ] _User_extensions_Iterate( &ctx, _User_extensions_Thread_create_visitor ); 200a958: 90 07 bf f8 add %fp, -8, %o0 200a95c: 13 00 80 2c sethi %hi(0x200b000), %o1 200a960: 40 00 02 94 call 200b3b0 <_User_extensions_Iterate> 200a964: 92 12 62 88 or %o1, 0x288, %o1 ! 200b288 <_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 ) 200a968: c2 0f bf fc ldub [ %fp + -4 ], %g1 200a96c: 80 a0 60 00 cmp %g1, 0 200a970: 12 80 00 11 bne 200a9b4 <_Thread_Initialize+0x160> 200a974: b0 10 20 01 mov 1, %i0 return true; failed: _Workspace_Free( the_thread->libc_reent ); 200a978: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 200a97c: 40 00 03 ee call 200b934 <_Workspace_Free> 200a980: b0 10 20 00 clr %i0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 200a984: 40 00 03 ec call 200b934 <_Workspace_Free> 200a988: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 200a98c: 40 00 03 ea call 200b934 <_Workspace_Free> 200a990: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( extensions_area ); 200a994: 40 00 03 e8 call 200b934 <_Workspace_Free> 200a998: 90 10 00 1a mov %i2, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 200a99c: 40 00 03 e6 call 200b934 <_Workspace_Free> 200a9a0: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 200a9a4: 40 00 03 e4 call 200b934 <_Workspace_Free> 200a9a8: 90 10 00 1c mov %i4, %o0 _Thread_Stack_Free( the_thread ); 200a9ac: 40 00 02 05 call 200b1c0 <_Thread_Stack_Free> 200a9b0: 90 10 00 19 mov %i1, %o0 200a9b4: b0 0e 20 ff and %i0, 0xff, %i0 200a9b8: 81 c7 e0 08 ret 200a9bc: 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 ); 200a9c0: 40 00 03 d5 call 200b914 <_Workspace_Allocate> 200a9c4: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 200a9c8: b6 92 20 00 orcc %o0, 0, %i3 200a9cc: 32 bf ff b4 bne,a 200a89c <_Thread_Initialize+0x48> 200a9d0: 39 00 80 78 sethi %hi(0x201e000), %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; 200a9d4: b4 10 20 00 clr %i2 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; 200a9d8: 10 bf ff e8 b 200a978 <_Thread_Initialize+0x124> 200a9dc: b8 10 20 00 clr %i4 /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { extensions_area = _Workspace_Allocate( 200a9e0: 90 00 60 01 add %g1, 1, %o0 200a9e4: 40 00 03 cc call 200b914 <_Workspace_Allocate> 200a9e8: 91 2a 20 02 sll %o0, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 200a9ec: b4 92 20 00 orcc %o0, 0, %i2 200a9f0: 02 80 00 1d be 200aa64 <_Thread_Initialize+0x210> 200a9f4: 86 10 00 1a mov %i2, %g3 goto failed; } the_thread->extensions = (void **) extensions_area; 200a9f8: f4 26 61 60 st %i2, [ %i1 + 0x160 ] 200a9fc: c8 07 23 a0 ld [ %i4 + 0x3a0 ], %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++ ) 200aa00: 84 10 20 00 clr %g2 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 200aa04: 10 80 00 03 b 200aa10 <_Thread_Initialize+0x1bc> 200aa08: 82 10 20 00 clr %g1 200aa0c: c6 06 61 60 ld [ %i1 + 0x160 ], %g3 * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) the_thread->extensions[i] = NULL; 200aa10: 85 28 a0 02 sll %g2, 2, %g2 200aa14: 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++ ) 200aa18: 82 00 60 01 inc %g1 200aa1c: 80 a0 40 04 cmp %g1, %g4 200aa20: 08 bf ff fb bleu 200aa0c <_Thread_Initialize+0x1b8> 200aa24: 84 10 00 01 mov %g1, %g2 * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; the_thread->Start.budget_callout = budget_callout; 200aa28: 10 bf ff a9 b 200a8cc <_Thread_Initialize+0x78> 200aa2c: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; #else if ( !stack_area ) { actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); 200aa30: 90 10 00 19 mov %i1, %o0 200aa34: 40 00 01 d3 call 200b180 <_Thread_Stack_Allocate> 200aa38: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 200aa3c: 80 a2 00 1b cmp %o0, %i3 200aa40: 0a 80 00 07 bcs 200aa5c <_Thread_Initialize+0x208> 200aa44: 80 a2 20 00 cmp %o0, 0 200aa48: 02 80 00 05 be 200aa5c <_Thread_Initialize+0x208> <== NEVER TAKEN 200aa4c: 82 10 20 01 mov 1, %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; 200aa50: f4 06 60 c0 ld [ %i1 + 0xc0 ], %i2 the_thread->Start.core_allocated_stack = true; 200aa54: 10 bf ff 8c b 200a884 <_Thread_Initialize+0x30> 200aa58: c2 2e 60 b0 stb %g1, [ %i1 + 0xb0 ] stack = the_thread->Start.stack; #else if ( !stack_area ) { actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ 200aa5c: 10 bf ff d6 b 200a9b4 <_Thread_Initialize+0x160> 200aa60: b0 10 20 00 clr %i0 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; 200aa64: 10 bf ff c5 b 200a978 <_Thread_Initialize+0x124> 200aa68: b8 10 20 00 clr %i4 =============================================================================== 0200b1c0 <_Thread_Stack_Free>: #include void _Thread_Stack_Free( Thread_Control *the_thread ) { 200b1c0: 9d e3 bf a0 save %sp, -96, %sp #if defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) /* * If the API provided the stack space, then don't free it. */ if ( !the_thread->Start.core_allocated_stack ) 200b1c4: c2 0e 20 b0 ldub [ %i0 + 0xb0 ], %g1 200b1c8: 80 a0 60 00 cmp %g1, 0 void _Thread_Stack_Free( Thread_Control *the_thread ) { rtems_stack_free_hook stack_free_hook = 200b1cc: 03 00 80 6d sethi %hi(0x201b400), %g1 #if defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) /* * If the API provided the stack space, then don't free it. */ if ( !the_thread->Start.core_allocated_stack ) 200b1d0: 02 80 00 04 be 200b1e0 <_Thread_Stack_Free+0x20> <== NEVER TAKEN 200b1d4: c2 00 60 f4 ld [ %g1 + 0xf4 ], %g1 ! 201b4f4 * Call ONLY the CPU table stack free hook, or the * the RTEMS workspace free. This is so the free * routine properly matches the allocation of the stack. */ (*stack_free_hook)( the_thread->Start.Initial_stack.area ); 200b1d8: 9f c0 40 00 call %g1 200b1dc: d0 06 20 b8 ld [ %i0 + 0xb8 ], %o0 200b1e0: 81 c7 e0 08 ret 200b1e4: 81 e8 00 00 restore =============================================================================== 0200b01c <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 200b01c: 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 ) 200b020: 80 a6 20 00 cmp %i0, 0 200b024: 02 80 00 13 be 200b070 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN 200b028: 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 ) { 200b02c: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 200b030: 80 a7 60 01 cmp %i5, 1 200b034: 02 80 00 04 be 200b044 <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN 200b038: 01 00 00 00 nop 200b03c: 81 c7 e0 08 ret <== NOT EXECUTED 200b040: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 200b044: 7f ff dd 72 call 200260c 200b048: 01 00 00 00 nop 200b04c: b8 10 00 08 mov %o0, %i4 200b050: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 200b054: 03 00 00 ef sethi %hi(0x3bc00), %g1 200b058: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 200b05c: 80 88 80 01 btst %g2, %g1 200b060: 12 80 00 06 bne 200b078 <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN 200b064: 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 ); 200b068: 7f ff dd 6d call 200261c 200b06c: 90 10 00 1c mov %i4, %o0 200b070: 81 c7 e0 08 ret 200b074: 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 ); 200b078: 92 10 00 19 mov %i1, %o1 200b07c: 94 10 20 01 mov 1, %o2 200b080: 40 00 0d 68 call 200e620 <_Thread_queue_Extract_priority_helper> 200b084: fa 26 20 30 st %i5, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 200b088: 90 10 00 18 mov %i0, %o0 200b08c: 92 10 00 19 mov %i1, %o1 200b090: 7f ff ff 35 call 200ad64 <_Thread_queue_Enqueue_priority> 200b094: 94 07 bf fc add %fp, -4, %o2 200b098: 30 bf ff f4 b,a 200b068 <_Thread_queue_Requeue+0x4c> =============================================================================== 0200b09c <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 200b09c: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200b0a0: 90 10 00 18 mov %i0, %o0 200b0a4: 7f ff fd c1 call 200a7a8 <_Thread_Get> 200b0a8: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200b0ac: c2 07 bf fc ld [ %fp + -4 ], %g1 200b0b0: 80 a0 60 00 cmp %g1, 0 200b0b4: 12 80 00 08 bne 200b0d4 <_Thread_queue_Timeout+0x38> <== NEVER TAKEN 200b0b8: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 200b0bc: 40 00 0d 92 call 200e704 <_Thread_queue_Process_timeout> 200b0c0: 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; 200b0c4: 03 00 80 78 sethi %hi(0x201e000), %g1 200b0c8: c4 00 63 20 ld [ %g1 + 0x320 ], %g2 ! 201e320 <_Thread_Dispatch_disable_level> --level; 200b0cc: 84 00 bf ff add %g2, -1, %g2 _Thread_Dispatch_disable_level = level; 200b0d0: c4 20 63 20 st %g2, [ %g1 + 0x320 ] 200b0d4: 81 c7 e0 08 ret 200b0d8: 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 f2 sethi %hi(0x203c800), %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 f2 sethi %hi(0x203c800), %i1 20180e0: 27 00 80 f2 sethi %hi(0x203c800), %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 22 1c or %l0, 0x21c, %l0 2018100: b6 06 20 30 add %i0, 0x30, %i3 2018104: b2 16 60 78 or %i1, 0x78, %i1 2018108: ba 06 20 68 add %i0, 0x68, %i5 201810c: a6 14 e1 30 or %l3, 0x130, %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 8a call 201cb60 <_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 51 4c call 202c67c <__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 c2 call 2018c80 <_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 9b call 201cc10 <_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 b4 call 2018c80 <_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 12 2d call 201caa0 <_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 85 call 201cc10 <_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 12 54 call 201cb60 <_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 11 11 call 201c6dc <_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 84 call 201bcc0 <_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 b3 call 201cd8c <_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 b1 call 201cd8c <_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 38 call 2018c54 <_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 f2 sethi %hi(0x203c800), %g1 2017f80: c4 00 61 30 ld [ %g1 + 0x130 ], %g2 ! 203c930 <_Thread_Dispatch_disable_level> ++level; 2017f84: 84 00 a0 01 inc %g2 _Thread_Dispatch_disable_level = level; 2017f88: c4 20 61 30 st %g2, [ %g1 + 0x130 ] * 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 0f 47 call 201bcc0 <_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 f2 sethi %hi(0x203c800), %g1 2017fbc: d0 18 60 78 ldd [ %g1 + 0x78 ], %o0 ! 203c878 <_TOD> 2017fc0: 94 10 20 00 clr %o2 2017fc4: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2017fc8: 40 00 51 ad call 202c67c <__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 fe call 201cc10 <_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 0f 22 call 201bcc0 <_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 f2 sethi %hi(0x203c800), %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 a2 1c ld [ %g2 + 0x21c ], %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 e0 call 201cc10 <_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 0f 04 call 201bcc0 <_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 =============================================================================== 0200d0d8 <_Timespec_Add_to>: ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 200d0d8: 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; 200d0dc: c4 02 40 00 ld [ %o1 ], %g2 /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; 200d0e0: c6 02 20 04 ld [ %o0 + 4 ], %g3 200d0e4: c2 02 60 04 ld [ %o1 + 4 ], %g1 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 200d0e8: 98 03 00 02 add %o4, %g2, %o4 time->tv_nsec += add->tv_nsec; 200d0ec: 82 00 c0 01 add %g3, %g1, %g1 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 200d0f0: 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 ) { 200d0f4: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4 200d0f8: 88 11 21 ff or %g4, 0x1ff, %g4 ! 3b9ac9ff 200d0fc: 80 a0 40 04 cmp %g1, %g4 200d100: 08 80 00 0d bleu 200d134 <_Timespec_Add_to+0x5c> 200d104: c2 22 20 04 st %g1, [ %o0 + 4 ] 200d108: 98 03 20 01 inc %o4 time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 200d10c: 1b 31 19 4d sethi %hi(0xc4653400), %o5 #include #include #include #include uint32_t _Timespec_Add_to( 200d110: 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; 200d114: 9a 13 62 00 or %o5, 0x200, %o5 200d118: 82 00 40 0d add %g1, %o5, %g1 #include #include #include #include uint32_t _Timespec_Add_to( 200d11c: 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 ) { 200d120: 80 a0 40 04 cmp %g1, %g4 200d124: 18 bf ff fd bgu 200d118 <_Timespec_Add_to+0x40> <== NEVER TAKEN 200d128: 84 00 a0 01 inc %g2 200d12c: c2 22 20 04 st %g1, [ %o0 + 4 ] 200d130: c6 22 00 00 st %g3, [ %o0 ] time->tv_sec++; seconds++; } return seconds; } 200d134: 81 c3 e0 08 retl 200d138: 90 10 00 02 mov %g2, %o0 =============================================================================== 0200cb38 <_Timestamp64_Divide>: const Timestamp64_Control *_lhs, const Timestamp64_Control *_rhs, uint32_t *_ival_percentage, uint32_t *_fval_percentage ) { 200cb38: 9d e3 bf a0 save %sp, -96, %sp Timestamp64_Control answer; if ( *_rhs == 0 ) { 200cb3c: d4 1e 40 00 ldd [ %i1 ], %o2 200cb40: 80 92 80 0b orcc %o2, %o3, %g0 200cb44: 22 80 00 2f be,a 200cc00 <_Timestamp64_Divide+0xc8> <== NEVER TAKEN 200cb48: 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; 200cb4c: e0 1e 00 00 ldd [ %i0 ], %l0 200cb50: 83 2c 20 02 sll %l0, 2, %g1 200cb54: 89 34 60 1e srl %l1, 0x1e, %g4 200cb58: 87 2c 60 02 sll %l1, 2, %g3 200cb5c: 84 11 00 01 or %g4, %g1, %g2 200cb60: 83 30 e0 1b srl %g3, 0x1b, %g1 200cb64: 9b 28 e0 05 sll %g3, 5, %o5 200cb68: 99 28 a0 05 sll %g2, 5, %o4 200cb6c: 86 a3 40 03 subcc %o5, %g3, %g3 200cb70: 98 10 40 0c or %g1, %o4, %o4 200cb74: 84 63 00 02 subx %o4, %g2, %g2 200cb78: 92 80 c0 11 addcc %g3, %l1, %o1 200cb7c: 83 32 60 1e srl %o1, 0x1e, %g1 200cb80: 90 40 80 10 addx %g2, %l0, %o0 200cb84: b3 2a 60 02 sll %o1, 2, %i1 200cb88: b1 2a 20 02 sll %o0, 2, %i0 200cb8c: 86 82 40 19 addcc %o1, %i1, %g3 200cb90: b0 10 40 18 or %g1, %i0, %i0 200cb94: 83 30 e0 1e srl %g3, 0x1e, %g1 200cb98: 84 42 00 18 addx %o0, %i0, %g2 200cb9c: bb 28 e0 02 sll %g3, 2, %i5 200cba0: b9 28 a0 02 sll %g2, 2, %i4 200cba4: 92 80 c0 1d addcc %g3, %i5, %o1 200cba8: b8 10 40 1c or %g1, %i4, %i4 200cbac: 87 32 60 1b srl %o1, 0x1b, %g3 200cbb0: 90 40 80 1c addx %g2, %i4, %o0 200cbb4: 83 2a 60 05 sll %o1, 5, %g1 200cbb8: 85 2a 20 05 sll %o0, 5, %g2 200cbbc: 92 10 00 01 mov %g1, %o1 200cbc0: 40 00 3b 46 call 201b8d8 <__divdi3> 200cbc4: 90 10 c0 02 or %g3, %g2, %o0 *_ival_percentage = answer / 1000; 200cbc8: 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; 200cbcc: b8 10 00 08 mov %o0, %i4 200cbd0: ba 10 00 09 mov %o1, %i5 *_ival_percentage = answer / 1000; 200cbd4: 40 00 3b 41 call 201b8d8 <__divdi3> 200cbd8: 96 10 23 e8 mov 0x3e8, %o3 *_fval_percentage = answer % 1000; 200cbdc: 90 10 00 1c mov %i4, %o0 * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; *_ival_percentage = answer / 1000; 200cbe0: d2 26 80 00 st %o1, [ %i2 ] *_fval_percentage = answer % 1000; 200cbe4: 94 10 20 00 clr %o2 200cbe8: 96 10 23 e8 mov 0x3e8, %o3 200cbec: 40 00 3c 26 call 201bc84 <__moddi3> 200cbf0: 92 10 00 1d mov %i5, %o1 200cbf4: d2 26 c0 00 st %o1, [ %i3 ] 200cbf8: 81 c7 e0 08 ret 200cbfc: 81 e8 00 00 restore { Timestamp64_Control answer; if ( *_rhs == 0 ) { *_ival_percentage = 0; *_fval_percentage = 0; 200cc00: c0 26 c0 00 clr [ %i3 ] <== NOT EXECUTED return; 200cc04: 81 c7 e0 08 ret <== NOT EXECUTED 200cc08: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200b480 <_User_extensions_Handler_initialization>: } } void _User_extensions_Handler_initialization(void) { 200b480: 9d e3 bf 98 save %sp, -104, %sp uint32_t number_of_initial_extensions = 200b484: 03 00 80 6d sethi %hi(0x201b400), %g1 200b488: c2 00 61 08 ld [ %g1 + 0x108 ], %g1 ! 201b508 rtems_configuration_get_number_of_initial_extensions(); if ( number_of_initial_extensions > 0 ) { 200b48c: 80 a0 60 00 cmp %g1, 0 200b490: 02 80 00 0a be 200b4b8 <_User_extensions_Handler_initialization+0x38><== NEVER TAKEN 200b494: 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 ) 200b498: 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 = 200b49c: 40 00 01 2c call 200b94c <_Workspace_Allocate_or_fatal_error> 200b4a0: 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 ); 200b4a4: 13 00 80 2d sethi %hi(0x200b400), %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 }; 200b4a8: d0 27 bf fc st %o0, [ %fp + -4 ] _User_extensions_Iterate( &ctx, _User_extensions_Switch_visitor ); 200b4ac: 92 12 60 3c or %o1, 0x3c, %o1 200b4b0: 7f ff ff c0 call 200b3b0 <_User_extensions_Iterate> 200b4b4: 90 07 bf fc add %fp, -4, %o0 200b4b8: 81 c7 e0 08 ret 200b4bc: 81 e8 00 00 restore =============================================================================== 0200b3b0 <_User_extensions_Iterate>: void _User_extensions_Iterate( void *arg, User_extensions_Visitor visitor ) { 200b3b0: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *executing = _Thread_Executing; const User_extensions_Table *callouts_current = 200b3b4: 03 00 80 6d sethi %hi(0x201b400), %g1 200b3b8: 82 10 60 c8 or %g1, 0xc8, %g1 ! 201b4c8 200b3bc: 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(); 200b3c0: f6 00 60 40 ld [ %g1 + 0x40 ], %i3 void _User_extensions_Iterate( void *arg, User_extensions_Visitor visitor ) { Thread_Control *executing = _Thread_Executing; 200b3c4: 03 00 80 7a sethi %hi(0x201e800), %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(); 200b3c8: 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 = 200b3cc: 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 ) { 200b3d0: 80 a7 40 1b cmp %i5, %i3 200b3d4: 02 80 00 0a be 200b3fc <_User_extensions_Iterate+0x4c> <== NEVER TAKEN 200b3d8: f8 00 60 50 ld [ %g1 + 0x50 ], %i4 (*visitor)( executing, arg, callouts_current ); 200b3dc: 94 10 00 1d mov %i5, %o2 200b3e0: 90 10 00 1c mov %i4, %o0 200b3e4: 9f c6 40 00 call %i1 200b3e8: 92 10 00 18 mov %i0, %o1 ++callouts_current; 200b3ec: 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 ) { 200b3f0: 80 a6 c0 1d cmp %i3, %i5 200b3f4: 12 bf ff fb bne 200b3e0 <_User_extensions_Iterate+0x30> 200b3f8: 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; 200b3fc: 37 00 80 76 sethi %hi(0x201d800), %i3 200b400: fa 06 e0 cc ld [ %i3 + 0xcc ], %i5 ! 201d8cc <_User_extensions_List> 200b404: b6 16 e0 cc or %i3, 0xcc, %i3 ++callouts_current; } node = _Chain_Immutable_first( &_User_extensions_List ); tail = _Chain_Immutable_tail( &_User_extensions_List ); while ( node != tail ) { 200b408: b6 06 e0 04 add %i3, 4, %i3 200b40c: 80 a7 40 1b cmp %i5, %i3 200b410: 02 80 00 09 be 200b434 <_User_extensions_Iterate+0x84> 200b414: 94 07 60 14 add %i5, 0x14, %o2 const User_extensions_Control *extension = (const User_extensions_Control *) node; (*visitor)( executing, arg, &extension->Callouts ); 200b418: 90 10 00 1c mov %i4, %o0 200b41c: 9f c6 40 00 call %i1 200b420: 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; 200b424: 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 ) { 200b428: 80 a7 40 1b cmp %i5, %i3 200b42c: 12 bf ff fb bne 200b418 <_User_extensions_Iterate+0x68> 200b430: 94 07 60 14 add %i5, 0x14, %o2 200b434: 81 c7 e0 08 ret 200b438: 81 e8 00 00 restore =============================================================================== 0200ce84 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200ce84: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200ce88: 7f ff d9 2f call 2003344 200ce8c: 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; 200ce90: 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 ); 200ce94: 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 ) ) { 200ce98: 80 a0 40 1c cmp %g1, %i4 200ce9c: 02 80 00 1f be 200cf18 <_Watchdog_Adjust+0x94> 200cea0: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200cea4: 12 80 00 1f bne 200cf20 <_Watchdog_Adjust+0x9c> 200cea8: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200ceac: 80 a6 a0 00 cmp %i2, 0 200ceb0: 02 80 00 1a be 200cf18 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200ceb4: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200ceb8: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200cebc: 80 a6 80 02 cmp %i2, %g2 200cec0: 1a 80 00 0a bcc 200cee8 <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN 200cec4: b6 10 20 01 mov 1, %i3 _Watchdog_First( header )->delta_interval -= units; 200cec8: 10 80 00 1d b 200cf3c <_Watchdog_Adjust+0xb8> <== NOT EXECUTED 200cecc: 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 ) { 200ced0: 02 80 00 12 be 200cf18 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200ced4: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200ced8: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200cedc: 80 a0 80 1a cmp %g2, %i2 200cee0: 38 80 00 17 bgu,a 200cf3c <_Watchdog_Adjust+0xb8> 200cee4: 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; 200cee8: 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; 200ceec: b4 26 80 02 sub %i2, %g2, %i2 _Watchdog_First( header )->delta_interval = 1; _ISR_Enable( level ); 200cef0: 7f ff d9 19 call 2003354 200cef4: 01 00 00 00 nop _Watchdog_Tickle( header ); 200cef8: 40 00 00 a8 call 200d198 <_Watchdog_Tickle> 200cefc: 90 10 00 18 mov %i0, %o0 _ISR_Disable( level ); 200cf00: 7f ff d9 11 call 2003344 200cf04: 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; 200cf08: c2 06 00 00 ld [ %i0 ], %g1 if ( _Chain_Is_empty( header ) ) 200cf0c: 80 a7 00 01 cmp %i4, %g1 200cf10: 12 bf ff f0 bne 200ced0 <_Watchdog_Adjust+0x4c> 200cf14: 80 a6 a0 00 cmp %i2, 0 } break; } } _ISR_Enable( level ); 200cf18: 7f ff d9 0f call 2003354 200cf1c: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 200cf20: 12 bf ff fe bne 200cf18 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200cf24: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200cf28: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200cf2c: b4 00 80 1a add %g2, %i2, %i2 200cf30: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 200cf34: 7f ff d9 08 call 2003354 200cf38: 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; 200cf3c: 10 bf ff f7 b 200cf18 <_Watchdog_Adjust+0x94> 200cf40: c4 20 60 10 st %g2, [ %g1 + 0x10 ] =============================================================================== 0201cb60 <_Watchdog_Adjust_to_chain>: Chain_Control *header, Watchdog_Interval units_arg, Chain_Control *to_fire ) { 201cb60: 9d e3 bf a0 save %sp, -96, %sp Watchdog_Interval units = units_arg; ISR_Level level; Watchdog_Control *first; _ISR_Disable( level ); 201cb64: 7f ff ca e5 call 200f6f8 201cb68: 01 00 00 00 nop 201cb6c: c2 06 00 00 ld [ %i0 ], %g1 201cb70: ba 06 20 04 add %i0, 4, %i5 201cb74: b8 06 a0 04 add %i2, 4, %i4 while ( 1 ) { if ( _Chain_Is_empty( header ) ) { 201cb78: 80 a7 40 01 cmp %i5, %g1 201cb7c: 02 80 00 20 be 201cbfc <_Watchdog_Adjust_to_chain+0x9c> 201cb80: 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 ) { 201cb84: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 201cb88: 80 a6 40 02 cmp %i1, %g2 201cb8c: 2a 80 00 1e bcs,a 201cc04 <_Watchdog_Adjust_to_chain+0xa4> 201cb90: 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; 201cb94: b2 26 40 02 sub %i1, %g2, %i1 first->delta_interval = 0; 201cb98: c0 20 60 10 clr [ %g1 + 0x10 ] { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 201cb9c: c4 00 60 04 ld [ %g1 + 4 ], %g2 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 201cba0: c6 00 40 00 ld [ %g1 ], %g3 previous = the_node->previous; next->previous = previous; 201cba4: c4 20 e0 04 st %g2, [ %g3 + 4 ] previous->next = next; 201cba8: 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; 201cbac: c4 06 a0 08 ld [ %i2 + 8 ], %g2 the_node->next = tail; 201cbb0: f8 20 40 00 st %i4, [ %g1 ] tail->previous = the_node; 201cbb4: c2 26 a0 08 st %g1, [ %i2 + 8 ] old_last->next = the_node; 201cbb8: c2 20 80 00 st %g1, [ %g2 ] the_node->previous = old_last; 201cbbc: 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 ); 201cbc0: 7f ff ca d2 call 200f708 201cbc4: 01 00 00 00 nop 201cbc8: 7f ff ca cc call 200f6f8 201cbcc: 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; 201cbd0: c2 06 00 00 ld [ %i0 ], %g1 if ( _Chain_Is_empty( header ) ) 201cbd4: 80 a7 40 01 cmp %i5, %g1 201cbd8: 02 bf ff e9 be 201cb7c <_Watchdog_Adjust_to_chain+0x1c> 201cbdc: 01 00 00 00 nop break; first = _Watchdog_First( header ); if ( first->delta_interval != 0 ) 201cbe0: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 201cbe4: 80 a0 a0 00 cmp %g2, 0 201cbe8: 22 bf ff ee be,a 201cba0 <_Watchdog_Adjust_to_chain+0x40> 201cbec: c4 00 60 04 ld [ %g1 + 4 ], %g2 Watchdog_Control *first; _ISR_Disable( level ); while ( 1 ) { if ( _Chain_Is_empty( header ) ) { 201cbf0: 80 a7 40 01 cmp %i5, %g1 201cbf4: 12 bf ff e6 bne 201cb8c <_Watchdog_Adjust_to_chain+0x2c> <== ALWAYS TAKEN 201cbf8: 80 a6 40 02 cmp %i1, %g2 if ( first->delta_interval != 0 ) break; } } _ISR_Enable( level ); 201cbfc: 7f ff ca c3 call 200f708 201cc00: 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; 201cc04: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( first->delta_interval != 0 ) break; } } _ISR_Enable( level ); 201cc08: 7f ff ca c0 call 200f708 201cc0c: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200b63c <_Watchdog_Remove>: #include Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 200b63c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 200b640: 7f ff db f3 call 200260c 200b644: 01 00 00 00 nop previous_state = the_watchdog->state; 200b648: fa 06 20 08 ld [ %i0 + 8 ], %i5 switch ( previous_state ) { 200b64c: 80 a7 60 01 cmp %i5, 1 200b650: 02 80 00 2a be 200b6f8 <_Watchdog_Remove+0xbc> 200b654: 03 00 80 79 sethi %hi(0x201e400), %g1 200b658: 1a 80 00 09 bcc 200b67c <_Watchdog_Remove+0x40> 200b65c: 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; 200b660: 03 00 80 79 sethi %hi(0x201e400), %g1 200b664: c2 00 60 0c ld [ %g1 + 0xc ], %g1 ! 201e40c <_Watchdog_Ticks_since_boot> 200b668: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200b66c: 7f ff db ec call 200261c 200b670: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200b674: 81 c7 e0 08 ret 200b678: 81 e8 00 00 restore Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); previous_state = the_watchdog->state; switch ( previous_state ) { 200b67c: 18 bf ff fa bgu 200b664 <_Watchdog_Remove+0x28> <== NEVER TAKEN 200b680: 03 00 80 79 sethi %hi(0x201e400), %g1 RTEMS_INLINE_ROUTINE Watchdog_Control *_Watchdog_Next( Watchdog_Control *the_watchdog ) { return ( (Watchdog_Control *) the_watchdog->Node.next ); 200b684: c2 06 00 00 ld [ %i0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 200b688: c0 26 20 08 clr [ %i0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 200b68c: c4 00 40 00 ld [ %g1 ], %g2 200b690: 80 a0 a0 00 cmp %g2, 0 200b694: 02 80 00 07 be 200b6b0 <_Watchdog_Remove+0x74> 200b698: 05 00 80 79 sethi %hi(0x201e400), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 200b69c: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200b6a0: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 200b6a4: 84 00 c0 02 add %g3, %g2, %g2 200b6a8: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 200b6ac: 05 00 80 79 sethi %hi(0x201e400), %g2 200b6b0: c4 00 a0 08 ld [ %g2 + 8 ], %g2 ! 201e408 <_Watchdog_Sync_count> 200b6b4: 80 a0 a0 00 cmp %g2, 0 200b6b8: 22 80 00 07 be,a 200b6d4 <_Watchdog_Remove+0x98> 200b6bc: c4 06 20 04 ld [ %i0 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 200b6c0: 05 00 80 7a sethi %hi(0x201e800), %g2 200b6c4: c6 00 a0 48 ld [ %g2 + 0x48 ], %g3 ! 201e848 <_Per_CPU_Information+0x8> 200b6c8: 05 00 80 78 sethi %hi(0x201e000), %g2 200b6cc: c6 20 a3 a8 st %g3, [ %g2 + 0x3a8 ] ! 201e3a8 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 200b6d0: c4 06 20 04 ld [ %i0 + 4 ], %g2 next->previous = previous; 200b6d4: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 200b6d8: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200b6dc: 03 00 80 79 sethi %hi(0x201e400), %g1 200b6e0: c2 00 60 0c ld [ %g1 + 0xc ], %g1 ! 201e40c <_Watchdog_Ticks_since_boot> 200b6e4: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200b6e8: 7f ff db cd call 200261c 200b6ec: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200b6f0: 81 c7 e0 08 ret 200b6f4: 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; 200b6f8: c2 00 60 0c ld [ %g1 + 0xc ], %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; 200b6fc: 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; 200b700: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200b704: 7f ff db c6 call 200261c 200b708: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200b70c: 81 c7 e0 08 ret 200b710: 81 e8 00 00 restore =============================================================================== 0200c8c4 <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200c8c4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200c8c8: 7f ff d9 9d call 2002f3c 200c8cc: 01 00 00 00 nop 200c8d0: b6 10 00 08 mov %o0, %i3 printk( "Watchdog Chain: %s %p\n", name, header ); 200c8d4: 11 00 80 78 sethi %hi(0x201e000), %o0 200c8d8: 94 10 00 19 mov %i1, %o2 200c8dc: 92 10 00 18 mov %i0, %o1 200c8e0: 7f ff e1 52 call 2004e28 200c8e4: 90 12 21 f8 or %o0, 0x1f8, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200c8e8: 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 ); 200c8ec: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200c8f0: 80 a7 40 19 cmp %i5, %i1 200c8f4: 02 80 00 0f be 200c930 <_Watchdog_Report_chain+0x6c> 200c8f8: 11 00 80 78 sethi %hi(0x201e000), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200c8fc: 92 10 00 1d mov %i5, %o1 200c900: 40 00 00 0f call 200c93c <_Watchdog_Report> 200c904: 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 ) 200c908: 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 ) ; 200c90c: 80 a7 40 19 cmp %i5, %i1 200c910: 12 bf ff fc bne 200c900 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 200c914: 92 10 00 1d mov %i5, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200c918: 11 00 80 78 sethi %hi(0x201e000), %o0 200c91c: 92 10 00 18 mov %i0, %o1 200c920: 7f ff e1 42 call 2004e28 200c924: 90 12 22 10 or %o0, 0x210, %o0 } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); 200c928: 7f ff d9 89 call 2002f4c 200c92c: 91 e8 00 1b restore %g0, %i3, %o0 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200c930: 7f ff e1 3e call 2004e28 200c934: 90 12 22 20 or %o0, 0x220, %o0 200c938: 30 bf ff fc b,a 200c928 <_Watchdog_Report_chain+0x64> =============================================================================== 0200b714 <_Watchdog_Tickle>: #include void _Watchdog_Tickle( Chain_Control *header ) { 200b714: 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 ); 200b718: 7f ff db bd call 200260c 200b71c: 01 00 00 00 nop 200b720: 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; 200b724: 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 ); 200b728: b4 06 20 04 add %i0, 4, %i2 if ( _Chain_Is_empty( header ) ) 200b72c: 80 a7 40 1a cmp %i5, %i2 200b730: 02 80 00 09 be 200b754 <_Watchdog_Tickle+0x40> 200b734: 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) { 200b738: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200b73c: 80 a0 60 00 cmp %g1, 0 200b740: 02 80 00 15 be 200b794 <_Watchdog_Tickle+0x80> <== NEVER TAKEN 200b744: 82 00 7f ff add %g1, -1, %g1 the_watchdog->delta_interval--; if ( the_watchdog->delta_interval != 0 ) 200b748: 80 a0 60 00 cmp %g1, 0 200b74c: 02 80 00 12 be 200b794 <_Watchdog_Tickle+0x80> 200b750: 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); 200b754: 7f ff db b2 call 200261c 200b758: 91 e8 00 1c restore %g0, %i4, %o0 _ISR_Enable( level ); switch( watchdog_state ) { case WATCHDOG_ACTIVE: (*the_watchdog->routine)( 200b75c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200b760: 9f c0 40 00 call %g1 200b764: d2 07 60 24 ld [ %i5 + 0x24 ], %o1 case WATCHDOG_REMOVE_IT: break; } _ISR_Disable( level ); 200b768: 7f ff db a9 call 200260c 200b76c: 01 00 00 00 nop 200b770: b8 10 00 08 mov %o0, %i4 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200b774: fa 06 00 00 ld [ %i0 ], %i5 the_watchdog = _Watchdog_First( header ); } while ( !_Chain_Is_empty( header ) && (the_watchdog->delta_interval == 0) ); 200b778: 80 a6 80 1d cmp %i2, %i5 200b77c: 02 bf ff f6 be 200b754 <_Watchdog_Tickle+0x40> 200b780: 01 00 00 00 nop } _ISR_Disable( level ); the_watchdog = _Watchdog_First( header ); } while ( !_Chain_Is_empty( header ) && 200b784: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200b788: 80 a0 60 00 cmp %g1, 0 200b78c: 12 bf ff f2 bne 200b754 <_Watchdog_Tickle+0x40> 200b790: 01 00 00 00 nop if ( the_watchdog->delta_interval != 0 ) goto leave; } do { watchdog_state = _Watchdog_Remove( the_watchdog ); 200b794: 7f ff ff aa call 200b63c <_Watchdog_Remove> 200b798: 90 10 00 1d mov %i5, %o0 200b79c: b6 10 00 08 mov %o0, %i3 _ISR_Enable( level ); 200b7a0: 7f ff db 9f call 200261c 200b7a4: 90 10 00 1c mov %i4, %o0 switch( watchdog_state ) { 200b7a8: 80 a6 e0 02 cmp %i3, 2 200b7ac: 12 bf ff ef bne 200b768 <_Watchdog_Tickle+0x54> 200b7b0: 01 00 00 00 nop case WATCHDOG_ACTIVE: (*the_watchdog->routine)( 200b7b4: 10 bf ff ea b 200b75c <_Watchdog_Tickle+0x48> 200b7b8: d0 07 60 20 ld [ %i5 + 0x20 ], %o0 =============================================================================== 0200b7bc <_Workspace_Handler_initialization>: void _Workspace_Handler_initialization( Heap_Area *areas, size_t area_count, Heap_Initialization_or_extend_handler extend ) { 200b7bc: 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(); 200b7c0: 05 00 80 6d sethi %hi(0x201b400), %g2 200b7c4: 82 10 a0 c8 or %g2, 0xc8, %g1 ! 201b4c8 200b7c8: c6 08 60 32 ldub [ %g1 + 0x32 ], %g3 200b7cc: f6 00 a0 c8 ld [ %g2 + 0xc8 ], %i3 200b7d0: 80 a0 e0 00 cmp %g3, 0 200b7d4: 12 80 00 03 bne 200b7e0 <_Workspace_Handler_initialization+0x24> 200b7d8: 84 10 20 00 clr %g2 200b7dc: c4 00 60 04 ld [ %g1 + 4 ], %g2 200b7e0: b6 00 80 1b add %g2, %i3, %i3 bool do_zero = rtems_configuration_get_do_zero_of_workspace(); 200b7e4: c4 08 60 30 ldub [ %g1 + 0x30 ], %g2 bool unified = rtems_configuration_get_unified_work_area(); 200b7e8: 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(); 200b7ec: 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) { 200b7f0: 80 a6 60 00 cmp %i1, 0 200b7f4: 02 80 00 3c be 200b8e4 <_Workspace_Handler_initialization+0x128><== NEVER TAKEN 200b7f8: 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; 200b7fc: 23 00 80 23 sethi %hi(0x2008c00), %l1 } else { size = 0; } } space_available = (*init_or_extend)( 200b800: 27 00 80 78 sethi %hi(0x201e000), %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) { 200b804: 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; 200b808: a2 14 62 6c or %l1, 0x26c, %l1 200b80c: a0 08 a0 ff and %g2, 0xff, %l0 if ( area->size > overhead ) { uintptr_t space_available; uintptr_t size; if ( unified ) { 200b810: a4 08 60 ff and %g1, 0xff, %l2 } else { size = 0; } } space_available = (*init_or_extend)( 200b814: 10 80 00 22 b 200b89c <_Workspace_Handler_initialization+0xe0> 200b818: a6 14 e3 30 or %l3, 0x330, %l3 if ( do_zero ) { memset( area->begin, 0, area->size ); } if ( area->size > overhead ) { 200b81c: 80 a7 60 16 cmp %i5, 0x16 200b820: 28 80 00 1c bleu,a 200b890 <_Workspace_Handler_initialization+0xd4> 200b824: b8 07 20 01 inc %i4 uintptr_t space_available; uintptr_t size; if ( unified ) { 200b828: 80 a4 a0 00 cmp %l2, 0 200b82c: 32 80 00 0a bne,a 200b854 <_Workspace_Handler_initialization+0x98> 200b830: d2 06 00 00 ld [ %i0 ], %o1 size = area->size; } else { if ( remaining > 0 ) { 200b834: 80 a6 e0 00 cmp %i3, 0 200b838: 22 80 00 22 be,a 200b8c0 <_Workspace_Handler_initialization+0x104><== NEVER TAKEN 200b83c: d2 06 00 00 ld [ %i0 ], %o1 <== NOT EXECUTED size = remaining < area->size - overhead ? 200b840: 82 07 7f ea add %i5, -22, %g1 remaining + overhead : area->size; 200b844: 80 a0 40 1b cmp %g1, %i3 200b848: 38 80 00 02 bgu,a 200b850 <_Workspace_Handler_initialization+0x94><== ALWAYS TAKEN 200b84c: ba 06 e0 16 add %i3, 0x16, %i5 } else { size = 0; } } space_available = (*init_or_extend)( 200b850: d2 06 00 00 ld [ %i0 ], %o1 200b854: 94 10 00 1d mov %i5, %o2 200b858: 90 10 00 13 mov %l3, %o0 200b85c: 9f c4 40 00 call %l1 200b860: 96 10 20 08 mov 8, %o3 area->begin, size, page_size ); area->begin = (char *) area->begin + size; 200b864: c2 06 00 00 ld [ %i0 ], %g1 area->size -= size; 200b868: c4 06 20 04 ld [ %i0 + 4 ], %g2 area->begin, size, page_size ); area->begin = (char *) area->begin + size; 200b86c: 82 00 40 1d add %g1, %i5, %g1 area->size -= size; 200b870: ba 20 80 1d sub %g2, %i5, %i5 area->begin, size, page_size ); area->begin = (char *) area->begin + size; 200b874: c2 26 00 00 st %g1, [ %i0 ] area->size -= size; if ( space_available < remaining ) { 200b878: 80 a2 00 1b cmp %o0, %i3 200b87c: 1a 80 00 1f bcc 200b8f8 <_Workspace_Handler_initialization+0x13c><== ALWAYS TAKEN 200b880: fa 26 20 04 st %i5, [ %i0 + 4 ] remaining -= space_available; 200b884: b6 26 c0 08 sub %i3, %o0, %i3 <== NOT EXECUTED } else { remaining = 0; } init_or_extend = extend; 200b888: 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) { 200b88c: b8 07 20 01 inc %i4 200b890: 80 a7 00 19 cmp %i4, %i1 200b894: 02 80 00 14 be 200b8e4 <_Workspace_Handler_initialization+0x128><== ALWAYS TAKEN 200b898: b0 06 20 08 add %i0, 8, %i0 Heap_Area *area = &areas [i]; if ( do_zero ) { 200b89c: 80 a4 20 00 cmp %l0, 0 200b8a0: 22 bf ff df be,a 200b81c <_Workspace_Handler_initialization+0x60> 200b8a4: fa 06 20 04 ld [ %i0 + 4 ], %i5 memset( area->begin, 0, area->size ); 200b8a8: d0 06 00 00 ld [ %i0 ], %o0 200b8ac: d4 06 20 04 ld [ %i0 + 4 ], %o2 200b8b0: 40 00 15 58 call 2010e10 200b8b4: 92 10 20 00 clr %o1 } if ( area->size > overhead ) { 200b8b8: 10 bf ff d9 b 200b81c <_Workspace_Handler_initialization+0x60> 200b8bc: fa 06 20 04 ld [ %i0 + 4 ], %i5 } else { size = 0; } } space_available = (*init_or_extend)( 200b8c0: 90 10 00 13 mov %l3, %o0 <== NOT EXECUTED 200b8c4: 94 10 20 00 clr %o2 <== NOT EXECUTED 200b8c8: 9f c4 40 00 call %l1 <== NOT EXECUTED 200b8cc: 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) { 200b8d0: b8 07 20 01 inc %i4 <== NOT EXECUTED remaining -= space_available; } else { remaining = 0; } init_or_extend = extend; 200b8d4: 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) { 200b8d8: 80 a7 00 19 cmp %i4, %i1 <== NOT EXECUTED 200b8dc: 12 bf ff f0 bne 200b89c <_Workspace_Handler_initialization+0xe0><== NOT EXECUTED 200b8e0: b0 06 20 08 add %i0, 8, %i0 <== NOT EXECUTED init_or_extend = extend; } } if ( remaining > 0 ) { 200b8e4: 80 a6 e0 00 cmp %i3, 0 200b8e8: 12 80 00 07 bne 200b904 <_Workspace_Handler_initialization+0x148> 200b8ec: 90 10 20 00 clr %o0 200b8f0: 81 c7 e0 08 ret 200b8f4: 81 e8 00 00 restore remaining -= space_available; } else { remaining = 0; } init_or_extend = extend; 200b8f8: a2 10 00 1a mov %i2, %l1 area->size -= size; if ( space_available < remaining ) { remaining -= space_available; } else { remaining = 0; 200b8fc: 10 bf ff e4 b 200b88c <_Workspace_Handler_initialization+0xd0> 200b900: b6 10 20 00 clr %i3 init_or_extend = extend; } } if ( remaining > 0 ) { _Internal_error_Occurred( 200b904: 92 10 20 01 mov 1, %o1 200b908: 7f ff f5 f6 call 20090e0 <_Internal_error_Occurred> 200b90c: 94 10 20 02 mov 2, %o2 =============================================================================== 0201405c <_fat_block_read>: uint32_t start, uint32_t offset, uint32_t count, void *buff ) { 201405c: 9d e3 bf 98 save %sp, -104, %sp 2014060: 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) 2014064: 80 a6 e0 00 cmp %i3, 0 2014068: 12 80 00 11 bne 20140ac <_fat_block_read+0x50> <== ALWAYS TAKEN 201406c: b0 10 20 00 clr %i0 2014070: 30 80 00 19 b,a 20140d4 <_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)); 2014074: fa 14 00 00 lduh [ %l0 ], %i5 memcpy((buff + cmpltd), (sec_buf + ofs), c); 2014078: 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)); 201407c: ba 27 40 1a sub %i5, %i2, %i5 2014080: 80 a7 40 1b cmp %i5, %i3 2014084: 08 80 00 03 bleu 2014090 <_fat_block_read+0x34> 2014088: 92 02 40 1a add %o1, %i2, %o1 201408c: ba 10 00 1b mov %i3, %i5 memcpy((buff + cmpltd), (sec_buf + ofs), c); 2014090: 40 00 26 ce call 201dbc8 2014094: 94 10 00 1d mov %i5, %o2 count -= c; cmpltd += c; 2014098: b0 07 40 18 add %i5, %i0, %i0 sec_num++; 201409c: 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) 20140a0: b6 a6 c0 1d subcc %i3, %i5, %i3 20140a4: 02 80 00 0c be 20140d4 <_fat_block_read+0x78> 20140a8: b4 10 20 00 clr %i2 { rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_READ, &sec_buf); 20140ac: 92 10 00 19 mov %i1, %o1 20140b0: 94 10 20 01 mov 1, %o2 20140b4: 96 07 bf fc add %fp, -4, %o3 20140b8: 7f ff ff bb call 2013fa4 20140bc: 90 10 00 10 mov %l0, %o0 if (rc != RC_OK) 20140c0: 80 a2 20 00 cmp %o0, 0 20140c4: 02 bf ff ec be 2014074 <_fat_block_read+0x18> <== ALWAYS TAKEN 20140c8: 90 07 00 18 add %i4, %i0, %o0 cmpltd += c; sec_num++; ofs = 0; } return cmpltd; } 20140cc: 81 c7 e0 08 ret <== NOT EXECUTED 20140d0: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED 20140d4: 81 c7 e0 08 ret 20140d8: 81 e8 00 00 restore =============================================================================== 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 =============================================================================== 02007984 : */ int adjtime( const struct timeval *delta, struct timeval *olddelta ) { 2007984: 9d e3 bf 98 save %sp, -104, %sp long adjustment; /* * Simple validations */ if ( !delta ) 2007988: 80 a6 20 00 cmp %i0, 0 200798c: 02 80 00 8e be 2007bc4 2007990: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) 2007994: c4 06 20 04 ld [ %i0 + 4 ], %g2 2007998: 03 00 03 d0 sethi %hi(0xf4000), %g1 200799c: 82 10 62 3f or %g1, 0x23f, %g1 ! f423f 20079a0: 80 a0 80 01 cmp %g2, %g1 20079a4: 18 80 00 88 bgu 2007bc4 20079a8: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); if ( olddelta ) { 20079ac: 22 80 00 06 be,a 20079c4 20079b0: c2 06 00 00 ld [ %i0 ], %g1 olddelta->tv_sec = 0; olddelta->tv_usec = 0; 20079b4: c0 26 60 04 clr [ %i1 + 4 ] 20079b8: c4 06 20 04 ld [ %i0 + 4 ], %g2 if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( olddelta ) { olddelta->tv_sec = 0; 20079bc: c0 26 40 00 clr [ %i1 ] olddelta->tv_usec = 0; } /* convert delta to microseconds */ adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND); 20079c0: c2 06 00 00 ld [ %i0 ], %g1 adjustment += delta->tv_usec; /* too small to account for */ if ( adjustment < rtems_configuration_get_microseconds_per_tick() ) 20079c4: 07 00 80 77 sethi %hi(0x201dc00), %g3 20079c8: c8 00 e0 0c ld [ %g3 + 0xc ], %g4 ! 201dc0c olddelta->tv_sec = 0; olddelta->tv_usec = 0; } /* convert delta to microseconds */ adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND); 20079cc: bb 28 60 08 sll %g1, 8, %i5 20079d0: 87 28 60 03 sll %g1, 3, %g3 20079d4: 86 27 40 03 sub %i5, %g3, %g3 20079d8: bb 28 e0 06 sll %g3, 6, %i5 20079dc: 86 27 40 03 sub %i5, %g3, %g3 20079e0: 82 00 c0 01 add %g3, %g1, %g1 20079e4: 83 28 60 06 sll %g1, 6, %g1 adjustment += delta->tv_usec; 20079e8: 84 00 40 02 add %g1, %g2, %g2 /* too small to account for */ if ( adjustment < rtems_configuration_get_microseconds_per_tick() ) 20079ec: 80 a0 80 04 cmp %g2, %g4 20079f0: 1a 80 00 05 bcc 2007a04 20079f4: 03 00 80 83 sethi %hi(0x2020c00), %g1 return 0; 20079f8: 82 10 20 00 clr %g1 /* set the user's output */ if ( olddelta ) *olddelta = *delta; return 0; } 20079fc: 81 c7 e0 08 ret 2007a00: 91 e8 00 01 restore %g0, %g1, %o0 * * 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; 2007a04: c4 00 63 e0 ld [ %g1 + 0x3e0 ], %g2 ++level; 2007a08: 84 00 a0 01 inc %g2 _Thread_Dispatch_disable_level = level; 2007a0c: c4 20 63 e0 st %g2, [ %g1 + 0x3e0 ] ) { Timestamp_Control tod_as_timestamp; Timestamp_Control *tod_as_timestamp_ptr; tod_as_timestamp_ptr = 2007a10: 13 00 80 83 sethi %hi(0x2020c00), %o1 2007a14: 90 07 bf f8 add %fp, -8, %o0 2007a18: 40 00 07 2e call 20096d0 <_TOD_Get_with_nanoseconds> 2007a1c: 92 12 63 28 or %o1, 0x328, %o1 2007a20: f8 1a 00 00 ldd [ %o0 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007a24: 94 10 20 00 clr %o2 2007a28: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007a2c: 90 10 00 1c mov %i4, %o0 2007a30: 96 12 e2 00 or %o3, 0x200, %o3 2007a34: 40 00 51 5b call 201bfa0 <__divdi3> 2007a38: 92 10 00 1d mov %i5, %o1 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; 2007a3c: f6 06 00 00 ld [ %i0 ], %i3 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007a40: 94 10 20 00 clr %o2 2007a44: b6 06 c0 09 add %i3, %o1, %i3 2007a48: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007a4c: 90 10 00 1c mov %i4, %o0 2007a50: 96 12 e2 00 or %o3, 0x200, %o3 2007a54: 40 00 52 3e call 201c34c <__moddi3> 2007a58: 92 10 00 1d mov %i5, %o1 ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2007a5c: c2 06 20 04 ld [ %i0 + 4 ], %g1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 2007a60: 09 31 19 4d sethi %hi(0xc4653400), %g4 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2007a64: 87 28 60 07 sll %g1, 7, %g3 2007a68: 85 28 60 02 sll %g1, 2, %g2 2007a6c: 84 20 c0 02 sub %g3, %g2, %g2 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 2007a70: 88 11 22 00 or %g4, 0x200, %g4 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2007a74: 82 00 80 01 add %g2, %g1, %g1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2007a78: 07 0e e6 b2 sethi %hi(0x3b9ac800), %g3 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2007a7c: 83 28 60 03 sll %g1, 3, %g1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2007a80: 86 10 e1 ff or %g3, 0x1ff, %g3 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2007a84: 92 02 40 01 add %o1, %g1, %o1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2007a88: 80 a2 40 03 cmp %o1, %g3 2007a8c: 08 80 00 07 bleu 2007aa8 2007a90: 84 06 e0 01 add %i3, 1, %g2 ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 2007a94: 92 02 40 04 add %o1, %g4, %o1 ts.tv_sec++; 2007a98: b6 10 00 02 mov %g2, %i3 ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2007a9c: 80 a2 40 03 cmp %o1, %g3 2007aa0: 18 bf ff fd bgu 2007a94 <== NEVER TAKEN 2007aa4: 84 00 a0 01 inc %g2 ts.tv_sec++; } /* if adjustment is too much negative */ while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) { ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND; 2007aa8: 3b 0e e6 b2 sethi %hi(0x3b9ac800), %i5 ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; ts.tv_sec++; } /* if adjustment is too much negative */ while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) { 2007aac: 07 31 19 4d sethi %hi(0xc4653400), %g3 2007ab0: 82 10 00 09 mov %o1, %g1 int _EXFUN(setitimer, (int __which, const struct itimerval *__value, struct itimerval *__ovalue)); #if defined(__rtems__) /* BSD function used by RTEMS code */ int _EXFUN(adjtime,(const struct timeval *, struct timeval *)); 2007ab4: 84 06 ff ff add %i3, -1, %g2 ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND; 2007ab8: ba 17 62 00 or %i5, 0x200, %i5 ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; ts.tv_sec++; } /* if adjustment is too much negative */ while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) { 2007abc: 86 10 e2 00 or %g3, 0x200, %g3 ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND; 2007ac0: 82 00 40 1d add %g1, %i5, %g1 ts.tv_sec--; 2007ac4: 88 10 00 02 mov %g2, %g4 ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; ts.tv_sec++; } /* if adjustment is too much negative */ while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) { 2007ac8: 80 a0 40 03 cmp %g1, %g3 2007acc: 08 bf ff fd bleu 2007ac0 2007ad0: 84 00 bf ff add %g2, -1, %g2 const struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _Timestamp_Set( 2007ad4: 85 39 20 1f sra %g4, 0x1f, %g2 2007ad8: a6 10 00 01 mov %g1, %l3 2007adc: a5 38 60 1f sra %g1, 0x1f, %l2 Timestamp64_Control *_time, Timestamp64_Control _seconds, Timestamp64_Control _nanoseconds ) { *_time = _seconds * 1000000000L + _nanoseconds; 2007ae0: 83 28 a0 03 sll %g2, 3, %g1 2007ae4: 86 10 00 04 mov %g4, %g3 2007ae8: 89 31 20 1d srl %g4, 0x1d, %g4 2007aec: bb 28 e0 03 sll %g3, 3, %i5 2007af0: b8 11 00 01 or %g4, %g1, %i4 2007af4: 83 37 60 1b srl %i5, 0x1b, %g1 2007af8: a9 2f 20 05 sll %i4, 5, %l4 2007afc: ab 2f 60 05 sll %i5, 5, %l5 2007b00: a8 10 40 14 or %g1, %l4, %l4 2007b04: ba a5 40 1d subcc %l5, %i5, %i5 2007b08: 83 37 60 1a srl %i5, 0x1a, %g1 2007b0c: b8 65 00 1c subx %l4, %i4, %i4 2007b10: a3 2f 60 06 sll %i5, 6, %l1 2007b14: a1 2f 20 06 sll %i4, 6, %l0 2007b18: ba a4 40 1d subcc %l1, %i5, %i5 2007b1c: a0 10 40 10 or %g1, %l0, %l0 2007b20: b8 64 00 1c subx %l0, %i4, %i4 2007b24: ae 87 40 03 addcc %i5, %g3, %l7 2007b28: 83 35 e0 1e srl %l7, 0x1e, %g1 2007b2c: ac 47 00 02 addx %i4, %g2, %l6 2007b30: 97 2d e0 02 sll %l7, 2, %o3 2007b34: 95 2d a0 02 sll %l6, 2, %o2 2007b38: 86 85 c0 0b addcc %l7, %o3, %g3 2007b3c: 94 10 40 0a or %g1, %o2, %o2 2007b40: 9b 28 e0 02 sll %g3, 2, %o5 2007b44: 84 45 80 0a addx %l6, %o2, %g2 2007b48: 83 30 e0 1e srl %g3, 0x1e, %g1 2007b4c: ba 80 c0 0d addcc %g3, %o5, %i5 2007b50: 99 28 a0 02 sll %g2, 2, %o4 2007b54: b7 2f 60 02 sll %i5, 2, %i3 2007b58: 98 10 40 0c or %g1, %o4, %o4 2007b5c: 83 37 60 1e srl %i5, 0x1e, %g1 2007b60: b8 40 80 0c addx %g2, %o4, %i4 2007b64: 86 87 40 1b addcc %i5, %i3, %g3 2007b68: b5 2f 20 02 sll %i4, 2, %i2 2007b6c: bb 30 e0 17 srl %g3, 0x17, %i5 2007b70: b4 10 40 1a or %g1, %i2, %i2 2007b74: 84 47 00 1a addx %i4, %i2, %g2 2007b78: 83 28 e0 09 sll %g3, 9, %g1 2007b7c: 89 28 a0 09 sll %g2, 9, %g4 &tod_as_timestamp, tod_as_timespec->tv_sec, tod_as_timespec->tv_nsec ); _TOD_Set_with_timestamp( &tod_as_timestamp ); 2007b80: 90 07 bf f8 add %fp, -8, %o0 2007b84: 84 17 40 04 or %i5, %g4, %g2 2007b88: ba 84 c0 01 addcc %l3, %g1, %i5 2007b8c: b8 44 80 02 addx %l2, %g2, %i4 2007b90: 40 00 06 eb call 200973c <_TOD_Set_with_timestamp> 2007b94: f8 3f bf f8 std %i4, [ %fp + -8 ] ts.tv_sec--; } _TOD_Set( &ts ); _Thread_Enable_dispatch(); 2007b98: 40 00 0d c7 call 200b2b4 <_Thread_Enable_dispatch> 2007b9c: 01 00 00 00 nop /* set the user's output */ if ( olddelta ) 2007ba0: 80 a6 60 00 cmp %i1, 0 2007ba4: 02 bf ff 95 be 20079f8 2007ba8: 82 10 20 00 clr %g1 *olddelta = *delta; 2007bac: c4 06 00 00 ld [ %i0 ], %g2 2007bb0: c4 26 40 00 st %g2, [ %i1 ] 2007bb4: c4 06 20 04 ld [ %i0 + 4 ], %g2 2007bb8: c4 26 60 04 st %g2, [ %i1 + 4 ] return 0; } 2007bbc: 81 c7 e0 08 ret 2007bc0: 91 e8 00 01 restore %g0, %g1, %o0 */ if ( !delta ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) rtems_set_errno_and_return_minus_one( EINVAL ); 2007bc4: 40 00 25 2c call 2011074 <__errno> 2007bc8: 01 00 00 00 nop 2007bcc: 84 10 20 16 mov 0x16, %g2 ! 16 2007bd0: 82 10 3f ff mov -1, %g1 2007bd4: 10 bf ff 8a b 20079fc 2007bd8: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 02007b90 : #include #include #include int aio_cancel(int fildes, struct aiocb *aiocbp) { 2007b90: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request_chain *r_chain; int result; pthread_mutex_lock (&aio_request_queue.mutex); 2007b94: 3b 00 80 82 sethi %hi(0x2020800), %i5 2007b98: 40 00 04 85 call 2008dac 2007b9c: 90 17 60 4c or %i5, 0x4c, %o0 ! 202084c if (fcntl (fildes, F_GETFD) < 0) { 2007ba0: 90 10 00 18 mov %i0, %o0 2007ba4: 40 00 1c 73 call 200ed70 2007ba8: 92 10 20 01 mov 1, %o1 2007bac: 80 a2 20 00 cmp %o0, 0 2007bb0: 06 80 00 6c bl 2007d60 2007bb4: 80 a6 60 00 cmp %i1, 0 pthread_mutex_unlock(&aio_request_queue.mutex); rtems_set_errno_and_return_minus_one (EBADF); } /* if aiocbp is NULL remove all request for given file descriptor */ if (aiocbp == NULL) { 2007bb8: 02 80 00 3b be 2007ca4 2007bbc: 92 10 00 18 mov %i0, %o1 pthread_mutex_unlock (&aio_request_queue.mutex); return AIO_CANCELED; } else { AIO_printf ("Cancel request\n"); if (aiocbp->aio_fildes != fildes) { 2007bc0: f8 06 40 00 ld [ %i1 ], %i4 2007bc4: 80 a7 00 18 cmp %i4, %i0 2007bc8: 12 80 00 2f bne 2007c84 2007bcc: 90 17 60 4c or %i5, 0x4c, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); rtems_set_errno_and_return_minus_one (EINVAL); } r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); 2007bd0: 92 10 00 1c mov %i4, %o1 2007bd4: 11 00 80 82 sethi %hi(0x2020800), %o0 2007bd8: 94 10 20 00 clr %o2 2007bdc: 40 00 01 92 call 2008224 2007be0: 90 12 20 94 or %o0, 0x94, %o0 if (r_chain == NULL) { 2007be4: b6 92 20 00 orcc %o0, 0, %i3 2007be8: 22 80 00 0f be,a 2007c24 2007bec: b6 17 60 4c or %i5, 0x4c, %i3 return AIO_ALLDONE; } } AIO_printf ("Request on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2007bf0: b8 06 e0 1c add %i3, 0x1c, %i4 2007bf4: 40 00 04 6e call 2008dac 2007bf8: 90 10 00 1c mov %i4, %o0 result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2007bfc: 92 10 00 19 mov %i1, %o1 2007c00: 40 00 01 d2 call 2008348 2007c04: 90 06 e0 08 add %i3, 8, %o0 2007c08: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&r_chain->mutex); 2007c0c: 40 00 04 88 call 2008e2c 2007c10: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2007c14: 40 00 04 86 call 2008e2c 2007c18: 90 17 60 4c or %i5, 0x4c, %o0 return result; } return AIO_ALLDONE; } 2007c1c: 81 c7 e0 08 ret 2007c20: 81 e8 00 00 restore rtems_set_errno_and_return_minus_one (EINVAL); } r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); if (r_chain == NULL) { if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2007c24: c4 06 e0 54 ld [ %i3 + 0x54 ], %g2 2007c28: 82 06 e0 58 add %i3, 0x58, %g1 2007c2c: 80 a0 80 01 cmp %g2, %g1 2007c30: 02 80 00 0f be 2007c6c <== NEVER TAKEN 2007c34: 90 06 e0 54 add %i3, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 2007c38: 92 10 00 1c mov %i4, %o1 2007c3c: 40 00 01 7a call 2008224 2007c40: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2007c44: 80 a2 20 00 cmp %o0, 0 2007c48: 02 80 00 0e be 2007c80 2007c4c: 92 10 00 19 mov %i1, %o1 rtems_set_errno_and_return_minus_one (EINVAL); } AIO_printf ("Request on [IQ]\n"); result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2007c50: 40 00 01 be call 2008348 2007c54: 90 02 20 08 add %o0, 8, %o0 2007c58: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&aio_request_queue.mutex); 2007c5c: 40 00 04 74 call 2008e2c 2007c60: 90 10 00 1b mov %i3, %o0 return result; 2007c64: 81 c7 e0 08 ret 2007c68: 81 e8 00 00 restore if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); if (r_chain == NULL) { pthread_mutex_unlock(&aio_request_queue.mutex); return AIO_ALLDONE; 2007c6c: b0 10 20 02 mov 2, %i0 <== NOT EXECUTED AIO_printf ("Request chain not on [WQ]\n"); if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); if (r_chain == NULL) { pthread_mutex_unlock(&aio_request_queue.mutex); 2007c70: 40 00 04 6f call 2008e2c 2007c74: 90 17 60 4c or %i5, 0x4c, %o0 return AIO_ALLDONE; 2007c78: 81 c7 e0 08 ret 2007c7c: 81 e8 00 00 restore r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); if (r_chain == NULL) { if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); if (r_chain == NULL) { pthread_mutex_unlock (&aio_request_queue.mutex); 2007c80: 90 10 00 1b mov %i3, %o0 2007c84: 40 00 04 6a call 2008e2c 2007c88: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one (EINVAL); 2007c8c: 40 00 2a eb call 2012838 <__errno> 2007c90: 01 00 00 00 nop 2007c94: 82 10 20 16 mov 0x16, %g1 ! 16 2007c98: c2 22 00 00 st %g1, [ %o0 ] 2007c9c: 81 c7 e0 08 ret 2007ca0: 81 e8 00 00 restore /* if aiocbp is NULL remove all request for given file descriptor */ if (aiocbp == NULL) { AIO_printf ("Cancel all requests\n"); r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); 2007ca4: 11 00 80 82 sethi %hi(0x2020800), %o0 2007ca8: 94 10 20 00 clr %o2 2007cac: 40 00 01 5e call 2008224 2007cb0: 90 12 20 94 or %o0, 0x94, %o0 if (r_chain == NULL) { 2007cb4: b8 92 20 00 orcc %o0, 0, %i4 2007cb8: 02 80 00 0f be 2007cf4 2007cbc: b6 07 20 1c add %i4, 0x1c, %i3 return AIO_ALLDONE; } AIO_printf ("Request chain on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2007cc0: 40 00 04 3b call 2008dac 2007cc4: 90 10 00 1b mov %i3, %o0 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2007cc8: 40 00 0b 3a call 200a9b0 <_Chain_Extract> 2007ccc: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 2007cd0: 40 00 01 8a call 20082f8 2007cd4: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&r_chain->mutex); 2007cd8: 40 00 04 55 call 2008e2c 2007cdc: 90 10 00 1b mov %i3, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); return AIO_CANCELED; 2007ce0: b0 10 20 00 clr %i0 pthread_mutex_lock (&r_chain->mutex); rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); pthread_mutex_unlock (&r_chain->mutex); pthread_mutex_unlock (&aio_request_queue.mutex); 2007ce4: 40 00 04 52 call 2008e2c 2007ce8: 90 17 60 4c or %i5, 0x4c, %o0 return AIO_CANCELED; 2007cec: 81 c7 e0 08 ret 2007cf0: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2007cf4: b8 17 60 4c or %i5, 0x4c, %i4 r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); if (r_chain == NULL) { AIO_printf ("Request chain not on [WQ]\n"); if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2007cf8: c4 07 20 54 ld [ %i4 + 0x54 ], %g2 2007cfc: 82 07 20 58 add %i4, 0x58, %g1 2007d00: 80 a0 80 01 cmp %g2, %g1 2007d04: 02 bf ff da be 2007c6c <== NEVER TAKEN 2007d08: 90 07 20 54 add %i4, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 2007d0c: 92 10 00 18 mov %i0, %o1 2007d10: 40 00 01 45 call 2008224 2007d14: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2007d18: b6 92 20 00 orcc %o0, 0, %i3 2007d1c: 22 bf ff d5 be,a 2007c70 2007d20: b0 10 20 02 mov 2, %i0 2007d24: 40 00 0b 23 call 200a9b0 <_Chain_Extract> 2007d28: ba 06 e0 1c add %i3, 0x1c, %i5 } AIO_printf ("Request chain on [IQ]\n"); rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 2007d2c: 40 00 01 73 call 20082f8 2007d30: 90 10 00 1b mov %i3, %o0 pthread_mutex_destroy (&r_chain->mutex); 2007d34: 40 00 03 72 call 2008afc 2007d38: 90 10 00 1d mov %i5, %o0 pthread_cond_destroy (&r_chain->mutex); 2007d3c: 40 00 02 94 call 200878c 2007d40: 90 10 00 1d mov %i5, %o0 free (r_chain); 2007d44: 7f ff ef 9a call 2003bac 2007d48: 90 10 00 1b mov %i3, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); return AIO_CANCELED; 2007d4c: b0 10 20 00 clr %i0 rtems_aio_remove_fd (r_chain); pthread_mutex_destroy (&r_chain->mutex); pthread_cond_destroy (&r_chain->mutex); free (r_chain); pthread_mutex_unlock (&aio_request_queue.mutex); 2007d50: 40 00 04 37 call 2008e2c 2007d54: 90 10 00 1c mov %i4, %o0 return AIO_CANCELED; 2007d58: 81 c7 e0 08 ret 2007d5c: 81 e8 00 00 restore int result; pthread_mutex_lock (&aio_request_queue.mutex); if (fcntl (fildes, F_GETFD) < 0) { pthread_mutex_unlock(&aio_request_queue.mutex); 2007d60: 40 00 04 33 call 2008e2c 2007d64: 90 17 60 4c or %i5, 0x4c, %o0 rtems_set_errno_and_return_minus_one (EBADF); 2007d68: 40 00 2a b4 call 2012838 <__errno> 2007d6c: b0 10 3f ff mov -1, %i0 2007d70: 82 10 20 09 mov 9, %g1 2007d74: c2 22 00 00 st %g1, [ %o0 ] 2007d78: 81 c7 e0 08 ret 2007d7c: 81 e8 00 00 restore =============================================================================== 02007d88 : int aio_fsync( int op, struct aiocb *aiocbp ) { 2007d88: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; if (op != O_SYNC) 2007d8c: 03 00 00 08 sethi %hi(0x2000), %g1 2007d90: 80 a6 00 01 cmp %i0, %g1 2007d94: 12 80 00 14 bne 2007de4 2007d98: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2007d9c: d0 06 40 00 ld [ %i1 ], %o0 2007da0: 40 00 1b f4 call 200ed70 2007da4: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2007da8: 90 0a 20 03 and %o0, 3, %o0 2007dac: 90 02 3f ff add %o0, -1, %o0 2007db0: 80 a2 20 01 cmp %o0, 1 2007db4: 18 80 00 0c bgu 2007de4 2007db8: ba 10 20 09 mov 9, %i5 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2007dbc: 7f ff f0 a3 call 2004048 2007dc0: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2007dc4: 80 a2 20 00 cmp %o0, 0 2007dc8: 02 80 00 06 be 2007de0 <== NEVER TAKEN 2007dcc: 82 10 20 03 mov 3, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 2007dd0: f2 22 20 14 st %i1, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_SYNC; 2007dd4: c2 26 60 30 st %g1, [ %i1 + 0x30 ] return rtems_aio_enqueue (req); 2007dd8: 40 00 01 78 call 20083b8 2007ddc: 91 e8 00 08 restore %g0, %o0, %o0 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2007de0: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED 2007de4: 82 10 3f ff mov -1, %g1 2007de8: fa 26 60 34 st %i5, [ %i1 + 0x34 ] 2007dec: c2 26 60 38 st %g1, [ %i1 + 0x38 ] 2007df0: 40 00 2a 92 call 2012838 <__errno> 2007df4: b0 10 3f ff mov -1, %i0 2007df8: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; return rtems_aio_enqueue (req); } 2007dfc: 81 c7 e0 08 ret 2007e00: 81 e8 00 00 restore =============================================================================== 0200859c : * 0 - otherwise */ int aio_read (struct aiocb *aiocbp) { 200859c: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 20085a0: d0 06 00 00 ld [ %i0 ], %o0 20085a4: 92 10 20 03 mov 3, %o1 20085a8: 40 00 19 f2 call 200ed70 20085ac: ba 10 20 09 mov 9, %i5 if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 20085b0: 80 8a 20 01 btst 1, %o0 20085b4: 12 80 00 0b bne 20085e0 20085b8: 82 10 3f ff mov -1, %g1 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) 20085bc: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 20085c0: 80 a0 60 00 cmp %g1, 0 20085c4: 12 80 00 06 bne 20085dc 20085c8: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 20085cc: c2 06 20 08 ld [ %i0 + 8 ], %g1 20085d0: 80 a0 60 00 cmp %g1, 0 20085d4: 16 80 00 0a bge 20085fc 20085d8: 01 00 00 00 nop rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 20085dc: 82 10 3f ff mov -1, %g1 ! ffffffff 20085e0: fa 26 20 34 st %i5, [ %i0 + 0x34 ] 20085e4: c2 26 20 38 st %g1, [ %i0 + 0x38 ] 20085e8: 40 00 28 94 call 2012838 <__errno> 20085ec: b0 10 3f ff mov -1, %i0 20085f0: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; return rtems_aio_enqueue (req); } 20085f4: 81 c7 e0 08 ret 20085f8: 81 e8 00 00 restore rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 20085fc: 7f ff ee 93 call 2004048 2008600: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2008604: 80 a2 20 00 cmp %o0, 0 2008608: 02 80 00 06 be 2008620 <== NEVER TAKEN 200860c: 82 10 20 01 mov 1, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 2008610: f0 22 20 14 st %i0, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_READ; 2008614: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 2008618: 7f ff ff 68 call 20083b8 200861c: 91 e8 00 08 restore %g0, %o0, %o0 if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2008620: 10 bf ff ef b 20085dc <== NOT EXECUTED 2008624: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED =============================================================================== 02008630 : * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 2008630: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2008634: d0 06 00 00 ld [ %i0 ], %o0 2008638: 40 00 19 ce call 200ed70 200863c: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2008640: 90 0a 20 03 and %o0, 3, %o0 2008644: 90 02 3f ff add %o0, -1, %o0 2008648: 80 a2 20 01 cmp %o0, 1 200864c: 18 80 00 0a bgu 2008674 2008650: ba 10 20 09 mov 9, %i5 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) 2008654: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 2008658: 80 a0 60 00 cmp %g1, 0 200865c: 12 80 00 06 bne 2008674 2008660: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 2008664: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008668: 80 a0 60 00 cmp %g1, 0 200866c: 16 80 00 0a bge 2008694 2008670: 01 00 00 00 nop rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2008674: 82 10 3f ff mov -1, %g1 ! ffffffff 2008678: fa 26 20 34 st %i5, [ %i0 + 0x34 ] 200867c: c2 26 20 38 st %g1, [ %i0 + 0x38 ] 2008680: 40 00 28 6e call 2012838 <__errno> 2008684: b0 10 3f ff mov -1, %i0 2008688: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; return rtems_aio_enqueue (req); } 200868c: 81 c7 e0 08 ret 2008690: 81 e8 00 00 restore rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2008694: 7f ff ee 6d call 2004048 2008698: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 200869c: 80 a2 20 00 cmp %o0, 0 20086a0: 02 80 00 06 be 20086b8 <== NEVER TAKEN 20086a4: 82 10 20 02 mov 2, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 20086a8: f0 22 20 14 st %i0, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_WRITE; 20086ac: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 20086b0: 7f ff ff 42 call 20083b8 20086b4: 91 e8 00 08 restore %g0, %o0, %o0 if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 20086b8: 10 bf ff ef b 2008674 <== NOT EXECUTED 20086bc: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED =============================================================================== 02008c38 : rtems_rbtree_control *chunk_tree, rtems_rbheap_chunk *a, rtems_rbheap_chunk *b ) { if (b != NULL_PAGE && rtems_rbheap_is_chunk_free(b)) { 2008c38: 80 a2 ff f8 cmp %o3, -8 2008c3c: 02 80 00 23 be 2008cc8 2008c40: 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); 2008c44: c2 02 c0 00 ld [ %o3 ], %g1 2008c48: 80 a0 60 00 cmp %g1, 0 2008c4c: 22 80 00 1c be,a 2008cbc 2008c50: c4 02 e0 04 ld [ %o3 + 4 ], %g2 if (b->begin < a->begin) { 2008c54: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3 2008c58: c4 02 a0 18 ld [ %o2 + 0x18 ], %g2 2008c5c: 80 a0 c0 02 cmp %g3, %g2 2008c60: 3a 80 00 07 bcc,a 2008c7c 2008c64: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4 2008c68: 84 10 00 0a mov %o2, %g2 2008c6c: c2 02 80 00 ld [ %o2 ], %g1 2008c70: 94 10 00 0b mov %o3, %o2 2008c74: 96 10 00 02 mov %g2, %o3 a = b; b = t; } a->size += b->size; 2008c78: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4 2008c7c: c6 02 e0 1c ld [ %o3 + 0x1c ], %g3 { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 2008c80: c4 02 e0 04 ld [ %o3 + 4 ], %g2 2008c84: 86 01 00 03 add %g4, %g3, %g3 2008c88: c6 22 a0 1c st %g3, [ %o2 + 0x1c ] next->previous = previous; previous->next = next; 2008c8c: c2 20 80 00 st %g1, [ %g2 ] Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; next->previous = previous; 2008c90: c4 20 60 04 st %g2, [ %g1 + 4 ] ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 2008c94: c2 02 00 00 ld [ %o0 ], %g1 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 2008c98: d0 22 e0 04 st %o0, [ %o3 + 4 ] before_node = after_node->next; after_node->next = the_node; 2008c9c: d6 22 00 00 st %o3, [ %o0 ] the_node->next = before_node; 2008ca0: 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); 2008ca4: 90 10 00 09 mov %o1, %o0 before_node->previous = the_node; 2008ca8: d6 20 60 04 st %o3, [ %g1 + 4 ] 2008cac: 92 02 e0 08 add %o3, 8, %o1 2008cb0: 82 13 c0 00 mov %o7, %g1 2008cb4: 40 00 07 32 call 200a97c <_RBTree_Extract_unprotected> 2008cb8: 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); 2008cbc: 80 a0 a0 00 cmp %g2, 0 2008cc0: 32 bf ff e6 bne,a 2008c58 <== NEVER TAKEN 2008cc4: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3 <== NOT EXECUTED 2008cc8: 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 4a sethi %hi(0x2012800), %o3 2003a14: 96 12 e3 74 or %o3, 0x374, %o3 ! 2012b74 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 49 sethi %hi(0x2012400), %i4 2003a3c: b8 17 20 44 or %i4, 0x44, %i4 ! 2012444 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 22 41 call 200c388 <__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 22 2d call 200c388 <__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 4a sethi %hi(0x2012800), %i4 2003aec: d0 07 23 6c ld [ %i4 + 0x36c ], %o0 ! 2012b6c 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 23 6c ld [ %i4 + 0x36c ], %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 =============================================================================== 020077f0 : int clock_gettime( clockid_t clock_id, struct timespec *tp ) { 20077f0: 9d e3 bf 98 save %sp, -104, %sp if ( !tp ) 20077f4: 80 a6 60 00 cmp %i1, 0 20077f8: 02 80 00 0a be 2007820 20077fc: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 2007800: 02 80 00 19 be 2007864 2007804: 80 a6 20 04 cmp %i0, 4 _TOD_Get(tp); return 0; } #ifdef CLOCK_MONOTONIC if ( clock_id == CLOCK_MONOTONIC ) { 2007808: 02 80 00 12 be 2007850 <== NEVER TAKEN 200780c: 80 a6 20 02 cmp %i0, 2 return 0; } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) { 2007810: 02 80 00 10 be 2007850 2007814: 80 a6 20 03 cmp %i0, 3 return 0; } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) 2007818: 02 80 00 08 be 2007838 200781c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2007820: 40 00 27 76 call 20115f8 <__errno> 2007824: b0 10 3f ff mov -1, %i0 ! ffffffff 2007828: 82 10 20 16 mov 0x16, %g1 200782c: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2007830: 81 c7 e0 08 ret 2007834: 81 e8 00 00 restore } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) rtems_set_errno_and_return_minus_one( ENOSYS ); 2007838: 40 00 27 70 call 20115f8 <__errno> 200783c: b0 10 3f ff mov -1, %i0 2007840: 82 10 20 58 mov 0x58, %g1 2007844: c2 22 00 00 st %g1, [ %o0 ] 2007848: 81 c7 e0 08 ret 200784c: 81 e8 00 00 restore _TOD_Get(tp); return 0; } #ifdef CLOCK_MONOTONIC if ( clock_id == CLOCK_MONOTONIC ) { _TOD_Get_uptime_as_timespec( tp ); 2007850: 90 10 00 19 mov %i1, %o0 2007854: 40 00 08 b6 call 2009b2c <_TOD_Get_uptime_as_timespec> 2007858: b0 10 20 00 clr %i0 return 0; 200785c: 81 c7 e0 08 ret 2007860: 81 e8 00 00 restore ) { Timestamp_Control tod_as_timestamp; Timestamp_Control *tod_as_timestamp_ptr; tod_as_timestamp_ptr = 2007864: 90 07 bf f8 add %fp, -8, %o0 2007868: 13 00 80 86 sethi %hi(0x2021800), %o1 200786c: 40 00 08 9f call 2009ae8 <_TOD_Get_with_nanoseconds> 2007870: 92 12 60 d8 or %o1, 0xd8, %o1 ! 20218d8 <_TOD> #endif rtems_set_errno_and_return_minus_one( EINVAL ); return 0; } 2007874: f8 1a 00 00 ldd [ %o0 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007878: 94 10 20 00 clr %o2 200787c: 90 10 00 1c mov %i4, %o0 2007880: 92 10 00 1d mov %i5, %o1 2007884: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007888: 40 00 55 69 call 201ce2c <__divdi3> 200788c: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007890: 94 10 20 00 clr %o2 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007894: d2 26 40 00 st %o1, [ %i1 ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007898: 90 10 00 1c mov %i4, %o0 200789c: 92 10 00 1d mov %i5, %o1 20078a0: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { _TOD_Get(tp); return 0; 20078a4: b0 10 20 00 clr %i0 20078a8: 40 00 56 4c call 201d1d8 <__moddi3> 20078ac: 96 12 e2 00 or %o3, 0x200, %o3 20078b0: d2 26 60 04 st %o1, [ %i1 + 4 ] 20078b4: 81 c7 e0 08 ret 20078b8: 81 e8 00 00 restore =============================================================================== 02029350 : int clock_settime( clockid_t clock_id, const struct timespec *tp ) { 2029350: 9d e3 bf 98 save %sp, -104, %sp if ( !tp ) 2029354: 80 a6 60 00 cmp %i1, 0 2029358: 02 80 00 08 be 2029378 <== NEVER TAKEN 202935c: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 2029360: 02 80 00 0c be 2029390 2029364: 80 a6 20 02 cmp %i0, 2 _Thread_Disable_dispatch(); _TOD_Set( tp ); _Thread_Enable_dispatch(); } #ifdef _POSIX_CPUTIME else if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) 2029368: 02 80 00 49 be 202948c 202936c: 80 a6 20 03 cmp %i0, 3 rtems_set_errno_and_return_minus_one( ENOSYS ); #endif #ifdef _POSIX_THREAD_CPUTIME else if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) 2029370: 02 80 00 47 be 202948c 2029374: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif else rtems_set_errno_and_return_minus_one( EINVAL ); 2029378: 40 00 4a bc call 203be68 <__errno> 202937c: b0 10 3f ff mov -1, %i0 ! ffffffff 2029380: 82 10 20 16 mov 0x16, %g1 2029384: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2029388: 81 c7 e0 08 ret 202938c: 81 e8 00 00 restore { if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 ) 2029390: c4 06 40 00 ld [ %i1 ], %g2 2029394: 03 08 76 b9 sethi %hi(0x21dae400), %g1 2029398: 82 10 60 ff or %g1, 0xff, %g1 ! 21dae4ff 202939c: 80 a0 80 01 cmp %g2, %g1 20293a0: 08 bf ff f6 bleu 2029378 20293a4: 03 00 81 9c sethi %hi(0x2067000), %g1 * * 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; 20293a8: c4 00 63 60 ld [ %g1 + 0x360 ], %g2 ! 2067360 <_Thread_Dispatch_disable_level> ++level; 20293ac: 84 00 a0 01 inc %g2 _Thread_Dispatch_disable_level = level; 20293b0: c4 20 63 60 st %g2, [ %g1 + 0x360 ] const struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _Timestamp_Set( 20293b4: c6 06 40 00 ld [ %i1 ], %g3 20293b8: e2 06 60 04 ld [ %i1 + 4 ], %l1 20293bc: 85 38 e0 1f sra %g3, 0x1f, %g2 Timestamp64_Control *_time, Timestamp64_Control _seconds, Timestamp64_Control _nanoseconds ) { *_time = _seconds * 1000000000L + _nanoseconds; 20293c0: 83 28 a0 03 sll %g2, 3, %g1 20293c4: bb 28 e0 03 sll %g3, 3, %i5 20293c8: 89 30 e0 1d srl %g3, 0x1d, %g4 20293cc: b8 11 00 01 or %g4, %g1, %i4 20293d0: 83 37 60 1b srl %i5, 0x1b, %g1 20293d4: a5 2f 20 05 sll %i4, 5, %l2 20293d8: a7 2f 60 05 sll %i5, 5, %l3 20293dc: a4 10 40 12 or %g1, %l2, %l2 20293e0: ba a4 c0 1d subcc %l3, %i5, %i5 20293e4: 83 37 60 1a srl %i5, 0x1a, %g1 20293e8: b8 64 80 1c subx %l2, %i4, %i4 20293ec: 97 2f 60 06 sll %i5, 6, %o3 20293f0: 95 2f 20 06 sll %i4, 6, %o2 20293f4: ba a2 c0 1d subcc %o3, %i5, %i5 20293f8: 94 10 40 0a or %g1, %o2, %o2 20293fc: b8 62 80 1c subx %o2, %i4, %i4 2029400: aa 87 40 03 addcc %i5, %g3, %l5 2029404: 83 35 60 1e srl %l5, 0x1e, %g1 2029408: a8 47 00 02 addx %i4, %g2, %l4 202940c: 9b 2d 60 02 sll %l5, 2, %o5 2029410: 99 2d 20 02 sll %l4, 2, %o4 2029414: 86 85 40 0d addcc %l5, %o5, %g3 2029418: 98 10 40 0c or %g1, %o4, %o4 202941c: b3 28 e0 02 sll %g3, 2, %i1 2029420: 84 45 00 0c addx %l4, %o4, %g2 2029424: 83 30 e0 1e srl %g3, 0x1e, %g1 2029428: ba 80 c0 19 addcc %g3, %i1, %i5 202942c: b1 28 a0 02 sll %g2, 2, %i0 2029430: b7 2f 60 02 sll %i5, 2, %i3 2029434: b0 10 40 18 or %g1, %i0, %i0 2029438: 83 37 60 1e srl %i5, 0x1e, %g1 202943c: b8 40 80 18 addx %g2, %i0, %i4 2029440: 86 87 40 1b addcc %i5, %i3, %g3 2029444: b5 2f 20 02 sll %i4, 2, %i2 2029448: bb 30 e0 17 srl %g3, 0x17, %i5 202944c: b4 10 40 1a or %g1, %i2, %i2 2029450: 84 47 00 1a addx %i4, %i2, %g2 2029454: 83 28 e0 09 sll %g3, 9, %g1 2029458: 89 28 a0 09 sll %g2, 9, %g4 &tod_as_timestamp, tod_as_timespec->tv_sec, tod_as_timespec->tv_nsec ); _TOD_Set_with_timestamp( &tod_as_timestamp ); 202945c: 90 07 bf f8 add %fp, -8, %o0 2029460: 84 17 40 04 or %i5, %g4, %g2 2029464: ba 84 40 01 addcc %l1, %g1, %i5 const struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _Timestamp_Set( 2029468: a1 3c 60 1f sra %l1, 0x1f, %l0 rtems_set_errno_and_return_minus_one( ENOSYS ); #endif else rtems_set_errno_and_return_minus_one( EINVAL ); return 0; 202946c: b0 10 20 00 clr %i0 2029470: b8 44 00 02 addx %l0, %g2, %i4 &tod_as_timestamp, tod_as_timespec->tv_sec, tod_as_timespec->tv_nsec ); _TOD_Set_with_timestamp( &tod_as_timestamp ); 2029474: 40 00 04 80 call 202a674 <_TOD_Set_with_timestamp> 2029478: f8 3f bf f8 std %i4, [ %fp + -8 ] if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 ) rtems_set_errno_and_return_minus_one( EINVAL ); _Thread_Disable_dispatch(); _TOD_Set( tp ); _Thread_Enable_dispatch(); 202947c: 7f ff 83 ee call 200a434 <_Thread_Enable_dispatch> 2029480: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif else rtems_set_errno_and_return_minus_one( EINVAL ); return 0; 2029484: 81 c7 e0 08 ret 2029488: 81 e8 00 00 restore else if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) rtems_set_errno_and_return_minus_one( ENOSYS ); #endif #ifdef _POSIX_THREAD_CPUTIME else if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) rtems_set_errno_and_return_minus_one( ENOSYS ); 202948c: 40 00 4a 77 call 203be68 <__errno> 2029490: b0 10 3f ff mov -1, %i0 2029494: 82 10 20 58 mov 0x58, %g1 2029498: c2 22 00 00 st %g1, [ %o0 ] 202949c: 81 c7 e0 08 ret 20294a0: 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 89 sethi %hi(0x2022400), %l2 2003580: fa 04 a1 f0 ld [ %l2 + 0x1f0 ], %i5 ! 20225f0 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 89 sethi %hi(0x2022400), %g1 2003594: e0 00 61 f4 ld [ %g1 + 0x1f4 ], %l0 ! 20225f4 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 47 ba call 2015508 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 89 sethi %hi(0x2022400), %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 e1 f4 ld [ %l3 + 0x1f4 ], %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 47 a2 call 2015508 <== NOT EXECUTED 2003684: 95 2a a0 03 sll %o2, 3, %o2 <== NOT EXECUTED disktab = table; 2003688: e0 24 e1 f4 st %l0, [ %l3 + 0x1f4 ] <== NOT EXECUTED disktab_size = new_size; 200368c: 10 bf ff c3 b 2003598 <== NOT EXECUTED 2003690: f0 24 a1 f0 st %i0, [ %l2 + 0x1f0 ] <== 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 48 c7 call 20159e4 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 95 sethi %hi(0x2025400), %o0 2004cc8: 94 10 20 06 mov 6, %o2 2004ccc: 40 00 47 03 call 20168d8 2004cd0: 90 12 23 18 or %o0, 0x318, %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 6b sethi %hi(0x201ac00), %g1 2002afc: c2 00 60 74 ld [ %g1 + 0x74 ], %g1 ! 201ac74 if (rootloc->mt_entry->ops == &devFS_ops) { 2002b00: 05 00 80 64 sethi %hi(0x2019000), %g2 2002b04: c2 00 60 04 ld [ %g1 + 4 ], %g1 2002b08: 84 10 a0 dc or %g2, 0xdc, %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 64 sethi %hi(0x2019000), %l1 for (j = 0; j < m; ++j) { printk("%c", current->name [j]); 2002b3c: 35 00 80 64 sethi %hi(0x2019000), %i2 } printk( 2002b40: 21 00 80 64 sethi %hi(0x2019000), %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 30 or %l1, 0x130, %l1 for (j = 0; j < m; ++j) { printk("%c", current->name [j]); 2002b4c: b4 16 a1 48 or %i2, 0x148, %i2 } printk( 2002b50: a0 14 21 38 or %l0, 0x138, %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 =============================================================================== 0200c478 : } void devFS_eval_path( rtems_filesystem_eval_path_context_t *ctx ) { 200c478: 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; 200c47c: 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; 200c480: e2 06 00 00 ld [ %i0 ], %l1 200c484: 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; 200c488: 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; 200c48c: 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) { 200c490: 80 a4 20 00 cmp %l0, 0 200c494: 02 80 00 3d be 200c588 200c498: 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; 200c49c: b4 10 20 00 clr %i2 devFS_node *free_node = NULL; 200c4a0: 82 10 20 00 clr %g1 for (i = 0; (free_node == NULL || node == NULL) && i < n; ++i) { 200c4a4: 10 80 00 09 b 200c4c8 200c4a8: b8 10 20 00 clr %i4 200c4ac: 80 a6 a0 00 cmp %i2, 0 200c4b0: 12 80 00 18 bne 200c510 200c4b4: b8 07 20 01 inc %i4 200c4b8: ba 07 60 14 add %i5, 0x14, %i5 200c4bc: 80 a7 00 10 cmp %i4, %l0 200c4c0: 02 80 00 1f be 200c53c 200c4c4: 82 10 00 1b mov %i3, %g1 devFS_node *current = nodes + i; if (current->name != NULL) { 200c4c8: d0 07 40 00 ld [ %i5 ], %o0 200c4cc: 80 a2 20 00 cmp %o0, 0 200c4d0: 02 bf ff f7 be 200c4ac 200c4d4: b6 10 00 1d mov %i5, %i3 if ( 200c4d8: c4 07 60 04 ld [ %i5 + 4 ], %g2 200c4dc: 80 a6 40 02 cmp %i1, %g2 200c4e0: 12 bf ff f3 bne 200c4ac 200c4e4: b6 10 00 01 mov %g1, %i3 current->namelen == pathlen && memcmp(current->name, path, pathlen) == 0 200c4e8: 92 10 00 11 mov %l1, %o1 200c4ec: 40 00 0c c6 call 200f804 200c4f0: 94 10 00 19 mov %i1, %o2 200c4f4: 80 a2 20 00 cmp %o0, 0 200c4f8: 12 bf ff ee bne 200c4b0 200c4fc: 80 a6 a0 00 cmp %i2, 0 200c500: 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) { 200c504: 80 a6 a0 00 cmp %i2, 0 200c508: 02 bf ff ec be 200c4b8 <== NEVER TAKEN 200c50c: b8 07 20 01 inc %i4 200c510: 80 a6 e0 00 cmp %i3, 0 200c514: 22 bf ff ea be,a 200c4bc 200c518: 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; 200c51c: 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) { 200c520: 80 88 60 40 btst 0x40, %g1 200c524: 12 80 00 15 bne 200c578 200c528: 01 00 00 00 nop currentloc->node_access = node; 200c52c: 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; 200c530: c0 26 20 04 clr [ %i0 + 4 ] 200c534: 81 c7 e0 08 ret 200c538: 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) { 200c53c: 80 a6 a0 00 cmp %i2, 0 200c540: 12 bf ff f8 bne 200c520 200c544: 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) { 200c548: 80 88 60 20 btst 0x20, %g1 200c54c: 02 80 00 0d be 200c580 <== NEVER TAKEN 200c550: 80 a6 e0 00 cmp %i3, 0 if (free_node != NULL) { 200c554: 02 80 00 11 be 200c598 <== NEVER TAKEN 200c558: 82 10 21 ff mov 0x1ff, %g1 free_node->mode = S_IRWXU | S_IRWXG | S_IRWXO; 200c55c: c2 26 e0 10 st %g1, [ %i3 + 0x10 ] currentloc->node_access = free_node; 200c560: f6 26 20 20 st %i3, [ %i0 + 0x20 ] rtems_filesystem_eval_path_context_t *ctx, const char *token, size_t tokenlen ) { ctx->token = token; 200c564: e2 26 20 08 st %l1, [ %i0 + 8 ] ctx->tokenlen = tokenlen; 200c568: 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; 200c56c: c0 26 20 04 clr [ %i0 + 4 ] 200c570: 81 c7 e0 08 ret 200c574: 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); 200c578: 7f ff e1 fe call 2004d70 200c57c: 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); 200c580: 7f ff e1 fc call 2004d70 <== NOT EXECUTED 200c584: 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) { 200c588: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 200c58c: 80 88 60 20 btst 0x20, %g1 200c590: 02 bf ff fc be 200c580 <== NEVER TAKEN 200c594: 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); 200c598: 7f ff e1 f6 call 2004d70 200c59c: 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 30 6b call 200f8ac 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 2d bd call 200ee48 <__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 2d b7 call 200ee48 <__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 89 sethi %hi(0x2022400), %g1 2003508: d0 00 61 ec ld [ %g1 + 0x1ec ], %o0 ! 20225ec 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 89 sethi %hi(0x2022400), %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 61 e8 stb %g2, [ %g1 + 0x1e8 ] 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 89 sethi %hi(0x2022400), %g1 2003544: d0 00 61 ec ld [ %g1 + 0x1ec ], %o0 ! 20225ec static void disk_unlock(void) { rtems_status_code sc = RTEMS_SUCCESSFUL; diskdevs_protected = false; 2003548: 03 00 80 89 sethi %hi(0x2022400), %g1 200354c: c0 28 61 e8 clrb [ %g1 + 0x1e8 ] ! 20225e8 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 40 call 200966c <== 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 ca call 20082f4 <== 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 76 sethi %hi(0x201d800), %g1 iscntrl(c) && (c != '\t') && (c != '\n')) { 2006194: c2 00 61 a8 ld [ %g1 + 0x1a8 ], %g1 ! 201d9a8 <__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 =============================================================================== 0202827c : } void endgrent(void) { if (group_fp != NULL) 202827c: 03 00 81 9b sethi %hi(0x2066c00), %g1 2028280: d0 00 61 a8 ld [ %g1 + 0x1a8 ], %o0 ! 2066da8 2028284: 80 a2 20 00 cmp %o0, 0 2028288: 02 80 00 05 be 202829c <== NEVER TAKEN 202828c: 01 00 00 00 nop fclose(group_fp); 2028290: 82 13 c0 00 mov %o7, %g1 2028294: 40 00 4f 47 call 203bfb0 2028298: 9e 10 40 00 mov %g1, %o7 202829c: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 020280e0 : } void endpwent(void) { if (passwd_fp != NULL) 20280e0: 03 00 81 9b sethi %hi(0x2066c00), %g1 20280e4: d0 00 60 c8 ld [ %g1 + 0xc8 ], %o0 ! 2066cc8 20280e8: 80 a2 20 00 cmp %o0, 0 20280ec: 02 80 00 05 be 2028100 <== NEVER TAKEN 20280f0: 01 00 00 00 nop fclose(passwd_fp); 20280f4: 82 13 c0 00 mov %o7, %g1 20280f8: 40 00 4f ae call 203bfb0 20280fc: 9e 10 40 00 mov %g1, %o7 2028100: 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 70 sethi %hi(0x201c000), %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 76 sethi %hi(0x201d800), %i2 rtems_termios_puts ("\b \b", 3, tty); 2006214: 31 00 80 70 sethi %hi(0x201c000), %i0 /* * Back up over the tab */ while (tty->column > col) { rtems_termios_puts ("\b", 1, tty); 2006218: b6 16 e1 00 or %i3, 0x100, %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 21 08 or %i0, 0x108, %i0 if (tty->column) tty->column--; } if (!iscntrl (c) || (tty->termios.c_lflag & ECHOCTL)) { rtems_termios_puts ("\b \b", 3, tty); 2006224: 90 12 21 08 or %o0, 0x108, %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 a1 a8 ld [ %i2 + 0x1a8 ], %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 70 sethi %hi(0x201c000), %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 70 sethi %hi(0x201c000), %o0 <== NOT EXECUTED tty->column--; } if (!iscntrl (c) || (tty->termios.c_lflag & ECHOCTL)) { 20062e8: c2 06 a1 a8 ld [ %i2 + 0x1a8 ], %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 21 08 or %o0, 0x108, %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 21 08 or %o0, 0x108, %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 a1 a8 ld [ %i2 + 0x1a8 ], %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 31 5d call 2010e10 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 81 call 200c71c 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 2e a2 call 20103d8 <__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 68 call 200c71c 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 1f 54 call 200c71c 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 =============================================================================== 02013fa4 : int fat_buf_access(fat_fs_info_t *fs_info, const uint32_t sec_num, const int op_type, uint8_t **sec_buf) { 2013fa4: 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); 2013fa8: c2 0e 20 02 ldub [ %i0 + 2 ], %g1 2013fac: 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) 2013fb0: c6 0e 20 89 ldub [ %i0 + 0x89 ], %g3 2013fb4: 84 20 80 01 sub %g2, %g1, %g2 2013fb8: 80 a0 e0 00 cmp %g3, 0 2013fbc: 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); 2013fc0: 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 - 2013fc4: 84 26 40 02 sub %i1, %g2, %g2 2013fc8: 02 80 00 06 be 2013fe0 2013fcc: b9 28 80 01 sll %g2, %g1, %i4 2013fd0: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 2013fd4: 80 a0 40 19 cmp %g1, %i1 2013fd8: 22 80 00 12 be,a 2014020 2013fdc: c2 06 20 8c ld [ %i0 + 0x8c ], %g1 { fat_buf_release(fs_info); 2013fe0: 7f ff ff 7a call 2013dc8 2013fe4: 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); 2013fe8: d0 06 20 64 ld [ %i0 + 0x64 ], %o0 2013fec: 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) 2013ff0: 80 a6 a0 01 cmp %i2, 1 2013ff4: 02 80 00 10 be 2014034 2013ff8: 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); 2013ffc: 7f ff f6 c9 call 2011b20 2014000: 01 00 00 00 nop if (sc != RTEMS_SUCCESSFUL) 2014004: 80 a2 20 00 cmp %o0, 0 2014008: 12 80 00 0f bne 2014044 <== NEVER TAKEN 201400c: 82 10 20 01 mov 1, %g1 rtems_set_errno_and_return_minus_one(EIO); fs_info->c.blk_num = sec_num; 2014010: f2 26 20 84 st %i1, [ %i0 + 0x84 ] fs_info->c.modified = 0; 2014014: c0 2e 20 88 clrb [ %i0 + 0x88 ] fs_info->c.state = FAT_CACHE_ACTUAL; 2014018: c2 2e 20 89 stb %g1, [ %i0 + 0x89 ] } *sec_buf = &fs_info->c.buf->buffer[blk_ofs]; 201401c: c2 06 20 8c ld [ %i0 + 0x8c ], %g1 2014020: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 2014024: b8 00 40 1c add %g1, %i4, %i4 2014028: f8 26 c0 00 st %i4, [ %i3 ] return RC_OK; } 201402c: 81 c7 e0 08 ret 2014030: 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); 2014034: 7f ff f6 fb call 2011c20 2014038: 01 00 00 00 nop else sc = rtems_bdbuf_get(fs_info->vol.dd, blk, &fs_info->c.buf); if (sc != RTEMS_SUCCESSFUL) 201403c: 10 bf ff f3 b 2014008 2014040: 80 a2 20 00 cmp %o0, 0 rtems_set_errno_and_return_minus_one(EIO); 2014044: 40 00 24 22 call 201d0cc <__errno> <== NOT EXECUTED 2014048: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201404c: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 2014050: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2014054: 81 c7 e0 08 ret <== NOT EXECUTED 2014058: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02013dc8 : return RC_OK; } int fat_buf_release(fat_fs_info_t *fs_info) { 2013dc8: 9d e3 bf 98 save %sp, -104, %sp rtems_status_code sc = RTEMS_SUCCESSFUL; if (fs_info->c.state == FAT_CACHE_EMPTY) 2013dcc: c2 0e 20 89 ldub [ %i0 + 0x89 ], %g1 return RC_OK; } int fat_buf_release(fat_fs_info_t *fs_info) { 2013dd0: ba 10 00 18 mov %i0, %i5 rtems_status_code sc = RTEMS_SUCCESSFUL; if (fs_info->c.state == FAT_CACHE_EMPTY) 2013dd4: 80 a0 60 00 cmp %g1, 0 2013dd8: 02 80 00 6b be 2013f84 2013ddc: b0 10 20 00 clr %i0 return RC_OK; if (fs_info->c.modified) 2013de0: c2 0f 60 88 ldub [ %i5 + 0x88 ], %g1 2013de4: 80 a0 60 00 cmp %g1, 0 2013de8: 02 80 00 47 be 2013f04 2013dec: 01 00 00 00 nop { uint32_t sec_num = fs_info->c.blk_num; 2013df0: c2 07 60 84 ld [ %i5 + 0x84 ], %g1 bool sec_of_fat = ((sec_num >= fs_info->vol.fat_loc) && 2013df4: c4 17 60 18 lduh [ %i5 + 0x18 ], %g2 2013df8: 80 a0 40 02 cmp %g1, %g2 2013dfc: 0a 80 00 06 bcs 2013e14 2013e00: b8 10 20 00 clr %i4 2013e04: c4 07 60 20 ld [ %i5 + 0x20 ], %g2 2013e08: 80 a0 40 02 cmp %g1, %g2 2013e0c: 2a 80 00 46 bcs,a 2013f24 2013e10: 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); 2013e14: 7f ff f8 40 call 2011f14 2013e18: d0 07 60 8c ld [ %i5 + 0x8c ], %o0 if (sc != RTEMS_SUCCESSFUL) 2013e1c: 80 a2 20 00 cmp %o0, 0 2013e20: 12 80 00 5b bne 2013f8c <== NEVER TAKEN 2013e24: 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) 2013e28: 02 80 00 3c be 2013f18 2013e2c: c0 2f 60 88 clrb [ %i5 + 0x88 ] 2013e30: c2 0f 60 54 ldub [ %i5 + 0x54 ], %g1 2013e34: 80 a0 60 00 cmp %g1, 0 2013e38: 32 80 00 39 bne,a 2013f1c <== NEVER TAKEN 2013e3c: c0 2f 60 89 clrb [ %i5 + 0x89 ] <== NOT EXECUTED { uint8_t i; for (i = 1; i < fs_info->vol.fats; i++) 2013e40: c2 0f 60 0d ldub [ %i5 + 0xd ], %g1 2013e44: 80 a0 60 01 cmp %g1, 1 2013e48: 08 80 00 34 bleu 2013f18 <== NEVER TAKEN 2013e4c: b6 10 20 01 mov 1, %i3 2013e50: 10 80 00 16 b 2013ea8 2013e54: 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); 2013e58: 7f ff f7 72 call 2011c20 2013e5c: 94 07 bf fc add %fp, -4, %o2 } if ( sc != RTEMS_SUCCESSFUL) 2013e60: 80 a2 20 00 cmp %o0, 0 2013e64: 12 80 00 44 bne 2013f74 <== NEVER TAKEN 2013e68: 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); 2013e6c: d2 07 60 90 ld [ %i5 + 0x90 ], %o1 2013e70: d0 00 60 1c ld [ %g1 + 0x1c ], %o0 2013e74: d4 17 40 00 lduh [ %i5 ], %o2 2013e78: 40 00 27 54 call 201dbc8 2013e7c: 90 02 00 1c add %o0, %i4, %o0 sc = rtems_bdbuf_release_modified(bd); 2013e80: d0 07 bf fc ld [ %fp + -4 ], %o0 2013e84: 7f ff f8 24 call 2011f14 2013e88: b6 06 e0 01 inc %i3 if ( sc != RTEMS_SUCCESSFUL) 2013e8c: 80 a2 20 00 cmp %o0, 0 2013e90: 12 80 00 39 bne 2013f74 <== NEVER TAKEN 2013e94: 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++) 2013e98: c2 0f 60 0d ldub [ %i5 + 0xd ], %g1 2013e9c: 80 a2 00 01 cmp %o0, %g1 2013ea0: 3a 80 00 1f bcc,a 2013f1c <== ALWAYS TAKEN 2013ea4: c0 2f 60 89 clrb [ %i5 + 0x89 ] { rtems_bdbuf_buffer *bd; sec_num = fs_info->c.blk_num + fs_info->vol.fat_length * i, 2013ea8: 7f ff b9 b9 call 200258c <.umul> 2013eac: 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); 2013eb0: c2 0f 60 02 ldub [ %i5 + 2 ], %g1 2013eb4: c6 07 60 84 ld [ %i5 + 0x84 ], %g3 2013eb8: c4 0f 60 0c ldub [ %i5 + 0xc ], %g2 2013ebc: 90 02 00 03 add %o0, %g3, %o0 2013ec0: 84 20 80 01 sub %g2, %g1, %g2 2013ec4: 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); 2013ec8: 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 - 2013ecc: 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); 2013ed0: 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 2013ed4: 80 a7 20 00 cmp %i4, 0 2013ed8: 12 bf ff e0 bne 2013e58 2013edc: d0 07 60 64 ld [ %i5 + 0x64 ], %o0 && fs_info->vol.bps == fs_info->vol.bytes_per_block) 2013ee0: c4 17 40 00 lduh [ %i5 ], %g2 2013ee4: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 2013ee8: 80 a0 80 01 cmp %g2, %g1 2013eec: 12 bf ff db bne 2013e58 2013ef0: 01 00 00 00 nop { sc = rtems_bdbuf_get(fs_info->vol.dd, blk, &bd); 2013ef4: 7f ff f7 0b call 2011b20 2013ef8: 94 07 bf fc add %fp, -4, %o2 } else { sc = rtems_bdbuf_read(fs_info->vol.dd, blk, &bd); } if ( sc != RTEMS_SUCCESSFUL) 2013efc: 10 bf ff da b 2013e64 2013f00: 80 a2 20 00 cmp %o0, 0 } } } else { sc = rtems_bdbuf_release(fs_info->c.buf); 2013f04: 7f ff f7 cc call 2011e34 2013f08: d0 07 60 8c ld [ %i5 + 0x8c ], %o0 if (sc != RTEMS_SUCCESSFUL) 2013f0c: 80 a2 20 00 cmp %o0, 0 2013f10: 12 80 00 1f bne 2013f8c <== NEVER TAKEN 2013f14: 01 00 00 00 nop rtems_set_errno_and_return_minus_one(EIO); } fs_info->c.state = FAT_CACHE_EMPTY; 2013f18: c0 2f 60 89 clrb [ %i5 + 0x89 ] return RC_OK; 2013f1c: 81 c7 e0 08 ret 2013f20: 91 e8 20 00 restore %g0, 0, %o0 uint32_t ino ) { return (ino >= fs_info->uino_base); } 2013f24: c8 0f 60 02 ldub [ %i5 + 2 ], %g4 2013f28: 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) 2013f2c: 80 a0 a0 00 cmp %g2, 0 2013f30: 12 bf ff b9 bne 2013e14 <== NEVER TAKEN 2013f34: b8 10 20 01 mov 1, %i4 memcpy(fs_info->sec_buf, fs_info->c.buf->buffer + blk_ofs, 2013f38: 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, 2013f3c: d0 07 60 90 ld [ %i5 + 0x90 ], %o0 2013f40: d2 00 a0 1c ld [ %g2 + 0x1c ], %o1 2013f44: 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); 2013f48: 84 09 20 ff and %g4, 0xff, %g2 2013f4c: 86 08 e0 ff and %g3, 0xff, %g3 2013f50: 86 20 c0 02 sub %g3, %g2, %g3 2013f54: 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); 2013f58: 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 - 2013f5c: 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); 2013f60: 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) && 2013f64: 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, 2013f68: 40 00 27 18 call 201dbc8 2013f6c: 92 02 40 02 add %o1, %g2, %o1 2013f70: 30 bf ff a9 b,a 2013e14 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); 2013f74: 40 00 24 56 call 201d0cc <__errno> <== NOT EXECUTED 2013f78: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013f7c: 82 10 20 0c mov 0xc, %g1 <== NOT EXECUTED 2013f80: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013f84: 81 c7 e0 08 ret 2013f88: 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); 2013f8c: 40 00 24 50 call 201d0cc <__errno> <== NOT EXECUTED 2013f90: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013f94: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 2013f98: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013f9c: 81 c7 e0 08 ret <== NOT EXECUTED 2013fa0: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0201418c : fat_fs_info_t *fs_info, const uint32_t start_cln, const uint32_t offset, const uint32_t count, const uint8_t pattern) { 201418c: 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)); 2014190: c2 16 20 06 lduh [ %i0 + 6 ], %g1 2014194: 82 20 40 1a sub %g1, %i2, %g1 2014198: 80 a6 c0 01 cmp %i3, %g1 201419c: 38 80 00 02 bgu,a 20141a4 <== NEVER TAKEN 20141a0: 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)) ) 20141a4: 80 a6 60 00 cmp %i1, 0 20141a8: 32 80 00 06 bne,a 20141c0 <== ALWAYS TAKEN 20141ac: c2 0e 20 0c ldub [ %i0 + 0xc ], %g1 20141b0: c2 0e 20 0e ldub [ %i0 + 0xe ], %g1 <== NOT EXECUTED 20141b4: 80 88 60 03 btst 3, %g1 <== NOT EXECUTED 20141b8: 12 80 00 50 bne 20142f8 <== NOT EXECUTED 20141bc: 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); 20141c0: e0 0e 20 02 ldub [ %i0 + 2 ], %l0 20141c4: 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); 20141c8: c4 0e 20 08 ldub [ %i0 + 8 ], %g2 20141cc: 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; 20141d0: b2 06 7f fe add %i1, -2, %i1 20141d4: a1 30 c0 10 srl %g3, %l0, %l0 blk = cln << (fs_info->vol.bpc_log2 - fs_info->vol.bytes_per_block_log2); 20141d8: 84 20 80 01 sub %g2, %g1, %g2 20141dc: b3 2e 40 02 sll %i1, %g2, %i1 blk += fat_sector_num_to_block_num(fs_info, fs_info->vol.data_fsec); 20141e0: 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; 20141e4: 85 36 80 01 srl %i2, %g1, %g2 uint32_t ofs_blk = offset - (blocks_in_offset << fs_info->vol.bytes_per_block_log2); 20141e8: 83 28 80 01 sll %g2, %g1, %g1 ssize_t bytes_written = 0; 20141ec: 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); 20141f0: b4 26 80 01 sub %i2, %g1, %i2 ssize_t bytes_written = 0; ssize_t ret; cur_blk += blocks_in_offset; 20141f4: 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; 20141f8: 82 10 20 00 clr %g1 ssize_t bytes_written = 0; ssize_t ret; cur_blk += blocks_in_offset; while ( (RC_OK == rc) 20141fc: 80 a6 e0 00 cmp %i3, 0 2014200: 02 80 00 25 be 2014294 <== NEVER TAKEN 2014204: a4 10 20 01 mov 1, %l2 2014208: 80 a0 60 00 cmp %g1, 0 201420c: 32 80 00 39 bne,a 20142f0 <== NEVER TAKEN 2014210: 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)); 2014214: c4 16 20 0a lduh [ %i0 + 0xa ], %g2 2014218: 82 20 80 1a sub %g2, %i2, %g1 201421c: 80 a0 40 1b cmp %g1, %i3 2014220: 08 80 00 03 bleu 201422c <== ALWAYS TAKEN 2014224: ba 10 00 01 mov %g1, %i5 2014228: 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)); 201422c: 80 a7 40 01 cmp %i5, %g1 2014230: 08 80 00 03 bleu 201423c <== ALWAYS TAKEN 2014234: b2 10 00 1d mov %i5, %i1 2014238: b2 10 00 01 mov %g1, %i1 <== NOT EXECUTED uint32_t ino ) { return (ino >= fs_info->uino_base); } 201423c: 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) 2014240: 80 a6 60 00 cmp %i1, 0 2014244: 02 80 00 24 be 20142d4 <== NEVER TAKEN 2014248: 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); 201424c: 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); 2014250: 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) 2014254: 80 a0 80 19 cmp %g2, %i1 2014258: 02 80 00 21 be 20142dc 201425c: 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); 2014260: 94 10 20 01 mov 1, %o2 2014264: 7f ff ff 50 call 2013fa4 2014268: 96 07 bf fc add %fp, -4, %o3 if (RC_OK == rc) 201426c: 80 a2 20 00 cmp %o0, 0 2014270: 22 80 00 14 be,a 20142c0 <== ALWAYS TAKEN 2014274: d0 07 bf fc ld [ %fp + -4 ], %o0 fs_info, cur_blk, ofs_blk, c, pattern); if (c != ret) 2014278: 80 a2 00 1d cmp %o0, %i5 201427c: 02 80 00 0b be 20142a8 <== ALWAYS TAKEN 2014280: 82 10 3f ff mov -1, %g1 2014284: 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) 2014288: 80 a6 e0 00 cmp %i3, 0 201428c: 12 bf ff e0 bne 201420c <== NEVER TAKEN 2014290: 80 a0 60 00 cmp %g1, 0 bytes_written += ret; ++cur_blk; } ofs_blk = 0; } if (RC_OK != rc) 2014294: 80 a0 60 00 cmp %g1, 0 2014298: 12 80 00 16 bne 20142f0 <== NEVER TAKEN 201429c: b0 10 3f ff mov -1, %i0 20142a0: 81 c7 e0 08 ret 20142a4: 91 e8 00 11 restore %g0, %l1, %o0 pattern); if (c != ret) rc = -1; else { bytes_to_write -= ret; 20142a8: b6 26 c0 08 sub %i3, %o0, %i3 bytes_written += ret; 20142ac: a2 04 40 08 add %l1, %o0, %l1 ++cur_blk; 20142b0: a0 04 20 01 inc %l0 20142b4: 82 10 20 00 clr %g1 20142b8: 10 bf ff f4 b 2014288 20142bc: 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); 20142c0: 92 10 00 1c mov %i4, %o1 20142c4: 90 02 00 1a add %o0, %i2, %o0 20142c8: 40 00 26 7d call 201dcbc 20142cc: 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; 20142d0: e4 2e 20 88 stb %l2, [ %i0 + 0x88 ] } } if (RC_OK != rc) return rc; else return bytes_to_write; 20142d4: 10 bf ff e9 b 2014278 20142d8: 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); 20142dc: 94 10 20 02 mov 2, %o2 20142e0: 7f ff ff 31 call 2013fa4 20142e4: 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) 20142e8: 10 bf ff e2 b 2014270 20142ec: 80 a2 20 00 cmp %o0, 0 } if (RC_OK != rc) return rc; else return bytes_written; } 20142f0: 81 c7 e0 08 ret <== NOT EXECUTED 20142f4: 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); 20142f8: c4 0e 20 02 ldub [ %i0 + 2 ], %g2 <== NOT EXECUTED 20142fc: e0 06 20 20 ld [ %i0 + 0x20 ], %l0 <== NOT EXECUTED 2014300: 84 20 40 02 sub %g1, %g2, %g2 <== NOT EXECUTED 2014304: 10 bf ff b8 b 20141e4 <== NOT EXECUTED 2014308: a1 34 00 02 srl %l0, %g2, %l0 <== NOT EXECUTED =============================================================================== 0201430c : const uint32_t start_cln, const uint32_t offset, const uint32_t count, const void *buff, const bool overwrite_cluster) { 201430c: 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)); 2014310: c2 16 20 06 lduh [ %i0 + 6 ], %g1 2014314: 82 20 40 1a sub %g1, %i2, %g1 2014318: 80 a6 c0 01 cmp %i3, %g1 201431c: 38 80 00 02 bgu,a 2014324 <== NEVER TAKEN 2014320: 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)) ) 2014324: 80 a6 60 00 cmp %i1, 0 2014328: 32 80 00 06 bne,a 2014340 201432c: c2 0e 20 0c ldub [ %i0 + 0xc ], %g1 2014330: c2 0e 20 0e ldub [ %i0 + 0xe ], %g1 2014334: 80 88 60 03 btst 3, %g1 2014338: 12 80 00 52 bne 2014480 <== ALWAYS TAKEN 201433c: c2 0e 20 0c ldub [ %i0 + 0xc ], %g1 2014340: e2 0e 20 02 ldub [ %i0 + 2 ], %l1 2014344: 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); 2014348: c4 0e 20 08 ldub [ %i0 + 8 ], %g2 201434c: 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; 2014350: b2 06 7f fe add %i1, -2, %i1 2014354: a3 30 c0 11 srl %g3, %l1, %l1 blk = cln << (fs_info->vol.bpc_log2 - fs_info->vol.bytes_per_block_log2); 2014358: 84 20 80 01 sub %g2, %g1, %g2 201435c: b3 2e 40 02 sll %i1, %g2, %i1 blk += fat_sector_num_to_block_num(fs_info, fs_info->vol.data_fsec); 2014360: 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); 2014364: 85 36 80 01 srl %i2, %g1, %g2 uint32_t ofs_blk = offset - (blocks_in_offset << fs_info->vol.bytes_per_block_log2); 2014368: 83 28 80 01 sll %g2, %g1, %g1 ssize_t bytes_written = 0; 201436c: 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); 2014370: 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; 2014374: 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; 2014378: 82 10 20 00 clr %g1 ssize_t ret; uint32_t c; cur_blk += blocks_in_offset; while ( (RC_OK == rc) 201437c: 80 a6 e0 00 cmp %i3, 0 2014380: 02 80 00 27 be 201441c <== NEVER TAKEN 2014384: a6 10 20 01 mov 1, %l3 2014388: 80 a0 60 00 cmp %g1, 0 201438c: 32 80 00 3b bne,a 2014478 <== NEVER TAKEN 2014390: 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)); 2014394: c4 16 20 0a lduh [ %i0 + 0xa ], %g2 2014398: 82 20 80 1a sub %g2, %i2, %g1 201439c: 80 a0 40 1b cmp %g1, %i3 20143a0: 08 80 00 03 bleu 20143ac 20143a4: b2 10 00 01 mov %g1, %i1 20143a8: 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)); 20143ac: 80 a6 40 01 cmp %i1, %g1 20143b0: 08 80 00 03 bleu 20143bc <== ALWAYS TAKEN 20143b4: a0 10 00 19 mov %i1, %l0 20143b8: a0 10 00 01 mov %g1, %l0 <== NOT EXECUTED uint32_t ino ) { return (ino >= fs_info->uino_base); } 20143bc: 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) 20143c0: 80 a4 20 00 cmp %l0, 0 20143c4: 02 80 00 26 be 201445c <== NEVER TAKEN 20143c8: 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); 20143cc: 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); 20143d0: 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 20143d4: 80 a7 60 00 cmp %i5, 0 20143d8: 12 80 00 23 bne 2014464 20143dc: 93 2c 40 09 sll %l1, %o1, %o1 || (bytes_to_write == fs_info->vol.bytes_per_block)) 20143e0: 80 a0 80 10 cmp %g2, %l0 20143e4: 02 80 00 20 be 2014464 20143e8: 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); 20143ec: 7f ff fe ee call 2013fa4 20143f0: 96 07 bf fc add %fp, -4, %o3 if (RC_OK == rc) 20143f4: 80 a2 20 00 cmp %o0, 0 20143f8: 22 80 00 14 be,a 2014448 <== ALWAYS TAKEN 20143fc: d0 07 bf fc ld [ %fp + -4 ], %o0 cur_blk, ofs_blk, c, &buffer[bytes_written], overwrite_cluster); if (c != ret) 2014400: 80 a2 00 19 cmp %o0, %i1 2014404: 02 80 00 0b be 2014430 <== ALWAYS TAKEN 2014408: 82 10 3f ff mov -1, %g1 201440c: b4 10 20 00 clr %i2 <== NOT EXECUTED ssize_t ret; uint32_t c; cur_blk += blocks_in_offset; while ( (RC_OK == rc) 2014410: 80 a6 e0 00 cmp %i3, 0 2014414: 12 bf ff de bne 201438c <== NEVER TAKEN 2014418: 80 a0 60 00 cmp %g1, 0 bytes_written += ret; ++cur_blk; } ofs_blk = 0; } if (RC_OK != rc) 201441c: 80 a0 60 00 cmp %g1, 0 2014420: 12 80 00 16 bne 2014478 <== NEVER TAKEN 2014424: b0 10 3f ff mov -1, %i0 2014428: 81 c7 e0 08 ret 201442c: 91 e8 00 12 restore %g0, %l2, %o0 overwrite_cluster); if (c != ret) rc = -1; else { bytes_to_write -= ret; 2014430: b6 26 c0 08 sub %i3, %o0, %i3 bytes_written += ret; 2014434: a4 04 80 08 add %l2, %o0, %l2 ++cur_blk; 2014438: a2 04 60 01 inc %l1 201443c: 82 10 20 00 clr %g1 2014440: 10 bf ff f4 b 2014410 2014444: 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); 2014448: 92 07 00 12 add %i4, %l2, %o1 201444c: 90 02 00 1a add %o0, %i2, %o0 2014450: 40 00 25 de call 201dbc8 2014454: 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; 2014458: e6 2e 20 88 stb %l3, [ %i0 + 0x88 ] } } if (RC_OK != rc) return rc; else return bytes_to_write; 201445c: 10 bf ff e9 b 2014400 2014460: 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); 2014464: 94 10 20 02 mov 2, %o2 2014468: 7f ff fe cf call 2013fa4 201446c: 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) 2014470: 10 bf ff e2 b 20143f8 2014474: 80 a2 20 00 cmp %o0, 0 } if (RC_OK != rc) return rc; else return bytes_written; } 2014478: 81 c7 e0 08 ret <== NOT EXECUTED 201447c: 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); 2014480: c4 0e 20 02 ldub [ %i0 + 2 ], %g2 2014484: e2 06 20 20 ld [ %i0 + 0x20 ], %l1 2014488: 84 20 40 02 sub %g1, %g2, %g2 201448c: 10 bf ff b6 b 2014364 2014490: a3 34 40 02 srl %l1, %g2, %l1 =============================================================================== 02013614 : int fat_file_close( fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd ) { 2013614: 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) 2013618: c2 06 60 08 ld [ %i1 + 8 ], %g1 201361c: 80 a0 60 01 cmp %g1, 1 2013620: 08 80 00 06 bleu 2013638 2013624: 82 00 7f ff add %g1, -1, %g1 { fat_fd->links_num--; return rc; 2013628: 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--; 201362c: c2 26 60 08 st %g1, [ %i1 + 8 ] * flush any modified "cached" buffer back to disk */ rc = fat_buf_release(fs_info); return rc; } 2013630: 81 c7 e0 08 ret 2013634: 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) 2013638: c2 0e 60 30 ldub [ %i1 + 0x30 ], %g1 201363c: 80 88 60 01 btst 1, %g1 2013640: 22 80 00 15 be,a 2013694 2013644: d2 06 60 0c ld [ %i1 + 0xc ], %o1 { rc = fat_file_truncate(fs_info, fat_fd, 0); 2013648: 90 10 00 18 mov %i0, %o0 201364c: 92 10 00 19 mov %i1, %o1 2013650: 7f ff ff b0 call 2013510 2013654: 94 10 20 00 clr %o2 if ( rc != RC_OK ) 2013658: 80 a2 20 00 cmp %o0, 0 201365c: 12 bf ff f5 bne 2013630 <== NEVER TAKEN 2013660: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2013664: 40 00 0f d1 call 20175a8 <_Chain_Extract> 2013668: 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) ) 201366c: d2 06 60 0c ld [ %i1 + 0xc ], %o1 2013670: 40 00 06 7a call 2015058 2013674: 90 10 00 18 mov %i0, %o0 2013678: 80 8a 20 ff btst 0xff, %o0 201367c: 32 80 00 11 bne,a 20136c0 <== NEVER TAKEN 2013680: 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); 2013684: 7f ff c7 76 call 200545c 2013688: 90 10 00 19 mov %i1, %o0 } } /* * flush any modified "cached" buffer back to disk */ rc = fat_buf_release(fs_info); 201368c: 40 00 01 cf call 2013dc8 2013690: 81 e8 00 00 restore free(fat_fd); } else { if (fat_ino_is_unique(fs_info, fat_fd->ino)) 2013694: 40 00 06 71 call 2015058 2013698: 90 10 00 18 mov %i0, %o0 201369c: 80 8a 20 ff btst 0xff, %o0 20136a0: 02 80 00 05 be 20136b4 <== ALWAYS TAKEN 20136a4: 01 00 00 00 nop { fat_fd->links_num = 0; 20136a8: c0 26 60 08 clr [ %i1 + 8 ] <== NOT EXECUTED } } /* * flush any modified "cached" buffer back to disk */ rc = fat_buf_release(fs_info); 20136ac: 40 00 01 c7 call 2013dc8 <== NOT EXECUTED 20136b0: 81 e8 00 00 restore <== NOT EXECUTED 20136b4: 40 00 0f bd call 20175a8 <_Chain_Extract> 20136b8: 90 10 00 19 mov %i1, %o0 20136bc: 30 bf ff f2 b,a 2013684 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); 20136c0: 40 00 06 5b call 201502c <== NOT EXECUTED 20136c4: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 20136c8: 30 bf ff ef b,a 2013684 <== NOT EXECUTED =============================================================================== 020137a0 : fat_file_fd_t *fat_fd, bool zero_fill, uint32_t new_length, uint32_t *a_length ) { 20137a0: 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; 20137a4: f6 27 00 00 st %i3, [ %i4 ] if (new_length <= fat_fd->fat_file_size) 20137a8: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 uint32_t new_length, uint32_t *a_length ) { int rc = RC_OK; uint32_t chain = 0; 20137ac: 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; 20137b0: 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) 20137b4: 80 a6 c0 01 cmp %i3, %g1 20137b8: 08 80 00 16 bleu 2013810 20137bc: ba 10 00 18 mov %i0, %i5 return RC_OK; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 20137c0: c4 06 60 20 ld [ %i1 + 0x20 ], %g2 20137c4: 80 a0 a0 01 cmp %g2, 1 20137c8: 22 80 00 56 be,a 2013920 20137cc: 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))) & 20137d0: e0 17 60 06 lduh [ %i5 + 6 ], %l0 (fs_info->vol.bpc - 1); bytes2add = new_length - fat_fd->fat_file_size; 20137d4: 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))) & 20137d8: 84 04 3f ff add %l0, -1, %g2 20137dc: 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 - 20137e0: a0 24 00 12 sub %l0, %l2, %l0 20137e4: 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) 20137e8: 80 a4 00 03 cmp %l0, %g3 20137ec: 1a 80 00 03 bcc 20137f8 20137f0: a2 10 20 00 clr %l1 bytes2add -= bytes_remain; 20137f4: a2 20 c0 10 sub %g3, %l0, %l1 else bytes2add = 0; if (zero_fill && bytes_remain > 0) { 20137f8: 80 a4 20 00 cmp %l0, 0 20137fc: 12 80 00 3c bne 20138ec 2013800: 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) 2013804: 80 a4 60 00 cmp %l1, 0 2013808: 32 80 00 04 bne,a 2013818 201380c: 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; 2013810: 81 c7 e0 08 ret 2013814: 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; 2013818: a4 04 7f ff add %l1, -1, %l2 rc = fat_scan_fat_for_free_clusters(fs_info, &chain, cls2add, 201381c: 90 10 00 1d mov %i5, %o0 * file ) - return */ if (bytes2add == 0) return RC_OK; cls2add = ((bytes2add - 1) >> fs_info->vol.bpc_log2) + 1; 2013820: a5 34 80 01 srl %l2, %g1, %l2 rc = fat_scan_fat_for_free_clusters(fs_info, &chain, cls2add, 2013824: 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; 2013828: a4 04 a0 01 inc %l2 rc = fat_scan_fat_for_free_clusters(fs_info, &chain, cls2add, 201382c: 96 07 bf fc add %fp, -4, %o3 2013830: 94 10 00 12 mov %l2, %o2 2013834: 98 07 bf f8 add %fp, -8, %o4 2013838: 40 00 1e dc call 201b3a8 201383c: 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) 2013840: b0 92 20 00 orcc %o0, 0, %i0 2013844: 12 80 00 28 bne 20138e4 <== NEVER TAKEN 2013848: 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)) 201384c: 80 94 00 01 orcc %l0, %g1, %g0 2013850: 02 80 00 3b be 201393c <== NEVER TAKEN 2013854: 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) 2013858: 02 80 00 09 be 201387c <== ALWAYS TAKEN 201385c: a4 24 80 01 sub %l2, %g1, %l2 { new_length -= bytes2add & (fs_info->vol.bpc - 1); 2013860: c6 17 60 06 lduh [ %i5 + 6 ], %g3 <== NOT EXECUTED new_length -= (cls2add - cls_added) << fs_info->vol.bpc_log2; 2013864: 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); 2013868: 86 00 ff ff add %g3, -1, %g3 <== NOT EXECUTED 201386c: a2 0c 40 03 and %l1, %g3, %l1 <== NOT EXECUTED new_length -= (cls2add - cls_added) << fs_info->vol.bpc_log2; 2013870: 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); 2013874: b6 26 c0 11 sub %i3, %l1, %i3 <== NOT EXECUTED new_length -= (cls2add - cls_added) << fs_info->vol.bpc_log2; 2013878: 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 ) 201387c: d6 06 60 18 ld [ %i1 + 0x18 ], %o3 2013880: 80 a2 e0 00 cmp %o3, 0 2013884: 32 80 00 43 bne,a 2013990 2013888: d2 06 60 3c ld [ %i1 + 0x3c ], %o1 { fat_fd->map.disk_cln = fat_fd->cln = chain; 201388c: c4 07 bf f0 ld [ %fp + -16 ], %g2 fat_fd->map.file_cln = 0; 2013890: 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; 2013894: c4 26 60 1c st %g2, [ %i1 + 0x1c ] 2013898: 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) 201389c: 80 a0 60 00 cmp %g1, 0 20138a0: 22 80 00 39 be,a 2013984 <== NEVER TAKEN 20138a4: f6 27 00 00 st %i3, [ %i4 ] <== NOT EXECUTED { fat_fd->map.last_cln = last_cl; 20138a8: c4 07 bf f8 ld [ %fp + -8 ], %g2 if (fat_fd->fat_file_type == FAT_DIRECTORY) 20138ac: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 20138b0: 80 a0 60 00 cmp %g1, 0 20138b4: 12 80 00 33 bne 2013980 20138b8: c4 26 60 3c st %g2, [ %i1 + 0x3c ] { rc = fat_init_clusters_chain(fs_info, chain); 20138bc: d2 07 bf f0 ld [ %fp + -16 ], %o1 20138c0: 40 00 05 80 call 2014ec0 20138c4: 90 10 00 1d mov %i5, %o0 if ( rc != RC_OK ) 20138c8: 82 92 20 00 orcc %o0, 0, %g1 20138cc: 22 80 00 2e be,a 2013984 <== ALWAYS TAKEN 20138d0: f6 27 00 00 st %i3, [ %i4 ] { fat_free_fat_clusters_chain(fs_info, chain); 20138d4: d2 07 bf f0 ld [ %fp + -16 ], %o1 <== NOT EXECUTED 20138d8: b0 10 00 01 mov %g1, %i0 <== NOT EXECUTED 20138dc: 40 00 1e 7b call 201b2c8 <== NOT EXECUTED 20138e0: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 20138e4: 81 c7 e0 08 ret <== NOT EXECUTED 20138e8: 81 e8 00 00 restore <== NOT EXECUTED if (bytes2add > bytes_remain) bytes2add -= bytes_remain; else bytes2add = 0; if (zero_fill && bytes_remain > 0) { 20138ec: 02 bf ff c7 be 2013808 20138f0: 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; 20138f4: 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); 20138f8: 90 10 00 1d mov %i5, %o0 20138fc: 92 10 00 19 mov %i1, %o1 2013900: 95 30 40 0a srl %g1, %o2, %o2 2013904: 7f ff fd 9b call 2012f70 2013908: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 201390c: b0 92 60 00 orcc %o1, 0, %i0 2013910: 02 80 00 11 be 2013954 <== ALWAYS TAKEN 2013914: d2 07 bf fc ld [ %fp + -4 ], %o1 *a_length = new_length; fat_fd->fat_file_size = new_length; return RC_OK; } 2013918: 81 c7 e0 08 ret <== NOT EXECUTED 201391c: 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)) && 2013920: 80 a0 a0 00 cmp %g2, 0 2013924: 32 bf ff ac bne,a 20137d4 <== NEVER TAKEN 2013928: e0 17 60 06 lduh [ %i5 + 6 ], %l0 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 201392c: 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)) && 2013930: 80 88 a0 03 btst 3, %g2 2013934: 22 bf ff a8 be,a 20137d4 <== NEVER TAKEN 2013938: 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); 201393c: 40 00 25 e4 call 201d0cc <__errno> 2013940: b0 10 3f ff mov -1, %i0 2013944: 82 10 20 1c mov 0x1c, %g1 2013948: c2 22 00 00 st %g1, [ %o0 ] 201394c: 81 c7 e0 08 ret 2013950: 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); 2013954: 90 10 00 1d mov %i5, %o0 2013958: 94 10 00 12 mov %l2, %o2 201395c: 96 10 00 10 mov %l0, %o3 2013960: 98 10 20 00 clr %o4 2013964: 40 00 02 0a call 201418c 2013968: b0 10 3f ff mov -1, %i0 if (bytes_remain != bytes_written) 201396c: 80 a2 00 10 cmp %o0, %l0 2013970: 02 bf ff a6 be 2013808 <== ALWAYS TAKEN 2013974: 80 a4 60 00 cmp %l1, 0 *a_length = new_length; fat_fd->fat_file_size = new_length; return RC_OK; } 2013978: 81 c7 e0 08 ret <== NOT EXECUTED 201397c: 81 e8 00 00 restore <== NOT EXECUTED return rc; } } } *a_length = new_length; 2013980: f6 27 00 00 st %i3, [ %i4 ] fat_fd->fat_file_size = new_length; 2013984: f6 26 60 18 st %i3, [ %i1 + 0x18 ] return RC_OK; } 2013988: 81 c7 e0 08 ret 201398c: 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) 2013990: 80 a2 7f ff cmp %o1, -1 2013994: 22 80 00 0d be,a 20139c8 <== NEVER TAKEN 2013998: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED { old_last_cl = fat_fd->map.last_cln; 201399c: 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); 20139a0: d4 07 bf f0 ld [ %fp + -16 ], %o2 20139a4: 40 00 1d 97 call 201b000 20139a8: 90 10 00 1d mov %i5, %o0 if ( rc != RC_OK ) 20139ac: 82 92 20 00 orcc %o0, 0, %g1 20139b0: 12 bf ff ca bne 20138d8 <== NEVER TAKEN 20139b4: d2 07 bf f0 ld [ %fp + -16 ], %o1 { fat_free_fat_clusters_chain(fs_info, chain); return rc; } fat_buf_release(fs_info); 20139b8: 40 00 01 04 call 2013dc8 20139bc: 90 10 00 1d mov %i5, %o0 20139c0: 10 bf ff b7 b 201389c 20139c4: 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, 20139c8: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 20139cc: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 20139d0: 96 02 ff ff add %o3, -1, %o3 <== NOT EXECUTED 20139d4: 7f ff ff 3e call 20136cc <== NOT EXECUTED 20139d8: 98 07 bf f4 add %fp, -12, %o4 <== NOT EXECUTED 20139dc: d2 07 bf f4 ld [ %fp + -12 ], %o1 <== NOT EXECUTED (fat_fd->fat_file_size - 1), &old_last_cl); if ( rc != RC_OK ) 20139e0: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 20139e4: 02 bf ff ef be 20139a0 <== NOT EXECUTED 20139e8: 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); 20139ec: 10 bf ff bb b 20138d8 <== NOT EXECUTED 20139f0: d2 07 bf f0 ld [ %fp + -16 ], %o1 <== NOT EXECUTED =============================================================================== 020136cc : fat_file_ioctl( fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd, int cmd, ...) { 20136cc: 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); 20136d0: 82 07 a0 50 add %fp, 0x50, %g1 20136d4: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 20136d8: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 20136dc: 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; 20136e0: c0 27 bf f8 clr [ %fp + -8 ] uint32_t *ret; va_list ap; va_start(ap, cmd); switch (cmd) 20136e4: 80 a6 a0 01 cmp %i2, 1 20136e8: 02 80 00 08 be 2013708 <== ALWAYS TAKEN 20136ec: c2 27 bf fc st %g1, [ %fp + -4 ] *ret = cur_cln; break; default: errno = EINVAL; 20136f0: 40 00 26 77 call 201d0cc <__errno> <== NOT EXECUTED 20136f4: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20136f8: 82 10 20 16 mov 0x16, %g1 <== NOT EXECUTED 20136fc: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED rc = -1; break; } va_end(ap); return rc; } 2013700: 81 c7 e0 08 ret <== NOT EXECUTED 2013704: 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 ) { 2013708: 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 *); 201370c: 86 07 a0 58 add %fp, 0x58, %g3 2013710: c6 27 bf fc st %g3, [ %fp + -4 ] /* sanity check */ if ( pos >= fat_fd->fat_file_size ) { 2013714: 80 a6 c0 02 cmp %i3, %g2 2013718: 1a 80 00 1c bcc 2013788 <== NEVER TAKEN 201371c: 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)) && 2013720: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 2013724: 80 a0 60 01 cmp %g1, 1 2013728: 22 80 00 0e be,a 2013760 201372c: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 *ret = 0; rc = RC_OK; break; } cl_start = pos >> fs_info->vol.bpc_log2; 2013730: d4 0e 20 08 ldub [ %i0 + 8 ], %o2 rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); 2013734: 90 10 00 18 mov %i0, %o0 2013738: 92 10 00 19 mov %i1, %o1 201373c: 95 36 c0 0a srl %i3, %o2, %o2 2013740: 7f ff fe 0c call 2012f70 2013744: 96 07 bf f8 add %fp, -8, %o3 if ( rc != RC_OK ) 2013748: b0 92 60 00 orcc %o1, 0, %i0 201374c: 12 bf ff ed bne 2013700 <== NEVER TAKEN 2013750: c2 07 bf f8 ld [ %fp + -8 ], %g1 break; *ret = cur_cln; 2013754: c2 27 40 00 st %g1, [ %i5 ] break; 2013758: 81 c7 e0 08 ret 201375c: 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)) && 2013760: 80 a0 60 00 cmp %g1, 0 2013764: 32 bf ff f4 bne,a 2013734 <== NEVER TAKEN 2013768: d4 0e 20 08 ldub [ %i0 + 8 ], %o2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 201376c: 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)) && 2013770: 80 88 60 03 btst 3, %g1 2013774: 22 bf ff f0 be,a 2013734 2013778: 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; 201377c: c0 27 00 00 clr [ %i4 ] rc = RC_OK; break; 2013780: 81 c7 e0 08 ret 2013784: 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 ); 2013788: 40 00 26 51 call 201d0cc <__errno> <== NOT EXECUTED 201378c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013790: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 2013794: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013798: 81 c7 e0 08 ret <== NOT EXECUTED 201379c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02012f70 : fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd, uint32_t file_cln, uint32_t *disk_cln ) { 2012f70: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; if (file_cln == fat_fd->map.file_cln) 2012f74: f8 06 60 34 ld [ %i1 + 0x34 ], %i4 2012f78: 80 a7 00 1a cmp %i4, %i2 2012f7c: 22 80 00 26 be,a 2013014 2012f80: 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) 2012f84: 2a 80 00 19 bcs,a 2012fe8 2012f88: 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; 2012f8c: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 2012f90: b8 10 00 1a mov %i2, %i4 2012f94: c2 27 bf fc st %g1, [ %fp + -4 ] count = file_cln; } /* skip over the clusters */ for (i = 0; i < count; i++) 2012f98: 80 a7 20 00 cmp %i4, 0 2012f9c: 12 80 00 07 bne 2012fb8 2012fa0: ba 10 20 00 clr %i5 return rc; } /* update cache */ fat_fd->map.file_cln = file_cln; fat_fd->map.disk_cln = cur_cln; 2012fa4: 10 80 00 14 b 2012ff4 2012fa8: 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++) 2012fac: 80 a7 40 1c cmp %i5, %i4 2012fb0: 02 80 00 11 be 2012ff4 2012fb4: c2 07 bf fc ld [ %fp + -4 ], %g1 { rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 2012fb8: d2 07 bf fc ld [ %fp + -4 ], %o1 2012fbc: 90 10 00 18 mov %i0, %o0 2012fc0: 40 00 1f 8c call 201adf0 2012fc4: 94 07 bf fc add %fp, -4, %o2 if ( rc != RC_OK ) 2012fc8: 80 a2 20 00 cmp %o0, 0 2012fcc: 22 bf ff f8 be,a 2012fac <== ALWAYS TAKEN 2012fd0: ba 07 60 01 inc %i5 return rc; 2012fd4: 86 10 00 08 mov %o0, %g3 <== NOT EXECUTED 2012fd8: 85 3a 20 1f sra %o0, 0x1f, %g2 <== NOT EXECUTED fat_fd->map.disk_cln = cur_cln; *disk_cln = cur_cln; } return RC_OK; } 2012fdc: b2 10 00 03 mov %g3, %i1 <== NOT EXECUTED 2012fe0: 81 c7 e0 08 ret <== NOT EXECUTED 2012fe4: 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; 2012fe8: 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; 2012fec: 10 bf ff eb b 2012f98 2012ff0: c2 27 bf fc st %g1, [ %fp + -4 ] if ( rc != RC_OK ) return rc; } /* update cache */ fat_fd->map.file_cln = file_cln; 2012ff4: f4 26 60 34 st %i2, [ %i1 + 0x34 ] fat_fd->map.disk_cln = cur_cln; 2012ff8: c2 26 60 38 st %g1, [ %i1 + 0x38 ] *disk_cln = cur_cln; } return RC_OK; 2012ffc: 84 10 20 00 clr %g2 2013000: 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; 2013004: c2 26 c0 00 st %g1, [ %i3 ] } return RC_OK; } 2013008: b0 10 00 02 mov %g2, %i0 201300c: 81 c7 e0 08 ret 2013010: 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; 2013014: 84 10 20 00 clr %g2 2013018: 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; 201301c: c2 26 c0 00 st %g1, [ %i3 ] fat_fd->map.disk_cln = cur_cln; *disk_cln = cur_cln; } return RC_OK; } 2013020: b0 10 00 02 mov %g2, %i0 2013024: 81 c7 e0 08 ret 2013028: 93 e8 00 03 restore %g0, %g3, %o1 =============================================================================== 02013c58 : void fat_file_mark_removed( fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd ) { 2013c58: 9d e3 bf a0 save %sp, -96, %sp 2013c5c: 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) 2013c60: 80 a0 60 01 cmp %g1, 1 2013c64: 02 80 00 26 be 2013cfc <== NEVER TAKEN 2013c68: 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)) ) 2013c6c: 32 80 00 1f bne,a 2013ce8 <== NEVER TAKEN 2013c70: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 <== NOT EXECUTED 2013c74: c4 0e 20 0e ldub [ %i0 + 0xe ], %g2 2013c78: 80 88 a0 03 btst 3, %g2 2013c7c: 22 80 00 1b be,a 2013ce8 <== NEVER TAKEN 2013c80: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2013c84: fa 06 20 20 ld [ %i0 + 0x20 ], %i5 ) { if (cln == 1) return 1; return (fat_cluster_num_to_sector_num(fs_info, cln) << 2013c88: c4 0e 20 03 ldub [ %i0 + 3 ], %g2 2013c8c: bb 2f 40 02 sll %i5, %g2, %i5 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2013c90: c4 06 60 24 ld [ %i1 + 0x24 ], %g2 2013c94: 90 10 00 19 mov %i1, %o0 2013c98: 87 30 a0 09 srl %g2, 9, %g3 ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2013c9c: 85 30 a0 05 srl %g2, 5, %g2 2013ca0: 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) + 2013ca4: ba 07 40 03 add %i5, %g3, %i5 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2013ca8: bb 2f 60 04 sll %i5, 4, %i5 2013cac: 40 00 0e 3f call 20175a8 <_Chain_Extract> 2013cb0: 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); 2013cb4: d0 06 20 70 ld [ %i0 + 0x70 ], %o0 2013cb8: 82 0f 60 01 and %i5, 1, %g1 2013cbc: 85 28 60 02 sll %g1, 2, %g2 2013cc0: 83 28 60 04 sll %g1, 4, %g1 2013cc4: 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 ); 2013cc8: 92 10 00 19 mov %i1, %o1 2013ccc: 7f ff db 0c call 200a8fc <_Chain_Append> 2013cd0: 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; 2013cd4: c2 0e 60 30 ldub [ %i1 + 0x30 ], %g1 2013cd8: 82 10 60 01 or %g1, 1, %g1 2013cdc: c2 2e 60 30 stb %g1, [ %i1 + 0x30 ] 2013ce0: 81 c7 e0 08 ret 2013ce4: 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) + 2013ce8: c4 06 20 34 ld [ %i0 + 0x34 ], %g2 <== NOT EXECUTED 2013cec: ba 00 7f fe add %g1, -2, %i5 <== NOT EXECUTED 2013cf0: bb 2f 40 03 sll %i5, %g3, %i5 <== NOT EXECUTED 2013cf4: 10 bf ff e5 b 2013c88 <== NOT EXECUTED 2013cf8: 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; 2013cfc: 10 bf ff e5 b 2013c90 <== NOT EXECUTED 2013d00: ba 10 20 01 mov 1, %i5 <== NOT EXECUTED =============================================================================== 0201302c : fat_file_open( fat_fs_info_t *fs_info, fat_dir_pos_t *dir_pos, fat_file_fd_t **fat_fd ) { 201302c: 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) + 2013030: 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) 2013034: 80 a0 60 01 cmp %g1, 1 2013038: 02 80 00 9c be 20132a8 201303c: 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)) ) 2013040: 32 80 00 7b bne,a 201322c 2013044: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 2013048: c4 0e 20 0e ldub [ %i0 + 0xe ], %g2 201304c: 80 88 a0 03 btst 3, %g2 2013050: 22 80 00 77 be,a 201322c <== NEVER TAKEN 2013054: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2013058: fa 06 20 20 ld [ %i0 + 0x20 ], %i5 ) { if (cln == 1) return 1; return (fat_cluster_num_to_sector_num(fs_info, cln) << 201305c: c4 0e 20 03 ldub [ %i0 + 3 ], %g2 2013060: bb 2f 40 02 sll %i5, %g2, %i5 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2013064: 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); 2013068: de 06 20 6c ld [ %i0 + 0x6c ], %o7 201306c: 85 30 60 09 srl %g1, 9, %g2 ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2013070: 83 30 60 05 srl %g1, 5, %g1 2013074: 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) + 2013078: ba 07 40 02 add %i5, %g2, %i5 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 201307c: 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) + 2013080: 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; 2013084: 82 0f 60 01 and %i5, 1, %g1 rtems_chain_node *the_node = rtems_chain_first(hash + mod); 2013088: 85 28 60 02 sll %g1, 2, %g2 201308c: b7 28 60 04 sll %g1, 4, %i3 2013090: 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; 2013094: c2 03 c0 1b ld [ %o7 + %i3 ], %g1 2013098: 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 )); 201309c: 9e 03 e0 04 add %o7, 4, %o7 for ( ; !rtems_chain_is_tail((hash) + mod, the_node) ; ) 20130a0: 80 a0 40 0f cmp %g1, %o7 20130a4: 22 80 00 1e be,a 201311c 20130a8: c4 06 20 70 ld [ %i0 + 0x70 ], %g2 20130ac: 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) 20130b0: 80 a0 a0 01 cmp %g2, 1 20130b4: 02 80 00 6d be 2013268 20130b8: 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)) ) 20130bc: 32 80 00 61 bne,a 2013240 20130c0: c8 0e 20 05 ldub [ %i0 + 5 ], %g4 20130c4: c6 0e 20 0e ldub [ %i0 + 0xe ], %g3 20130c8: 80 88 e0 03 btst 3, %g3 20130cc: 22 80 00 5d be,a 2013240 <== NEVER TAKEN 20130d0: c8 0e 20 05 ldub [ %i0 + 5 ], %g4 <== NOT EXECUTED return fs_info->vol.rdir_loc; 20130d4: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 ) { if (cln == 1) return 1; return (fat_cluster_num_to_sector_num(fs_info, cln) << 20130d8: c6 0e 20 03 ldub [ %i0 + 3 ], %g3 20130dc: b9 2f 00 03 sll %i4, %g3, %i4 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 20130e0: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 20130e4: 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) + 20130e8: 89 30 e0 09 srl %g3, 9, %g4 ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 20130ec: 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) + 20130f0: 86 07 00 04 add %i4, %g4, %g3 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 20130f4: 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) + 20130f8: 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) 20130fc: 80 a7 40 03 cmp %i5, %g3 2013100: 22 80 00 55 be,a 2013254 2013104: c4 00 60 08 ld [ %g1 + 8 ], %g2 { *ret = (void *)the_node; return 0; } } the_node = the_node->next; 2013108: 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) ; ) 201310c: 80 a3 c0 01 cmp %o7, %g1 2013110: 32 bf ff e8 bne,a 20130b0 2013114: 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); 2013118: 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; 201311c: c2 00 80 1b ld [ %g2 + %i3 ], %g1 2013120: 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 )); 2013124: 9e 00 a0 04 add %g2, 4, %o7 for ( ; !rtems_chain_is_tail((hash) + mod, the_node) ; ) 2013128: 80 a0 40 0f cmp %g1, %o7 201312c: 02 80 00 1e be 20131a4 <== ALWAYS TAKEN 2013130: a0 10 3f ff mov -1, %l0 2013134: 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) 2013138: 80 a0 a0 01 cmp %g2, 1 <== NOT EXECUTED 201313c: 02 80 00 59 be 20132a0 <== NOT EXECUTED 2013140: 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)) ) 2013144: 32 80 00 4b bne,a 2013270 <== NOT EXECUTED 2013148: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 <== NOT EXECUTED 201314c: c6 0e 20 0e ldub [ %i0 + 0xe ], %g3 <== NOT EXECUTED 2013150: 80 88 e0 03 btst 3, %g3 <== NOT EXECUTED 2013154: 22 80 00 47 be,a 2013270 <== NOT EXECUTED 2013158: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 201315c: 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) << 2013160: c8 0e 20 03 ldub [ %i0 + 3 ], %g4 <== NOT EXECUTED 2013164: b9 2f 00 04 sll %i4, %g4, %i4 <== NOT EXECUTED (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2013168: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 <== NOT EXECUTED ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 201316c: 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) + 2013170: 89 30 e0 09 srl %g3, 9, %g4 <== NOT EXECUTED ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2013174: 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) + 2013178: 86 07 00 04 add %i4, %g4, %g3 <== NOT EXECUTED (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 201317c: 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) + 2013180: 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) 2013184: 80 a7 40 03 cmp %i5, %g3 <== NOT EXECUTED 2013188: 02 80 00 3f be 2013284 <== NOT EXECUTED 201318c: 80 a7 60 00 cmp %i5, 0 <== NOT EXECUTED { *ret = (void *)the_node; return 0; } } the_node = the_node->next; 2013190: 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) ; ) 2013194: 80 a0 40 0f cmp %g1, %o7 <== NOT EXECUTED 2013198: 32 bf ff e8 bne,a 2013138 <== NOT EXECUTED 201319c: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 <== NOT EXECUTED return 0; } } the_node = the_node->next; } return -1; 20131a0: 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)); 20131a4: 7f ff ca 01 call 20059a8 20131a8: 90 10 20 44 mov 0x44, %o0 20131ac: d0 26 80 00 st %o0, [ %i2 ] if ( lfat_fd == NULL ) 20131b0: 80 a2 20 00 cmp %o0, 0 20131b4: 02 80 00 46 be 20132cc <== NEVER TAKEN 20131b8: b8 10 00 08 mov %o0, %i4 rtems_set_errno_and_return_minus_one( ENOMEM ); memset(lfat_fd, 0, sizeof(fat_file_fd_t)); 20131bc: 92 10 20 00 clr %o1 20131c0: 40 00 2a bf call 201dcbc 20131c4: 94 10 20 44 mov 0x44, %o2 lfat_fd->links_num = 1; lfat_fd->flags &= ~FAT_FILE_REMOVED; 20131c8: de 0f 20 30 ldub [ %i4 + 0x30 ], %o7 lfat_fd->map.last_cln = FAT_UNDEFINED_VALUE; lfat_fd->dir_pos = *dir_pos; 20131cc: c8 06 40 00 ld [ %i1 ], %g4 20131d0: c6 06 60 04 ld [ %i1 + 4 ], %g3 20131d4: c4 06 60 08 ld [ %i1 + 8 ], %g2 20131d8: 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; 20131dc: b2 0b ff fe and %o7, -2, %i1 lfat_fd->map.last_cln = FAT_UNDEFINED_VALUE; lfat_fd->dir_pos = *dir_pos; 20131e0: 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; 20131e4: 9e 10 20 01 mov 1, %o7 lfat_fd->flags &= ~FAT_FILE_REMOVED; 20131e8: 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; 20131ec: de 27 20 08 st %o7, [ %i4 + 8 ] lfat_fd->flags &= ~FAT_FILE_REMOVED; lfat_fd->map.last_cln = FAT_UNDEFINED_VALUE; 20131f0: b2 10 3f ff mov -1, %i1 lfat_fd->dir_pos = *dir_pos; 20131f4: 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; 20131f8: f2 27 20 3c st %i1, [ %i4 + 0x3c ] lfat_fd->dir_pos = *dir_pos; 20131fc: c4 27 20 28 st %g2, [ %i4 + 0x28 ] if ( rc != RC_OK ) 2013200: 80 a4 20 00 cmp %l0, 0 2013204: 02 80 00 2b be 20132b0 <== NEVER TAKEN 2013208: c2 27 20 2c st %g1, [ %i4 + 0x2c ] lfat_fd->ino = key; 201320c: 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); 2013210: 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 ); 2013214: 92 10 00 1c mov %i4, %o1 2013218: 90 02 00 1b add %o0, %i3, %o0 201321c: 7f ff dd b8 call 200a8fc <_Chain_Append> 2013220: b0 10 20 00 clr %i0 2013224: 81 c7 e0 08 ret 2013228: 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) + 201322c: c4 06 20 34 ld [ %i0 + 0x34 ], %g2 2013230: ba 00 7f fe add %g1, -2, %i5 2013234: bb 2f 40 03 sll %i5, %g3, %i5 2013238: 10 bf ff 89 b 201305c 201323c: ba 07 40 02 add %i5, %g2, %i5 2013240: c6 06 20 34 ld [ %i0 + 0x34 ], %g3 2013244: b8 00 bf fe add %g2, -2, %i4 2013248: b9 2f 00 04 sll %i4, %g4, %i4 201324c: 10 bf ff a3 b 20130d8 2013250: 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; 2013254: c2 26 80 00 st %g1, [ %i2 ] lfat_fd->links_num++; 2013258: 84 00 a0 01 inc %g2 201325c: c4 20 60 08 st %g2, [ %g1 + 8 ] 2013260: 81 c7 e0 08 ret 2013264: 91 e8 20 00 restore %g0, 0, %o0 const fat_fs_info_t *fs_info, uint32_t cln ) { if (cln == 1) return 1; 2013268: 10 bf ff 9e b 20130e0 201326c: 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) + 2013270: c8 06 20 34 ld [ %i0 + 0x34 ], %g4 <== NOT EXECUTED 2013274: b8 00 bf fe add %g2, -2, %i4 <== NOT EXECUTED 2013278: b9 2f 00 03 sll %i4, %g3, %i4 <== NOT EXECUTED 201327c: 10 bf ff b9 b 2013160 <== NOT EXECUTED 2013280: 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) ) 2013284: 02 bf ff c8 be 20131a4 <== NOT EXECUTED 2013288: a0 10 20 00 clr %l0 <== NOT EXECUTED 201328c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 <== NOT EXECUTED 2013290: 80 a7 40 02 cmp %i5, %g2 <== NOT EXECUTED 2013294: 32 bf ff c0 bne,a 2013194 <== NOT EXECUTED 2013298: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED 201329c: 30 bf ff c2 b,a 20131a4 <== NOT EXECUTED const fat_fs_info_t *fs_info, uint32_t cln ) { if (cln == 1) return 1; 20132a0: 10 bf ff b2 b 2013168 <== NOT EXECUTED 20132a4: b8 10 20 01 mov 1, %i4 <== NOT EXECUTED 20132a8: 10 bf ff 6f b 2013064 20132ac: 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); 20132b0: 40 00 07 23 call 2014f3c <== NOT EXECUTED 20132b4: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED if ( lfat_fd->ino == 0 ) 20132b8: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 20132bc: 12 bf ff d5 bne 2013210 <== NOT EXECUTED 20132c0: d0 27 20 0c st %o0, [ %i4 + 0xc ] <== NOT EXECUTED { free((*fat_fd)); 20132c4: 7f ff c8 66 call 200545c <== NOT EXECUTED 20132c8: 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 ); 20132cc: 40 00 27 80 call 201d0cc <__errno> <== NOT EXECUTED 20132d0: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20132d4: 82 10 20 0c mov 0xc, %g1 <== NOT EXECUTED 20132d8: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 20132dc: 81 c7 e0 08 ret <== NOT EXECUTED 20132e0: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 020132fc : fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, uint8_t *buf ) { 20132fc: 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; 2013300: c0 27 bf fc clr [ %fp + -4 ] fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, uint8_t *buf ) { 2013304: 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) 2013308: 80 a6 e0 00 cmp %i3, 0 201330c: 02 80 00 7f be 2013508 <== NEVER TAKEN 2013310: 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 ) 2013314: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 2013318: 80 a0 40 1a cmp %g1, %i2 201331c: 08 80 00 7b bleu 2013508 2013320: 80 a6 c0 01 cmp %i3, %g1 return FAT_EOF; if ((count > fat_fd->fat_file_size) || 2013324: 08 80 00 4c bleu 2013454 <== ALWAYS TAKEN 2013328: 84 20 40 1b sub %g1, %i3, %g2 (start > fat_fd->fat_file_size - count)) count = fat_fd->fat_file_size - start; 201332c: b6 20 40 1a sub %g1, %i2, %i3 <== NOT EXECUTED if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2013330: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 2013334: 80 a0 60 01 cmp %g1, 1 2013338: 22 80 00 4c be,a 2013468 201333c: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 return -1; return ret; } cl_start = start >> fs_info->vol.bpc_log2; 2013340: e4 0f 60 08 ldub [ %i5 + 8 ], %l2 save_ofs = ofs = start & (fs_info->vol.bpc - 1); 2013344: e0 17 60 06 lduh [ %i5 + 6 ], %l0 return -1; return ret; } cl_start = start >> fs_info->vol.bpc_log2; 2013348: 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); 201334c: 90 10 00 1d mov %i5, %o0 2013350: 92 10 00 19 mov %i1, %o1 2013354: 94 10 00 12 mov %l2, %o2 2013358: 7f ff ff 06 call 2012f70 201335c: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 2013360: b0 92 60 00 orcc %o1, 0, %i0 2013364: 12 80 00 69 bne 2013508 <== NEVER TAKEN 2013368: a1 2c 20 10 sll %l0, 0x10, %l0 return rc; while (count > 0) 201336c: 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); 2013370: 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) 2013374: 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); 2013378: 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) 201337c: 80 a6 e0 00 cmp %i3, 0 2013380: 02 80 00 5b be 20134ec <== NEVER TAKEN 2013384: b4 0e 80 10 and %i2, %l0, %i2 2013388: c6 0f 60 02 ldub [ %i5 + 2 ], %g3 201338c: c8 17 40 00 lduh [ %i5 ], %g4 2013390: 10 80 00 20 b 2013410 2013394: 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)) ) 2013398: 80 8e 20 03 btst 3, %i0 <== NOT EXECUTED 201339c: 22 80 00 27 be,a 2013438 <== NOT EXECUTED 20133a0: de 0f 60 05 ldub [ %i5 + 5 ], %o7 <== NOT EXECUTED return fs_info->vol.rdir_loc; 20133a4: 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); 20133a8: 87 32 80 03 srl %o2, %g3, %g3 byte = ofs & (fs_info->vol.bps - 1); 20133ac: 85 29 20 10 sll %g4, 0x10, %g2 20133b0: 85 30 a0 10 srl %g2, 0x10, %g2 20133b4: 84 00 bf ff add %g2, -1, %g2 ret = _fat_block_read(fs_info, sec, byte, c, buf + cmpltd); 20133b8: 98 07 00 11 add %i4, %l1, %o4 20133bc: 94 0a 80 02 and %o2, %g2, %o2 20133c0: 92 02 40 03 add %o1, %g3, %o1 20133c4: 96 10 00 10 mov %l0, %o3 20133c8: 40 00 03 25 call 201405c <_fat_block_read> 20133cc: 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); 20133d0: 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 ) 20133d4: 80 a2 20 00 cmp %o0, 0 20133d8: 06 80 00 3d bl 20134cc <== NEVER TAKEN 20133dc: 90 10 00 1d mov %i5, %o0 return -1; count -= c; cmpltd += c; save_cln = cur_cln; 20133e0: 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; 20133e4: 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); 20133e8: 92 10 00 13 mov %l3, %o1 20133ec: 40 00 1e 81 call 201adf0 20133f0: a2 04 40 10 add %l1, %l0, %l1 if ( rc != RC_OK ) 20133f4: 80 a2 20 00 cmp %o0, 0 20133f8: 12 80 00 15 bne 201344c <== NEVER TAKEN 20133fc: 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) 2013400: 02 80 00 3a be 20134e8 2013404: 94 10 20 00 clr %o2 2013408: c6 0f 60 02 ldub [ %i5 + 2 ], %g3 201340c: c8 17 40 00 lduh [ %i5 ], %g4 { c = MIN(count, (fs_info->vol.bpc - ofs)); 2013410: e0 17 60 06 lduh [ %i5 + 6 ], %l0 2013414: a0 24 00 0a sub %l0, %o2, %l0 2013418: 80 a4 00 1b cmp %l0, %i3 201341c: 08 80 00 03 bleu 2013428 2013420: c4 07 bf fc ld [ %fp + -4 ], %g2 2013424: 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)) ) 2013428: 80 a0 a0 00 cmp %g2, 0 201342c: 22 bf ff db be,a 2013398 <== NEVER TAKEN 2013430: 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) + 2013434: de 0f 60 05 ldub [ %i5 + 5 ], %o7 2013438: f0 07 60 34 ld [ %i5 + 0x34 ], %i0 201343c: 92 00 bf fe add %g2, -2, %o1 2013440: 93 2a 40 0f sll %o1, %o7, %o1 2013444: 10 bf ff d9 b 20133a8 2013448: 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; } 201344c: 81 c7 e0 08 ret <== NOT EXECUTED 2013450: 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) || 2013454: 80 a6 80 02 cmp %i2, %g2 2013458: 28 bf ff b7 bleu,a 2013334 201345c: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 (start > fat_fd->fat_file_size - count)) count = fat_fd->fat_file_size - start; 2013460: 10 bf ff b4 b 2013330 2013464: b6 20 40 1a sub %g1, %i2, %i3 if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2013468: 80 a0 60 00 cmp %g1, 0 201346c: 32 bf ff b6 bne,a 2013344 <== NEVER TAKEN 2013470: e4 0f 60 08 ldub [ %i5 + 8 ], %l2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 2013474: 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)) && 2013478: 80 88 60 03 btst 3, %g1 201347c: 22 bf ff b2 be,a 2013344 2013480: 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); 2013484: 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)) ) 2013488: 80 a0 60 00 cmp %g1, 0 201348c: 32 80 00 12 bne,a 20134d4 <== NEVER TAKEN 2013490: c6 0f 60 05 ldub [ %i5 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2013494: d2 07 60 20 ld [ %i5 + 0x20 ], %o1 sec += (start >> fs_info->vol.sec_log2); 2013498: c2 0f 60 02 ldub [ %i5 + 2 ], %g1 byte = start & (fs_info->vol.bps - 1); 201349c: 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); 20134a0: 83 36 80 01 srl %i2, %g1, %g1 byte = start & (fs_info->vol.bps - 1); 20134a4: 94 02 bf ff add %o2, -1, %o2 ret = _fat_block_read(fs_info, sec, byte, count, buf); 20134a8: 90 10 00 1d mov %i5, %o0 20134ac: 92 02 40 01 add %o1, %g1, %o1 20134b0: 94 0e 80 0a and %i2, %o2, %o2 20134b4: 96 10 00 1b mov %i3, %o3 20134b8: 40 00 02 e9 call 201405c <_fat_block_read> 20134bc: 98 10 00 1c mov %i4, %o4 if ( ret < 0 ) 20134c0: b0 92 20 00 orcc %o0, 0, %i0 20134c4: 16 80 00 11 bge 2013508 <== ALWAYS TAKEN 20134c8: 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; 20134cc: 81 c7 e0 08 ret <== NOT EXECUTED 20134d0: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 20134d4: c4 07 60 34 ld [ %i5 + 0x34 ], %g2 <== NOT EXECUTED 20134d8: 92 00 7f fe add %g1, -2, %o1 <== NOT EXECUTED 20134dc: 93 2a 40 03 sll %o1, %g3, %o1 <== NOT EXECUTED 20134e0: 10 bf ff ee b 2013498 <== NOT EXECUTED 20134e4: 92 02 40 02 add %o1, %g2, %o1 <== NOT EXECUTED 20134e8: 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); 20134ec: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 20134f0: b4 06 bf ff add %i2, -1, %i2 fat_fd->map.disk_cln = save_cln; 20134f4: 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); 20134f8: a2 06 80 11 add %i2, %l1, %l1 20134fc: 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 + 2013500: a4 04 40 12 add %l1, %l2, %l2 2013504: e4 26 60 34 st %l2, [ %i1 + 0x34 ] 2013508: 81 c7 e0 08 ret 201350c: 81 e8 00 00 restore =============================================================================== 02013d04 : int fat_file_size( fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd ) { 2013d04: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; uint32_t cur_cln = fat_fd->cln; 2013d08: 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)) && 2013d0c: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 2013d10: 80 a0 60 01 cmp %g1, 1 2013d14: 02 80 00 21 be 2013d98 2013d18: 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) 2013d1c: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 2013d20: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2013d24: 84 0f 00 02 and %i4, %g2, %g2 2013d28: 80 a0 80 01 cmp %g2, %g1 2013d2c: 0a 80 00 0e bcs 2013d64 <== ALWAYS TAKEN 2013d30: 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; 2013d34: 10 80 00 15 b 2013d88 <== NOT EXECUTED 2013d38: 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; 2013d3c: 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) 2013d40: c6 06 20 10 ld [ %i0 + 0x10 ], %g3 2013d44: c4 06 20 14 ld [ %i0 + 0x14 ], %g2 2013d48: 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; 2013d4c: 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) 2013d50: 86 08 40 03 and %g1, %g3, %g3 2013d54: 80 a0 c0 02 cmp %g3, %g2 2013d58: 1a 80 00 0c bcc 2013d88 <== ALWAYS TAKEN 2013d5c: c8 26 60 18 st %g4, [ %i1 + 0x18 ] 2013d60: b8 10 00 01 mov %g1, %i4 <== NOT EXECUTED { save_cln = cur_cln; rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 2013d64: 92 10 00 1c mov %i4, %o1 2013d68: 90 10 00 18 mov %i0, %o0 2013d6c: 40 00 1c 21 call 201adf0 2013d70: 94 07 bf fc add %fp, -4, %o2 if ( rc != RC_OK ) 2013d74: 80 a2 20 00 cmp %o0, 0 2013d78: 22 bf ff f1 be,a 2013d3c <== ALWAYS TAKEN 2013d7c: 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; } 2013d80: 81 c7 e0 08 ret <== NOT EXECUTED 2013d84: 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; 2013d88: 90 10 20 00 clr %o0 2013d8c: f8 26 60 3c st %i4, [ %i1 + 0x3c ] return rc; } 2013d90: 81 c7 e0 08 ret 2013d94: 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)) && 2013d98: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 2013d9c: 80 a0 60 00 cmp %g1, 0 2013da0: 32 bf ff e0 bne,a 2013d20 <== NEVER TAKEN 2013da4: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 2013da8: 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)) && 2013dac: 80 88 60 03 btst 3, %g1 2013db0: 22 bf ff dc be,a 2013d20 <== ALWAYS TAKEN 2013db4: 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; 2013db8: c2 06 20 2c ld [ %i0 + 0x2c ], %g1 <== NOT EXECUTED return rc; 2013dbc: 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; 2013dc0: 10 bf ff f0 b 2013d80 <== NOT EXECUTED 2013dc4: c2 26 60 18 st %g1, [ %i1 + 0x18 ] <== NOT EXECUTED =============================================================================== 02013510 : fat_file_truncate( fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd, uint32_t new_length ) { 2013510: 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 ) 2013514: 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; 2013518: 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; 201351c: 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 ) 2013520: 80 a0 40 1a cmp %g1, %i2 2013524: 08 80 00 26 bleu 20135bc 2013528: c4 27 bf fc st %g2, [ %fp + -4 ] return rc; assert(fat_fd->fat_file_size); 201352c: 80 a0 60 00 cmp %g1, 0 2013530: 02 80 00 31 be 20135f4 <== NEVER TAKEN 2013534: 11 00 80 b4 sethi %hi(0x202d000), %o0 cl_start = (new_length + fs_info->vol.bpc - 1) >> fs_info->vol.bpc_log2; 2013538: c4 0e 20 08 ldub [ %i0 + 8 ], %g2 201353c: c6 16 20 06 lduh [ %i0 + 6 ], %g3 2013540: 86 00 ff ff add %g3, -1, %g3 2013544: b4 00 c0 1a add %g3, %i2, %i2 2013548: b5 36 80 02 srl %i2, %g2, %i2 if ((cl_start << fs_info->vol.bpc_log2) >= fat_fd->fat_file_size) 201354c: 85 2e 80 02 sll %i2, %g2, %g2 2013550: 80 a0 40 02 cmp %g1, %g2 2013554: 08 80 00 1a bleu 20135bc 2013558: 80 a6 a0 00 cmp %i2, 0 return RC_OK; if (cl_start != 0) 201355c: 02 80 00 09 be 2013580 2013560: 90 10 00 18 mov %i0, %o0 { rc = fat_file_lseek(fs_info, fat_fd, cl_start - 1, &new_last_cln); 2013564: 92 10 00 19 mov %i1, %o1 2013568: 94 06 bf ff add %i2, -1, %o2 201356c: 7f ff fe 81 call 2012f70 2013570: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 2013574: 80 a2 60 00 cmp %o1, 0 2013578: 12 80 00 12 bne 20135c0 <== NEVER TAKEN 201357c: 90 10 00 18 mov %i0, %o0 return rc; } rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); 2013580: 92 10 00 19 mov %i1, %o1 2013584: 94 10 00 1a mov %i2, %o2 2013588: 7f ff fe 7a call 2012f70 201358c: 96 07 bf f8 add %fp, -8, %o3 if (rc != RC_OK) 2013590: 80 a2 60 00 cmp %o1, 0 2013594: 12 80 00 0b bne 20135c0 <== NEVER TAKEN 2013598: 01 00 00 00 nop return rc; rc = fat_free_fat_clusters_chain(fs_info, cur_cln); 201359c: d2 07 bf f8 ld [ %fp + -8 ], %o1 20135a0: 40 00 1f 4a call 201b2c8 20135a4: 90 10 00 18 mov %i0, %o0 if (rc != RC_OK) 20135a8: 92 92 20 00 orcc %o0, 0, %o1 20135ac: 12 80 00 05 bne 20135c0 <== NEVER TAKEN 20135b0: 80 a6 a0 00 cmp %i2, 0 return rc; if (cl_start != 0) 20135b4: 12 80 00 05 bne 20135c8 20135b8: 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; 20135bc: 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; } 20135c0: 81 c7 e0 08 ret 20135c4: 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); 20135c8: 90 10 00 18 mov %i0, %o0 20135cc: 40 00 1e 8d call 201b000 20135d0: 94 10 3f ff mov -1, %o2 if ( rc != RC_OK ) 20135d4: 92 92 20 00 orcc %o0, 0, %o1 20135d8: 12 bf ff fa bne 20135c0 <== NEVER TAKEN 20135dc: c2 07 bf fc ld [ %fp + -4 ], %g1 return rc; fat_fd->map.file_cln = cl_start - 1; 20135e0: b4 06 bf ff add %i2, -1, %i2 fat_fd->map.disk_cln = new_last_cln; 20135e4: 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; 20135e8: f4 26 60 34 st %i2, [ %i1 + 0x34 ] fat_fd->map.disk_cln = new_last_cln; fat_fd->map.last_cln = new_last_cln; 20135ec: 10 bf ff f5 b 20135c0 20135f0: c2 26 60 3c st %g1, [ %i1 + 0x3c ] if ( new_length >= fat_fd->fat_file_size ) return rc; assert(fat_fd->fat_file_size); 20135f4: 15 00 80 b4 sethi %hi(0x202d000), %o2 <== NOT EXECUTED 20135f8: 17 00 80 b4 sethi %hi(0x202d000), %o3 <== NOT EXECUTED 20135fc: 90 12 22 78 or %o0, 0x278, %o0 <== NOT EXECUTED 2013600: 92 10 22 d1 mov 0x2d1, %o1 <== NOT EXECUTED 2013604: 94 12 a2 d8 or %o2, 0x2d8, %o2 <== NOT EXECUTED 2013608: 40 00 08 ea call 20159b0 <__assert_func> <== NOT EXECUTED 201360c: 96 12 e2 c0 or %o3, 0x2c0, %o3 <== NOT EXECUTED =============================================================================== 020139f4 : fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, const uint8_t *buf ) { 20139f4: 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; 20139f8: c0 27 bf f8 clr [ %fp + -8 ] fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, const uint8_t *buf ) { 20139fc: 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; 2013a00: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 uint32_t file_cln_initial = fat_fd->map.file_cln; 2013a04: e4 06 60 34 ld [ %i1 + 0x34 ], %l2 uint32_t cln; if ( count == 0 ) 2013a08: 80 a6 e0 00 cmp %i3, 0 2013a0c: 02 80 00 5d be 2013b80 <== NEVER TAKEN 2013a10: b0 10 20 00 clr %i0 return cmpltd; if (start >= fat_fd->size_limit) 2013a14: fa 06 60 14 ld [ %i1 + 0x14 ], %i5 2013a18: 80 a6 80 1d cmp %i2, %i5 2013a1c: 1a 80 00 89 bcc 2013c40 <== NEVER TAKEN 2013a20: ba 27 40 1a sub %i5, %i2, %i5 2013a24: 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; 2013a28: 18 80 00 58 bgu 2013b88 <== ALWAYS TAKEN 2013a2c: 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); 2013a30: b6 07 40 1a add %i5, %i2, %i3 <== NOT EXECUTED 2013a34: 94 40 20 00 addx %g0, 0, %o2 <== NOT EXECUTED 2013a38: 90 10 00 10 mov %l0, %o0 <== NOT EXECUTED 2013a3c: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED 2013a40: 96 10 00 1b mov %i3, %o3 <== NOT EXECUTED 2013a44: 7f ff ff 57 call 20137a0 <== NOT EXECUTED 2013a48: 98 07 bf f8 add %fp, -8, %o4 <== NOT EXECUTED if (RC_OK == rc) 2013a4c: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 2013a50: 12 80 00 4c bne 2013b80 <== NOT EXECUTED 2013a54: 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)) 2013a58: 80 a6 c0 01 cmp %i3, %g1 <== NOT EXECUTED 2013a5c: 32 80 00 02 bne,a 2013a64 <== NEVER TAKEN 2013a60: 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)); 2013a64: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 2013a68: 80 a0 60 01 cmp %g1, 1 2013a6c: 02 80 00 5b be 2013bd8 2013a70: 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; 2013a74: 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; 2013a78: 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; 2013a7c: 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); 2013a80: 90 10 00 10 mov %l0, %o0 2013a84: 92 10 00 19 mov %i1, %o1 2013a88: 94 10 00 15 mov %l5, %o2 2013a8c: 7f ff fd 39 call 2012f70 2013a90: 96 07 bf fc add %fp, -4, %o3 if (RC_OK == rc) 2013a94: 80 a2 60 00 cmp %o1, 0 2013a98: 12 80 00 38 bne 2013b78 <== NEVER TAKEN 2013a9c: b0 92 60 00 orcc %o1, 0, %i0 { file_cln_cnt = cur_cln - fat_fd->cln; 2013aa0: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 2013aa4: 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); 2013aa8: 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; 2013aac: 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); 2013ab0: 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; 2013ab4: 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); 2013ab8: 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; 2013abc: 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 */ 2013ac0: 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; 2013ac4: 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) 2013ac8: 80 a7 60 00 cmp %i5, 0 2013acc: 22 80 00 21 be,a 2013b50 <== NEVER TAKEN 2013ad0: c2 0c 20 08 ldub [ %l0 + 8 ], %g1 <== NOT EXECUTED 2013ad4: 80 a6 20 00 cmp %i0, 0 2013ad8: 32 80 00 1e bne,a 2013b50 <== NEVER TAKEN 2013adc: 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)); 2013ae0: d6 14 20 06 lduh [ %l0 + 6 ], %o3 2013ae4: 96 22 c0 11 sub %o3, %l1, %o3 2013ae8: 80 a2 c0 1d cmp %o3, %i5 2013aec: 38 80 00 02 bgu,a 2013af4 2013af0: 96 10 00 1d mov %i5, %o3 if (file_cln_initial < file_cln_cnt) 2013af4: 80 a4 80 16 cmp %l2, %l6 2013af8: 2a 80 00 02 bcs,a 2013b00 2013afc: a6 10 20 01 mov 1, %l3 overwrite_cluster = true; ret = fat_cluster_write(fs_info, 2013b00: d2 07 bf fc ld [ %fp + -4 ], %o1 2013b04: 90 10 00 10 mov %l0, %o0 2013b08: 94 10 00 11 mov %l1, %o2 2013b0c: 98 07 00 1b add %i4, %i3, %o4 2013b10: 9a 0c e0 01 and %l3, 1, %o5 2013b14: 40 00 01 fe call 201430c 2013b18: b0 10 3f ff mov -1, %i0 cur_cln, ofs_cln, c, &buf[cmpltd], overwrite_cluster); if (0 > ret) 2013b1c: 80 a2 20 00 cmp %o0, 0 2013b20: 06 bf ff eb bl 2013acc <== NEVER TAKEN 2013b24: 80 a7 60 00 cmp %i5, 0 rc = -1; if (RC_OK == rc) { ++file_cln_cnt; 2013b28: ac 05 a0 01 inc %l6 bytes_to_write -= ret; cmpltd += ret; 2013b2c: b6 06 c0 08 add %i3, %o0, %i3 save_cln = cur_cln; if (0 < bytes_to_write) 2013b30: ba a7 40 08 subcc %i5, %o0, %i5 2013b34: 12 80 00 22 bne 2013bbc 2013b38: e8 07 bf fc ld [ %fp + -4 ], %l4 2013b3c: 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) 2013b40: 80 a7 60 00 cmp %i5, 0 2013b44: 12 bf ff e4 bne 2013ad4 <== NEVER TAKEN 2013b48: 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); 2013b4c: c2 0c 20 08 ldub [ %l0 + 8 ], %g1 2013b50: b4 06 bf ff add %i2, -1, %i2 fat_fd->map.disk_cln = save_cln; 2013b54: 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); 2013b58: b4 06 80 1b add %i2, %i3, %i2 2013b5c: b5 36 80 01 srl %i2, %g1, %i2 } } /* update cache */ /* XXX: check this - I'm not sure :( */ fat_fd->map.file_cln = start_cln + 2013b60: 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) 2013b64: 92 96 20 00 orcc %i0, 0, %o1 2013b68: 12 80 00 03 bne 2013b74 <== NEVER TAKEN 2013b6c: ea 26 60 34 st %l5, [ %i1 + 0x34 ] return rc; else return cmpltd; 2013b70: 92 10 00 1b mov %i3, %o1 fat_fd, start, count, buf, file_cln_initial); if (0 > ret) 2013b74: b0 92 60 00 orcc %o1, 0, %i0 2013b78: 06 80 00 30 bl 2013c38 <== NEVER TAKEN 2013b7c: 01 00 00 00 nop } if (RC_OK != rc) return rc; else return cmpltd; } 2013b80: 81 c7 e0 08 ret 2013b84: 81 e8 00 00 restore 2013b88: 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); 2013b8c: 94 40 20 00 addx %g0, 0, %o2 2013b90: b6 07 40 1a add %i5, %i2, %i3 2013b94: 90 10 00 10 mov %l0, %o0 2013b98: 92 10 00 19 mov %i1, %o1 2013b9c: 96 10 00 1b mov %i3, %o3 2013ba0: 7f ff ff 00 call 20137a0 2013ba4: 98 07 bf f8 add %fp, -8, %o4 if (RC_OK == rc) 2013ba8: b0 92 20 00 orcc %o0, 0, %i0 2013bac: 12 bf ff f5 bne 2013b80 2013bb0: 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)) 2013bb4: 10 bf ff aa b 2013a5c 2013bb8: 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); 2013bbc: 90 10 00 10 mov %l0, %o0 2013bc0: 92 10 00 14 mov %l4, %o1 2013bc4: 94 07 bf fc add %fp, -4, %o2 2013bc8: 40 00 1c 8a call 201adf0 2013bcc: a2 10 20 00 clr %l1 2013bd0: 10 bf ff be b 2013ac8 2013bd4: 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)); 2013bd8: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 2013bdc: 80 a0 60 00 cmp %g1, 0 2013be0: 32 bf ff a6 bne,a 2013a78 <== NEVER TAKEN 2013be4: f6 0c 20 08 ldub [ %l0 + 8 ], %i3 <== NOT EXECUTED 2013be8: 80 88 a0 03 btst 3, %g2 2013bec: 22 bf ff a3 be,a 2013a78 2013bf0: 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; 2013bf4: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 cln += (start >> fs_info->vol.bpc_log2); 2013bf8: d2 0c 20 08 ldub [ %l0 + 8 ], %o1 byte = start & (fs_info->vol.bpc -1); 2013bfc: 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); 2013c00: 93 36 80 09 srl %i2, %o1, %o1 byte = start & (fs_info->vol.bpc -1); 2013c04: 94 02 bf ff add %o2, -1, %o2 ret = fat_cluster_write(fs_info, 2013c08: 90 10 00 10 mov %l0, %o0 2013c0c: 92 02 40 01 add %o1, %g1, %o1 2013c10: 94 0e 80 0a and %i2, %o2, %o2 2013c14: 96 10 00 1d mov %i5, %o3 2013c18: 98 10 00 1c mov %i4, %o4 2013c1c: 40 00 01 bc call 201430c 2013c20: 9a 10 20 00 clr %o5 cln, byte, count, buf, false); if (0 > ret) 2013c24: 80 a2 20 00 cmp %o0, 0 2013c28: 06 80 00 04 bl 2013c38 <== NEVER TAKEN 2013c2c: 01 00 00 00 nop rc = -1; else cmpltd = ret; 2013c30: 81 c7 e0 08 ret 2013c34: 91 e8 00 08 restore %g0, %o0, %o0 start, count, buf, file_cln_initial); if (0 > ret) rc = -1; 2013c38: 81 c7 e0 08 ret <== NOT EXECUTED 2013c3c: 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); 2013c40: 40 00 25 23 call 201d0cc <__errno> <== NOT EXECUTED 2013c44: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013c48: 82 10 20 1b mov 0x1b, %g1 <== NOT EXECUTED 2013c4c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013c50: 81 c7 e0 08 ret <== NOT EXECUTED 2013c54: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0201b2c8 : int fat_free_fat_clusters_chain( fat_fs_info_t *fs_info, uint32_t chain ) { 201b2c8: 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) 201b2cc: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 201b2d0: 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; 201b2d4: 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) 201b2d8: 84 0e 40 02 and %i1, %g2, %g2 201b2dc: 80 a0 80 01 cmp %g2, %g1 201b2e0: 1a 80 00 25 bcc 201b374 <== NEVER TAKEN 201b2e4: ba 10 00 18 mov %i0, %i5 201b2e8: b8 10 00 19 mov %i1, %i4 201b2ec: b6 10 20 00 clr %i3 201b2f0: 10 80 00 0e b 201b328 201b2f4: 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); 201b2f8: 7f ff ff 42 call 201b000 201b2fc: 01 00 00 00 nop if ( rc != RC_OK ) 201b300: 80 a2 20 00 cmp %o0, 0 201b304: 02 80 00 03 be 201b310 <== ALWAYS TAKEN 201b308: f8 07 bf fc ld [ %fp + -4 ], %i4 201b30c: 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) 201b310: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 201b314: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 201b318: 84 0f 00 02 and %i4, %g2, %g2 201b31c: 80 a0 80 01 cmp %g2, %g1 201b320: 1a 80 00 17 bcc 201b37c 201b324: b6 06 e0 01 inc %i3 { rc = fat_get_fat_cluster(fs_info, cur_cln, &next_cln); 201b328: 92 10 00 1c mov %i4, %o1 201b32c: 94 07 bf fc add %fp, -4, %o2 201b330: 7f ff fe b0 call 201adf0 201b334: 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); 201b338: 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); 201b33c: 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); 201b340: 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 ) 201b344: 80 a6 20 00 cmp %i0, 0 201b348: 02 bf ff ec be 201b2f8 <== ALWAYS TAKEN 201b34c: 90 10 00 1d mov %i5, %o0 { if(fs_info->vol.free_cls != FAT_UNDEFINED_VALUE) 201b350: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 <== NOT EXECUTED 201b354: 80 a0 7f ff cmp %g1, -1 <== NOT EXECUTED 201b358: 02 80 00 03 be 201b364 <== NOT EXECUTED 201b35c: 82 06 c0 01 add %i3, %g1, %g1 <== NOT EXECUTED fs_info->vol.free_cls += freed_cls_cnt; 201b360: c2 27 60 44 st %g1, [ %i5 + 0x44 ] <== NOT EXECUTED fat_buf_release(fs_info); 201b364: 7f ff e2 99 call 2013dc8 <== NOT EXECUTED 201b368: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201b36c: 81 c7 e0 08 ret <== NOT EXECUTED 201b370: 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; 201b374: 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; 201b378: 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) 201b37c: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 201b380: 80 a0 7f ff cmp %g1, -1 201b384: 02 80 00 04 be 201b394 <== ALWAYS TAKEN 201b388: f2 27 60 4c st %i1, [ %i5 + 0x4c ] fs_info->vol.free_cls += freed_cls_cnt; 201b38c: 82 06 c0 01 add %i3, %g1, %g1 <== NOT EXECUTED 201b390: c2 27 60 44 st %g1, [ %i5 + 0x44 ] <== NOT EXECUTED fat_buf_release(fs_info); 201b394: b0 10 00 1a mov %i2, %i0 201b398: 7f ff e2 8c call 2013dc8 201b39c: 90 10 00 1d mov %i5, %o0 if (rc1 != RC_OK) return rc1; return RC_OK; } 201b3a0: 81 c7 e0 08 ret 201b3a4: 81 e8 00 00 restore =============================================================================== 0201502c : 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); 201502c: c4 02 20 80 ld [ %o0 + 0x80 ], %g2 <== NOT EXECUTED 2015030: c2 02 20 74 ld [ %o0 + 0x74 ], %g1 <== NOT EXECUTED 2015034: 92 22 40 02 sub %o1, %g2, %o1 <== NOT EXECUTED 2015038: 85 32 60 03 srl %o1, 3, %g2 <== NOT EXECUTED 201503c: c6 08 40 02 ldub [ %g1 + %g2 ], %g3 <== NOT EXECUTED 2015040: 92 0a 60 07 and %o1, 7, %o1 <== NOT EXECUTED 2015044: 88 10 20 01 mov 1, %g4 <== NOT EXECUTED 2015048: 93 29 00 09 sll %g4, %o1, %o1 <== NOT EXECUTED 201504c: 92 28 c0 09 andn %g3, %o1, %o1 <== NOT EXECUTED 2015050: 81 c3 e0 08 retl <== NOT EXECUTED 2015054: d2 28 40 02 stb %o1, [ %g1 + %g2 ] <== NOT EXECUTED =============================================================================== 0201adf0 : fat_get_fat_cluster( fat_fs_info_t *fs_info, uint32_t cln, uint32_t *ret_val ) { 201adf0: 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)) ) 201adf4: 80 a6 60 01 cmp %i1, 1 201adf8: 08 80 00 27 bleu 201ae94 <== NEVER TAKEN 201adfc: ba 10 00 18 mov %i0, %i5 201ae00: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 201ae04: 82 00 60 01 inc %g1 201ae08: 80 a6 40 01 cmp %i1, %g1 201ae0c: 18 80 00 22 bgu 201ae94 <== NEVER TAKEN 201ae10: 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) + 201ae14: c2 0e 20 0e ldub [ %i0 + 0xe ], %g1 201ae18: 80 88 60 01 btst 1, %g1 201ae1c: 12 80 00 24 bne 201aeac 201ae20: f6 0e 20 02 ldub [ %i0 + 2 ], %i3 201ae24: 82 08 60 02 and %g1, 2, %g1 201ae28: 80 88 60 ff btst 0xff, %g1 201ae2c: 02 80 00 30 be 201aeec 201ae30: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 201ae34: b9 2e 60 01 sll %i1, 1, %i4 201ae38: b7 37 00 1b srl %i4, %i3, %i3 201ae3c: 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); 201ae40: e0 17 40 00 lduh [ %i5 ], %l0 rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &sec_buf); 201ae44: 90 10 00 1d mov %i5, %o0 201ae48: 92 10 00 1b mov %i3, %o1 201ae4c: 94 10 20 01 mov 1, %o2 201ae50: 7f ff e4 55 call 2013fa4 201ae54: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 201ae58: b0 92 20 00 orcc %o0, 0, %i0 201ae5c: 12 80 00 57 bne 201afb8 <== NEVER TAKEN 201ae60: 01 00 00 00 nop return rc; switch ( fs_info->vol.type ) 201ae64: 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); 201ae68: 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 ) 201ae6c: 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); 201ae70: a1 34 20 10 srl %l0, 0x10, %l0 201ae74: 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 ) 201ae78: 02 80 00 21 be 201aefc 201ae7c: b8 0f 00 10 and %i4, %l0, %i4 201ae80: 80 a0 60 04 cmp %g1, 4 201ae84: 02 80 00 3c be 201af74 201ae88: 80 a0 60 01 cmp %g1, 1 201ae8c: 02 80 00 28 be 201af2c <== ALWAYS TAKEN 201ae90: 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); 201ae94: 40 00 08 8e call 201d0cc <__errno> <== NOT EXECUTED 201ae98: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201ae9c: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 201aea0: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 201aea4: 81 c7 e0 08 ret <== NOT EXECUTED 201aea8: 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) + 201aeac: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 201aeb0: 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); 201aeb4: 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) + 201aeb8: 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); 201aebc: 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) + 201aec0: 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); 201aec4: 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) + 201aec8: 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); 201aecc: 96 07 bf fc add %fp, -4, %o3 201aed0: 7f ff e4 35 call 2013fa4 201aed4: 92 10 00 1b mov %i3, %o1 if (rc != RC_OK) 201aed8: b0 92 20 00 orcc %o0, 0, %i0 201aedc: 22 bf ff e3 be,a 201ae68 <== ALWAYS TAKEN 201aee0: c2 0f 60 0e ldub [ %i5 + 0xe ], %g1 rtems_set_errno_and_return_minus_one(EIO); break; } return RC_OK; } 201aee4: 81 c7 e0 08 ret <== NOT EXECUTED 201aee8: 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) + 201aeec: b9 2e 60 02 sll %i1, 2, %i4 201aef0: b7 37 00 1b srl %i4, %i3, %i3 201aef4: 10 bf ff d3 b 201ae40 201aef8: 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)); 201aefc: c2 07 bf fc ld [ %fp + -4 ], %g1 *ret_val = CF_LE_W(*ret_val); 201af00: 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)); 201af04: c2 10 40 1c lduh [ %g1 + %i4 ], %g1 *ret_val = CF_LE_W(*ret_val); 201af08: 86 10 e3 ff or %g3, 0x3ff, %g3 201af0c: 83 28 60 10 sll %g1, 0x10, %g1 201af10: 85 30 60 18 srl %g1, 0x18, %g2 201af14: 83 30 60 08 srl %g1, 8, %g1 201af18: 82 08 40 03 and %g1, %g3, %g1 201af1c: 82 10 80 01 or %g2, %g1, %g1 201af20: c2 26 80 00 st %g1, [ %i2 ] break; 201af24: 81 c7 e0 08 ret 201af28: 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) ) 201af2c: 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)); 201af30: c2 08 80 1c ldub [ %g2 + %i4 ], %g1 if ( ofs == (fs_info->vol.bps - 1) ) 201af34: 86 00 ff ff add %g3, -1, %g3 201af38: 80 a0 c0 1c cmp %g3, %i4 201af3c: 02 80 00 21 be 201afc0 <== NEVER TAKEN 201af40: c2 26 80 00 st %g1, [ %i2 ] *ret_val |= *sec_buf << 8; } else { *ret_val |= *(sec_buf + ofs + 1) << 8; 201af44: b8 00 80 1c add %g2, %i4, %i4 201af48: c4 0f 20 01 ldub [ %i4 + 1 ], %g2 201af4c: 85 28 a0 08 sll %g2, 8, %g2 201af50: 82 10 80 01 or %g2, %g1, %g1 201af54: c2 26 80 00 st %g1, [ %i2 ] } if ( FAT_CLUSTER_IS_ODD(cln) ) 201af58: 80 8e 60 01 btst 1, %i1 201af5c: 22 80 00 16 be,a 201afb4 201af60: 82 08 6f ff and %g1, 0xfff, %g1 *ret_val = (*ret_val) >> FAT12_SHIFT; 201af64: 83 30 60 04 srl %g1, 4, %g1 201af68: c2 26 80 00 st %g1, [ %i2 ] 201af6c: 81 c7 e0 08 ret 201af70: 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)); 201af74: c2 07 bf fc ld [ %fp + -4 ], %g1 201af78: c2 00 40 1c ld [ %g1 + %i4 ], %g1 201af7c: 89 28 60 18 sll %g1, 0x18, %g4 uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 201af80: 85 30 60 18 srl %g1, 0x18, %g2 byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 201af84: 87 30 60 08 srl %g1, 8, %g3 byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201af88: 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; 201af8c: 86 08 e0 ff and %g3, 0xff, %g3 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 201af90: 83 30 60 10 srl %g1, 0x10, %g1 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201af94: 87 28 e0 10 sll %g3, 0x10, %g3 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 201af98: 82 08 60 ff and %g1, 0xff, %g1 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201af9c: 84 10 80 03 or %g2, %g3, %g2 201afa0: 83 28 60 08 sll %g1, 8, %g1 201afa4: 82 10 80 01 or %g2, %g1, %g1 *ret_val = CF_LE_L(*ret_val); 201afa8: c2 26 80 00 st %g1, [ %i2 ] break; 201afac: 81 c7 e0 08 ret 201afb0: 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; 201afb4: c2 26 80 00 st %g1, [ %i2 ] 201afb8: 81 c7 e0 08 ret 201afbc: 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, 201afc0: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201afc4: 92 06 e0 01 add %i3, 1, %o1 <== NOT EXECUTED 201afc8: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 201afcc: 7f ff e3 f6 call 2013fa4 <== NOT EXECUTED 201afd0: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED &sec_buf); if (rc != RC_OK) 201afd4: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 201afd8: 12 80 00 08 bne 201aff8 <== NOT EXECUTED 201afdc: c4 07 bf fc ld [ %fp + -4 ], %g2 <== NOT EXECUTED return rc; *ret_val |= *sec_buf << 8; 201afe0: c2 06 80 00 ld [ %i2 ], %g1 <== NOT EXECUTED 201afe4: c4 08 80 00 ldub [ %g2 ], %g2 <== NOT EXECUTED 201afe8: 85 28 a0 08 sll %g2, 8, %g2 <== NOT EXECUTED 201afec: 82 10 80 01 or %g2, %g1, %g1 <== NOT EXECUTED 201aff0: 10 bf ff da b 201af58 <== NOT EXECUTED 201aff4: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED rtems_set_errno_and_return_minus_one(EIO); break; } return RC_OK; } 201aff8: 81 c7 e0 08 ret <== NOT EXECUTED 201affc: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED =============================================================================== 02014f3c : * 0 means FAILED !!! * */ uint32_t fat_get_unique_ino(fat_fs_info_t *fs_info) { 2014f3c: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED 2014f40: 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)) 2014f44: 33 03 ff ff sethi %hi(0xffffc00), %i1 <== NOT EXECUTED 2014f48: 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++) 2014f4c: 80 a7 60 00 cmp %i5, 0 <== NOT EXECUTED 2014f50: 22 80 00 20 be,a 2014fd0 <== NOT EXECUTED 2014f54: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED { if (!FAT_UNIQ_INO_IS_BUSY(fs_info->index, fs_info->uino)) 2014f58: c6 06 20 74 ld [ %i0 + 0x74 ], %g3 <== NOT EXECUTED 2014f5c: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 <== NOT EXECUTED 2014f60: 85 30 60 03 srl %g1, 3, %g2 <== NOT EXECUTED 2014f64: c8 48 c0 02 ldsb [ %g3 + %g2 ], %g4 <== NOT EXECUTED 2014f68: b8 08 60 07 and %g1, 7, %i4 <== NOT EXECUTED 2014f6c: b4 00 c0 02 add %g3, %g2, %i2 <== NOT EXECUTED 2014f70: 89 39 00 1c sra %g4, %i4, %g4 <== NOT EXECUTED 2014f74: 80 89 20 01 btst 1, %g4 <== NOT EXECUTED 2014f78: 02 80 00 1d be 2014fec <== NOT EXECUTED 2014f7c: c4 08 c0 02 ldub [ %g3 + %g2 ], %g2 <== NOT EXECUTED 2014f80: 10 80 00 0a b 2014fa8 <== NOT EXECUTED 2014f84: 88 10 20 00 clr %g4 <== NOT EXECUTED 2014f88: 85 30 60 03 srl %g1, 3, %g2 <== NOT EXECUTED 2014f8c: f6 48 c0 02 ldsb [ %g3 + %g2 ], %i3 <== NOT EXECUTED 2014f90: b8 08 60 07 and %g1, 7, %i4 <== NOT EXECUTED 2014f94: b4 00 c0 02 add %g3, %g2, %i2 <== NOT EXECUTED 2014f98: b7 3e c0 1c sra %i3, %i4, %i3 <== NOT EXECUTED 2014f9c: 80 8e e0 01 btst 1, %i3 <== NOT EXECUTED 2014fa0: 02 80 00 13 be 2014fec <== NOT EXECUTED 2014fa4: 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++; 2014fa8: 82 00 60 01 inc %g1 <== NOT EXECUTED if (fs_info->index >= fs_info->uino_pool_size) 2014fac: 80 a0 40 1d cmp %g1, %i5 <== NOT EXECUTED 2014fb0: 0a 80 00 03 bcs 2014fbc <== NOT EXECUTED 2014fb4: c2 26 20 78 st %g1, [ %i0 + 0x78 ] <== NOT EXECUTED fs_info->index = 0; 2014fb8: 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++) 2014fbc: 88 01 20 01 inc %g4 <== NOT EXECUTED 2014fc0: 80 a1 00 1d cmp %g4, %i5 <== NOT EXECUTED 2014fc4: 32 bf ff f1 bne,a 2014f88 <== NOT EXECUTED 2014fc8: 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)) 2014fcc: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED 2014fd0: 93 2f 60 01 sll %i5, 1, %o1 <== NOT EXECUTED 2014fd4: 82 26 40 01 sub %i1, %g1, %g1 <== NOT EXECUTED 2014fd8: 80 a2 40 01 cmp %o1, %g1 <== NOT EXECUTED 2014fdc: 2a 80 00 0c bcs,a 201500c <== NOT EXECUTED 2014fe0: d0 06 20 74 ld [ %i0 + 0x74 ], %o0 <== NOT EXECUTED } else resrc_unsuff = true; } return 0; } 2014fe4: 81 c7 e0 08 ret <== NOT EXECUTED 2014fe8: 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); 2014fec: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED 2014ff0: b9 28 40 1c sll %g1, %i4, %i4 <== NOT EXECUTED 2014ff4: 84 17 00 02 or %i4, %g2, %g2 <== NOT EXECUTED 2014ff8: c4 2e 80 00 stb %g2, [ %i2 ] <== NOT EXECUTED return (fs_info->uino_base + fs_info->index); 2014ffc: c4 06 20 78 ld [ %i0 + 0x78 ], %g2 <== NOT EXECUTED 2015000: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED 2015004: 81 c7 e0 08 ret <== NOT EXECUTED 2015008: 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); 201500c: 7f ff c5 3b call 20064f8 <== NOT EXECUTED 2015010: d2 26 20 7c st %o1, [ %i0 + 0x7c ] <== NOT EXECUTED if (fs_info->uino != NULL) 2015014: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2015018: 02 bf ff f3 be 2014fe4 <== NOT EXECUTED 201501c: d0 26 20 74 st %o0, [ %i0 + 0x74 ] <== NOT EXECUTED fs_info->index = fs_info->uino_pool_size; 2015020: fa 06 20 7c ld [ %i0 + 0x7c ], %i5 <== NOT EXECUTED 2015024: 10 bf ff ca b 2014f4c <== NOT EXECUTED 2015028: fa 26 20 78 st %i5, [ %i0 + 0x78 ] <== NOT EXECUTED =============================================================================== 02014ec0 : int fat_init_clusters_chain( fat_fs_info_t *fs_info, uint32_t start_cln ) { 2014ec0: 9d e3 bf 98 save %sp, -104, %sp 2014ec4: 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) 2014ec8: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 2014ecc: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 { ret = fat_cluster_set(fs_info, cur_cln, 0, fs_info->vol.bpc, 0); 2014ed0: 92 10 00 19 mov %i1, %o1 2014ed4: 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) 2014ed8: b2 0e 40 02 and %i1, %g2, %i1 { ret = fat_cluster_set(fs_info, cur_cln, 0, fs_info->vol.bpc, 0); 2014edc: 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) 2014ee0: 80 a6 40 01 cmp %i1, %g1 2014ee4: 1a 80 00 10 bcc 2014f24 2014ee8: 90 10 00 18 mov %i0, %o0 { ret = fat_cluster_set(fs_info, cur_cln, 0, fs_info->vol.bpc, 0); 2014eec: 7f ff fc a8 call 201418c 2014ef0: d6 16 20 06 lduh [ %i0 + 6 ], %o3 if ( ret != fs_info->vol.bpc ) 2014ef4: c2 16 20 06 lduh [ %i0 + 6 ], %g1 { return -1; } rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 2014ef8: 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 ) 2014efc: 80 a0 40 08 cmp %g1, %o0 2014f00: 12 80 00 0c bne 2014f30 <== NEVER TAKEN 2014f04: 90 10 00 18 mov %i0, %o0 { return -1; } rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 2014f08: 40 00 17 ba call 201adf0 2014f0c: d2 07 bf fc ld [ %fp + -4 ], %o1 if ( rc != RC_OK ) 2014f10: 80 a2 20 00 cmp %o0, 0 2014f14: 02 bf ff ed be 2014ec8 <== ALWAYS TAKEN 2014f18: f2 07 bf fc ld [ %fp + -4 ], %i1 } } return rc; } 2014f1c: 81 c7 e0 08 ret <== NOT EXECUTED 2014f20: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED return rc; } } return rc; 2014f24: 90 10 20 00 clr %o0 } 2014f28: 81 c7 e0 08 ret 2014f2c: 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; 2014f30: 90 10 3f ff mov -1, %o0 <== NOT EXECUTED } } return rc; } 2014f34: 81 c7 e0 08 ret <== NOT EXECUTED 2014f38: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED =============================================================================== 02014494 : * 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) { 2014494: 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); 2014498: 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; 201449c: c0 27 bf a4 clr [ %fp + -92 ] vol->fd = open(device, O_RDWR); 20144a0: 7f ff c7 79 call 2006284 20144a4: 90 10 00 19 mov %i1, %o0 if (vol->fd < 0) 20144a8: 80 a2 20 00 cmp %o0, 0 20144ac: 06 80 01 c1 bl 2014bb0 <== NEVER TAKEN 20144b0: d0 26 20 60 st %o0, [ %i0 + 0x60 ] { rtems_set_errno_and_return_minus_one(ENXIO); } rc = fstat(vol->fd, &stat_buf); 20144b4: 7f ff c4 14 call 2005504 20144b8: 92 07 bf b8 add %fp, -72, %o1 if (rc != 0) 20144bc: 80 a2 20 00 cmp %o0, 0 20144c0: 12 80 01 b9 bne 2014ba4 <== NEVER TAKEN 20144c4: 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)) 20144c8: 05 00 00 3c sethi %hi(0xf000), %g2 20144cc: 86 08 c0 02 and %g3, %g2, %g3 20144d0: 05 00 00 18 sethi %hi(0x6000), %g2 20144d4: 80 a0 c0 02 cmp %g3, %g2 20144d8: 12 80 01 b4 bne 2014ba8 <== NEVER TAKEN 20144dc: 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); 20144e0: 94 06 20 64 add %i0, 0x64, %o2 20144e4: 13 10 01 10 sethi %hi(0x40044000), %o1 20144e8: 40 00 06 09 call 2015d0c 20144ec: 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) { 20144f0: 80 a2 20 00 cmp %o0, 0 20144f4: 12 80 01 ac bne 2014ba4 <== NEVER TAKEN 20144f8: 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); 20144fc: d0 06 20 64 ld [ %i0 + 0x64 ], %o0 2014500: 7f ff f5 c8 call 2011c20 2014504: 94 07 bf a4 add %fp, -92, %o2 if (sc != RTEMS_SUCCESSFUL) 2014508: 80 a2 20 00 cmp %o0, 0 201450c: 12 80 01 b5 bne 2014be0 <== NEVER TAKEN 2014510: 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); 2014514: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 2014518: c2 08 a0 20 ldub [ %g2 + 0x20 ], %g1 201451c: f8 08 a0 0b ldub [ %g2 + 0xb ], %i4 2014520: c2 2f bf 93 stb %g1, [ %fp + -109 ] 2014524: c2 08 a0 21 ldub [ %g2 + 0x21 ], %g1 2014528: f6 08 a0 0c ldub [ %g2 + 0xc ], %i3 201452c: c2 2f bf 95 stb %g1, [ %fp + -107 ] 2014530: c2 08 a0 22 ldub [ %g2 + 0x22 ], %g1 2014534: ec 08 a0 0d ldub [ %g2 + 0xd ], %l6 2014538: c2 2f bf 94 stb %g1, [ %fp + -108 ] 201453c: c2 08 a0 23 ldub [ %g2 + 0x23 ], %g1 2014540: e8 08 a0 0e ldub [ %g2 + 0xe ], %l4 2014544: c2 2f bf 8f stb %g1, [ %fp + -113 ] 2014548: c2 08 a0 25 ldub [ %g2 + 0x25 ], %g1 201454c: ea 08 a0 0f ldub [ %g2 + 0xf ], %l5 2014550: c2 2f bf 97 stb %g1, [ %fp + -105 ] 2014554: c2 08 a0 26 ldub [ %g2 + 0x26 ], %g1 2014558: fa 08 a0 10 ldub [ %g2 + 0x10 ], %i5 201455c: c2 2f bf 96 stb %g1, [ %fp + -106 ] 2014560: c2 08 a0 27 ldub [ %g2 + 0x27 ], %g1 2014564: f4 08 a0 11 ldub [ %g2 + 0x11 ], %i2 2014568: c2 2f bf 9f stb %g1, [ %fp + -97 ] 201456c: c2 08 a0 28 ldub [ %g2 + 0x28 ], %g1 2014570: f2 08 a0 12 ldub [ %g2 + 0x12 ], %i1 2014574: c2 2f bf 87 stb %g1, [ %fp + -121 ] 2014578: c2 08 a0 2c ldub [ %g2 + 0x2c ], %g1 201457c: e0 08 a0 13 ldub [ %g2 + 0x13 ], %l0 2014580: c2 2f bf 90 stb %g1, [ %fp + -112 ] 2014584: c2 08 a0 2d ldub [ %g2 + 0x2d ], %g1 2014588: e2 08 a0 14 ldub [ %g2 + 0x14 ], %l1 201458c: e4 08 a0 16 ldub [ %g2 + 0x16 ], %l2 2014590: e6 08 a0 17 ldub [ %g2 + 0x17 ], %l3 2014594: ee 08 a0 24 ldub [ %g2 + 0x24 ], %l7 2014598: c2 2f bf 7f stb %g1, [ %fp + -129 ] 201459c: c2 08 a0 2e ldub [ %g2 + 0x2e ], %g1 20145a0: c2 2f bf 7e stb %g1, [ %fp + -130 ] 20145a4: c2 08 a0 2f ldub [ %g2 + 0x2f ], %g1 20145a8: c2 2f bf 77 stb %g1, [ %fp + -137 ] 20145ac: c2 08 a0 30 ldub [ %g2 + 0x30 ], %g1 20145b0: c4 08 a0 31 ldub [ %g2 + 0x31 ], %g2 20145b4: c2 2f bf 92 stb %g1, [ %fp + -110 ] sc = rtems_bdbuf_release( block); 20145b8: 7f ff f6 1f call 2011e34 20145bc: c4 2f bf 91 stb %g2, [ %fp + -111 ] if (sc != RTEMS_SUCCESSFUL) 20145c0: 80 a2 20 00 cmp %o0, 0 20145c4: 12 80 01 87 bne 2014be0 <== NEVER TAKEN 20145c8: 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); 20145cc: b8 0f 20 ff and %i4, 0xff, %i4 20145d0: b7 2e e0 08 sll %i3, 8, %i3 20145d4: b8 16 c0 1c or %i3, %i4, %i4 20145d8: f8 36 00 00 sth %i4, [ %i0 ] if ( (vol->bps != 512) && 20145dc: 93 2f 20 10 sll %i4, 0x10, %o1 20145e0: 85 32 60 10 srl %o1, 0x10, %g2 20145e4: 80 a0 a4 00 cmp %g2, 0x400 20145e8: 12 80 00 dc bne 2014958 <== ALWAYS TAKEN 20145ec: 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; 20145f0: 85 32 60 19 srl %o1, 0x19, %g2 <== NOT EXECUTED 20145f4: 80 88 a0 01 btst 1, %g2 20145f8: 12 80 00 0a bne 2014620 <== ALWAYS TAKEN 20145fc: 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) { 2014600: 10 80 00 03 b 201460c <== NOT EXECUTED 2014604: 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; 2014608: 88 10 00 0f mov %o7, %g4 <== NOT EXECUTED i >>= 1, vol->sec_mul++); 201460c: 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; 2014610: 80 88 a0 01 btst 1, %g2 <== NOT EXECUTED 2014614: 02 bf ff fd be 2014608 <== NOT EXECUTED 2014618: 9e 01 20 01 add %g4, 1, %o7 <== NOT EXECUTED 201461c: 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; 2014620: c0 2e 20 02 clrb [ %i0 + 2 ] 2014624: 93 32 60 10 srl %o1, 0x10, %o1 2014628: b6 10 20 01 mov 1, %i3 201462c: 80 8f 20 01 btst 1, %i4 2014630: 02 80 00 05 be 2014644 <== ALWAYS TAKEN 2014634: 84 10 00 09 mov %o1, %g2 2014638: 10 80 01 66 b 2014bd0 <== NOT EXECUTED 201463c: b6 10 20 00 clr %i3 <== NOT EXECUTED 2014640: b6 10 00 04 mov %g4, %i3 i >>= 1, vol->sec_log2++); 2014644: 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; 2014648: 80 88 a0 01 btst 1, %g2 201464c: 02 bf ff fd be 2014640 2014650: 88 06 e0 01 add %i3, 1, %g4 2014654: 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; 2014658: 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; 201465c: da 36 20 0a sth %o5, [ %i0 + 0xa ] vol->bytes_per_block_log2 = vol->sec_log2; 2014660: f6 2e 20 0c stb %i3, [ %i0 + 0xc ] vol->sectors_per_block = 1; 2014664: 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) 2014668: b8 8d a0 ff andcc %l6, 0xff, %i4 201466c: 02 80 01 45 be 2014b80 <== NEVER TAKEN 2014670: 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; 2014674: c0 2e 20 05 clrb [ %i0 + 5 ] 2014678: 80 8d a0 01 btst 1, %l6 201467c: 12 80 01 57 bne 2014bd8 2014680: 84 10 00 1c mov %i4, %g2 2014684: 10 80 00 03 b 2014690 2014688: 86 10 20 01 mov 1, %g3 201468c: 86 10 00 04 mov %g4, %g3 i >>= 1, vol->spc_log2++); 2014690: 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; 2014694: 80 88 a0 01 btst 1, %g2 2014698: 02 bf ff fd be 201468c 201469c: 88 00 e0 01 add %g3, 1, %g4 20146a0: c6 2e 20 05 stb %g3, [ %i0 + 5 ] 20146a4: 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) 20146a8: 87 2a 40 03 sll %o1, %g3, %g3 20146ac: 89 28 e0 10 sll %g3, 0x10, %g4 20146b0: 05 20 00 00 sethi %hi(0x80000000), %g2 20146b4: 80 a1 00 02 cmp %g4, %g2 20146b8: 18 80 01 32 bgu 2014b80 <== NEVER TAKEN 20146bc: 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; 20146c0: c0 2e 20 08 clrb [ %i0 + 8 ] 20146c4: 05 00 00 3f sethi %hi(0xfc00), %g2 20146c8: 88 10 20 01 mov 1, %g4 20146cc: 84 10 a3 ff or %g2, 0x3ff, %g2 20146d0: 80 88 e0 01 btst 1, %g3 20146d4: 02 80 00 05 be 20146e8 <== ALWAYS TAKEN 20146d8: 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); 20146dc: 10 80 00 09 b 2014700 <== NOT EXECUTED 20146e0: 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; 20146e4: 88 10 00 03 mov %g3, %g4 i >>= 1, vol->bpc_log2++); 20146e8: 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; 20146ec: 80 88 a0 01 btst 1, %g2 20146f0: 02 bf ff fd be 20146e4 20146f4: 86 01 20 01 add %g4, 1, %g3 20146f8: 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); 20146fc: b4 0e a0 ff and %i2, 0xff, %i2 2014700: b2 0e 60 ff and %i1, 0xff, %i1 2014704: b3 2e 60 08 sll %i1, 8, %i1 2014708: 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)) / 201470c: 87 2e 60 10 sll %i1, 0x10, %g3 2014710: 87 30 e0 0b srl %g3, 0xb, %g3 2014714: 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); 2014718: fa 2e 20 0d stb %i5, [ %i0 + 0xd ] vol->fat_loc = FAT_GET_BR_RESERVED_SECTORS_NUM(boot_rec); 201471c: aa 0d 60 ff and %l5, 0xff, %l5 2014720: a8 0d 20 ff and %l4, 0xff, %l4 2014724: ab 2d 60 08 sll %l5, 8, %l5 vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); 2014728: 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); 201472c: 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)) / 2014730: 90 00 c0 08 add %g3, %o0, %o0 2014734: 7f ff b7 d2 call 200267c <.div> 2014738: e8 36 20 18 sth %l4, [ %i0 + 0x18 ] vol->bps; vol->rdir_size = vol->rdir_secs << vol->sec_log2; 201473c: 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)) / 2014740: d0 26 20 28 st %o0, [ %i0 + 0x28 ] 2014744: 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) 2014748: a4 0c a0 ff and %l2, 0xff, %l2 201474c: 90 0c e0 ff and %l3, 0xff, %o0 2014750: 91 2a 20 08 sll %o0, 8, %o0 2014754: 90 12 00 12 or %o0, %l2, %o0 2014758: 91 2a 20 10 sll %o0, 0x10, %o0 201475c: 80 a2 20 00 cmp %o0, 0 2014760: 02 80 00 8a be 2014988 2014764: f6 26 20 2c st %i3, [ %i0 + 0x2c ] vol->fat_length = FAT_GET_BR_SECTORS_PER_FAT(boot_rec); 2014768: 91 32 20 10 srl %o0, 0x10, %o0 201476c: 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 + 2014770: 92 0f 60 ff and %i5, 0xff, %o1 2014774: 7f ff b7 86 call 200258c <.umul> 2014778: a9 2d 20 10 sll %l4, 0x10, %l4 201477c: a9 35 20 10 srl %l4, 0x10, %l4 2014780: 90 02 00 14 add %o0, %l4, %o0 2014784: 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; 2014788: d0 26 20 20 st %o0, [ %i0 + 0x20 ] if ( (FAT_GET_BR_TOTAL_SECTORS_NUM16(boot_rec)) != 0) 201478c: 90 0c 60 ff and %l1, 0xff, %o0 2014790: a0 0c 20 ff and %l0, 0xff, %l0 2014794: 91 2a 20 08 sll %o0, 8, %o0 2014798: 90 12 00 10 or %o0, %l0, %o0 201479c: 91 2a 20 10 sll %o0, 0x10, %o0 20147a0: 80 a2 20 00 cmp %o0, 0 20147a4: 02 80 00 e3 be 2014b30 20147a8: f4 26 20 34 st %i2, [ %i0 + 0x34 ] vol->tot_secs = FAT_GET_BR_TOTAL_SECTORS_NUM16(boot_rec); 20147ac: 91 32 20 10 srl %o0, 0x10, %o0 20147b0: 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; 20147b4: 90 22 00 1a sub %o0, %i2, %o0 20147b8: 7f ff b7 af call 2002674 <.udiv> 20147bc: 92 10 00 1c mov %i4, %o1 /* determine FAT type at least */ if ( vol->data_cls < FAT_FAT12_MAX_CLN) 20147c0: 80 a2 2f f4 cmp %o0, 0xff4 20147c4: 18 80 00 7d bgu 20149b8 20147c8: d0 26 20 38 st %o0, [ %i0 + 0x38 ] { vol->type = FAT_FAT12; 20147cc: 84 10 20 01 mov 1, %g2 20147d0: c4 2e 20 0e stb %g2, [ %i0 + 0xe ] vol->mask = FAT_FAT12_MASK; 20147d4: 84 10 2f ff mov 0xfff, %g2 20147d8: c4 26 20 10 st %g2, [ %i0 + 0x10 ] vol->eoc_val = FAT_FAT12_EOC; 20147dc: 84 10 2f f8 mov 0xff8, %g2 20147e0: 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; 20147e4: 84 10 3f ff mov -1, %g2 } } } else { vol->rdir_cl = 0; 20147e8: c0 26 20 3c clr [ %i0 + 0x3c ] vol->mirror = 0; 20147ec: c0 2e 20 54 clrb [ %i0 + 0x54 ] vol->afat = 0; 20147f0: c0 2e 20 5c clrb [ %i0 + 0x5c ] vol->free_cls = FAT_UNDEFINED_VALUE; 20147f4: c4 26 20 44 st %g2, [ %i0 + 0x44 ] vol->next_cl = FAT_UNDEFINED_VALUE; 20147f8: 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); 20147fc: 7f ff fd 73 call 2013dc8 2014800: 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; 2014804: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 2014808: 7f ff b7 61 call 200258c <.umul> 201480c: d0 0e 20 5c ldub [ %i0 + 0x5c ], %o0 2014810: 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)); 2014814: 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; 2014818: 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)); 201481c: 90 10 20 02 mov 2, %o0 2014820: 7f ff c2 3e call 2005118 2014824: c4 26 20 58 st %g2, [ %i0 + 0x58 ] if ( fs_info->vhash == NULL ) 2014828: 80 a2 20 00 cmp %o0, 0 201482c: 02 80 01 03 be 2014c38 <== NEVER TAKEN 2014830: 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 ); 2014834: 88 02 20 04 add %o0, 4, %g4 2014838: 84 02 20 0c add %o0, 0xc, %g2 201483c: 86 02 20 10 add %o0, 0x10, %g3 head->next = tail; 2014840: c8 22 00 00 st %g4, [ %o0 ] head->previous = NULL; 2014844: c0 22 20 04 clr [ %o0 + 4 ] tail->previous = head; 2014848: 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; 201484c: c6 22 20 0c st %g3, [ %o0 + 0xc ] head->previous = NULL; 2014850: c0 22 20 10 clr [ %o0 + 0x10 ] tail->previous = head; 2014854: 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)); 2014858: 92 10 20 0c mov 0xc, %o1 201485c: 7f ff c2 2f call 2005118 2014860: 90 10 20 02 mov 2, %o0 if ( fs_info->rhash == NULL ) 2014864: 80 a2 20 00 cmp %o0, 0 2014868: 02 80 01 0c be 2014c98 <== NEVER TAKEN 201486c: 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; 2014870: c4 0e 20 03 ldub [ %i0 + 3 ], %g2 2014874: 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 ); 2014878: 86 02 20 0c add %o0, 0xc, %g3 head->next = tail; head->previous = NULL; 201487c: c0 22 20 04 clr [ %o0 + 4 ] tail->previous = head; 2014880: 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; 2014884: c0 22 20 10 clr [ %o0 + 0x10 ] tail->previous = head; 2014888: 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 ); 201488c: 88 02 20 10 add %o0, 0x10, %g4 2014890: ba 02 20 04 add %o0, 4, %i5 head->next = tail; 2014894: c8 22 20 0c st %g4, [ %o0 + 0xc ] 2014898: fa 22 00 00 st %i5, [ %o0 ] 201489c: 85 2f 00 02 sll %i4, %g2, %g2 20148a0: 85 28 a0 04 sll %g2, 4, %g2 20148a4: 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; 20148a8: 84 10 21 00 mov 0x100, %g2 fs_info->uino_base = (vol->tot_secs << vol->sec_mul) << 4; fs_info->index = 0; 20148ac: 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; 20148b0: 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)); 20148b4: 90 10 21 00 mov 0x100, %o0 20148b8: 7f ff c2 18 call 2005118 20148bc: 92 10 20 01 mov 1, %o1 if ( fs_info->uino == NULL ) 20148c0: 80 a2 20 00 cmp %o0, 0 20148c4: 02 80 00 d0 be 2014c04 <== NEVER TAKEN 20148c8: 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)); 20148cc: d0 16 00 00 lduh [ %i0 ], %o0 20148d0: 7f ff c2 12 call 2005118 20148d4: 92 10 20 01 mov 1, %o1 if (fs_info->sec_buf == NULL) 20148d8: 80 a2 20 00 cmp %o0, 0 20148dc: 02 80 00 e7 be 2014c78 <== NEVER TAKEN 20148e0: 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; 20148e4: c4 0e 20 04 ldub [ %i0 + 4 ], %g2 20148e8: c6 06 20 34 ld [ %i0 + 0x34 ], %g3 20148ec: 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) 20148f0: 80 88 80 03 btst %g2, %g3 20148f4: 12 80 00 17 bne 2014950 <== NEVER TAKEN 20148f8: 01 00 00 00 nop && (FAT_FAT32 == vol->type || is_cluster_aligned(vol, vol->rdir_loc))) 20148fc: c6 0e 20 0e ldub [ %i0 + 0xe ], %g3 2014900: 80 a0 e0 04 cmp %g3, 4 2014904: 22 80 00 07 be,a 2014920 2014908: 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; 201490c: 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))) 2014910: 80 88 80 03 btst %g2, %g3 2014914: 12 80 00 0f bne 2014950 <== NEVER TAKEN 2014918: 01 00 00 00 nop { sc = rtems_bdbuf_set_block_size (vol->dd, vol->bpc, true); 201491c: d0 06 20 64 ld [ %i0 + 0x64 ], %o0 2014920: d2 16 20 06 lduh [ %i0 + 6 ], %o1 2014924: 7f ff f6 83 call 2012330 2014928: 94 10 20 01 mov 1, %o2 if (sc == RTEMS_SUCCESSFUL) 201492c: 80 a2 20 00 cmp %o0, 0 2014930: 12 80 00 08 bne 2014950 <== NEVER TAKEN 2014934: 01 00 00 00 nop { vol->bytes_per_block = vol->bpc; 2014938: c8 16 20 06 lduh [ %i0 + 6 ], %g4 vol->bytes_per_block_log2 = vol->bpc_log2; 201493c: c6 0e 20 08 ldub [ %i0 + 8 ], %g3 vol->sectors_per_block = vol->spc; 2014940: 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; 2014944: c8 36 20 0a sth %g4, [ %i0 + 0xa ] vol->bytes_per_block_log2 = vol->bpc_log2; 2014948: c6 2e 20 0c stb %g3, [ %i0 + 0xc ] vol->sectors_per_block = vol->spc; 201494c: c4 2e 20 09 stb %g2, [ %i0 + 9 ] } } return RC_OK; 2014950: 81 c7 e0 08 ret 2014954: 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) && 2014958: 80 a0 a2 00 cmp %g2, 0x200 201495c: 22 bf ff 26 be,a 20145f4 <== ALWAYS TAKEN 2014960: 85 32 60 19 srl %o1, 0x19, %g2 (vol->bps != 1024) && 2014964: 80 a0 a8 00 cmp %g2, 0x800 <== NOT EXECUTED 2014968: 22 bf ff 26 be,a 2014600 <== NOT EXECUTED 201496c: 85 32 60 19 srl %o1, 0x19, %g2 <== NOT EXECUTED (vol->bps != 2048) && 2014970: 09 00 00 04 sethi %hi(0x1000), %g4 <== NOT EXECUTED 2014974: 80 a0 80 04 cmp %g2, %g4 <== NOT EXECUTED 2014978: 12 80 00 82 bne 2014b80 <== NOT EXECUTED 201497c: 85 32 60 19 srl %o1, 0x19, %g2 <== NOT EXECUTED 2014980: 10 bf ff 23 b 201460c <== NOT EXECUTED 2014984: 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); 2014988: c4 0f bf 96 ldub [ %fp + -106 ], %g2 201498c: d0 0f bf 97 ldub [ %fp + -105 ], %o0 2014990: c2 0f bf 9f ldub [ %fp + -97 ], %g1 2014994: 85 28 a0 10 sll %g2, 0x10, %g2 2014998: 91 2a 20 08 sll %o0, 8, %o0 201499c: ae 0d e0 ff and %l7, 0xff, %l7 20149a0: 90 12 00 02 or %o0, %g2, %o0 20149a4: 85 28 60 18 sll %g1, 0x18, %g2 20149a8: 90 12 00 17 or %o0, %l7, %o0 20149ac: 90 12 00 02 or %o0, %g2, %o0 20149b0: 10 bf ff 70 b 2014770 20149b4: 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) 20149b8: 05 00 00 3f sethi %hi(0xfc00), %g2 20149bc: 86 10 a3 f4 or %g2, 0x3f4, %g3 ! fff4 20149c0: 80 a2 00 03 cmp %o0, %g3 20149c4: 08 80 00 67 bleu 2014b60 20149c8: 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; 20149cc: c2 0f bf 87 ldub [ %fp + -121 ], %g1 } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 20149d0: f8 0f bf 7f ldub [ %fp + -129 ], %i4 vol->mirror = FAT_GET_BR_EXT_FLAGS(boot_rec) & FAT_BR_EXT_FLAGS_MIRROR; 20149d4: 84 08 7f 80 and %g1, -128, %g2 } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 20149d8: f6 0f bf 90 ldub [ %fp + -112 ], %i3 20149dc: c8 0f bf 7e ldub [ %fp + -130 ], %g4 20149e0: c2 0f bf 77 ldub [ %fp + -137 ], %g1 20149e4: b9 2f 20 08 sll %i4, 8, %i4 vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; vol->mask = FAT_FAT32_MASK; 20149e8: 07 03 ff ff sethi %hi(0xffffc00), %g3 } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 20149ec: 89 29 20 10 sll %g4, 0x10, %g4 vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; vol->mask = FAT_FAT32_MASK; 20149f0: ba 10 e3 ff or %g3, 0x3ff, %i5 } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 20149f4: 88 17 00 04 or %i4, %g4, %g4 } else { vol->type = FAT_FAT32; vol->mask = FAT_FAT32_MASK; vol->eoc_val = FAT_FAT32_EOC; 20149f8: 86 10 e3 f8 or %g3, 0x3f8, %g3 } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 20149fc: 88 11 00 1b or %g4, %i3, %g4 2014a00: b9 28 60 18 sll %g1, 0x18, %i4 vol->mask = FAT_FAT16_MASK; vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; 2014a04: b6 10 20 04 mov 4, %i3 } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 2014a08: 88 11 00 1c or %g4, %i4, %g4 vol->mask = FAT_FAT16_MASK; vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; 2014a0c: f6 2e 20 0e stb %i3, [ %i0 + 0xe ] vol->mask = FAT_FAT32_MASK; 2014a10: fa 26 20 10 st %i5, [ %i0 + 0x10 ] vol->eoc_val = FAT_FAT32_EOC; 2014a14: c6 26 20 14 st %g3, [ %i0 + 0x14 ] } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 2014a18: 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) 2014a1c: 80 88 a0 80 btst 0x80, %g2 2014a20: 02 80 00 6a be 2014bc8 <== ALWAYS TAKEN 2014a24: c4 2e 20 54 stb %g2, [ %i0 + 0x54 ] vol->afat = FAT_GET_BR_EXT_FLAGS(boot_rec) & FAT_BR_EXT_FLAGS_FAT_NUM; 2014a28: c2 0f bf 87 ldub [ %fp + -121 ], %g1 <== NOT EXECUTED 2014a2c: 84 08 60 0f and %g1, 0xf, %g2 <== NOT EXECUTED 2014a30: 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); 2014a34: c4 0f bf 91 ldub [ %fp + -111 ], %g2 2014a38: c6 0f bf 92 ldub [ %fp + -110 ], %g3 2014a3c: 85 28 a0 08 sll %g2, 8, %g2 2014a40: 84 10 80 03 or %g2, %g3, %g2 2014a44: c4 36 20 40 sth %g2, [ %i0 + 0x40 ] if( vol->info_sec == 0 ) 2014a48: 85 28 a0 10 sll %g2, 0x10, %g2 2014a4c: 93 30 a0 10 srl %g2, 0x10, %o1 2014a50: 80 a2 60 00 cmp %o1, 0 2014a54: 02 80 00 4b be 2014b80 <== NEVER TAKEN 2014a58: 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, 2014a5c: 94 10 20 00 clr %o2 2014a60: 96 10 20 04 mov 4, %o3 2014a64: 7f ff fd 7e call 201405c <_fat_block_read> 2014a68: 98 07 bf a8 add %fp, -88, %o4 FAT_FSI_LEADSIG_SIZE, fs_info_sector); if ( ret < 0 ) 2014a6c: 80 a2 20 00 cmp %o0, 0 2014a70: 06 80 00 7d bl 2014c64 <== NEVER TAKEN 2014a74: c4 0f bf ab ldub [ %fp + -85 ], %g2 { close(vol->fd); return -1; } if (FAT_GET_FSINFO_LEAD_SIGNATURE(fs_info_sector) != 2014a78: c6 0f bf a9 ldub [ %fp + -87 ], %g3 2014a7c: fa 0f bf aa ldub [ %fp + -86 ], %i5 2014a80: c8 0f bf a8 ldub [ %fp + -88 ], %g4 2014a84: 85 28 a0 18 sll %g2, 0x18, %g2 2014a88: 87 28 e0 08 sll %g3, 8, %g3 2014a8c: bb 2f 60 10 sll %i5, 0x10, %i5 2014a90: 86 10 c0 1d or %g3, %i5, %g3 2014a94: 86 10 c0 04 or %g3, %g4, %g3 2014a98: 86 10 c0 02 or %g3, %g2, %g3 2014a9c: 05 10 58 54 sethi %hi(0x41615000), %g2 2014aa0: 84 10 a2 52 or %g2, 0x252, %g2 ! 41615252 2014aa4: 80 a0 c0 02 cmp %g3, %g2 2014aa8: 12 80 00 34 bne 2014b78 <== NEVER TAKEN 2014aac: 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, 2014ab0: d2 16 20 40 lduh [ %i0 + 0x40 ], %o1 2014ab4: 94 10 21 e4 mov 0x1e4, %o2 2014ab8: 96 10 20 0c mov 0xc, %o3 2014abc: 7f ff fd 68 call 201405c <_fat_block_read> 2014ac0: 98 07 bf a8 add %fp, -88, %o4 FAT_USEFUL_INFO_SIZE, fs_info_sector); if ( ret < 0 ) 2014ac4: 80 a2 20 00 cmp %o0, 0 2014ac8: 06 80 00 65 bl 2014c5c <== NEVER TAKEN 2014acc: 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); 2014ad0: f2 0f bf ae ldub [ %fp + -82 ], %i1 2014ad4: f4 0f bf ac ldub [ %fp + -84 ], %i2 2014ad8: 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); 2014adc: f8 0f bf b1 ldub [ %fp + -79 ], %i4 2014ae0: c4 0f bf b2 ldub [ %fp + -78 ], %g2 2014ae4: fa 0f bf b0 ldub [ %fp + -80 ], %i5 2014ae8: 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); 2014aec: 87 28 e0 08 sll %g3, 8, %g3 2014af0: b3 2e 60 10 sll %i1, 0x10, %i1 2014af4: b7 2e e0 18 sll %i3, 0x18, %i3 2014af8: 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); 2014afc: 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); 2014b00: 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); 2014b04: 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); 2014b08: 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); 2014b0c: 84 17 00 02 or %i4, %g2, %g2 2014b10: 89 29 20 18 sll %g4, 0x18, %g4 2014b14: 84 10 80 1d or %g2, %i5, %g2 _fat_block_release(fs_info); close(vol->fd); return -1; } vol->free_cls_in_fs_info = 2014b18: 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); 2014b1c: 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; 2014b20: c6 26 20 44 st %g3, [ %i0 + 0x44 ] vol->next_cl_in_fs_info = 2014b24: 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; 2014b28: 10 bf ff 35 b 20147fc 2014b2c: 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); 2014b30: c4 0f bf 94 ldub [ %fp + -108 ], %g2 2014b34: d0 0f bf 95 ldub [ %fp + -107 ], %o0 2014b38: 85 28 a0 10 sll %g2, 0x10, %g2 2014b3c: 91 2a 20 08 sll %o0, 8, %o0 2014b40: c2 0f bf 93 ldub [ %fp + -109 ], %g1 2014b44: 90 12 00 02 or %o0, %g2, %o0 2014b48: c4 0f bf 8f ldub [ %fp + -113 ], %g2 2014b4c: 90 12 00 01 or %o0, %g1, %o0 2014b50: ad 28 a0 18 sll %g2, 0x18, %l6 2014b54: 90 12 00 16 or %o0, %l6, %o0 2014b58: 10 bf ff 17 b 20147b4 2014b5c: d0 26 20 30 st %o0, [ %i0 + 0x30 ] } else { if ( vol->data_cls < FAT_FAT16_MAX_CLN) { vol->type = FAT_FAT16; 2014b60: 88 10 20 02 mov 2, %g4 vol->mask = FAT_FAT16_MASK; vol->eoc_val = FAT_FAT16_EOC; 2014b64: 84 10 a3 f8 or %g2, 0x3f8, %g2 } else { if ( vol->data_cls < FAT_FAT16_MAX_CLN) { vol->type = FAT_FAT16; 2014b68: c8 2e 20 0e stb %g4, [ %i0 + 0xe ] vol->mask = FAT_FAT16_MASK; 2014b6c: c6 26 20 10 st %g3, [ %i0 + 0x10 ] vol->eoc_val = FAT_FAT16_EOC; 2014b70: 10 bf ff 1d b 20147e4 2014b74: 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); 2014b78: 7f ff fc 94 call 2013dc8 <== NOT EXECUTED 2014b7c: 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); 2014b80: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED 2014b84: 7f ff c1 7a call 200516c <== NOT EXECUTED 2014b88: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EINVAL ); 2014b8c: 40 00 21 50 call 201d0cc <__errno> <== NOT EXECUTED 2014b90: 01 00 00 00 nop <== NOT EXECUTED 2014b94: 82 10 20 16 mov 0x16, %g1 ! 16 <== NOT EXECUTED 2014b98: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2014b9c: 81 c7 e0 08 ret <== NOT EXECUTED 2014ba0: 81 e8 00 00 restore <== NOT EXECUTED } rc = fstat(vol->fd, &stat_buf); if (rc != 0) { close(vol->fd); 2014ba4: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED 2014ba8: 7f ff c1 71 call 200516c <== NOT EXECUTED 2014bac: 01 00 00 00 nop <== NOT EXECUTED rtems_set_errno_and_return_minus_one(ENXIO); 2014bb0: 40 00 21 47 call 201d0cc <__errno> <== NOT EXECUTED 2014bb4: b0 10 3f ff mov -1, %i0 ! ffffffff <== NOT EXECUTED 2014bb8: 82 10 20 06 mov 6, %g1 <== NOT EXECUTED 2014bbc: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2014bc0: 81 c7 e0 08 ret <== NOT EXECUTED 2014bc4: 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; 2014bc8: 10 bf ff 9b b 2014a34 2014bcc: 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; 2014bd0: 10 bf fe a3 b 201465c <== NOT EXECUTED 2014bd4: 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; 2014bd8: 10 bf fe b4 b 20146a8 2014bdc: 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); 2014be0: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED 2014be4: 7f ff c1 62 call 200516c <== NOT EXECUTED 2014be8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EIO ); 2014bec: 40 00 21 38 call 201d0cc <__errno> <== NOT EXECUTED 2014bf0: 01 00 00 00 nop <== NOT EXECUTED 2014bf4: 82 10 20 05 mov 5, %g1 ! 5 <== NOT EXECUTED 2014bf8: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2014bfc: 81 c7 e0 08 ret <== NOT EXECUTED 2014c00: 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); 2014c04: 7f ff c1 5a call 200516c <== NOT EXECUTED 2014c08: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED free(fs_info->vhash); 2014c0c: 7f ff c2 14 call 200545c <== NOT EXECUTED 2014c10: d0 06 20 6c ld [ %i0 + 0x6c ], %o0 <== NOT EXECUTED free(fs_info->rhash); 2014c14: 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); 2014c18: 7f ff c2 11 call 200545c <== NOT EXECUTED 2014c1c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 2014c20: 40 00 21 2b call 201d0cc <__errno> <== NOT EXECUTED 2014c24: 01 00 00 00 nop <== NOT EXECUTED 2014c28: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED 2014c2c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2014c30: 81 c7 e0 08 ret <== NOT EXECUTED 2014c34: 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); 2014c38: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED 2014c3c: 7f ff c1 4c call 200516c <== NOT EXECUTED 2014c40: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 2014c44: 40 00 21 22 call 201d0cc <__errno> <== NOT EXECUTED 2014c48: 01 00 00 00 nop <== NOT EXECUTED 2014c4c: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED 2014c50: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2014c54: 81 c7 e0 08 ret <== NOT EXECUTED 2014c58: 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); 2014c5c: 7f ff fc 5b call 2013dc8 <== NOT EXECUTED 2014c60: 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); 2014c64: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED 2014c68: 7f ff c1 41 call 200516c <== NOT EXECUTED 2014c6c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2014c70: 81 c7 e0 08 ret <== NOT EXECUTED 2014c74: 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); 2014c78: 7f ff c1 3d call 200516c <== NOT EXECUTED 2014c7c: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED free(fs_info->vhash); 2014c80: 7f ff c1 f7 call 200545c <== NOT EXECUTED 2014c84: d0 06 20 6c ld [ %i0 + 0x6c ], %o0 <== NOT EXECUTED free(fs_info->rhash); 2014c88: 7f ff c1 f5 call 200545c <== NOT EXECUTED 2014c8c: d0 06 20 70 ld [ %i0 + 0x70 ], %o0 <== NOT EXECUTED free(fs_info->uino); 2014c90: 10 bf ff e2 b 2014c18 <== NOT EXECUTED 2014c94: 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); 2014c98: 7f ff c1 35 call 200516c <== NOT EXECUTED 2014c9c: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 <== NOT EXECUTED free(fs_info->vhash); 2014ca0: 10 bf ff de b 2014c18 <== NOT EXECUTED 2014ca4: d0 06 20 6c ld [ %i0 + 0x6c ], %o0 <== NOT EXECUTED =============================================================================== 0201b3a8 : uint32_t count, uint32_t *cls_added, uint32_t *last_cl, bool zero_fill ) { 201b3a8: 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; 201b3ac: e6 06 20 38 ld [ %i0 + 0x38 ], %l3 bool zero_fill ) { int rc = RC_OK; uint32_t cl4find = 2; uint32_t next_cln = 0; 201b3b0: 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; 201b3b4: c0 26 c0 00 clr [ %i3 ] if (count == 0) 201b3b8: 80 a6 a0 00 cmp %i2, 0 201b3bc: 02 80 00 49 be 201b4e0 <== NEVER TAKEN 201b3c0: a4 10 20 00 clr %l2 return rc; if (fs_info->vol.next_cl != FAT_UNDEFINED_VALUE) 201b3c4: e0 06 20 4c ld [ %i0 + 0x4c ], %l0 201b3c8: 80 a4 3f ff cmp %l0, -1 201b3cc: 22 80 00 02 be,a 201b3d4 201b3d0: 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; 201b3d4: 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) 201b3d8: 80 a4 e0 02 cmp %l3, 2 201b3dc: 08 80 00 4e bleu 201b514 <== NEVER TAKEN 201b3e0: a2 10 20 02 mov 2, %l1 201b3e4: 10 80 00 1a b 201b44c 201b3e8: 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); 201b3ec: 90 10 00 18 mov %i0, %o0 201b3f0: 92 10 00 10 mov %l0, %o1 201b3f4: 7f ff ff 03 call 201b000 201b3f8: 94 10 3f ff mov -1, %o2 if ( rc != RC_OK ) 201b3fc: 80 a2 20 00 cmp %o0, 0 201b400: 32 80 00 38 bne,a 201b4e0 <== NEVER TAKEN 201b404: 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) 201b408: 80 a7 60 00 cmp %i5, 0 201b40c: 32 80 00 37 bne,a 201b4e8 201b410: d6 16 20 06 lduh [ %i0 + 6 ], %o3 goto cleanup; } } save_cln = cl4find; (*cls_added)++; 201b414: c2 06 c0 00 ld [ %i3 ], %g1 201b418: 82 00 60 01 inc %g1 /* have we satisfied request ? */ if (*cls_added == count) 201b41c: 80 a6 80 01 cmp %i2, %g1 201b420: 02 80 00 53 be 201b56c 201b424: c2 26 c0 00 st %g1, [ %i3 ] 201b428: a8 10 00 10 mov %l0, %l4 fat_buf_release(fs_info); return rc; } } i++; cl4find++; 201b42c: a0 04 20 01 inc %l0 if (cl4find >= data_cls_val) 201b430: 80 a4 c0 10 cmp %l3, %l0 201b434: 18 80 00 03 bgu 201b440 <== ALWAYS TAKEN 201b438: a2 04 60 01 inc %l1 cl4find = 2; 201b43c: 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) 201b440: 80 a4 c0 11 cmp %l3, %l1 201b444: 22 80 00 36 be,a 201b51c <== NEVER TAKEN 201b448: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 <== NOT EXECUTED { rc = fat_get_fat_cluster(fs_info, cl4find, &next_cln); 201b44c: 90 10 00 18 mov %i0, %o0 201b450: 92 10 00 10 mov %l0, %o1 201b454: 7f ff fe 67 call 201adf0 201b458: 94 07 bf fc add %fp, -4, %o2 if ( rc != RC_OK ) 201b45c: a4 92 20 00 orcc %o0, 0, %l2 201b460: 12 80 00 3b bne 201b54c <== NEVER TAKEN 201b464: 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) 201b468: 80 a0 60 00 cmp %g1, 0 201b46c: 32 bf ff f1 bne,a 201b430 201b470: 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) 201b474: c2 06 c0 00 ld [ %i3 ], %g1 201b478: 80 a0 60 00 cmp %g1, 0 201b47c: 22 bf ff dc be,a 201b3ec 201b480: 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); 201b484: 90 10 00 18 mov %i0, %o0 201b488: 92 10 00 10 mov %l0, %o1 201b48c: 7f ff fe dd call 201b000 201b490: 94 10 3f ff mov -1, %o2 if ( rc != RC_OK ) 201b494: 82 92 20 00 orcc %o0, 0, %g1 201b498: 12 80 00 40 bne 201b598 <== NEVER TAKEN 201b49c: 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); 201b4a0: 90 10 00 18 mov %i0, %o0 201b4a4: 7f ff fe d7 call 201b000 201b4a8: 94 10 00 10 mov %l0, %o2 if ( rc != RC_OK ) 201b4ac: a8 92 20 00 orcc %o0, 0, %l4 201b4b0: 02 bf ff d7 be 201b40c <== ALWAYS TAKEN 201b4b4: 80 a7 60 00 cmp %i5, 0 return RC_OK; cleanup: /* cleanup activity */ fat_free_fat_clusters_chain(fs_info, (*chain)); 201b4b8: d2 06 40 00 ld [ %i1 ], %o1 <== NOT EXECUTED 201b4bc: 7f ff ff 83 call 201b2c8 <== NOT EXECUTED 201b4c0: 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); 201b4c4: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 201b4c8: 92 10 00 10 mov %l0, %o1 <== NOT EXECUTED 201b4cc: 7f ff fe cd call 201b000 <== NOT EXECUTED 201b4d0: 94 10 20 00 clr %o2 <== NOT EXECUTED fat_buf_release(fs_info); return rc; 201b4d4: 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); 201b4d8: 7f ff e2 3c call 2013dc8 <== NOT EXECUTED 201b4dc: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED return rc; } 201b4e0: 81 c7 e0 08 ret 201b4e4: 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); 201b4e8: 90 10 00 18 mov %i0, %o0 201b4ec: 92 10 00 10 mov %l0, %o1 201b4f0: 94 10 20 00 clr %o2 201b4f4: 7f ff e3 26 call 201418c 201b4f8: 98 10 20 00 clr %o4 if (fs_info->vol.bpc != bytes_written) 201b4fc: c2 16 20 06 lduh [ %i0 + 6 ], %g1 201b500: 80 a0 40 08 cmp %g1, %o0 201b504: 22 bf ff c5 be,a 201b418 <== ALWAYS TAKEN 201b508: c2 06 c0 00 ld [ %i3 ], %g1 { rc = -1; 201b50c: 10 bf ff eb b 201b4b8 <== NOT EXECUTED 201b510: 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) 201b514: 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) 201b518: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 <== NOT EXECUTED 201b51c: 80 a0 7f ff cmp %g1, -1 <== NOT EXECUTED 201b520: 02 80 00 05 be 201b534 <== NOT EXECUTED 201b524: e8 26 20 4c st %l4, [ %i0 + 0x4c ] <== NOT EXECUTED fs_info->vol.free_cls -= (*cls_added); 201b528: c4 06 c0 00 ld [ %i3 ], %g2 <== NOT EXECUTED 201b52c: 82 20 40 02 sub %g1, %g2, %g1 <== NOT EXECUTED 201b530: c2 26 20 44 st %g1, [ %i0 + 0x44 ] <== NOT EXECUTED *last_cl = save_cln; 201b534: e8 27 00 00 st %l4, [ %i4 ] <== NOT EXECUTED fat_buf_release(fs_info); 201b538: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 201b53c: 7f ff e2 23 call 2013dc8 <== NOT EXECUTED 201b540: 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; } 201b544: 81 c7 e0 08 ret <== NOT EXECUTED 201b548: 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) 201b54c: c2 06 c0 00 ld [ %i3 ], %g1 <== NOT EXECUTED 201b550: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 201b554: 02 bf ff e3 be 201b4e0 <== NOT EXECUTED 201b558: 01 00 00 00 nop <== NOT EXECUTED fat_free_fat_clusters_chain(fs_info, (*chain)); 201b55c: d2 06 40 00 ld [ %i1 ], %o1 <== NOT EXECUTED 201b560: 7f ff ff 5a call 201b2c8 <== NOT EXECUTED 201b564: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 201b568: 30 bf ff de b,a 201b4e0 <== 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) 201b56c: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 201b570: 80 a0 7f ff cmp %g1, -1 201b574: 02 80 00 05 be 201b588 <== ALWAYS TAKEN 201b578: e0 26 20 4c st %l0, [ %i0 + 0x4c ] fs_info->vol.free_cls -= (*cls_added); 201b57c: c4 06 c0 00 ld [ %i3 ], %g2 <== NOT EXECUTED 201b580: 82 20 40 02 sub %g1, %g2, %g1 <== NOT EXECUTED 201b584: c2 26 20 44 st %g1, [ %i0 + 0x44 ] <== NOT EXECUTED *last_cl = save_cln; 201b588: e0 27 00 00 st %l0, [ %i4 ] fat_buf_release(fs_info); 201b58c: 7f ff e2 0f call 2013dc8 201b590: 90 10 00 18 mov %i0, %o0 201b594: 30 bf ff d3 b,a 201b4e0 /* 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)); 201b598: d2 06 40 00 ld [ %i1 ], %o1 <== NOT EXECUTED 201b59c: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 201b5a0: 7f ff ff 4a call 201b2c8 <== NOT EXECUTED 201b5a4: a4 10 00 01 mov %g1, %l2 <== NOT EXECUTED 201b5a8: 30 bf ff ce b,a 201b4e0 <== NOT EXECUTED =============================================================================== 020140dc : fat_fs_info_t *fs_info, uint32_t start, uint32_t offset, uint32_t count, const void *buff) { 20140dc: 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) 20140e0: 80 a6 e0 00 cmp %i3, 0 20140e4: 02 80 00 28 be 2014184 <== NEVER TAKEN 20140e8: a0 10 20 00 clr %l0 } static inline void fat_buf_mark_modified(fat_fs_info_t *fs_info) { fs_info->c.modified = true; 20140ec: 10 80 00 12 b 2014134 20140f0: 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); 20140f4: 96 07 bf fc add %fp, -4, %o3 20140f8: 7f ff ff ab call 2013fa4 20140fc: 90 10 00 18 mov %i0, %o0 if (rc != RC_OK) return -1; memcpy((sec_buf + ofs), (buff + cmpltd), c); 2014100: 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) 2014104: 80 a2 20 00 cmp %o0, 0 2014108: 12 80 00 1e bne 2014180 <== NEVER TAKEN 201410c: 94 10 00 1d mov %i5, %o2 return -1; memcpy((sec_buf + ofs), (buff + cmpltd), c); 2014110: d0 07 bf fc ld [ %fp + -4 ], %o0 fat_buf_mark_modified(fs_info); count -= c; cmpltd +=c; 2014114: 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); 2014118: 40 00 26 ac call 201dbc8 201411c: 90 02 00 1a add %o0, %i2, %o0 2014120: e2 2e 20 88 stb %l1, [ %i0 + 0x88 ] fat_buf_mark_modified(fs_info); count -= c; cmpltd +=c; sec_num++; 2014124: 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) 2014128: b6 a6 c0 1d subcc %i3, %i5, %i3 201412c: 02 80 00 16 be 2014184 <== ALWAYS TAKEN 2014130: b4 10 20 00 clr %i2 { c = MIN(count, (fs_info->vol.bps - ofs)); 2014134: fa 16 00 00 lduh [ %i0 ], %i5 2014138: ba 27 40 1a sub %i5, %i2, %i5 201413c: 80 a7 40 1b cmp %i5, %i3 2014140: 08 80 00 03 bleu 201414c 2014144: 92 10 00 19 mov %i1, %o1 2014148: ba 10 00 1b mov %i3, %i5 if (c == fs_info->vol.bytes_per_block) 201414c: c2 16 20 0a lduh [ %i0 + 0xa ], %g1 2014150: 80 a0 40 1d cmp %g1, %i5 2014154: 12 bf ff e8 bne 20140f4 <== ALWAYS TAKEN 2014158: 94 10 20 01 mov 1, %o2 rc = fat_buf_access(fs_info, sec_num, FAT_OP_TYPE_GET, &sec_buf); 201415c: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED 2014160: 94 10 20 02 mov 2, %o2 <== NOT EXECUTED 2014164: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 2014168: 7f ff ff 8f call 2013fa4 <== NOT EXECUTED 201416c: 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); 2014170: 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) 2014174: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2014178: 02 bf ff e6 be 2014110 <== NOT EXECUTED 201417c: 94 10 00 1d mov %i5, %o2 <== NOT EXECUTED return -1; 2014180: a0 10 3f ff mov -1, %l0 <== NOT EXECUTED cmpltd +=c; sec_num++; ofs = 0; } return cmpltd; } 2014184: 81 c7 e0 08 ret 2014188: 91 e8 00 10 restore %g0, %l0, %o0 =============================================================================== 0201b000 : fat_set_fat_cluster( fat_fs_info_t *fs_info, uint32_t cln, uint32_t in_val ) { 201b000: 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; 201b004: c0 27 bf fc clr [ %fp + -4 ] /* sanity check */ if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) 201b008: 80 a6 60 01 cmp %i1, 1 201b00c: 08 80 00 26 bleu 201b0a4 <== NEVER TAKEN 201b010: ba 10 00 18 mov %i0, %i5 201b014: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 201b018: 82 00 60 01 inc %g1 201b01c: 80 a6 40 01 cmp %i1, %g1 201b020: 18 80 00 21 bgu 201b0a4 <== NEVER TAKEN 201b024: 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) + 201b028: c2 0e 20 0e ldub [ %i0 + 0xe ], %g1 201b02c: 80 88 60 01 btst 1, %g1 201b030: 12 80 00 23 bne 201b0bc 201b034: e0 0e 20 02 ldub [ %i0 + 2 ], %l0 201b038: 82 08 60 02 and %g1, 2, %g1 201b03c: 80 88 60 ff btst 0xff, %g1 201b040: 02 80 00 25 be 201b0d4 201b044: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 201b048: b9 2e 60 01 sll %i1, 1, %i4 201b04c: a1 37 00 10 srl %i4, %l0, %l0 201b050: 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); 201b054: e2 17 40 00 lduh [ %i5 ], %l1 rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &sec_buf); 201b058: 90 10 00 1d mov %i5, %o0 201b05c: 92 10 00 10 mov %l0, %o1 201b060: 94 10 20 01 mov 1, %o2 201b064: 7f ff e3 d0 call 2013fa4 201b068: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 201b06c: b0 92 20 00 orcc %o0, 0, %i0 201b070: 12 80 00 11 bne 201b0b4 <== NEVER TAKEN 201b074: a3 2c 60 10 sll %l1, 0x10, %l1 return rc; switch ( fs_info->vol.type ) 201b078: f6 0f 60 0e ldub [ %i5 + 0xe ], %i3 201b07c: 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); 201b080: a3 34 60 10 srl %l1, 0x10, %l1 201b084: 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 ) 201b088: 02 80 00 17 be 201b0e4 201b08c: b8 0f 00 11 and %i4, %l1, %i4 201b090: 80 a6 e0 04 cmp %i3, 4 201b094: 02 80 00 3b be 201b180 201b098: 80 a6 e0 01 cmp %i3, 1 201b09c: 02 80 00 1f be 201b118 <== ALWAYS TAKEN 201b0a0: 80 8e 60 01 btst 1, %i1 fat_buf_mark_modified(fs_info); break; default: rtems_set_errno_and_return_minus_one(EIO); 201b0a4: 40 00 08 0a call 201d0cc <__errno> <== NOT EXECUTED 201b0a8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201b0ac: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 201b0b0: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED break; } return RC_OK; } 201b0b4: 81 c7 e0 08 ret <== NOT EXECUTED 201b0b8: 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) + 201b0bc: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 201b0c0: b9 36 60 01 srl %i1, 1, %i4 201b0c4: b8 07 00 19 add %i4, %i1, %i4 201b0c8: a1 37 00 10 srl %i4, %l0, %l0 201b0cc: 10 bf ff e2 b 201b054 201b0d0: a0 04 00 01 add %l0, %g1, %l0 201b0d4: b9 2e 60 02 sll %i1, 2, %i4 201b0d8: a1 37 00 10 srl %i4, %l0, %l0 201b0dc: 10 bf ff de b 201b054 201b0e0: a0 04 00 01 add %l0, %g1, %l0 } break; case FAT_FAT16: *((uint16_t *)(sec_buf + ofs)) = (uint16_t )(CT_LE_W(in_val)); 201b0e4: 83 2e a0 10 sll %i2, 0x10, %g1 201b0e8: 83 30 60 18 srl %g1, 0x18, %g1 break; } return RC_OK; } 201b0ec: 05 00 00 3f sethi %hi(0xfc00), %g2 201b0f0: 84 10 a3 ff or %g2, 0x3ff, %g2 ! ffff 201b0f4: b4 0e 80 02 and %i2, %g2, %i2 } break; case FAT_FAT16: *((uint16_t *)(sec_buf + ofs)) = (uint16_t )(CT_LE_W(in_val)); 201b0f8: b5 2e a0 08 sll %i2, 8, %i2 201b0fc: b4 16 80 01 or %i2, %g1, %i2 } } break; case FAT_FAT16: *((uint16_t *)(sec_buf + ofs)) = 201b100: c2 07 bf fc ld [ %fp + -4 ], %g1 201b104: 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; 201b108: 82 10 20 01 mov 1, %g1 201b10c: c2 2f 60 88 stb %g1, [ %i5 + 0x88 ] 201b110: 81 c7 e0 08 ret 201b114: 81 e8 00 00 restore return rc; switch ( fs_info->vol.type ) { case FAT_FAT12: if ( FAT_CLUSTER_IS_ODD(cln) ) 201b118: 02 80 00 30 be 201b1d8 201b11c: 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); 201b120: 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; 201b124: c6 08 40 1c ldub [ %g1 + %i4 ], %g3 201b128: 86 08 e0 0f and %g3, 0xf, %g3 201b12c: c6 28 40 1c stb %g3, [ %g1 + %i4 ] *(sec_buf + ofs) |= (uint8_t)(fat16_clv & 0x00F0); 201b130: c2 07 bf fc ld [ %fp + -4 ], %g1 201b134: c6 08 40 1c ldub [ %g1 + %i4 ], %g3 201b138: 84 10 c0 02 or %g3, %g2, %g2 201b13c: c4 28 40 1c stb %g2, [ %g1 + %i4 ] fat_buf_mark_modified(fs_info); if ( ofs == (fs_info->vol.bps - 1) ) 201b140: c2 17 40 00 lduh [ %i5 ], %g1 201b144: 82 00 7f ff add %g1, -1, %g1 201b148: 80 a0 40 1c cmp %g1, %i4 201b14c: 02 80 00 3a be 201b234 <== NEVER TAKEN 201b150: f6 2f 60 88 stb %i3, [ %i5 + 0x88 ] fat_buf_mark_modified(fs_info); } else { *(sec_buf + ofs + 1) &= 0x00; 201b154: c2 07 bf fc ld [ %fp + -4 ], %g1 201b158: b8 07 20 01 inc %i4 201b15c: c0 28 40 1c clrb [ %g1 + %i4 ] *(sec_buf + ofs + 1) |= (uint8_t )((fat16_clv & 0xFF00)>>8); 201b160: c2 07 bf fc ld [ %fp + -4 ], %g1 201b164: b5 2e a0 14 sll %i2, 0x14, %i2 201b168: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 201b16c: b5 36 a0 18 srl %i2, 0x18, %i2 201b170: 84 10 80 1a or %g2, %i2, %g2 201b174: c4 28 40 1c stb %g2, [ %g1 + %i4 ] 201b178: 81 c7 e0 08 ret 201b17c: 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); 201b180: 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)); 201b184: 03 3c 00 00 sethi %hi(0xf0000000), %g1 *((uint32_t *)(sec_buf + ofs)) &= CT_LE_L(0xF0000000); 201b188: 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)); 201b18c: 82 2e 80 01 andn %i2, %g1, %g1 uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 201b190: 89 30 60 18 srl %g1, 0x18, %g4 byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 201b194: b7 30 60 08 srl %g1, 8, %i3 *((uint32_t *)(sec_buf + ofs)) &= CT_LE_L(0xF0000000); 201b198: 86 08 e0 f0 and %g3, 0xf0, %g3 byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201b19c: 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; 201b1a0: b6 0e e0 ff and %i3, 0xff, %i3 byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201b1a4: b4 16 80 04 or %i2, %g4, %i2 201b1a8: b7 2e e0 10 sll %i3, 0x10, %i3 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 201b1ac: 89 30 60 10 srl %g1, 0x10, %g4 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201b1b0: 82 16 80 1b or %i2, %i3, %g1 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 201b1b4: 88 09 20 ff and %g4, 0xff, %g4 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201b1b8: 89 29 20 08 sll %g4, 8, %g4 201b1bc: 82 10 40 04 or %g1, %g4, %g1 *((uint32_t *)(sec_buf + ofs)) |= fat32_clv; 201b1c0: 82 10 40 03 or %g1, %g3, %g1 201b1c4: c2 20 80 1c st %g1, [ %g2 + %i4 ] 201b1c8: 82 10 20 01 mov 1, %g1 201b1cc: c2 2f 60 88 stb %g1, [ %i5 + 0x88 ] 201b1d0: 81 c7 e0 08 ret 201b1d4: 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; 201b1d8: b4 0e af ff and %i2, 0xfff, %i2 *(sec_buf + ofs) &= 0x00; 201b1dc: c0 28 40 1c clrb [ %g1 + %i4 ] *(sec_buf + ofs) |= (uint8_t)(fat16_clv & 0x00FF); 201b1e0: c2 07 bf fc ld [ %fp + -4 ], %g1 201b1e4: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 201b1e8: 84 10 80 1a or %g2, %i2, %g2 201b1ec: c4 28 40 1c stb %g2, [ %g1 + %i4 ] fat_buf_mark_modified(fs_info); if ( ofs == (fs_info->vol.bps - 1) ) 201b1f0: c2 17 40 00 lduh [ %i5 ], %g1 201b1f4: 82 00 7f ff add %g1, -1, %g1 201b1f8: 80 a0 40 1c cmp %g1, %i4 201b1fc: 02 80 00 20 be 201b27c <== NEVER TAKEN 201b200: f6 2f 60 88 stb %i3, [ %i5 + 0x88 ] fat_buf_mark_modified(fs_info); } else { *(sec_buf + ofs + 1) &= 0xF0; 201b204: c2 07 bf fc ld [ %fp + -4 ], %g1 201b208: b8 07 20 01 inc %i4 201b20c: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 *(sec_buf + ofs+1) |= (uint8_t)((fat16_clv & 0xFF00)>>8); 201b210: b5 36 a0 08 srl %i2, 8, %i2 fat_buf_mark_modified(fs_info); } else { *(sec_buf + ofs + 1) &= 0xF0; 201b214: 84 08 bf f0 and %g2, -16, %g2 201b218: c4 28 40 1c stb %g2, [ %g1 + %i4 ] *(sec_buf + ofs+1) |= (uint8_t)((fat16_clv & 0xFF00)>>8); 201b21c: c2 07 bf fc ld [ %fp + -4 ], %g1 201b220: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 201b224: b4 10 80 1a or %g2, %i2, %i2 201b228: f4 28 40 1c stb %i2, [ %g1 + %i4 ] 201b22c: 81 c7 e0 08 ret 201b230: 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, 201b234: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201b238: 92 04 20 01 add %l0, 1, %o1 <== NOT EXECUTED 201b23c: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 201b240: 7f ff e3 59 call 2013fa4 <== NOT EXECUTED 201b244: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED &sec_buf); if (rc != RC_OK) 201b248: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 201b24c: 12 bf ff 9a bne 201b0b4 <== NOT EXECUTED 201b250: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED return rc; *sec_buf &= 0x00; *sec_buf |= (uint8_t)((fat16_clv & 0xFF00)>>8); 201b254: 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; 201b258: c0 28 40 00 clrb [ %g1 ] <== NOT EXECUTED *sec_buf |= (uint8_t)((fat16_clv & 0xFF00)>>8); 201b25c: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED 201b260: 87 30 e0 18 srl %g3, 0x18, %g3 <== NOT EXECUTED 201b264: c4 08 40 00 ldub [ %g1 ], %g2 <== NOT EXECUTED 201b268: 84 10 c0 02 or %g3, %g2, %g2 <== NOT EXECUTED 201b26c: c4 28 40 00 stb %g2, [ %g1 ] <== NOT EXECUTED 201b270: f6 2f 60 88 stb %i3, [ %i5 + 0x88 ] <== NOT EXECUTED 201b274: 81 c7 e0 08 ret <== NOT EXECUTED 201b278: 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, 201b27c: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201b280: 92 04 20 01 add %l0, 1, %o1 <== NOT EXECUTED 201b284: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 201b288: 7f ff e3 47 call 2013fa4 <== NOT EXECUTED 201b28c: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED &sec_buf); if (rc != RC_OK) 201b290: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 201b294: 12 bf ff 88 bne 201b0b4 <== NOT EXECUTED 201b298: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED return rc; *sec_buf &= 0xF0; *sec_buf |= (uint8_t)((fat16_clv & 0xFF00)>>8); 201b29c: 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; 201b2a0: c4 08 40 00 ldub [ %g1 ], %g2 <== NOT EXECUTED 201b2a4: 84 08 bf f0 and %g2, -16, %g2 <== NOT EXECUTED 201b2a8: c4 28 40 00 stb %g2, [ %g1 ] <== NOT EXECUTED *sec_buf |= (uint8_t)((fat16_clv & 0xFF00)>>8); 201b2ac: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED 201b2b0: c4 08 40 00 ldub [ %g1 ], %g2 <== NOT EXECUTED 201b2b4: 84 16 80 02 or %i2, %g2, %g2 <== NOT EXECUTED 201b2b8: c4 28 40 00 stb %g2, [ %g1 ] <== NOT EXECUTED 201b2bc: f6 2f 60 88 stb %i3, [ %i5 + 0x88 ] <== NOT EXECUTED 201b2c0: 81 c7 e0 08 ret <== NOT EXECUTED 201b2c4: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02014dd0 : * RC_OK on success, or -1 if error occured * and errno set appropriately */ int fat_shutdown_drive(fat_fs_info_t *fs_info) { 2014dd0: 9d e3 bf a0 save %sp, -96, %sp int rc = RC_OK; int i = 0; rc = fat_sync(fs_info); 2014dd4: 90 10 00 18 mov %i0, %o0 2014dd8: 7f ff ff b4 call 2014ca8 2014ddc: b8 10 00 18 mov %i0, %i4 if ( rc != RC_OK ) 2014de0: b0 92 20 00 orcc %o0, 0, %i0 2014de4: 32 80 00 35 bne,a 2014eb8 <== NEVER TAKEN 2014de8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rc = -1; 2014dec: 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; 2014df0: fa 07 20 6c ld [ %i4 + 0x6c ], %i5 while ( (node = rtems_chain_get(the_chain)) != NULL ) 2014df4: 10 80 00 04 b 2014e04 2014df8: ba 07 40 1b add %i5, %i3, %i5 free(node); 2014dfc: 7f ff c1 98 call 200545c <== NOT EXECUTED 2014e00: 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 ); 2014e04: 7f ff d6 c9 call 200a928 <_Chain_Get> 2014e08: 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 ) 2014e0c: 80 a2 20 00 cmp %o0, 0 2014e10: 12 bf ff fb bne 2014dfc <== NEVER TAKEN 2014e14: 01 00 00 00 nop 2014e18: 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++) 2014e1c: 80 a6 e0 18 cmp %i3, 0x18 2014e20: 32 bf ff f5 bne,a 2014df4 2014e24: fa 07 20 6c ld [ %i4 + 0x6c ], %i5 2014e28: 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; 2014e2c: fa 07 20 70 ld [ %i4 + 0x70 ], %i5 while ( (node = rtems_chain_get(the_chain)) != NULL ) 2014e30: 10 80 00 04 b 2014e40 2014e34: ba 07 40 1b add %i5, %i3, %i5 free(node); 2014e38: 7f ff c1 89 call 200545c <== NOT EXECUTED 2014e3c: 01 00 00 00 nop <== NOT EXECUTED 2014e40: 7f ff d6 ba call 200a928 <_Chain_Get> 2014e44: 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 ) 2014e48: 80 a2 20 00 cmp %o0, 0 2014e4c: 12 bf ff fb bne 2014e38 <== NEVER TAKEN 2014e50: 01 00 00 00 nop 2014e54: 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++) 2014e58: 80 a6 e0 18 cmp %i3, 0x18 2014e5c: 32 bf ff f5 bne,a 2014e30 2014e60: fa 07 20 70 ld [ %i4 + 0x70 ], %i5 while ( (node = rtems_chain_get(the_chain)) != NULL ) free(node); } free(fs_info->vhash); 2014e64: 7f ff c1 7e call 200545c 2014e68: d0 07 20 6c ld [ %i4 + 0x6c ], %o0 free(fs_info->rhash); 2014e6c: 7f ff c1 7c call 200545c 2014e70: d0 07 20 70 ld [ %i4 + 0x70 ], %o0 free(fs_info->uino); 2014e74: 7f ff c1 7a call 200545c 2014e78: d0 07 20 74 ld [ %i4 + 0x74 ], %o0 free(fs_info->sec_buf); 2014e7c: 7f ff c1 78 call 200545c 2014e80: d0 07 20 90 ld [ %i4 + 0x90 ], %o0 close(fs_info->vol.fd); 2014e84: 7f ff c0 ba call 200516c 2014e88: d0 07 20 60 ld [ %i4 + 0x60 ], %o0 if (rc) 2014e8c: 80 a6 20 00 cmp %i0, 0 2014e90: 12 80 00 04 bne 2014ea0 <== NEVER TAKEN 2014e94: 01 00 00 00 nop errno = EIO; return rc; } 2014e98: 81 c7 e0 08 ret 2014e9c: 81 e8 00 00 restore free(fs_info->uino); free(fs_info->sec_buf); close(fs_info->vol.fd); if (rc) errno = EIO; 2014ea0: 40 00 20 8b call 201d0cc <__errno> <== NOT EXECUTED 2014ea4: 01 00 00 00 nop <== NOT EXECUTED 2014ea8: 82 10 20 05 mov 5, %g1 ! 5 <== NOT EXECUTED 2014eac: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED return rc; } 2014eb0: 81 c7 e0 08 ret <== NOT EXECUTED 2014eb4: 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; 2014eb8: 10 bf ff ce b 2014df0 <== NOT EXECUTED 2014ebc: b6 10 20 00 clr %i3 <== NOT EXECUTED =============================================================================== 02014ca8 : return RC_OK; } int fat_sync(fat_fs_info_t *fs_info) { 2014ca8: 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) 2014cac: c2 0e 20 0e ldub [ %i0 + 0xe ], %g1 2014cb0: 80 a0 60 04 cmp %g1, 4 2014cb4: 02 80 00 0c be 2014ce4 2014cb8: 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) 2014cbc: 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); 2014cc0: 7f ff fc 42 call 2013dc8 2014cc4: 90 10 00 1d mov %i5, %o0 if (rtems_bdbuf_syncdev(fs_info->vol.dd) != RTEMS_SUCCESSFUL) 2014cc8: 7f ff f5 05 call 20120dc 2014ccc: d0 07 60 64 ld [ %i5 + 0x64 ], %o0 2014cd0: 80 a2 20 00 cmp %o0, 0 2014cd4: 12 80 00 3d bne 2014dc8 <== NEVER TAKEN 2014cd8: 01 00 00 00 nop rc = -1; return rc; } 2014cdc: 81 c7 e0 08 ret 2014ce0: 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; 2014ce4: 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) 2014ce8: 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; 2014cec: f8 06 20 4c ld [ %i0 + 0x4c ], %i4 if (free_count != fs_info->vol.free_cls_in_fs_info) 2014cf0: 80 a0 40 02 cmp %g1, %g2 2014cf4: 02 80 00 16 be 2014d4c <== ALWAYS TAKEN 2014cf8: b6 10 20 00 clr %i3 uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 2014cfc: 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, 2014d00: 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; 2014d04: 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; 2014d08: 89 30 60 08 srl %g1, 8, %g4 <== NOT EXECUTED byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2014d0c: 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; 2014d10: 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; 2014d14: 85 30 60 10 srl %g1, 0x10, %g2 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; 2014d18: 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; 2014d1c: 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; 2014d20: 89 29 20 10 sll %g4, 0x10, %g4 <== NOT EXECUTED 2014d24: 85 28 a0 08 sll %g2, 8, %g2 <== NOT EXECUTED 2014d28: 86 10 c0 04 or %g3, %g4, %g3 <== NOT EXECUTED 2014d2c: 82 10 c0 02 or %g3, %g2, %g1 <== NOT EXECUTED ret1 = fat_sector_write(fs_info, 2014d30: 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); 2014d34: 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, 2014d38: 94 10 21 e8 mov 0x1e8, %o2 <== NOT EXECUTED 2014d3c: 96 10 20 04 mov 4, %o3 <== NOT EXECUTED 2014d40: 7f ff fc e7 call 20140dc <== NOT EXECUTED 2014d44: 98 07 bf fc add %fp, -4, %o4 <== NOT EXECUTED 2014d48: 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) 2014d4c: c4 07 60 50 ld [ %i5 + 0x50 ], %g2 2014d50: 80 a7 00 02 cmp %i4, %g2 2014d54: 02 80 00 16 be 2014dac <== NEVER TAKEN 2014d58: 90 10 20 00 clr %o0 2014d5c: 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, 2014d60: d2 17 60 40 lduh [ %i5 + 0x40 ], %o1 uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 2014d64: 83 37 20 18 srl %i4, 0x18, %g1 byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 2014d68: 87 37 20 08 srl %i4, 8, %g3 byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2014d6c: 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; 2014d70: 86 08 e0 ff and %g3, 0xff, %g3 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2014d74: 85 37 20 10 srl %i4, 0x10, %g2 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2014d78: 87 28 e0 10 sll %g3, 0x10, %g3 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2014d7c: 84 08 a0 ff and %g2, 0xff, %g2 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2014d80: 82 10 40 03 or %g1, %g3, %g1 2014d84: 85 28 a0 08 sll %g2, 8, %g2 2014d88: 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; 2014d8c: f8 27 60 50 st %i4, [ %i5 + 0x50 ] ret2 = fat_sector_write(fs_info, 2014d90: 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); 2014d94: c2 27 bf fc st %g1, [ %fp + -4 ] fs_info->vol.next_cl_in_fs_info = next_free; ret2 = fat_sector_write(fs_info, 2014d98: 94 10 21 ec mov 0x1ec, %o2 2014d9c: 96 10 20 04 mov 4, %o3 2014da0: 7f ff fc cf call 20140dc 2014da4: 98 07 bf fc add %fp, -4, %o4 2014da8: 91 32 20 1f srl %o0, 0x1f, %o0 sizeof(le_next_free), &le_next_free); } } if ( (ret1 < 0) || (ret2 < 0) ) 2014dac: 80 8a 20 ff btst 0xff, %o0 2014db0: 12 80 00 04 bne 2014dc0 <== NEVER TAKEN 2014db4: 80 8e e0 ff btst 0xff, %i3 2014db8: 22 bf ff c2 be,a 2014cc0 <== ALWAYS TAKEN 2014dbc: b0 10 20 00 clr %i0 { int rc = RC_OK; rc = fat_fat32_update_fsinfo_sector(fs_info); if ( rc != RC_OK ) rc = -1; 2014dc0: 10 bf ff c0 b 2014cc0 <== NOT EXECUTED 2014dc4: 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; 2014dc8: 81 c7 e0 08 ret <== NOT EXECUTED 2014dcc: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED =============================================================================== 02037768 : /** * compatible with SVr4, 4.4BSD and X/OPEN - Change Directory */ int fchdir( int fd ) { 2037768: 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 ); 203776c: 03 00 81 8c sethi %hi(0x2063000), %g1 2037770: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 ! 2063030 int rv = 0; rtems_libio_t *iop; struct stat st; rtems_filesystem_location_info_t loc; st.st_mode = 0; 2037774: c0 27 bf c4 clr [ %fp + -60 ] st.st_uid = 0; 2037778: c0 37 bf ca clrh [ %fp + -54 ] st.st_gid = 0; rtems_libio_check_fd( fd ); 203777c: 80 a6 00 01 cmp %i0, %g1 2037780: 1a 80 00 3d bcc 2037874 2037784: c0 37 bf cc clrh [ %fp + -52 ] iop = rtems_libio_iop( fd ); 2037788: 03 00 81 9c sethi %hi(0x2067000), %g1 203778c: fa 00 61 d4 ld [ %g1 + 0x1d4 ], %i5 ! 20671d4 2037790: 83 2e 20 03 sll %i0, 3, %g1 2037794: b1 2e 20 06 sll %i0, 6, %i0 2037798: b0 26 00 01 sub %i0, %g1, %i0 203779c: ba 07 40 18 add %i5, %i0, %i5 rtems_libio_check_is_open( iop ); 20377a0: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 20377a4: 80 88 61 00 btst 0x100, %g1 20377a8: 02 80 00 33 be 2037874 20377ac: 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; 20377b0: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->lock_h)( mt_entry ); 20377b4: c2 02 20 0c ld [ %o0 + 0xc ], %g1 20377b8: c2 00 40 00 ld [ %g1 ], %g1 20377bc: 9f c0 40 00 call %g1 20377c0: b8 07 60 14 add %i5, 0x14, %i4 rtems_filesystem_instance_lock( &iop->pathinfo ); rv = (*iop->pathinfo.handlers->fstat_h)( &iop->pathinfo, &st ); 20377c4: c2 07 60 24 ld [ %i5 + 0x24 ], %g1 20377c8: 90 10 00 1c mov %i4, %o0 20377cc: c2 00 60 18 ld [ %g1 + 0x18 ], %g1 20377d0: 9f c0 40 00 call %g1 20377d4: 92 07 bf b8 add %fp, -72, %o1 if ( rv == 0 ) { 20377d8: b0 92 20 00 orcc %o0, 0, %i0 20377dc: 02 80 00 09 be 2037800 <== ALWAYS TAKEN 20377e0: 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; 20377e4: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 <== NOT EXECUTED (*mt_entry->ops->unlock_h)( mt_entry ); 20377e8: c2 02 20 0c ld [ %o0 + 0xc ], %g1 <== NOT EXECUTED 20377ec: c2 00 60 04 ld [ %g1 + 4 ], %g1 <== NOT EXECUTED 20377f0: 9f c0 40 00 call %g1 <== NOT EXECUTED 20377f4: 01 00 00 00 nop <== NOT EXECUTED if ( rv == 0 ) { rv = rtems_filesystem_chdir( &loc ); } return rv; } 20377f8: 81 c7 e0 08 ret <== NOT EXECUTED 20377fc: 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( 2037800: d4 17 bf ca lduh [ %fp + -54 ], %o2 2037804: d6 17 bf cc lduh [ %fp + -52 ], %o3 2037808: 7f ff 5e 31 call 200f0cc 203780c: 90 10 20 01 mov 1, %o0 st.st_mode, st.st_uid, st.st_gid ); if ( access_ok ) { 2037810: 80 8a 20 ff btst 0xff, %o0 2037814: 02 80 00 0d be 2037848 2037818: 92 10 00 1c mov %i4, %o1 rtems_filesystem_location_clone( &loc, &iop->pathinfo ); 203781c: 7f ff 5c da call 200eb84 2037820: 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; 2037824: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 2037828: c2 02 20 0c ld [ %o0 + 0xc ], %g1 203782c: c2 00 60 04 ld [ %g1 + 4 ], %g1 2037830: 9f c0 40 00 call %g1 2037834: 01 00 00 00 nop } } rtems_filesystem_instance_unlock( &iop->pathinfo ); if ( rv == 0 ) { rv = rtems_filesystem_chdir( &loc ); 2037838: 7f ff be 9e call 20272b0 203783c: 90 07 bf a0 add %fp, -96, %o0 2037840: 81 c7 e0 08 ret 2037844: 91 e8 00 08 restore %g0, %o0, %o0 ); if ( access_ok ) { rtems_filesystem_location_clone( &loc, &iop->pathinfo ); } else { errno = EACCES; 2037848: 40 00 11 88 call 203be68 <__errno> 203784c: b0 10 3f ff mov -1, %i0 2037850: 82 10 20 0d mov 0xd, %g1 2037854: 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; 2037858: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 203785c: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2037860: c2 00 60 04 ld [ %g1 + 4 ], %g1 2037864: 9f c0 40 00 call %g1 2037868: 01 00 00 00 nop if ( rv == 0 ) { rv = rtems_filesystem_chdir( &loc ); } return rv; } 203786c: 81 c7 e0 08 ret 2037870: 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 ); 2037874: 40 00 11 7d call 203be68 <__errno> 2037878: b0 10 3f ff mov -1, %i0 203787c: 82 10 20 09 mov 9, %g1 2037880: c2 22 00 00 st %g1, [ %o0 ] 2037884: 81 c7 e0 08 ret 2037888: 81 e8 00 00 restore =============================================================================== 02027590 : /** * POSIX 1003.1b 5.6.4 - Change File Modes */ int fchmod( int fd, mode_t mode ) { 2027590: 9d e3 bf a0 save %sp, -96, %sp int rv; rtems_libio_t *iop; rtems_libio_check_fd( fd ); 2027594: 03 00 81 8c sethi %hi(0x2063000), %g1 2027598: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 ! 2063030 202759c: 80 a6 00 01 cmp %i0, %g1 20275a0: 1a 80 00 28 bcc 2027640 20275a4: 03 00 81 9c sethi %hi(0x2067000), %g1 iop = rtems_libio_iop( fd ); 20275a8: fa 00 61 d4 ld [ %g1 + 0x1d4 ], %i5 ! 20671d4 20275ac: 83 2e 20 03 sll %i0, 3, %g1 20275b0: b1 2e 20 06 sll %i0, 6, %i0 20275b4: b0 26 00 01 sub %i0, %g1, %i0 20275b8: ba 07 40 18 add %i5, %i0, %i5 rtems_libio_check_is_open(iop); 20275bc: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 20275c0: 80 88 61 00 btst 0x100, %g1 20275c4: 02 80 00 1f be 2027640 20275c8: 01 00 00 00 nop if (iop->pathinfo.mt_entry->writeable) { 20275cc: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 20275d0: c2 0a 20 29 ldub [ %o0 + 0x29 ], %g1 20275d4: 80 a0 60 00 cmp %g1, 0 20275d8: 02 80 00 14 be 2027628 <== NEVER TAKEN 20275dc: 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 ); 20275e0: c2 02 20 0c ld [ %o0 + 0xc ], %g1 20275e4: c2 00 40 00 ld [ %g1 ], %g1 20275e8: 9f c0 40 00 call %g1 20275ec: 01 00 00 00 nop rtems_filesystem_instance_lock( &iop->pathinfo ); rv = (*iop->pathinfo.mt_entry->ops->fchmod_h)( &iop->pathinfo, mode ); 20275f0: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 20275f4: 90 07 60 14 add %i5, 0x14, %o0 20275f8: c2 00 60 0c ld [ %g1 + 0xc ], %g1 20275fc: c2 00 60 20 ld [ %g1 + 0x20 ], %g1 2027600: 9f c0 40 00 call %g1 2027604: 92 10 00 19 mov %i1, %o1 2027608: 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; 202760c: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 2027610: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2027614: c2 00 60 04 ld [ %g1 + 4 ], %g1 2027618: 9f c0 40 00 call %g1 202761c: 01 00 00 00 nop 2027620: 81 c7 e0 08 ret 2027624: 81 e8 00 00 restore rtems_filesystem_instance_unlock( &iop->pathinfo ); } else { errno = EROFS; 2027628: 40 00 52 10 call 203be68 <__errno> <== NOT EXECUTED 202762c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2027630: 82 10 20 1e mov 0x1e, %g1 <== NOT EXECUTED 2027634: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED rv = -1; } return rv; } 2027638: 81 c7 e0 08 ret <== NOT EXECUTED 202763c: 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); 2027640: 40 00 52 0a call 203be68 <__errno> 2027644: b0 10 3f ff mov -1, %i0 2027648: 82 10 20 09 mov 9, %g1 202764c: c2 22 00 00 st %g1, [ %o0 ] 2027650: 81 c7 e0 08 ret 2027654: 81 e8 00 00 restore =============================================================================== 02027658 : /** * POSIX 1003.1b 5.6.5 - Change Owner and Group of a File */ int fchown( int fd, uid_t owner, gid_t group ) { 2027658: 9d e3 bf a0 save %sp, -96, %sp int rv = 0; rtems_libio_t *iop; rtems_libio_check_fd( fd ); 202765c: 03 00 81 8c sethi %hi(0x2063000), %g1 2027660: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 ! 2063030 2027664: 80 a6 00 01 cmp %i0, %g1 2027668: 1a 80 00 29 bcc 202770c 202766c: 03 00 81 9c sethi %hi(0x2067000), %g1 iop = rtems_libio_iop( fd ); 2027670: fa 00 61 d4 ld [ %g1 + 0x1d4 ], %i5 ! 20671d4 2027674: 83 2e 20 03 sll %i0, 3, %g1 2027678: b1 2e 20 06 sll %i0, 6, %i0 202767c: b0 26 00 01 sub %i0, %g1, %i0 2027680: ba 07 40 18 add %i5, %i0, %i5 rtems_libio_check_is_open(iop); 2027684: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2027688: 80 88 61 00 btst 0x100, %g1 202768c: 02 80 00 20 be 202770c 2027690: 01 00 00 00 nop if (iop->pathinfo.mt_entry->writeable) { 2027694: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 2027698: c2 0a 20 29 ldub [ %o0 + 0x29 ], %g1 202769c: 80 a0 60 00 cmp %g1, 0 20276a0: 02 80 00 15 be 20276f4 <== NEVER TAKEN 20276a4: 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 ); 20276a8: c2 02 20 0c ld [ %o0 + 0xc ], %g1 20276ac: c2 00 40 00 ld [ %g1 ], %g1 20276b0: 9f c0 40 00 call %g1 20276b4: 01 00 00 00 nop rtems_filesystem_instance_lock( &iop->pathinfo ); rv = (*iop->pathinfo.mt_entry->ops->chown_h)( 20276b8: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 20276bc: 90 07 60 14 add %i5, 0x14, %o0 20276c0: c2 00 60 0c ld [ %g1 + 0xc ], %g1 20276c4: 92 10 00 19 mov %i1, %o1 20276c8: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 20276cc: 9f c0 40 00 call %g1 20276d0: 94 10 00 1a mov %i2, %o2 20276d4: 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; 20276d8: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 20276dc: c2 02 20 0c ld [ %o0 + 0xc ], %g1 20276e0: c2 00 60 04 ld [ %g1 + 4 ], %g1 20276e4: 9f c0 40 00 call %g1 20276e8: 01 00 00 00 nop 20276ec: 81 c7 e0 08 ret 20276f0: 81 e8 00 00 restore owner, group ); rtems_filesystem_instance_unlock( &iop->pathinfo ); } else { errno = EROFS; 20276f4: 40 00 51 dd call 203be68 <__errno> <== NOT EXECUTED 20276f8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20276fc: 82 10 20 1e mov 0x1e, %g1 <== NOT EXECUTED 2027700: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED rv = -1; } return rv; } 2027704: 81 c7 e0 08 ret <== NOT EXECUTED 2027708: 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); 202770c: 40 00 51 d7 call 203be68 <__errno> 2027710: b0 10 3f ff mov -1, %i0 2027714: 82 10 20 09 mov 9, %g1 2027718: c2 22 00 00 st %g1, [ %o0 ] 202771c: 81 c7 e0 08 ret 2027720: 81 e8 00 00 restore =============================================================================== 02031f78 : int fcntl( int fd, int cmd, ... ) { 2031f78: 9d e3 bf 98 save %sp, -104, %sp int fd2; int flags; int mask; int ret = 0; rtems_libio_check_fd( fd ); 2031f7c: 03 00 80 e1 sethi %hi(0x2038400), %g1 2031f80: c4 00 60 bc ld [ %g1 + 0xbc ], %g2 ! 20384bc ... ) { int ret; va_list ap; va_start( ap, cmd ); 2031f84: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 2031f88: 82 07 a0 4c add %fp, 0x4c, %g1 2031f8c: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 2031f90: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2031f94: fa 27 a0 58 st %i5, [ %fp + 0x58 ] int fd2; int flags; int mask; int ret = 0; rtems_libio_check_fd( fd ); 2031f98: 80 a6 00 02 cmp %i0, %g2 2031f9c: 1a 80 00 7c bcc 203218c 2031fa0: c2 27 bf fc st %g1, [ %fp + -4 ] iop = rtems_libio_iop( fd ); 2031fa4: 39 00 81 24 sethi %hi(0x2049000), %i4 2031fa8: fa 07 20 68 ld [ %i4 + 0x68 ], %i5 ! 2049068 2031fac: 85 2e 20 03 sll %i0, 3, %g2 2031fb0: b1 2e 20 06 sll %i0, 6, %i0 2031fb4: b0 26 00 02 sub %i0, %g2, %i0 2031fb8: ba 07 40 18 add %i5, %i0, %i5 rtems_libio_check_is_open(iop); 2031fbc: d0 07 60 10 ld [ %i5 + 0x10 ], %o0 2031fc0: 80 8a 21 00 btst 0x100, %o0 2031fc4: 02 80 00 72 be 203218c 2031fc8: 80 a6 60 09 cmp %i1, 9 /* * This switch should contain all the cases from POSIX. */ switch ( cmd ) { 2031fcc: 08 80 00 08 bleu 2031fec 2031fd0: 85 2e 60 02 sll %i1, 2, %g2 errno = ENOTSUP; ret = -1; break; default: errno = EINVAL; 2031fd4: 7f ff c4 a5 call 2023268 <__errno> 2031fd8: b0 10 3f ff mov -1, %i0 2031fdc: 82 10 20 16 mov 0x16, %g1 2031fe0: c2 22 00 00 st %g1, [ %o0 ] va_list ap; va_start( ap, cmd ); ret = vfcntl(fd,cmd,ap); va_end(ap); return ret; } 2031fe4: 81 c7 e0 08 ret 2031fe8: 81 e8 00 00 restore /* * This switch should contain all the cases from POSIX. */ switch ( cmd ) { 2031fec: 07 00 80 c7 sethi %hi(0x2031c00), %g3 2031ff0: 86 10 e3 50 or %g3, 0x350, %g3 ! 2031f50 <_calloc_r+0x14> 2031ff4: c4 00 c0 02 ld [ %g3 + %g2 ], %g2 2031ff8: 81 c0 80 00 jmp %g2 2031ffc: 01 00 00 00 nop errno = ENOTSUP; ret = -1; break; case F_GETOWN: /* for sockets. */ errno = ENOTSUP; 2032000: 7f ff c4 9a call 2023268 <__errno> 2032004: b0 10 3f ff mov -1, %i0 ! ffffffff 2032008: 82 10 20 86 mov 0x86, %g1 203200c: c2 22 00 00 st %g1, [ %o0 ] 2032010: 81 c7 e0 08 ret 2032014: 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 ) ); 2032018: d0 00 40 00 ld [ %g1 ], %o0 203201c: 7f ff 5a d1 call 2008b60 2032020: 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); 2032024: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2032028: 90 0a 22 01 and %o0, 0x201, %o0 203202c: 82 08 7d fe and %g1, -514, %g1 2032030: 82 12 00 01 or %o0, %g1, %g1 2032034: 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 ); 2032038: c2 07 60 24 ld [ %i5 + 0x24 ], %g1 203203c: 90 10 00 1d mov %i5, %o0 2032040: c2 00 60 28 ld [ %g1 + 0x28 ], %g1 2032044: 9f c0 40 00 call %g1 2032048: 92 10 00 19 mov %i1, %o1 if (err) { 203204c: ba 92 20 00 orcc %o0, 0, %i5 2032050: 02 80 00 53 be 203219c <== ALWAYS TAKEN 2032054: 01 00 00 00 nop errno = err; 2032058: 7f ff c4 84 call 2023268 <__errno> <== NOT EXECUTED 203205c: b0 10 3f ff mov -1, %i0 ! ffffffff <== NOT EXECUTED 2032060: fa 22 00 00 st %i5, [ %o0 ] <== NOT EXECUTED 2032064: 81 c7 e0 08 ret <== NOT EXECUTED 2032068: 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 ); 203206c: 7f ff 5a ca call 2008b94 2032070: 01 00 00 00 nop 2032074: 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) { 2032078: 80 a6 20 00 cmp %i0, 0 203207c: 36 bf ff f0 bge,a 203203c <== ALWAYS TAKEN 2032080: 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; } 2032084: 81 c7 e0 08 ret <== NOT EXECUTED 2032088: 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 ) ) 203208c: c2 00 40 00 ld [ %g1 ], %g1 2032090: 80 a0 60 00 cmp %g1, 0 2032094: 22 80 00 3b be,a 2032180 2032098: 90 0a 37 ff and %o0, -2049, %o0 iop->flags |= LIBIO_FLAGS_CLOSE_ON_EXEC; 203209c: 90 12 28 00 or %o0, 0x800, %o0 { rtems_libio_t *iop; int fd2; int flags; int mask; int ret = 0; 20320a0: 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; 20320a4: 10 bf ff e5 b 2032038 20320a8: 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); 20320ac: b1 32 20 0b srl %o0, 0xb, %i0 20320b0: 10 bf ff e2 b 2032038 20320b4: 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(); 20320b8: 7f ff 5a ce call 2008bf0 20320bc: 01 00 00 00 nop if (diop != NULL) { 20320c0: b6 92 20 00 orcc %o0, 0, %i3 20320c4: 02 bf ff c8 be 2031fe4 20320c8: b0 10 3f ff mov -1, %i0 int oflag = rtems_libio_to_fcntl_flags( iop->flags ); 20320cc: 7f ff 5a b2 call 2008b94 20320d0: d0 07 60 10 ld [ %i5 + 0x10 ], %o0 oflag &= ~O_CREAT; diop->flags |= rtems_libio_fcntl_flags( oflag ); 20320d4: 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; 20320d8: b4 0a 3d ff and %o0, -513, %i2 diop->flags |= rtems_libio_fcntl_flags( oflag ); 20320dc: 7f ff 5a a1 call 2008b60 20320e0: 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; 20320e4: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 20320e8: b0 12 00 18 or %o0, %i0, %i0 (*mt_entry->ops->lock_h)( mt_entry ); 20320ec: c4 00 60 0c ld [ %g1 + 0xc ], %g2 20320f0: 90 10 00 01 mov %g1, %o0 20320f4: c2 00 80 00 ld [ %g2 ], %g1 20320f8: 9f c0 40 00 call %g1 20320fc: f0 26 e0 10 st %i0, [ %i3 + 0x10 ] rtems_filesystem_instance_lock( &iop->pathinfo ); rtems_filesystem_location_clone( &diop->pathinfo, &iop->pathinfo ); 2032100: 92 07 60 14 add %i5, 0x14, %o1 2032104: 7f ff 98 c5 call 2018418 2032108: 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; 203210c: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 2032110: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2032114: c2 00 60 04 ld [ %g1 + 4 ], %g1 2032118: 9f c0 40 00 call %g1 203211c: 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 ); 2032120: c2 06 e0 24 ld [ %i3 + 0x24 ], %g1 2032124: 90 10 00 1b mov %i3, %o0 2032128: c2 00 40 00 ld [ %g1 ], %g1 203212c: 92 10 20 00 clr %o1 2032130: 94 10 00 1a mov %i2, %o2 2032134: 9f c0 40 00 call %g1 2032138: 96 10 20 00 clr %o3 if ( rv == 0 ) { 203213c: b0 92 20 00 orcc %o0, 0, %i0 2032140: 12 80 00 19 bne 20321a4 <== NEVER TAKEN 2032144: c2 07 20 68 ld [ %i4 + 0x68 ], %g1 rv = diop - rtems_libio_iops; 2032148: b6 26 c0 01 sub %i3, %g1, %i3 203214c: b7 3e e0 03 sra %i3, 3, %i3 2032150: 85 2e e0 03 sll %i3, 3, %g2 2032154: 83 2e e0 06 sll %i3, 6, %g1 2032158: 82 00 80 01 add %g2, %g1, %g1 203215c: 85 28 60 06 sll %g1, 6, %g2 2032160: 82 00 40 02 add %g1, %g2, %g1 2032164: 82 00 40 1b add %g1, %i3, %g1 2032168: 85 28 60 0f sll %g1, 0xf, %g2 203216c: 82 00 40 02 add %g1, %g2, %g1 2032170: 83 28 60 03 sll %g1, 3, %g1 2032174: b6 00 40 1b add %g1, %i3, %i3 2032178: 10 bf ff c0 b 2032078 203217c: b0 20 00 1b neg %i3, %i0 { rtems_libio_t *iop; int fd2; int flags; int mask; int ret = 0; 2032180: 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; 2032184: 10 bf ff ad b 2032038 2032188: 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); 203218c: 7f ff c4 37 call 2023268 <__errno> 2032190: b0 10 3f ff mov -1, %i0 2032194: 82 10 20 09 mov 9, %g1 2032198: c2 22 00 00 st %g1, [ %o0 ] 203219c: 81 c7 e0 08 ret 20321a0: 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 ); 20321a4: 7f ff 5a a9 call 2008c48 <== NOT EXECUTED 20321a8: 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) { 20321ac: 10 bf ff b4 b 203207c <== NOT EXECUTED 20321b0: 80 a6 20 00 cmp %i0, 0 <== NOT EXECUTED =============================================================================== 0200e84c : int fifo_open( pipe_control_t **pipep, rtems_libio_t *iop ) { 200e84c: 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) { 200e850: 3b 00 80 90 sethi %hi(0x2024000), %i5 200e854: d0 07 61 10 ld [ %i5 + 0x110 ], %o0 ! 2024110 int fifo_open( pipe_control_t **pipep, rtems_libio_t *iop ) { 200e858: b6 10 00 18 mov %i0, %i3 static int pipe_lock(void) { rtems_status_code sc = RTEMS_SUCCESSFUL; if (pipe_semaphore == RTEMS_ID_NONE) { 200e85c: 80 a2 20 00 cmp %o0, 0 200e860: 02 80 00 18 be 200e8c0 200e864: b8 17 61 10 or %i5, 0x110, %i4 rtems_libio_unlock(); } if (sc == RTEMS_SUCCESSFUL) { sc = rtems_semaphore_obtain(pipe_semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT); 200e868: 92 10 20 00 clr %o1 200e86c: 7f ff eb 37 call 2009548 200e870: 94 10 20 00 clr %o2 } if (sc == RTEMS_SUCCESSFUL) { 200e874: 80 a2 20 00 cmp %o0, 0 200e878: 12 80 00 7a bne 200ea60 <== NEVER TAKEN 200e87c: 01 00 00 00 nop err = pipe_lock(); if (err) return err; pipe = *pipep; 200e880: f8 06 c0 00 ld [ %i3 ], %i4 if (pipe == NULL) { 200e884: 80 a7 20 00 cmp %i4, 0 200e888: 02 80 00 1b be 200e8f4 200e88c: 01 00 00 00 nop err = pipe_alloc(&pipe); if (err) goto out; } if (! PIPE_LOCK(pipe)) 200e890: d0 07 20 28 ld [ %i4 + 0x28 ], %o0 200e894: 92 10 20 00 clr %o1 200e898: 7f ff eb 2c call 2009548 200e89c: 94 10 20 00 clr %o2 200e8a0: 80 a2 20 00 cmp %o0, 0 200e8a4: 02 80 00 8c be 200ead4 <== ALWAYS TAKEN 200e8a8: c2 06 c0 00 ld [ %i3 ], %g1 err = -EINTR; if (*pipep == NULL) { 200e8ac: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 200e8b0: 22 80 00 6e be,a 200ea68 <== NOT EXECUTED 200e8b4: d0 07 20 2c ld [ %i4 + 0x2c ], %o0 <== NOT EXECUTED if (err) goto out; } if (! PIPE_LOCK(pipe)) err = -EINTR; 200e8b8: 10 80 00 76 b 200ea90 <== NOT EXECUTED 200e8bc: 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 ); 200e8c0: 35 00 80 90 sethi %hi(0x2024000), %i2 200e8c4: d0 06 a2 90 ld [ %i2 + 0x290 ], %o0 ! 2024290 200e8c8: 92 10 20 00 clr %o1 200e8cc: 7f ff eb 1f call 2009548 200e8d0: 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) { 200e8d4: c2 07 61 10 ld [ %i5 + 0x110 ], %g1 200e8d8: 80 a0 60 00 cmp %g1, 0 200e8dc: 02 80 00 55 be 200ea30 <== ALWAYS TAKEN 200e8e0: 98 10 00 1c mov %i4, %o4 } static inline void rtems_libio_unlock( void ) { rtems_semaphore_release( rtems_libio_semaphore ); 200e8e4: 7f ff eb 68 call 2009684 <== NOT EXECUTED 200e8e8: d0 06 a2 90 ld [ %i2 + 0x290 ], %o0 <== NOT EXECUTED 200e8ec: 10 bf ff df b 200e868 <== NOT EXECUTED 200e8f0: d0 07 61 10 ld [ %i5 + 0x110 ], %o0 <== NOT EXECUTED { static char c = 'a'; pipe_control_t *pipe; int err = -ENOMEM; pipe = malloc(sizeof(pipe_control_t)); 200e8f4: 7f ff d9 4a call 2004e1c 200e8f8: 90 10 20 34 mov 0x34, %o0 if (pipe == NULL) 200e8fc: b8 92 20 00 orcc %o0, 0, %i4 200e900: 02 80 00 73 be 200eacc <== NEVER TAKEN 200e904: 82 10 22 00 mov 0x200, %g1 return err; memset(pipe, 0, sizeof(pipe_control_t)); 200e908: c0 27 00 00 clr [ %i4 ] 200e90c: c0 27 20 08 clr [ %i4 + 8 ] 200e910: c0 27 20 0c clr [ %i4 + 0xc ] 200e914: c0 27 20 10 clr [ %i4 + 0x10 ] 200e918: c0 27 20 14 clr [ %i4 + 0x14 ] 200e91c: c0 27 20 18 clr [ %i4 + 0x18 ] 200e920: c0 27 20 1c clr [ %i4 + 0x1c ] 200e924: c0 27 20 20 clr [ %i4 + 0x20 ] 200e928: c0 27 20 24 clr [ %i4 + 0x24 ] 200e92c: c0 27 20 28 clr [ %i4 + 0x28 ] 200e930: c0 27 20 2c clr [ %i4 + 0x2c ] 200e934: c0 27 20 30 clr [ %i4 + 0x30 ] pipe->Size = PIPE_BUF; pipe->Buffer = malloc(pipe->Size); 200e938: 90 10 22 00 mov 0x200, %o0 200e93c: 7f ff d9 38 call 2004e1c 200e940: c2 27 20 04 st %g1, [ %i4 + 4 ] if (! pipe->Buffer) 200e944: 80 a2 20 00 cmp %o0, 0 200e948: 02 80 00 5f be 200eac4 <== NEVER TAKEN 200e94c: d0 27 00 00 st %o0, [ %i4 ] goto err_buf; err = -ENOMEM; if (rtems_barrier_create( rtems_build_name ('P', 'I', 'r', c), 200e950: 35 00 80 8e sethi %hi(0x2023800), %i2 200e954: d0 4e a1 c8 ldsb [ %i2 + 0x1c8 ], %o0 ! 20239c8 if (! pipe->Buffer) goto err_buf; err = -ENOMEM; if (rtems_barrier_create( 200e958: 31 14 12 5c sethi %hi(0x50497000), %i0 200e95c: 82 16 22 00 or %i0, 0x200, %g1 ! 50497200 200e960: 92 10 20 00 clr %o1 200e964: 94 10 20 00 clr %o2 200e968: 90 12 00 01 or %o0, %g1, %o0 200e96c: 40 00 06 5f call 20102e8 200e970: 96 07 20 2c add %i4, 0x2c, %o3 200e974: 80 a2 20 00 cmp %o0, 0 200e978: 12 80 00 51 bne 200eabc 200e97c: d0 4e a1 c8 ldsb [ %i2 + 0x1c8 ], %o0 rtems_build_name ('P', 'I', 'r', c), RTEMS_BARRIER_MANUAL_RELEASE, 0, &pipe->readBarrier) != RTEMS_SUCCESSFUL) goto err_rbar; if (rtems_barrier_create( 200e980: 03 14 12 5d sethi %hi(0x50497400), %g1 200e984: 82 10 63 00 or %g1, 0x300, %g1 ! 50497700 200e988: 92 10 20 00 clr %o1 200e98c: 94 10 20 00 clr %o2 200e990: 90 12 00 01 or %o0, %g1, %o0 200e994: 40 00 06 55 call 20102e8 200e998: 96 07 20 30 add %i4, 0x30, %o3 200e99c: 80 a2 20 00 cmp %o0, 0 200e9a0: 12 80 00 45 bne 200eab4 200e9a4: d0 4e a1 c8 ldsb [ %i2 + 0x1c8 ], %o0 rtems_build_name ('P', 'I', 'w', c), RTEMS_BARRIER_MANUAL_RELEASE, 0, &pipe->writeBarrier) != RTEMS_SUCCESSFUL) goto err_wbar; if (rtems_semaphore_create( 200e9a8: b0 16 23 00 or %i0, 0x300, %i0 200e9ac: 92 10 20 01 mov 1, %o1 200e9b0: 90 12 00 18 or %o0, %i0, %o0 200e9b4: 94 10 20 10 mov 0x10, %o2 200e9b8: 96 10 20 00 clr %o3 200e9bc: 7f ff ea 3b call 20092a8 200e9c0: 98 07 20 28 add %i4, 0x28, %o4 200e9c4: 80 a2 20 00 cmp %o0, 0 200e9c8: 12 80 00 39 bne 200eaac 200e9cc: 94 07 bf fc add %fp, -4, %o2 RTEMS_INLINE_ROUTINE Barrier_Control *_Barrier_Get ( Objects_Id id, Objects_Locations *location ) { return (Barrier_Control *) 200e9d0: d2 07 20 2c ld [ %i4 + 0x2c ], %o1 200e9d4: 21 00 80 93 sethi %hi(0x2024c00), %l0 200e9d8: 7f ff f1 f5 call 200b1ac <_Objects_Get> 200e9dc: 90 14 21 40 or %l0, 0x140, %o0 ! 2024d40 <_Barrier_Information> static void pipe_interruptible(pipe_control_t *pipe) { Objects_Locations location; _Barrier_Get(pipe->readBarrier, &location)->Barrier.Wait_queue.state |= STATES_INTERRUPTIBLE_BY_SIGNAL; 200e9e0: c2 02 20 4c ld [ %o0 + 0x4c ], %g1 200e9e4: 31 04 00 00 sethi %hi(0x10000000), %i0 200e9e8: 82 10 40 18 or %g1, %i0, %g1 _Thread_Enable_dispatch(); 200e9ec: 7f ff f5 de call 200c164 <_Thread_Enable_dispatch> 200e9f0: c2 22 20 4c st %g1, [ %o0 + 0x4c ] 200e9f4: d2 07 20 30 ld [ %i4 + 0x30 ], %o1 200e9f8: 94 07 bf fc add %fp, -4, %o2 200e9fc: 7f ff f1 ec call 200b1ac <_Objects_Get> 200ea00: 90 14 21 40 or %l0, 0x140, %o0 _Barrier_Get(pipe->writeBarrier, &location)->Barrier.Wait_queue.state |= STATES_INTERRUPTIBLE_BY_SIGNAL; 200ea04: c2 02 20 4c ld [ %o0 + 0x4c ], %g1 200ea08: b0 10 40 18 or %g1, %i0, %i0 _Thread_Enable_dispatch(); 200ea0c: 7f ff f5 d6 call 200c164 <_Thread_Enable_dispatch> 200ea10: f0 22 20 4c st %i0, [ %o0 + 0x4c ] #ifdef RTEMS_POSIX_API pipe_interruptible(pipe); #endif *pipep = pipe; if (c ++ == 'z') 200ea14: c2 4e a1 c8 ldsb [ %i2 + 0x1c8 ], %g1 200ea18: 80 a0 60 7a cmp %g1, 0x7a 200ea1c: 02 80 00 21 be 200eaa0 200ea20: c4 0e a1 c8 ldub [ %i2 + 0x1c8 ], %g2 200ea24: 84 00 a0 01 inc %g2 200ea28: 10 bf ff 9a b 200e890 200ea2c: c4 2e a1 c8 stb %g2, [ %i2 + 0x1c8 ] if (pipe_semaphore == RTEMS_ID_NONE) { rtems_libio_lock(); if (pipe_semaphore == RTEMS_ID_NONE) { sc = rtems_semaphore_create( 200ea30: 92 10 20 01 mov 1, %o1 200ea34: 94 10 20 54 mov 0x54, %o2 200ea38: 96 10 20 00 clr %o3 200ea3c: 11 14 12 54 sethi %hi(0x50495000), %o0 200ea40: 7f ff ea 1a call 20092a8 200ea44: 90 12 20 45 or %o0, 0x45, %o0 ! 50495045 200ea48: b8 10 00 08 mov %o0, %i4 200ea4c: 7f ff eb 0e call 2009684 200ea50: d0 06 a2 90 ld [ %i2 + 0x290 ], %o0 } rtems_libio_unlock(); } if (sc == RTEMS_SUCCESSFUL) { 200ea54: 80 a7 20 00 cmp %i4, 0 200ea58: 02 bf ff 84 be 200e868 200ea5c: d0 07 61 10 ld [ %i5 + 0x110 ], %o0 if (pipe->Writers ++ == 0) PIPE_WAKEUPREADERS(pipe); if (pipe->Readers == 0 && LIBIO_NODELAY(iop)) { PIPE_UNLOCK(pipe); err = -ENXIO; 200ea60: 81 c7 e0 08 ret 200ea64: 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); 200ea68: 40 00 06 51 call 20103ac <== NOT EXECUTED 200ea6c: b0 10 3f fc mov -4, %i0 <== NOT EXECUTED rtems_barrier_delete(pipe->writeBarrier); 200ea70: 40 00 06 4f call 20103ac <== NOT EXECUTED 200ea74: d0 07 20 30 ld [ %i4 + 0x30 ], %o0 <== NOT EXECUTED rtems_semaphore_delete(pipe->Semaphore); 200ea78: 7f ff ea 7d call 200946c <== NOT EXECUTED 200ea7c: d0 07 20 28 ld [ %i4 + 0x28 ], %o0 <== NOT EXECUTED free(pipe->Buffer); 200ea80: 7f ff d7 cc call 20049b0 <== NOT EXECUTED 200ea84: d0 07 00 00 ld [ %i4 ], %o0 <== NOT EXECUTED free(pipe); 200ea88: 7f ff d7 ca call 20049b0 <== NOT EXECUTED 200ea8c: 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); 200ea90: 7f ff ea fd call 2009684 200ea94: d0 07 61 10 ld [ %i5 + 0x110 ], %o0 return 0; out_error: pipe_release(pipep, iop); return err; } 200ea98: 81 c7 e0 08 ret 200ea9c: 81 e8 00 00 restore pipe_interruptible(pipe); #endif *pipep = pipe; if (c ++ == 'z') c = 'a'; 200eaa0: 82 10 20 61 mov 0x61, %g1 200eaa4: 10 bf ff 7b b 200e890 200eaa8: c2 2e a1 c8 stb %g1, [ %i2 + 0x1c8 ] return 0; err_sem: rtems_barrier_delete(pipe->writeBarrier); 200eaac: 40 00 06 40 call 20103ac 200eab0: d0 07 20 30 ld [ %i4 + 0x30 ], %o0 err_wbar: rtems_barrier_delete(pipe->readBarrier); 200eab4: 40 00 06 3e call 20103ac 200eab8: d0 07 20 2c ld [ %i4 + 0x2c ], %o0 err_rbar: free(pipe->Buffer); 200eabc: 7f ff d7 bd call 20049b0 200eac0: d0 07 00 00 ld [ %i4 ], %o0 err_buf: free(pipe); 200eac4: 7f ff d7 bb call 20049b0 200eac8: 90 10 00 1c mov %i4, %o0 if (err) goto out; } if (! PIPE_LOCK(pipe)) err = -EINTR; 200eacc: 10 bf ff f1 b 200ea90 200ead0: b0 10 3f f4 mov -12, %i0 if (*pipep == NULL) { 200ead4: 80 a0 60 00 cmp %g1, 0 200ead8: 22 80 00 02 be,a 200eae0 200eadc: f8 26 c0 00 st %i4, [ %i3 ] #ifdef RTEMS_DEBUG rtems_status_code sc = RTEMS_SUCCESSFUL; sc = #endif rtems_semaphore_release(pipe_semaphore); 200eae0: 7f ff ea e9 call 2009684 200eae4: d0 07 61 10 ld [ %i5 + 0x110 ], %o0 err = pipe_new(pipep); if (err) return err; pipe = *pipep; switch (LIBIO_ACCMODE(iop)) { 200eae8: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200eaec: 82 08 60 06 and %g1, 6, %g1 200eaf0: 80 a0 60 04 cmp %g1, 4 200eaf4: 02 80 00 0c be 200eb24 200eaf8: fa 06 c0 00 ld [ %i3 ], %i5 200eafc: 80 a0 60 06 cmp %g1, 6 200eb00: 02 80 00 58 be 200ec60 200eb04: 80 a0 60 02 cmp %g1, 2 200eb08: 22 80 00 31 be,a 200ebcc <== ALWAYS TAKEN 200eb0c: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 if (pipe->Writers ++ == 0) PIPE_WAKEUPREADERS(pipe); break; } PIPE_UNLOCK(pipe); 200eb10: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 <== NOT EXECUTED 200eb14: 7f ff ea dc call 2009684 200eb18: b0 10 20 00 clr %i0 return 0; 200eb1c: 81 c7 e0 08 ret 200eb20: 81 e8 00 00 restore break; case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; if (pipe->Writers ++ == 0) 200eb24: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 } while (prevCounter == pipe->writerCounter); } break; case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; 200eb28: c4 07 60 24 ld [ %i5 + 0x24 ], %g2 if (pipe->Writers ++ == 0) 200eb2c: 86 00 60 01 add %g1, 1, %g3 } while (prevCounter == pipe->writerCounter); } break; case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; 200eb30: 84 00 a0 01 inc %g2 if (pipe->Writers ++ == 0) 200eb34: c6 27 60 14 st %g3, [ %i5 + 0x14 ] 200eb38: 80 a0 60 00 cmp %g1, 0 200eb3c: 02 80 00 68 be 200ecdc <== ALWAYS TAKEN 200eb40: c4 27 60 24 st %g2, [ %i5 + 0x24 ] PIPE_WAKEUPREADERS(pipe); if (pipe->Readers == 0 && LIBIO_NODELAY(iop)) { 200eb44: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 <== NOT EXECUTED 200eb48: 80 a0 60 00 cmp %g1, 0 200eb4c: 32 bf ff f2 bne,a 200eb14 200eb50: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 200eb54: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200eb58: 80 88 60 01 btst 1, %g1 200eb5c: 32 80 00 65 bne,a 200ecf0 200eb60: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 err = -ENXIO; goto out_error; } if (pipe->Readers == 0) { prevCounter = pipe->readerCounter; 200eb64: 10 80 00 0c b 200eb94 200eb68: 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)) 200eb6c: 92 10 20 00 clr %o1 200eb70: 7f ff ea 76 call 2009548 200eb74: 94 10 20 00 clr %o2 200eb78: 80 a2 20 00 cmp %o0, 0 200eb7c: 12 80 00 0f bne 200ebb8 <== NEVER TAKEN 200eb80: b0 10 3f fc mov -4, %i0 goto out_error; } while (prevCounter == pipe->readerCounter); 200eb84: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200eb88: 80 a0 40 1c cmp %g1, %i4 200eb8c: 32 bf ff e2 bne,a 200eb14 <== ALWAYS TAKEN 200eb90: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 if (pipe->Readers == 0) { prevCounter = pipe->readerCounter; err = -EINTR; do { PIPE_UNLOCK(pipe); 200eb94: 7f ff ea bc call 2009684 200eb98: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 if (! PIPE_WRITEWAIT(pipe)) 200eb9c: d0 07 60 30 ld [ %i5 + 0x30 ], %o0 200eba0: 40 00 06 44 call 20104b0 200eba4: 92 10 20 00 clr %o1 200eba8: 80 a2 20 00 cmp %o0, 0 200ebac: 22 bf ff f0 be,a 200eb6c <== ALWAYS TAKEN 200ebb0: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 /* Not an error */ if (LIBIO_NODELAY(iop)) break; prevCounter = pipe->writerCounter; err = -EINTR; 200ebb4: b0 10 3f fc mov -4, %i0 <== NOT EXECUTED PIPE_UNLOCK(pipe); return 0; out_error: pipe_release(pipep, iop); 200ebb8: 90 10 00 1b mov %i3, %o0 <== NOT EXECUTED 200ebbc: 7f ff fe e5 call 200e750 200ebc0: 92 10 00 19 mov %i1, %o1 return err; 200ebc4: 81 c7 e0 08 ret 200ebc8: 81 e8 00 00 restore return err; pipe = *pipep; switch (LIBIO_ACCMODE(iop)) { case LIBIO_FLAGS_READ: pipe->readerCounter ++; 200ebcc: c4 07 60 20 ld [ %i5 + 0x20 ], %g2 if (pipe->Readers ++ == 0) 200ebd0: 86 00 60 01 add %g1, 1, %g3 return err; pipe = *pipep; switch (LIBIO_ACCMODE(iop)) { case LIBIO_FLAGS_READ: pipe->readerCounter ++; 200ebd4: 84 00 a0 01 inc %g2 if (pipe->Readers ++ == 0) 200ebd8: c6 27 60 10 st %g3, [ %i5 + 0x10 ] 200ebdc: 80 a0 60 00 cmp %g1, 0 200ebe0: 02 80 00 35 be 200ecb4 <== ALWAYS TAKEN 200ebe4: c4 27 60 20 st %g2, [ %i5 + 0x20 ] PIPE_WAKEUPWRITERS(pipe); if (pipe->Writers == 0) { 200ebe8: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 <== NOT EXECUTED 200ebec: 80 a0 60 00 cmp %g1, 0 200ebf0: 32 bf ff c9 bne,a 200eb14 200ebf4: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 /* Not an error */ if (LIBIO_NODELAY(iop)) 200ebf8: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200ebfc: 80 88 60 01 btst 1, %g1 200ec00: 32 bf ff c5 bne,a 200eb14 200ec04: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 break; prevCounter = pipe->writerCounter; 200ec08: 10 80 00 0c b 200ec38 200ec0c: 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)) 200ec10: 92 10 20 00 clr %o1 200ec14: 7f ff ea 4d call 2009548 200ec18: 94 10 20 00 clr %o2 200ec1c: 80 a2 20 00 cmp %o0, 0 200ec20: 12 bf ff e6 bne 200ebb8 <== NEVER TAKEN 200ec24: b0 10 3f fc mov -4, %i0 goto out_error; } while (prevCounter == pipe->writerCounter); 200ec28: c2 07 60 24 ld [ %i5 + 0x24 ], %g1 200ec2c: 80 a0 40 1c cmp %g1, %i4 200ec30: 32 bf ff b9 bne,a 200eb14 <== ALWAYS TAKEN 200ec34: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 prevCounter = pipe->writerCounter; err = -EINTR; /* Wait until a writer opens the pipe */ do { PIPE_UNLOCK(pipe); 200ec38: 7f ff ea 93 call 2009684 200ec3c: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 if (! PIPE_READWAIT(pipe)) 200ec40: d0 07 60 2c ld [ %i5 + 0x2c ], %o0 200ec44: 40 00 06 1b call 20104b0 200ec48: 92 10 20 00 clr %o1 200ec4c: 80 a2 20 00 cmp %o0, 0 200ec50: 22 bf ff f0 be,a 200ec10 <== ALWAYS TAKEN 200ec54: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 /* Not an error */ if (LIBIO_NODELAY(iop)) break; prevCounter = pipe->writerCounter; err = -EINTR; 200ec58: 10 bf ff d8 b 200ebb8 <== NOT EXECUTED 200ec5c: b0 10 3f fc mov -4, %i0 <== NOT EXECUTED } break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; if (pipe->Readers ++ == 0) 200ec60: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 } while (prevCounter == pipe->readerCounter); } break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; 200ec64: c4 07 60 20 ld [ %i5 + 0x20 ], %g2 if (pipe->Readers ++ == 0) 200ec68: 86 00 60 01 add %g1, 1, %g3 } while (prevCounter == pipe->readerCounter); } break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; 200ec6c: 84 00 a0 01 inc %g2 if (pipe->Readers ++ == 0) 200ec70: c6 27 60 10 st %g3, [ %i5 + 0x10 ] 200ec74: 80 a0 60 00 cmp %g1, 0 200ec78: 02 80 00 14 be 200ecc8 <== ALWAYS TAKEN 200ec7c: c4 27 60 20 st %g2, [ %i5 + 0x20 ] PIPE_WAKEUPWRITERS(pipe); pipe->writerCounter ++; if (pipe->Writers ++ == 0) 200ec80: 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 ++; 200ec84: c4 07 60 24 ld [ %i5 + 0x24 ], %g2 if (pipe->Writers ++ == 0) 200ec88: 86 00 60 01 add %g1, 1, %g3 case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; if (pipe->Readers ++ == 0) PIPE_WAKEUPWRITERS(pipe); pipe->writerCounter ++; 200ec8c: 84 00 a0 01 inc %g2 if (pipe->Writers ++ == 0) 200ec90: c6 27 60 14 st %g3, [ %i5 + 0x14 ] 200ec94: 80 a0 60 00 cmp %g1, 0 200ec98: 12 bf ff 9e bne 200eb10 <== NEVER TAKEN 200ec9c: c4 27 60 24 st %g2, [ %i5 + 0x24 ] PIPE_WAKEUPREADERS(pipe); 200eca0: d0 07 60 2c ld [ %i5 + 0x2c ], %o0 200eca4: 40 00 05 eb call 2010450 200eca8: 92 07 bf f8 add %fp, -8, %o1 break; } PIPE_UNLOCK(pipe); 200ecac: 10 bf ff 9a b 200eb14 200ecb0: 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); 200ecb4: d0 07 60 30 ld [ %i5 + 0x30 ], %o0 200ecb8: 40 00 05 e6 call 2010450 200ecbc: 92 07 bf f8 add %fp, -8, %o1 if (pipe->Writers == 0) { 200ecc0: 10 bf ff cb b 200ebec 200ecc4: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; if (pipe->Readers ++ == 0) PIPE_WAKEUPWRITERS(pipe); 200ecc8: d0 07 60 30 ld [ %i5 + 0x30 ], %o0 200eccc: 40 00 05 e1 call 2010450 200ecd0: 92 07 bf f8 add %fp, -8, %o1 pipe->writerCounter ++; if (pipe->Writers ++ == 0) 200ecd4: 10 bf ff ec b 200ec84 200ecd8: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; if (pipe->Writers ++ == 0) PIPE_WAKEUPREADERS(pipe); 200ecdc: d0 07 60 2c ld [ %i5 + 0x2c ], %o0 200ece0: 40 00 05 dc call 2010450 200ece4: 92 07 bf f8 add %fp, -8, %o1 if (pipe->Readers == 0 && LIBIO_NODELAY(iop)) { 200ece8: 10 bf ff 98 b 200eb48 200ecec: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 PIPE_UNLOCK(pipe); 200ecf0: 7f ff ea 65 call 2009684 200ecf4: b0 10 3f fa mov -6, %i0 err = -ENXIO; goto out_error; 200ecf8: 10 bf ff b1 b 200ebbc 200ecfc: 90 10 00 1b mov %i3, %o0 =============================================================================== 02009cc4 : */ long fpathconf( int fd, int name ) { 2009cc4: 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); 2009cc8: 03 00 80 4a sethi %hi(0x2012800), %g1 2009ccc: c2 00 63 58 ld [ %g1 + 0x358 ], %g1 ! 2012b58 2009cd0: 80 a6 00 01 cmp %i0, %g1 2009cd4: 1a 80 00 3e bcc 2009dcc 2009cd8: 03 00 80 4c sethi %hi(0x2013000), %g1 iop = rtems_libio_iop(fd); 2009cdc: c2 00 63 80 ld [ %g1 + 0x380 ], %g1 ! 2013380 2009ce0: 85 2e 20 03 sll %i0, 3, %g2 2009ce4: b1 2e 20 06 sll %i0, 6, %i0 2009ce8: b0 26 00 02 sub %i0, %g2, %i0 2009cec: b0 00 40 18 add %g1, %i0, %i0 rtems_libio_check_is_open(iop); 2009cf0: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 2009cf4: 80 88 61 00 btst 0x100, %g1 2009cf8: 02 80 00 35 be 2009dcc <== NEVER TAKEN 2009cfc: 80 a6 60 0b cmp %i1, 0xb /* * Now process the information request. */ the_limits = iop->pathinfo.mt_entry->pathconf_limits_and_options; 2009d00: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 switch ( name ) { 2009d04: 08 80 00 08 bleu 2009d24 2009d08: 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 ); 2009d0c: 40 00 09 9f call 200c388 <__errno> 2009d10: b0 10 3f ff mov -1, %i0 2009d14: 82 10 20 16 mov 0x16, %g1 2009d18: c2 22 00 00 st %g1, [ %o0 ] break; } return return_value; } 2009d1c: 81 c7 e0 08 ret 2009d20: 81 e8 00 00 restore * Now process the information request. */ the_limits = iop->pathinfo.mt_entry->pathconf_limits_and_options; switch ( name ) { 2009d24: b3 2e 60 02 sll %i1, 2, %i1 2009d28: 05 00 80 27 sethi %hi(0x2009c00), %g2 2009d2c: 84 10 a0 94 or %g2, 0x94, %g2 ! 2009c94 <_close_r+0x10> 2009d30: c4 00 80 19 ld [ %g2 + %i1 ], %g2 2009d34: 81 c0 80 00 jmp %g2 2009d38: 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; 2009d3c: f0 00 60 24 ld [ %g1 + 0x24 ], %i0 break; 2009d40: 81 c7 e0 08 ret 2009d44: 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; 2009d48: f0 00 60 18 ld [ %g1 + 0x18 ], %i0 break; 2009d4c: 81 c7 e0 08 ret 2009d50: 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; 2009d54: f0 00 60 2c ld [ %g1 + 0x2c ], %i0 break; 2009d58: 81 c7 e0 08 ret 2009d5c: 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; 2009d60: f0 00 60 20 ld [ %g1 + 0x20 ], %i0 break; 2009d64: 81 c7 e0 08 ret 2009d68: 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; 2009d6c: f0 00 60 1c ld [ %g1 + 0x1c ], %i0 break; 2009d70: 81 c7 e0 08 ret 2009d74: 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; 2009d78: f0 00 60 14 ld [ %g1 + 0x14 ], %i0 break; 2009d7c: 81 c7 e0 08 ret 2009d80: 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; 2009d84: f0 00 60 10 ld [ %g1 + 0x10 ], %i0 break; 2009d88: 81 c7 e0 08 ret 2009d8c: 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; 2009d90: f0 00 60 0c ld [ %g1 + 0xc ], %i0 break; 2009d94: 81 c7 e0 08 ret 2009d98: 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; 2009d9c: f0 00 60 08 ld [ %g1 + 8 ], %i0 break; 2009da0: 81 c7 e0 08 ret 2009da4: 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; 2009da8: f0 00 60 04 ld [ %g1 + 4 ], %i0 break; 2009dac: 81 c7 e0 08 ret 2009db0: 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; 2009db4: f0 00 40 00 ld [ %g1 ], %i0 break; 2009db8: 81 c7 e0 08 ret 2009dbc: 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; 2009dc0: f0 00 60 28 ld [ %g1 + 0x28 ], %i0 break; 2009dc4: 81 c7 e0 08 ret 2009dc8: 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); 2009dcc: 40 00 09 6f call 200c388 <__errno> 2009dd0: b0 10 3f ff mov -1, %i0 2009dd4: 82 10 20 09 mov 9, %g1 2009dd8: c2 22 00 00 st %g1, [ %o0 ] 2009ddc: 81 c7 e0 08 ret 2009de0: 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 78 sethi %hi(0x201e000), %g1 2003678: 82 10 61 a0 or %g1, 0x1a0, %g1 ! 201e1a0 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 7a sethi %hi(0x201e800), %g1 2003698: c2 00 60 38 ld [ %g1 + 0x38 ], %g1 ! 201e838 <_System_state_Current> 200369c: 80 a0 60 03 cmp %g1, 3 20036a0: 02 80 00 17 be 20036fc <== ALWAYS TAKEN 20036a4: 03 00 80 77 sethi %hi(0x201dc00), %g1 } /* * If configured, update the statistics */ if ( rtems_malloc_statistics_helpers ) 20036a8: c2 00 62 e0 ld [ %g1 + 0x2e0 ], %g1 ! 201dee0 20036ac: 80 a0 60 00 cmp %g1, 0 20036b0: 02 80 00 06 be 20036c8 20036b4: 3b 00 80 75 sethi %hi(0x201d400), %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 75 sethi %hi(0x201d400), %i5 20036c8: d0 07 63 00 ld [ %i5 + 0x300 ], %o0 ! 201d700 20036cc: 40 00 18 e9 call 2009a70 <_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 63 00 ld [ %i5 + 0x300 ], %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 70 sethi %hi(0x201c000), %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 20 58 restore %i0, 0x58, %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 77 sethi %hi(0x201dc00), %g1 !malloc_is_system_state_OK() ) { malloc_deferred_free(ptr); 2003710: 40 00 00 7c call 2003900 2003714: 81 e8 00 00 restore =============================================================================== 0201a974 : int fstat( int fd, struct stat *sbuf ) { 201a974: 9d e3 bf a0 save %sp, -96, %sp rtems_libio_t *iop; /* * Check to see if we were passed a valid pointer. */ if ( !sbuf ) 201a978: 80 a6 60 00 cmp %i1, 0 201a97c: 02 80 00 1f be 201a9f8 <== NEVER TAKEN 201a980: 03 00 80 75 sethi %hi(0x201d400), %g1 rtems_set_errno_and_return_minus_one( EFAULT ); /* * Now process the stat() request. */ iop = rtems_libio_iop( fd ); 201a984: c2 00 63 44 ld [ %g1 + 0x344 ], %g1 ! 201d744 201a988: 80 a6 00 01 cmp %i0, %g1 201a98c: 1a 80 00 15 bcc 201a9e0 201a990: 03 00 80 78 sethi %hi(0x201e000), %g1 201a994: c2 00 61 94 ld [ %g1 + 0x194 ], %g1 ! 201e194 201a998: 85 2e 20 03 sll %i0, 3, %g2 201a99c: b1 2e 20 06 sll %i0, 6, %i0 201a9a0: b0 26 00 02 sub %i0, %g2, %i0 201a9a4: b0 00 40 18 add %g1, %i0, %i0 rtems_libio_check_fd( fd ); rtems_libio_check_is_open(iop); 201a9a8: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 201a9ac: 80 88 61 00 btst 0x100, %g1 201a9b0: 02 80 00 0c be 201a9e0 201a9b4: 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) ); 201a9b8: 92 10 20 00 clr %o1 201a9bc: 7f ff d9 15 call 2010e10 201a9c0: 90 10 00 19 mov %i1, %o0 return (*iop->pathinfo.handlers->fstat_h)( &iop->pathinfo, sbuf ); 201a9c4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 201a9c8: 90 06 20 14 add %i0, 0x14, %o0 201a9cc: c2 00 60 18 ld [ %g1 + 0x18 ], %g1 201a9d0: 9f c0 40 00 call %g1 201a9d4: 92 10 00 19 mov %i1, %o1 } 201a9d8: 81 c7 e0 08 ret 201a9dc: 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); 201a9e0: 7f ff d6 7e call 20103d8 <__errno> 201a9e4: b0 10 3f ff mov -1, %i0 201a9e8: 82 10 20 09 mov 9, %g1 201a9ec: c2 22 00 00 st %g1, [ %o0 ] 201a9f0: 81 c7 e0 08 ret 201a9f4: 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 ); 201a9f8: 7f ff d6 78 call 20103d8 <__errno> <== NOT EXECUTED 201a9fc: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201aa00: 82 10 20 0e mov 0xe, %g1 <== NOT EXECUTED 201aa04: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 201aa08: 81 c7 e0 08 ret <== NOT EXECUTED 201aa0c: 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 89 sethi %hi(0x2022400), %g1 2003410: c2 00 61 f0 ld [ %g1 + 0x1f0 ], %g1 ! 20225f0 2003414: 80 a0 40 08 cmp %g1, %o0 2003418: 08 80 00 20 bleu 2003498 <== NEVER TAKEN 200341c: 03 00 80 89 sethi %hi(0x2022400), %g1 2003420: c2 00 61 f4 ld [ %g1 + 0x1f4 ], %g1 ! 20225f4 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 =============================================================================== 020321dc : int getdents( int dd_fd, char *dd_buf, int dd_len ) { 20321dc: 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 ); 20321e0: 03 00 80 e1 sethi %hi(0x2038400), %g1 20321e4: c2 00 60 bc ld [ %g1 + 0xbc ], %g1 ! 20384bc 20321e8: 80 a6 00 01 cmp %i0, %g1 20321ec: 1a 80 00 08 bcc 203220c <== NEVER TAKEN 20321f0: ba 10 20 00 clr %i5 20321f4: 03 00 81 24 sethi %hi(0x2049000), %g1 20321f8: fa 00 60 68 ld [ %g1 + 0x68 ], %i5 ! 2049068 20321fc: 83 2e 20 03 sll %i0, 3, %g1 2032200: b1 2e 20 06 sll %i0, 6, %i0 2032204: b0 26 00 01 sub %i0, %g1, %i0 2032208: ba 07 40 18 add %i5, %i0, %i5 /* * Make sure we are working on a directory */ type = rtems_filesystem_node_type( &iop->pathinfo ); 203220c: 7f ff 61 b7 call 200a8e8 2032210: 90 07 60 14 add %i5, 0x14, %o0 if ( type != RTEMS_FILESYSTEM_DIRECTORY ) 2032214: 80 a2 20 00 cmp %o0, 0 2032218: 12 80 00 09 bne 203223c 203221c: 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 ); 2032220: c2 07 60 24 ld [ %i5 + 0x24 ], %g1 2032224: c2 00 60 08 ld [ %g1 + 8 ], %g1 2032228: 92 10 00 19 mov %i1, %o1 203222c: 9f c0 40 00 call %g1 2032230: 94 10 00 1a mov %i2, %o2 } 2032234: 81 c7 e0 08 ret 2032238: 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 ); 203223c: 7f ff c4 0b call 2023268 <__errno> 2032240: b0 10 3f ff mov -1, %i0 2032244: 82 10 20 14 mov 0x14, %g1 2032248: c2 22 00 00 st %g1, [ %o0 ] 203224c: 81 c7 e0 08 ret 2032250: 81 e8 00 00 restore =============================================================================== 0200f720 : ssize_t imfs_dir_read( rtems_libio_t *iop, void *buffer, size_t count ) { 200f720: 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; 200f724: d0 06 20 28 ld [ %i0 + 0x28 ], %o0 (*mt_entry->ops->lock_h)( mt_entry ); 200f728: c4 02 20 0c ld [ %o0 + 0xc ], %g2 200f72c: c2 00 80 00 ld [ %g2 ], %g1 200f730: 9f c0 40 00 call %g1 200f734: 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; 200f738: 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; 200f73c: 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 ); 200f740: 90 10 00 1a mov %i2, %o0 200f744: 40 00 26 a2 call 20191cc <.udiv> 200f748: 92 10 21 18 mov 0x118, %o1 200f74c: 83 2a 20 03 sll %o0, 3, %g1 200f750: 91 2a 20 05 sll %o0, 5, %o0 200f754: 82 00 40 08 add %g1, %o0, %g1 200f758: a3 28 60 03 sll %g1, 3, %l1 200f75c: a2 24 40 01 sub %l1, %g1, %l1 200f760: a2 04 40 10 add %l1, %l0, %l1 /* The directory was not empty so try to move to the desired entry in chain*/ for ( 200f764: 80 a4 60 00 cmp %l1, 0 200f768: 04 80 00 34 ble 200f838 <== NEVER TAKEN 200f76c: 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 )); 200f770: 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 ); 200f774: 80 a6 80 12 cmp %i2, %l2 200f778: 02 80 00 29 be 200f81c 200f77c: a6 10 20 00 clr %l3 200f780: 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 ); 200f784: 10 80 00 08 b 200f7a4 200f788: 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 ( 200f78c: 80 a4 40 1b cmp %l1, %i3 200f790: 04 80 00 23 ble 200f81c <== NEVER TAKEN 200f794: 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 ); 200f798: 80 a6 80 12 cmp %i2, %l2 200f79c: 22 80 00 21 be,a 200f820 200f7a0: 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 ) { 200f7a4: 80 a4 00 1b cmp %l0, %i3 200f7a8: 34 bf ff f9 bg,a 200f78c 200f7ac: 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; 200f7b0: 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; 200f7b4: 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 ); 200f7b8: 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; 200f7bc: 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; 200f7c0: 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; 200f7c4: 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 ); 200f7c8: 90 10 00 1d mov %i5, %o0 200f7cc: 40 00 08 68 call 201196c 200f7d0: e8 37 be f8 sth %l4, [ %fp + -264 ] strcpy( tmp_dirent.d_name, the_jnode->name ); 200f7d4: 92 10 00 1d mov %i5, %o1 200f7d8: 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 ); 200f7dc: d0 37 be fa sth %o0, [ %fp + -262 ] strcpy( tmp_dirent.d_name, the_jnode->name ); 200f7e0: 40 00 05 4f call 2010d1c 200f7e4: 90 07 be fc add %fp, -260, %o0 memcpy( 200f7e8: 90 06 40 13 add %i1, %l3, %o0 200f7ec: 92 07 be e8 add %fp, -280, %o1 200f7f0: 40 00 05 4b call 2010d1c 200f7f4: 94 10 21 18 mov 0x118, %o2 buffer + bytes_transferred, (void *)&tmp_dirent, sizeof( struct dirent ) ); iop->offset += sizeof( struct dirent ); 200f7f8: c4 1e 20 08 ldd [ %i0 + 8 ], %g2 #include "imfs.h" #include #include ssize_t imfs_dir_read( 200f7fc: b6 06 e1 18 add %i3, 0x118, %i3 memcpy( buffer + bytes_transferred, (void *)&tmp_dirent, sizeof( struct dirent ) ); iop->offset += sizeof( struct dirent ); 200f800: ba 80 e1 18 addcc %g3, 0x118, %i5 200f804: b8 40 a0 00 addx %g2, 0, %i4 200f808: f8 3e 20 08 std %i4, [ %i0 + 8 ] bytes_transferred += sizeof( struct dirent ); 200f80c: 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 ( 200f810: 80 a4 40 1b cmp %l1, %i3 200f814: 14 bf ff e1 bg 200f798 <== NEVER TAKEN 200f818: 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; 200f81c: d0 06 20 28 ld [ %i0 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 200f820: c2 02 20 0c ld [ %o0 + 0xc ], %g1 200f824: c2 00 60 04 ld [ %g1 + 4 ], %g1 200f828: 9f c0 40 00 call %g1 200f82c: b0 10 00 13 mov %l3, %i0 } rtems_filesystem_instance_unlock( &iop->pathinfo ); return bytes_transferred; } 200f830: 81 c7 e0 08 ret 200f834: 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; 200f838: 10 bf ff f9 b 200f81c <== NOT EXECUTED 200f83c: a6 10 20 00 clr %l3 <== NOT EXECUTED =============================================================================== 02027cf4 : /** * Initialize useable but dummy databases */ void init_etc_passwd_group(void) { 2027cf4: 9d e3 bf a0 save %sp, -96, %sp FILE *fp; static char etc_passwd_initted = 0; if (etc_passwd_initted) 2027cf8: 03 00 81 9a sethi %hi(0x2066800), %g1 2027cfc: c4 48 63 e0 ldsb [ %g1 + 0x3e0 ], %g2 ! 2066be0 2027d00: 80 a0 a0 00 cmp %g2, 0 2027d04: 02 80 00 04 be 2027d14 2027d08: 84 10 20 01 mov 1, %g2 2027d0c: 81 c7 e0 08 ret 2027d10: 81 e8 00 00 restore return; etc_passwd_initted = 1; mkdir("/etc", 0777); 2027d14: 92 10 21 ff mov 0x1ff, %o1 FILE *fp; static char etc_passwd_initted = 0; if (etc_passwd_initted) return; etc_passwd_initted = 1; 2027d18: c4 28 63 e0 stb %g2, [ %g1 + 0x3e0 ] mkdir("/etc", 0777); 2027d1c: 11 00 81 77 sethi %hi(0x205dc00), %o0 2027d20: 7f ff 6e df call 200389c 2027d24: 90 12 23 c8 or %o0, 0x3c8, %o0 ! 205dfc8 /* * Initialize /etc/passwd */ if ((fp = fopen("/etc/passwd", "r")) != NULL) { 2027d28: 39 00 81 77 sethi %hi(0x205dc00), %i4 2027d2c: 3b 00 81 8a sethi %hi(0x2062800), %i5 2027d30: 90 17 23 d0 or %i4, 0x3d0, %o0 2027d34: 40 00 52 fd call 203c928 2027d38: 92 17 60 58 or %i5, 0x58, %o1 2027d3c: 80 a2 20 00 cmp %o0, 0 2027d40: 22 80 00 0d be,a 2027d74 2027d44: 90 17 23 d0 or %i4, 0x3d0, %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); 2027d48: 40 00 50 9a call 203bfb0 2027d4c: 01 00 00 00 nop } /* * Initialize /etc/group */ if ((fp = fopen("/etc/group", "r")) != NULL) { 2027d50: 39 00 81 78 sethi %hi(0x205e000), %i4 2027d54: 92 17 60 58 or %i5, 0x58, %o1 2027d58: 40 00 52 f4 call 203c928 2027d5c: 90 17 20 48 or %i4, 0x48, %o0 2027d60: 80 a2 20 00 cmp %o0, 0 2027d64: 22 80 00 11 be,a 2027da8 2027d68: 90 17 20 48 or %i4, 0x48, %o0 fclose(fp); 2027d6c: 40 00 50 91 call 203bfb0 2027d70: 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) { 2027d74: 13 00 81 6f sethi %hi(0x205bc00), %o1 2027d78: 40 00 52 ec call 203c928 2027d7c: 92 12 63 90 or %o1, 0x390, %o1 ! 205bf90 2027d80: b8 92 20 00 orcc %o0, 0, %i4 2027d84: 02 bf ff f3 be 2027d50 <== NEVER TAKEN 2027d88: 92 10 20 01 mov 1, %o1 fprintf(fp, "root:*:0:0:root::/:/bin/sh\n" 2027d8c: 94 10 20 66 mov 0x66, %o2 2027d90: 96 10 00 1c mov %i4, %o3 2027d94: 11 00 81 77 sethi %hi(0x205dc00), %o0 2027d98: 40 00 57 b3 call 203dc64 2027d9c: 90 12 23 e0 or %o0, 0x3e0, %o0 ! 205dfe0 "rtems:*:1:1:RTEMS Application::/:/bin/sh\n" "tty:!:2:2:tty owner::/:/bin/false\n" ); fclose(fp); 2027da0: 10 bf ff ea b 2027d48 2027da4: 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) { 2027da8: 13 00 81 6f sethi %hi(0x205bc00), %o1 2027dac: 40 00 52 df call 203c928 2027db0: 92 12 63 90 or %o1, 0x390, %o1 ! 205bf90 2027db4: b0 92 20 00 orcc %o0, 0, %i0 2027db8: 02 bf ff d5 be 2027d0c <== NEVER TAKEN 2027dbc: 92 10 20 01 mov 1, %o1 fprintf( fp, "root:x:0:root\n" 2027dc0: 11 00 81 78 sethi %hi(0x205e000), %o0 2027dc4: 94 10 20 2a mov 0x2a, %o2 2027dc8: 96 10 00 18 mov %i0, %o3 2027dcc: 40 00 57 a6 call 203dc64 2027dd0: 90 12 20 58 or %o0, 0x58, %o0 "rtems:x:1:rtems\n" "tty:x:2:tty\n" ); fclose(fp); 2027dd4: 40 00 50 77 call 203bfb0 2027dd8: 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 76 sethi %hi(0x201d800), %g2 20063fc: c6 00 a1 a8 ld [ %g2 + 0x1a8 ], %g3 ! 201d9a8 <__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 76 sethi %hi(0x201d800), %g2 2006444: c4 00 a0 30 ld [ %g2 + 0x30 ], %g2 ! 201d830 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 =============================================================================== 0201ac94 : int killinfo( pid_t pid, int sig, const union sigval *value ) { 201ac94: 9d e3 bf 90 save %sp, -112, %sp POSIX_signals_Siginfo_node *psiginfo; /* * Only supported for the "calling process" (i.e. this node). */ if ( pid != getpid() ) 201ac98: 7f ff ff 63 call 201aa24 201ac9c: 01 00 00 00 nop 201aca0: 80 a2 00 18 cmp %o0, %i0 201aca4: 12 80 00 af bne 201af60 201aca8: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); /* * Validate the signal passed. */ if ( !sig ) 201acac: 02 80 00 b3 be 201af78 201acb0: 82 06 7f ff add %i1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 201acb4: 80 a0 60 1f cmp %g1, 0x1f 201acb8: 18 80 00 b0 bgu 201af78 201acbc: a1 2e 60 02 sll %i1, 2, %l0 rtems_set_errno_and_return_minus_one( EINVAL ); /* * If the signal is being ignored, then we are out of here. */ if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) 201acc0: 31 00 80 7a sethi %hi(0x201e800), %i0 201acc4: a3 2e 60 04 sll %i1, 4, %l1 201acc8: b0 16 20 a0 or %i0, 0xa0, %i0 201accc: 84 24 40 10 sub %l1, %l0, %g2 201acd0: 84 06 00 02 add %i0, %g2, %g2 201acd4: c4 00 a0 08 ld [ %g2 + 8 ], %g2 201acd8: 80 a0 a0 01 cmp %g2, 1 201acdc: 02 80 00 9f be 201af58 201ace0: 80 a6 60 04 cmp %i1, 4 /* * P1003.1c/Draft 10, p. 33 says that certain signals should always * be directed to the executing thread such as those caused by hardware * faults. */ if ( (sig == SIGFPE) || (sig == SIGILL) || (sig == SIGSEGV ) ) 201ace4: 02 80 00 41 be 201ade8 201ace8: 80 a6 60 08 cmp %i1, 8 201acec: 02 80 00 3f be 201ade8 201acf0: 80 a6 60 0b cmp %i1, 0xb 201acf4: 02 80 00 3d be 201ade8 201acf8: ba 10 20 01 mov 1, %i5 /* * Build up a siginfo structure */ siginfo = &siginfo_struct; siginfo->si_signo = sig; 201acfc: f2 27 bf f4 st %i1, [ %fp + -12 ] siginfo->si_code = SI_USER; 201ad00: fa 27 bf f8 st %i5, [ %fp + -8 ] if ( !value ) { 201ad04: 80 a6 a0 00 cmp %i2, 0 201ad08: 02 80 00 3e be 201ae00 201ad0c: bb 2f 40 01 sll %i5, %g1, %i5 siginfo->si_value.sival_int = 0; } else { siginfo->si_value = *value; 201ad10: c2 06 80 00 ld [ %i2 ], %g1 201ad14: c2 27 bf fc st %g1, [ %fp + -4 ] * * 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; 201ad18: 03 00 80 78 sethi %hi(0x201e000), %g1 201ad1c: c4 00 63 20 ld [ %g1 + 0x320 ], %g2 ! 201e320 <_Thread_Dispatch_disable_level> ++level; 201ad20: 84 00 a0 01 inc %g2 _Thread_Dispatch_disable_level = level; 201ad24: c4 20 63 20 st %g2, [ %g1 + 0x320 ] */ void _POSIX_signals_Manager_Initialization(void); static inline void _POSIX_signals_Add_post_switch_extension(void) { _API_extensions_Add_post_switch( &_POSIX_signals_Post_switch ); 201ad28: 11 00 80 76 sethi %hi(0x201d800), %o0 201ad2c: 7f ff b6 08 call 200854c <_API_extensions_Add_post_switch> 201ad30: 90 12 20 f4 or %o0, 0xf4, %o0 ! 201d8f4 <_POSIX_signals_Post_switch> /* * Is the currently executing thread interested? If so then it will * get it an execute it as soon as the dispatcher executes. */ the_thread = _Thread_Executing; 201ad34: 03 00 80 7a sethi %hi(0x201e800), %g1 201ad38: d0 00 60 50 ld [ %g1 + 0x50 ], %o0 ! 201e850 <_Per_CPU_Information+0x10> api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( _POSIX_signals_Is_interested( api, mask ) ) { 201ad3c: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 201ad40: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 201ad44: 80 af 40 01 andncc %i5, %g1, %g0 201ad48: 12 80 00 17 bne 201ada4 201ad4c: 09 00 80 7a sethi %hi(0x201e800), %g4 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 201ad50: c2 01 22 2c ld [ %g4 + 0x22c ], %g1 ! 201ea2c <_POSIX_signals_Wait_queue> 201ad54: 88 11 22 2c or %g4, 0x22c, %g4 /* XXX violation of visibility -- need to define thread queue support */ the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); 201ad58: 88 01 20 04 add %g4, 4, %g4 201ad5c: 80 a0 40 04 cmp %g1, %g4 201ad60: 32 80 00 0d bne,a 201ad94 201ad64: c4 00 60 30 ld [ %g1 + 0x30 ], %g2 * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 201ad68: 10 80 00 28 b 201ae08 201ad6c: 03 00 80 75 sethi %hi(0x201d400), %g1 /* * Is this thread is blocked waiting for another signal but has * not blocked this one? */ if (~api->signals_blocked & mask) 201ad70: c4 00 e0 d0 ld [ %g3 + 0xd0 ], %g2 201ad74: 80 af 40 02 andncc %i5, %g2, %g0 201ad78: 12 80 00 0b bne 201ada4 201ad7c: 90 10 00 01 mov %g1, %o0 the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); !_Chain_Is_tail( the_chain, the_node ) ; the_node = the_node->next ) { 201ad80: c2 00 40 00 ld [ %g1 ], %g1 /* XXX violation of visibility -- need to define thread queue support */ the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); 201ad84: 80 a0 40 04 cmp %g1, %g4 201ad88: 22 80 00 20 be,a 201ae08 <== ALWAYS TAKEN 201ad8c: 03 00 80 75 sethi %hi(0x201d400), %g1 #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 201ad90: c4 00 60 30 ld [ %g1 + 0x30 ], %g2 ! 201d430 <__mprec_tens><== NOT EXECUTED 201ad94: 80 8f 40 02 btst %i5, %g2 201ad98: 02 bf ff f6 be 201ad70 201ad9c: c6 00 61 5c ld [ %g1 + 0x15c ], %g3 the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); !_Chain_Is_tail( the_chain, the_node ) ; the_node = the_node->next ) { 201ada0: 90 10 00 01 mov %g1, %o0 /* * Returns true if the signal was synchronously given to a thread * blocked waiting for the signal. */ if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) { 201ada4: 92 10 00 19 mov %i1, %o1 201ada8: 40 00 00 8b call 201afd4 <_POSIX_signals_Unblock_thread> 201adac: 94 07 bf f4 add %fp, -12, %o2 201adb0: 80 8a 20 ff btst 0xff, %o0 201adb4: 12 80 00 09 bne 201add8 201adb8: 01 00 00 00 nop /* * We may have woken up a thread but we definitely need to post the * signal to the process wide information set. */ _POSIX_signals_Set_process_signals( mask ); 201adbc: 40 00 00 7d call 201afb0 <_POSIX_signals_Set_process_signals> 201adc0: 90 10 00 1d mov %i5, %o0 if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 201adc4: a0 24 40 10 sub %l1, %l0, %l0 201adc8: c2 06 00 10 ld [ %i0 + %l0 ], %g1 201adcc: 80 a0 60 02 cmp %g1, 2 201add0: 02 80 00 4f be 201af0c 201add4: 11 00 80 7a sethi %hi(0x201e800), %o0 /* * Returns true if the signal was synchronously given to a thread * blocked waiting for the signal. */ if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) { _Thread_Enable_dispatch(); 201add8: 7f ff be 68 call 200a778 <_Thread_Enable_dispatch> 201addc: b0 10 20 00 clr %i0 201ade0: 81 c7 e0 08 ret 201ade4: 81 e8 00 00 restore * P1003.1c/Draft 10, p. 33 says that certain signals should always * be directed to the executing thread such as those caused by hardware * faults. */ if ( (sig == SIGFPE) || (sig == SIGILL) || (sig == SIGSEGV ) ) return pthread_kill( pthread_self(), sig ); 201ade8: 40 00 01 13 call 201b234 201adec: 01 00 00 00 nop 201adf0: 40 00 00 d2 call 201b138 201adf4: 92 10 00 19 mov %i1, %o1 201adf8: 81 c7 e0 08 ret 201adfc: 91 e8 00 08 restore %g0, %o0, %o0 */ siginfo = &siginfo_struct; siginfo->si_signo = sig; siginfo->si_code = SI_USER; if ( !value ) { siginfo->si_value.sival_int = 0; 201ae00: 10 bf ff c6 b 201ad18 201ae04: c0 27 bf fc clr [ %fp + -4 ] * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 201ae08: f8 08 62 7c ldub [ %g1 + 0x27c ], %i4 201ae0c: 1b 00 80 78 sethi %hi(0x201e000), %o5 201ae10: b8 07 20 01 inc %i4 201ae14: 9a 13 62 8c or %o5, 0x28c, %o5 * * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; 201ae18: 90 10 20 00 clr %o0 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 201ae1c: 98 03 60 08 add %o5, 8, %o4 */ RTEMS_INLINE_ROUTINE bool _States_Is_interruptible_by_signal ( States_Control the_states ) { return (the_states & STATES_INTERRUPTIBLE_BY_SIGNAL); 201ae20: 17 04 00 00 sethi %hi(0x10000000), %o3 for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { /* * This can occur when no one is interested and an API is not configured. */ if ( !_Objects_Information_table[ the_api ] ) 201ae24: c2 03 40 00 ld [ %o5 ], %g1 201ae28: 80 a0 60 00 cmp %g1, 0 201ae2c: 22 80 00 31 be,a 201aef0 <== NEVER TAKEN 201ae30: 9a 03 60 04 add %o5, 4, %o5 <== NOT EXECUTED continue; the_info = _Objects_Information_table[ the_api ][ 1 ]; 201ae34: c2 00 60 04 ld [ %g1 + 4 ], %g1 */ if ( !the_info ) continue; #endif maximum = the_info->maximum; 201ae38: f6 10 60 10 lduh [ %g1 + 0x10 ], %i3 object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201ae3c: 80 a6 e0 00 cmp %i3, 0 201ae40: 02 80 00 2b be 201aeec 201ae44: f4 00 60 1c ld [ %g1 + 0x1c ], %i2 201ae48: 84 10 20 01 mov 1, %g2 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 201ae4c: 87 28 a0 02 sll %g2, 2, %g3 maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { the_thread = (Thread_Control *) object_table[ index ]; 201ae50: c6 06 80 03 ld [ %i2 + %g3 ], %g3 if ( !the_thread ) 201ae54: 80 a0 e0 00 cmp %g3, 0 201ae58: 22 80 00 22 be,a 201aee0 201ae5c: 84 00 a0 01 inc %g2 /* * If this thread is of lower priority than the interested thread, * go on to the next thread. */ if ( the_thread->current_priority > interested_priority ) 201ae60: c8 00 e0 14 ld [ %g3 + 0x14 ], %g4 201ae64: 80 a1 00 1c cmp %g4, %i4 201ae68: 38 80 00 1e bgu,a 201aee0 201ae6c: 84 00 a0 01 inc %g2 #if defined(RTEMS_DEBUG) if ( !api ) continue; #endif if ( !_POSIX_signals_Is_interested( api, mask ) ) 201ae70: de 00 e1 5c ld [ %g3 + 0x15c ], %o7 201ae74: de 03 e0 d0 ld [ %o7 + 0xd0 ], %o7 201ae78: 80 af 40 0f andncc %i5, %o7, %g0 201ae7c: 22 80 00 19 be,a 201aee0 201ae80: 84 00 a0 01 inc %g2 * * NOTE: We initialized interested_priority to PRIORITY_MAXIMUM + 1 * so we never have to worry about deferencing a NULL * interested thread. */ if ( the_thread->current_priority < interested_priority ) { 201ae84: 80 a1 00 1c cmp %g4, %i4 201ae88: 2a 80 00 14 bcs,a 201aed8 201ae8c: b8 10 00 04 mov %g4, %i4 * and blocking interruptibutable by signal. * * If the interested thread is ready, don't think about changing. */ if ( interested && !_States_Is_ready( interested->current_state ) ) { 201ae90: 80 a2 20 00 cmp %o0, 0 201ae94: 22 80 00 13 be,a 201aee0 <== NEVER TAKEN 201ae98: 84 00 a0 01 inc %g2 <== NOT EXECUTED 201ae9c: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 201aea0: 80 a0 60 00 cmp %g1, 0 201aea4: 22 80 00 0f be,a 201aee0 <== NEVER TAKEN 201aea8: 84 00 a0 01 inc %g2 <== NOT EXECUTED /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 201aeac: de 00 e0 10 ld [ %g3 + 0x10 ], %o7 201aeb0: 80 a3 e0 00 cmp %o7, 0 201aeb4: 22 80 00 09 be,a 201aed8 201aeb8: b8 10 00 04 mov %g4, %i4 continue; } DEBUG_STEP("6"); /* prefer blocked/interruptible over blocked/not interruptible */ if ( !_States_Is_interruptible_by_signal(interested->current_state) ) { 201aebc: 80 88 40 0b btst %g1, %o3 201aec0: 32 80 00 08 bne,a 201aee0 201aec4: 84 00 a0 01 inc %g2 DEBUG_STEP("7"); if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) { 201aec8: 80 8b c0 0b btst %o7, %o3 201aecc: 22 80 00 05 be,a 201aee0 201aed0: 84 00 a0 01 inc %g2 */ if ( interested && !_States_Is_ready( interested->current_state ) ) { /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 201aed4: b8 10 00 04 mov %g4, %i4 201aed8: 90 10 00 03 mov %g3, %o0 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201aedc: 84 00 a0 01 inc %g2 201aee0: 80 a6 c0 02 cmp %i3, %g2 201aee4: 1a bf ff db bcc 201ae50 201aee8: 87 28 a0 02 sll %g2, 2, %g3 201aeec: 9a 03 60 04 add %o5, 4, %o5 * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { 201aef0: 80 a3 40 0c cmp %o5, %o4 201aef4: 32 bf ff cd bne,a 201ae28 201aef8: c2 03 40 00 ld [ %o5 ], %g1 } } } } if ( interested ) { 201aefc: 80 a2 20 00 cmp %o0, 0 201af00: 12 bf ff aa bne 201ada8 201af04: 92 10 00 19 mov %i1, %o1 201af08: 30 bf ff ad b,a 201adbc */ _POSIX_signals_Set_process_signals( mask ); if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { psiginfo = (POSIX_signals_Siginfo_node *) 201af0c: 7f ff b5 f5 call 20086e0 <_Chain_Get> 201af10: 90 12 22 20 or %o0, 0x220, %o0 _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { 201af14: 92 92 20 00 orcc %o0, 0, %o1 201af18: 02 80 00 1e be 201af90 201af1c: c2 07 bf f4 ld [ %fp + -12 ], %g1 rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201af20: 11 00 80 7a sethi %hi(0x201e800), %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 201af24: c2 22 60 08 st %g1, [ %o1 + 8 ] 201af28: c2 07 bf f8 ld [ %fp + -8 ], %g1 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201af2c: 90 12 22 98 or %o0, 0x298, %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 201af30: c2 22 60 0c st %g1, [ %o1 + 0xc ] 201af34: c2 07 bf fc ld [ %fp + -4 ], %g1 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201af38: 90 02 00 10 add %o0, %l0, %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 201af3c: c2 22 60 10 st %g1, [ %o1 + 0x10 ] _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201af40: 7f ff b5 dd call 20086b4 <_Chain_Append> 201af44: b0 10 20 00 clr %i0 /* * Returns true if the signal was synchronously given to a thread * blocked waiting for the signal. */ if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) { _Thread_Enable_dispatch(); 201af48: 7f ff be 0c call 200a778 <_Thread_Enable_dispatch> 201af4c: 01 00 00 00 nop 201af50: 81 c7 e0 08 ret 201af54: 81 e8 00 00 restore } DEBUG_STEP("\n"); _Thread_Enable_dispatch(); return 0; } 201af58: 81 c7 e0 08 ret 201af5c: 91 e8 20 00 restore %g0, 0, %o0 /* * Only supported for the "calling process" (i.e. this node). */ if ( pid != getpid() ) rtems_set_errno_and_return_minus_one( ESRCH ); 201af60: 7f ff d5 1e call 20103d8 <__errno> 201af64: b0 10 3f ff mov -1, %i0 201af68: 82 10 20 03 mov 3, %g1 201af6c: c2 22 00 00 st %g1, [ %o0 ] 201af70: 81 c7 e0 08 ret 201af74: 81 e8 00 00 restore */ if ( !sig ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) rtems_set_errno_and_return_minus_one( EINVAL ); 201af78: 7f ff d5 18 call 20103d8 <__errno> 201af7c: b0 10 3f ff mov -1, %i0 201af80: 82 10 20 16 mov 0x16, %g1 201af84: c2 22 00 00 st %g1, [ %o0 ] 201af88: 81 c7 e0 08 ret 201af8c: 81 e8 00 00 restore if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { psiginfo = (POSIX_signals_Siginfo_node *) _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { _Thread_Enable_dispatch(); 201af90: 7f ff bd fa call 200a778 <_Thread_Enable_dispatch> 201af94: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EAGAIN ); 201af98: 7f ff d5 10 call 20103d8 <__errno> 201af9c: 01 00 00 00 nop 201afa0: 82 10 20 0b mov 0xb, %g1 ! b 201afa4: c2 22 00 00 st %g1, [ %o0 ] 201afa8: 81 c7 e0 08 ret 201afac: 81 e8 00 00 restore =============================================================================== 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 7a sethi %hi(0x201e800), %g1 2003f44: c2 00 60 38 ld [ %g1 + 0x38 ], %g1 ! 201e838 <_System_state_Current> 2003f48: 80 a0 60 03 cmp %g1, 3 2003f4c: 02 80 00 04 be 2003f5c <== ALWAYS TAKEN 2003f50: 3b 00 80 76 sethi %hi(0x201d800), %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 72 sethi %hi(0x201c800), %g2 2003f60: c2 07 61 b0 ld [ %i5 + 0x1b0 ], %g1 2003f64: f8 00 a3 f8 ld [ %g2 + 0x3f8 ], %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 34 48 call 2011094 <_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 61 b0 st %i4, [ %i5 + 0x1b0 ] * * Should this be changed to do *all* file streams? * _fwalk (_REENT, fclose); */ fclose (stdin); 2003f80: 40 00 31 68 call 2010520 2003f84: d0 07 20 04 ld [ %i4 + 4 ], %o0 fclose (stdout); 2003f88: c2 07 61 b0 ld [ %i5 + 0x1b0 ], %g1 2003f8c: 40 00 31 65 call 2010520 2003f90: d0 00 60 08 ld [ %g1 + 8 ], %o0 fclose (stderr); 2003f94: c2 07 61 b0 ld [ %i5 + 0x1b0 ], %g1 2003f98: f0 00 60 0c ld [ %g1 + 0xc ], %i0 2003f9c: 40 00 31 61 call 2010520 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 78 sethi %hi(0x201e000), %g1 20039e0: 82 10 61 a0 or %g1, 0x1a0, %g1 ! 201e1a0 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 7a sethi %hi(0x201e800), %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 60 38 ld [ %g1 + 0x38 ], %g1 ! 201e838 <_System_state_Current> 2003a04: 80 a0 60 03 cmp %g1, 3 2003a08: 02 80 00 1c be 2003a78 2003a0c: 39 00 80 75 sethi %hi(0x201d400), %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 23 00 ld [ %i4 + 0x300 ], %o0 ! 201d700 2003a14: 92 10 00 18 mov %i0, %o1 2003a18: 94 10 20 00 clr %o2 2003a1c: 40 00 18 07 call 2009a38 <_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 23 00 ld [ %i4 + 0x300 ], %o0 } /* * If the user wants us to dirty the allocated memory, then do it. */ if ( rtems_malloc_dirty_helper ) 2003a30: 03 00 80 77 sethi %hi(0x201dc00), %g1 2003a34: c2 00 62 dc ld [ %g1 + 0x2dc ], %g1 ! 201dedc 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 77 sethi %hi(0x201dc00), %g1 2003a50: c2 00 62 e0 ld [ %g1 + 0x2e0 ], %g1 ! 201dee0 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 6d sethi %hi(0x201b400), %g1 2003a9c: c2 00 61 10 ld [ %g1 + 0x110 ], %g1 ! 201b510 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 77 sethi %hi(0x201dc00), %g1 errno = ENOMEM; 2003ab4: 40 00 32 49 call 20103d8 <__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 =============================================================================== 0200e840 : * Allocate a block for an in-memory file. */ int memfile_blocks_allocated = 0; void *memfile_alloc_block(void) { 200e840: 9d e3 bf a0 save %sp, -96, %sp void *memory; memory = (void *)calloc(1, IMFS_MEMFILE_BYTES_PER_BLOCK); 200e844: 03 00 80 77 sethi %hi(0x201dc00), %g1 200e848: d2 00 63 08 ld [ %g1 + 0x308 ], %o1 ! 201df08 200e84c: 7f ff d2 da call 20033b4 200e850: 90 10 20 01 mov 1, %o0 if ( memory ) 200e854: b0 92 20 00 orcc %o0, 0, %i0 200e858: 02 80 00 05 be 200e86c <== NEVER TAKEN 200e85c: 03 00 80 78 sethi %hi(0x201e000), %g1 memfile_blocks_allocated++; 200e860: c4 00 60 1c ld [ %g1 + 0x1c ], %g2 ! 201e01c 200e864: 84 00 a0 01 inc %g2 200e868: c4 20 60 1c st %g2, [ %g1 + 0x1c ] return memory; } 200e86c: 81 c7 e0 08 ret 200e870: 81 e8 00 00 restore =============================================================================== 0200edb8 : */ static void memfile_free_blocks_in_table( block_p **block_table, int entries ) { 200edb8: 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 200edc4: d0 06 00 00 ld [ %i0 ], %o0 200edc8: ba 10 00 08 mov %o0, %i5 200edcc: b8 10 20 00 clr %i4 if ( b[i] ) { 200edd0: d0 07 40 00 ld [ %i5 ], %o0 200edd4: 80 a2 20 00 cmp %o0, 0 200edd8: 02 80 00 05 be 200edec 200eddc: b8 07 20 01 inc %i4 memfile_free_block( b[i] ); 200ede0: 7f ff ff ed call 200ed94 200ede4: 01 00 00 00 nop b[i] = 0; 200ede8: 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 200edf4: ba 07 60 04 add %i5, 4, %i5 200edf8: 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 ); 200edfc: 7f ff ff e6 call 200ed94 200ee00: 01 00 00 00 nop *block_table = 0; 200ee04: c0 26 00 00 clr [ %i0 ] 200ee08: 81 c7 e0 08 ret 200ee0c: 81 e8 00 00 restore =============================================================================== 0200f44c : int memfile_ftruncate( rtems_libio_t *iop, off_t length ) { 200f44c: 9d e3 bf 98 save %sp, -104, %sp IMFS_jnode_t *the_jnode; the_jnode = iop->pathinfo.node_access; 200f450: 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 ) 200f454: c2 07 60 50 ld [ %i5 + 0x50 ], %g1 200f458: 80 a0 40 19 cmp %g1, %i1 200f45c: 06 80 00 11 bl 200f4a0 <== NEVER TAKEN 200f460: 90 10 00 1d mov %i5, %o0 200f464: 22 80 00 0b be,a 200f490 <== ALWAYS TAKEN 200f468: 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; 200f46c: f2 27 60 50 st %i1, [ %i5 + 0x50 ] <== NOT EXECUTED 200f470: f4 27 60 54 st %i2, [ %i5 + 0x54 ] IMFS_update_atime( the_jnode ); 200f474: 90 07 bf f8 add %fp, -8, %o0 200f478: 7f ff d0 a8 call 2003718 200f47c: 92 10 20 00 clr %o1 200f480: c2 07 bf f8 ld [ %fp + -8 ], %g1 200f484: c2 27 60 40 st %g1, [ %i5 + 0x40 ] return 0; } 200f488: 81 c7 e0 08 ret 200f48c: 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 ) 200f490: 80 a0 40 1a cmp %g1, %i2 200f494: 3a bf ff f7 bcc,a 200f470 200f498: f2 27 60 50 st %i1, [ %i5 + 0x50 ] return IMFS_memfile_extend( the_jnode, true, length ); 200f49c: 90 10 00 1d mov %i5, %o0 200f4a0: 92 10 20 01 mov 1, %o1 200f4a4: 94 10 00 19 mov %i1, %o2 200f4a8: 7f ff fe c4 call 200efb8 200f4ac: 96 10 00 1a mov %i2, %o3 200f4b0: 81 c7 e0 08 ret 200f4b4: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200f3d0 : rtems_libio_t *iop, const char *pathname, int oflag, mode_t mode ) { 200f3d0: 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) 200f3d4: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 200f3d8: 80 88 60 04 btst 4, %g1 200f3dc: 02 80 00 07 be 200f3f8 200f3e0: d0 06 20 1c ld [ %i0 + 0x1c ], %o0 200f3e4: c2 02 20 4c ld [ %o0 + 0x4c ], %g1 && (IMFS_type( the_jnode ) == IMFS_LINEAR_FILE)) { 200f3e8: c2 00 40 00 ld [ %g1 ], %g1 200f3ec: 80 a0 60 05 cmp %g1, 5 200f3f0: 22 80 00 04 be,a 200f400 <== NEVER TAKEN 200f3f4: 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; 200f3f8: 81 c7 e0 08 ret 200f3fc: 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; 200f400: d6 02 20 58 ld [ %o0 + 0x58 ], %o3 <== NOT EXECUTED the_jnode->control = &IMFS_node_control_memfile; 200f404: 03 00 80 71 sethi %hi(0x201c400), %g1 <== NOT EXECUTED the_jnode->info.file.size = 0; 200f408: 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; 200f40c: 82 10 60 84 or %g1, 0x84, %g1 <== NOT EXECUTED the_jnode->info.file.size = 0; 200f410: c0 22 20 54 clr [ %o0 + 0x54 ] <== NOT EXECUTED the_jnode->info.file.indirect = 0; 200f414: 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; 200f418: 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; 200f41c: c0 22 20 5c clr [ %o0 + 0x5c ] <== NOT EXECUTED the_jnode->info.file.triply_indirect = 0; if ((count != 0) 200f420: 80 a3 20 00 cmp %o4, 0 <== NOT EXECUTED 200f424: 02 bf ff f5 be 200f3f8 <== NOT EXECUTED 200f428: c0 22 20 60 clr [ %o0 + 0x60 ] <== NOT EXECUTED && (IMFS_memfile_write(the_jnode, 0, buffer, count) == -1)) 200f42c: 92 10 20 00 clr %o1 <== NOT EXECUTED 200f430: 7f ff ff 53 call 200f17c <== NOT EXECUTED 200f434: 94 10 20 00 clr %o2 <== NOT EXECUTED return -1; 200f438: 90 38 00 08 xnor %g0, %o0, %o0 <== NOT EXECUTED 200f43c: 80 a0 00 08 cmp %g0, %o0 <== NOT EXECUTED 200f440: b0 40 3f ff addx %g0, -1, %i0 <== NOT EXECUTED } return 0; } 200f444: 81 c7 e0 08 ret <== NOT EXECUTED 200f448: 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 a0 call 200ca80 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 37 54 call 201196c 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 37 51 call 201196c 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 37 49 call 201196c 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 34 29 call 2010d1c 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 34 20 call 2010d1c 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 34 1a call 2010d1c 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 70 sethi %hi(0x201c000), %g1 2003cc8: 82 10 60 94 or %g1, 0x94, %g1 ! 201c094 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 8c call 2008720 <_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 78 sethi %hi(0x201e000), %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 21 9c ld [ %i4 + 0x19c ], %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 21 9c ld [ %i4 + 0x19c ], %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 76 sethi %hi(0x201d800), %g1 2003ddc: 82 10 60 18 or %g1, 0x18, %g1 ! 201d818 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 36 db call 201196c 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 70 sethi %hi(0x201c000), %l5 2003e0c: a6 10 20 02 mov 2, %l3 2003e10: aa 15 60 90 or %l5, 0x90, %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 31 64 call 20103d8 <__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 31 5e call 20103d8 <__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 78 sethi %hi(0x201e000), %i4 2003e7c: d0 07 21 9c ld [ %i4 + 0x19c ], %o0 ! 201e19c 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 76 sethi %hi(0x201d800), %g1 ) { int rv = 0; rtems_filesystem_mt_lock(); if ( rtems_chain_is_empty( &rtems_filesystem_mount_table ) ) { 2003e90: c4 00 60 18 ld [ %g1 + 0x18 ], %g2 ! 201d818 2003e94: 82 10 60 18 or %g1, 0x18, %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 21 9c ld [ %i4 + 0x19c ], %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 76 sethi %hi(0x201d800), %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 20 38 ld [ %i4 + 0x38 ], %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 20 38 ld [ %i4 + 0x38 ], %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 31 2f call 20103d8 <__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 21 9c ld [ %i4 + 0x19c ], %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 68 69 call 2023268 <__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 ] =============================================================================== 02007d4c : int oflag, ... /* mode_t mode, */ /* struct mq_attr attr */ ) { 2007d4c: 9d e3 bf 88 save %sp, -120, %sp * * 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; 2007d50: 03 00 80 8b sethi %hi(0x2022c00), %g1 2007d54: c4 00 61 d0 ld [ %g1 + 0x1d0 ], %g2 ! 2022dd0 <_Thread_Dispatch_disable_level> size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 2007d58: f4 27 a0 4c st %i2, [ %fp + 0x4c ] ++level; 2007d5c: 84 00 a0 01 inc %g2 2007d60: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 2007d64: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2007d68: fa 27 a0 58 st %i5, [ %fp + 0x58 ] _Thread_Dispatch_disable_level = level; 2007d6c: c4 20 61 d0 st %g2, [ %g1 + 0x1d0 ] Objects_Locations location; size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 2007d70: a2 8e 62 00 andcc %i1, 0x200, %l1 2007d74: 12 80 00 36 bne 2007e4c 2007d78: a0 10 20 00 clr %l0 */ RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd * _POSIX_Message_queue_Allocate_fd( void ) { return (POSIX_Message_queue_Control_fd *) 2007d7c: 39 00 80 8c sethi %hi(0x2023000), %i4 2007d80: 40 00 0c 21 call 200ae04 <_Objects_Allocate> 2007d84: 90 17 22 b0 or %i4, 0x2b0, %o0 ! 20232b0 <_POSIX_Message_queue_Information_fds> attr = va_arg( arg, struct mq_attr * ); va_end(arg); } the_mq_fd = _POSIX_Message_queue_Allocate_fd(); if ( !the_mq_fd ) { 2007d88: ba 92 20 00 orcc %o0, 0, %i5 2007d8c: 02 80 00 39 be 2007e70 <== NEVER TAKEN 2007d90: 01 00 00 00 nop _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( ENFILE ); } the_mq_fd->oflag = oflag; 2007d94: f2 27 60 14 st %i1, [ %i5 + 0x14 ] const char *name, Objects_Id *id, size_t *len ) { return _POSIX_Name_to_id( &_POSIX_Message_queue_Information, name, id, len ); 2007d98: 35 00 80 8c sethi %hi(0x2023000), %i2 2007d9c: 92 10 00 18 mov %i0, %o1 2007da0: 90 16 a1 24 or %i2, 0x124, %o0 2007da4: 94 07 bf f0 add %fp, -16, %o2 2007da8: 40 00 01 42 call 20082b0 <_POSIX_Name_to_id> 2007dac: 96 07 bf fc add %fp, -4, %o3 * If the name to id translation worked, then the message queue exists * and we can just return a pointer to the id. Otherwise we may * need to check to see if this is a "message queue does not exist" * or some other miscellaneous error on the name. */ if ( status ) { 2007db0: b6 92 20 00 orcc %o0, 0, %i3 2007db4: 22 80 00 0f be,a 2007df0 2007db8: b2 0e 6a 00 and %i1, 0xa00, %i1 /* * Unless provided a valid name that did not already exist * and we are willing to create then it is an error. */ if ( !( status == ENOENT && (oflag & O_CREAT) ) ) { 2007dbc: 80 a6 e0 02 cmp %i3, 2 2007dc0: 02 80 00 3f be 2007ebc 2007dc4: 80 a4 60 00 cmp %l1, 0 RTEMS_INLINE_ROUTINE void _POSIX_Message_queue_Free_fd ( POSIX_Message_queue_Control_fd *the_mq_fd ) { _Objects_Free( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object ); 2007dc8: 90 17 22 b0 or %i4, 0x2b0, %o0 2007dcc: 40 00 0d 06 call 200b1e4 <_Objects_Free> 2007dd0: 92 10 00 1d mov %i5, %o1 _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); 2007dd4: 40 00 11 8f call 200c410 <_Thread_Enable_dispatch> 2007dd8: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, mqd_t ); 2007ddc: 40 00 29 46 call 20122f4 <__errno> 2007de0: 01 00 00 00 nop 2007de4: f6 22 00 00 st %i3, [ %o0 ] 2007de8: 81 c7 e0 08 ret 2007dec: 81 e8 00 00 restore } else { /* name -> ID translation succeeded */ /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { 2007df0: 80 a6 6a 00 cmp %i1, 0xa00 2007df4: 02 80 00 27 be 2007e90 2007df8: d2 07 bf f0 ld [ %fp + -16 ], %o1 RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control *_POSIX_Message_queue_Get ( Objects_Id id, Objects_Locations *location ) { return (POSIX_Message_queue_Control *) 2007dfc: 94 07 bf f8 add %fp, -8, %o2 2007e00: 40 00 0d 5f call 200b37c <_Objects_Get> 2007e04: 90 16 a1 24 or %i2, 0x124, %o0 /* * In this case we need to do an ID->pointer conversion to * check the mode. */ the_mq = _POSIX_Message_queue_Get( the_mq_id, &location ); the_mq->open_count += 1; 2007e08: c4 02 20 18 ld [ %o0 + 0x18 ], %g2 Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 2007e0c: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 2007e10: 84 00 a0 01 inc %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007e14: b8 17 22 b0 or %i4, 0x2b0, %i4 2007e18: c4 22 20 18 st %g2, [ %o0 + 0x18 ] 2007e1c: c4 07 20 1c ld [ %i4 + 0x1c ], %g2 /* * In this case we need to do an ID->pointer conversion to * check the mode. */ the_mq = _POSIX_Message_queue_Get( the_mq_id, &location ); 2007e20: d0 27 bf f4 st %o0, [ %fp + -12 ] the_mq->open_count += 1; the_mq_fd->Queue = the_mq; 2007e24: d0 27 60 10 st %o0, [ %i5 + 0x10 ] 2007e28: 83 28 60 02 sll %g1, 2, %g1 2007e2c: fa 20 80 01 st %i5, [ %g2 + %g1 ] _Objects_Open_string( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object, NULL ); _Thread_Enable_dispatch(); 2007e30: 40 00 11 78 call 200c410 <_Thread_Enable_dispatch> 2007e34: c0 27 60 0c clr [ %i5 + 0xc ] _Thread_Enable_dispatch(); 2007e38: 40 00 11 76 call 200c410 <_Thread_Enable_dispatch> 2007e3c: 01 00 00 00 nop return (mqd_t)the_mq_fd->Object.id; 2007e40: f0 07 60 08 ld [ %i5 + 8 ], %i0 2007e44: 81 c7 e0 08 ret 2007e48: 81 e8 00 00 restore size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 2007e4c: 82 07 a0 4c add %fp, 0x4c, %g1 mode = va_arg( arg, mode_t ); attr = va_arg( arg, struct mq_attr * ); 2007e50: e0 07 a0 50 ld [ %fp + 0x50 ], %l0 size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 2007e54: c2 27 bf ec st %g1, [ %fp + -20 ] */ RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd * _POSIX_Message_queue_Allocate_fd( void ) { return (POSIX_Message_queue_Control_fd *) 2007e58: 39 00 80 8c sethi %hi(0x2023000), %i4 2007e5c: 40 00 0b ea call 200ae04 <_Objects_Allocate> 2007e60: 90 17 22 b0 or %i4, 0x2b0, %o0 ! 20232b0 <_POSIX_Message_queue_Information_fds> attr = va_arg( arg, struct mq_attr * ); va_end(arg); } the_mq_fd = _POSIX_Message_queue_Allocate_fd(); if ( !the_mq_fd ) { 2007e64: ba 92 20 00 orcc %o0, 0, %i5 2007e68: 32 bf ff cc bne,a 2007d98 2007e6c: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _Thread_Enable_dispatch(); 2007e70: 40 00 11 68 call 200c410 <_Thread_Enable_dispatch> 2007e74: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( ENFILE ); 2007e78: 40 00 29 1f call 20122f4 <__errno> 2007e7c: 01 00 00 00 nop 2007e80: 82 10 20 17 mov 0x17, %g1 ! 17 2007e84: c2 22 00 00 st %g1, [ %o0 ] 2007e88: 81 c7 e0 08 ret 2007e8c: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE void _POSIX_Message_queue_Free_fd ( POSIX_Message_queue_Control_fd *the_mq_fd ) { _Objects_Free( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object ); 2007e90: 90 17 22 b0 or %i4, 0x2b0, %o0 2007e94: 40 00 0c d4 call 200b1e4 <_Objects_Free> 2007e98: 92 10 00 1d mov %i5, %o1 /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); 2007e9c: 40 00 11 5d call 200c410 <_Thread_Enable_dispatch> 2007ea0: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, mqd_t ); 2007ea4: 40 00 29 14 call 20122f4 <__errno> 2007ea8: 01 00 00 00 nop 2007eac: 82 10 20 11 mov 0x11, %g1 ! 11 2007eb0: c2 22 00 00 st %g1, [ %o0 ] 2007eb4: 81 c7 e0 08 ret 2007eb8: 81 e8 00 00 restore if ( status ) { /* * Unless provided a valid name that did not already exist * and we are willing to create then it is an error. */ if ( !( status == ENOENT && (oflag & O_CREAT) ) ) { 2007ebc: 02 bf ff c4 be 2007dcc 2007ec0: 90 17 22 b0 or %i4, 0x2b0, %o0 /* * At this point, the message queue does not exist and everything has been * checked. We should go ahead and create a message queue. */ status = _POSIX_Message_queue_Create_support( 2007ec4: d2 07 bf fc ld [ %fp + -4 ], %o1 2007ec8: 90 10 00 18 mov %i0, %o0 2007ecc: 94 10 20 01 mov 1, %o2 2007ed0: 96 10 00 10 mov %l0, %o3 2007ed4: 40 00 1c 37 call 200efb0 <_POSIX_Message_queue_Create_support> 2007ed8: 98 07 bf f4 add %fp, -12, %o4 ); /* * errno was set by Create_support, so don't set it again. */ if ( status == -1 ) { 2007edc: 80 a2 3f ff cmp %o0, -1 2007ee0: 02 80 00 0d be 2007f14 2007ee4: c6 07 bf f4 ld [ %fp + -12 ], %g3 Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 2007ee8: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007eec: b8 17 22 b0 or %i4, 0x2b0, %i4 2007ef0: c4 07 20 1c ld [ %i4 + 0x1c ], %g2 _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); return (mqd_t) -1; } the_mq_fd->Queue = the_mq; 2007ef4: c6 27 60 10 st %g3, [ %i5 + 0x10 ] 2007ef8: 83 28 60 02 sll %g1, 2, %g1 2007efc: fa 20 80 01 st %i5, [ %g2 + %g1 ] &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object, NULL ); _Thread_Enable_dispatch(); 2007f00: 40 00 11 44 call 200c410 <_Thread_Enable_dispatch> 2007f04: c0 27 60 0c clr [ %i5 + 0xc ] return (mqd_t) the_mq_fd->Object.id; 2007f08: f0 07 60 08 ld [ %i5 + 8 ], %i0 } 2007f0c: 81 c7 e0 08 ret 2007f10: 81 e8 00 00 restore 2007f14: 90 17 22 b0 or %i4, 0x2b0, %o0 2007f18: 92 10 00 1d mov %i5, %o1 2007f1c: 40 00 0c b2 call 200b1e4 <_Objects_Free> 2007f20: b0 10 3f ff mov -1, %i0 /* * errno was set by Create_support, so don't set it again. */ if ( status == -1 ) { _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); 2007f24: 40 00 11 3b call 200c410 <_Thread_Enable_dispatch> 2007f28: 01 00 00 00 nop 2007f2c: 81 c7 e0 08 ret 2007f30: 81 e8 00 00 restore =============================================================================== 02018d5c : msdos_node_type_t type, const char *name, int name_len, mode_t mode, const fat_file_fd_t *link_fd) { 2018d5c: 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; 2018d60: 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); 2018d64: 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; 2018d68: 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; 2018d6c: 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; 2018d70: 82 10 3f ff mov -1, %g1 time_t time_ret = 0; uint16_t time_val = 0; 2018d74: c0 37 bf 68 clrh [ %fp + -152 ] uint16_t date = 0; 2018d78: 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; 2018d7c: c0 27 bf 70 clr [ %fp + -144 ] dir_pos->sname.ofs = 0; 2018d80: c0 27 bf 74 clr [ %fp + -140 ] dir_pos->lname.cln = FAT_FILE_SHORT_NAME; 2018d84: c2 27 bf 78 st %g1, [ %fp + -136 ] dir_pos->lname.ofs = FAT_FILE_SHORT_NAME; 2018d88: 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); 2018d8c: c0 27 bf 80 clr [ %fp + -128 ] 2018d90: c0 27 bf 84 clr [ %fp + -124 ] 2018d94: c0 27 20 08 clr [ %i4 + 8 ] 2018d98: c0 27 20 0c clr [ %i4 + 0xc ] 2018d9c: c0 27 20 10 clr [ %i4 + 0x10 ] 2018da0: c0 27 20 14 clr [ %i4 + 0x14 ] 2018da4: c0 27 20 18 clr [ %i4 + 0x18 ] 2018da8: c0 27 20 1c clr [ %i4 + 0x1c ] memset(dot_dotdot, 0, MSDOS_DIRECTORY_ENTRY_STRUCT_SIZE * 2); 2018dac: c0 27 bf c0 clr [ %fp + -64 ] 2018db0: c0 27 bf c4 clr [ %fp + -60 ] 2018db4: c0 27 bf c8 clr [ %fp + -56 ] 2018db8: c0 27 bf cc clr [ %fp + -52 ] 2018dbc: c0 27 bf d0 clr [ %fp + -48 ] 2018dc0: c0 27 bf d4 clr [ %fp + -44 ] 2018dc4: c0 27 bf d8 clr [ %fp + -40 ] 2018dc8: c0 27 bf dc clr [ %fp + -36 ] 2018dcc: c0 27 bf e0 clr [ %fp + -32 ] 2018dd0: c0 27 bf e4 clr [ %fp + -28 ] 2018dd4: c0 27 bf e8 clr [ %fp + -24 ] 2018dd8: c0 27 bf ec clr [ %fp + -20 ] 2018ddc: c0 27 bf f0 clr [ %fp + -16 ] 2018de0: c0 27 bf f4 clr [ %fp + -12 ] 2018de4: c0 27 bf f8 clr [ %fp + -8 ] 2018de8: c0 27 bf fc clr [ %fp + -4 ] if (name_len > MSDOS_NAME_MAX_LFN_WITH_DOT) { 2018dec: 80 a6 e1 04 cmp %i3, 0x104 2018df0: 14 80 00 e3 bg 201917c <== NEVER TAKEN 2018df4: 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, 2018df8: 90 10 00 1a mov %i2, %o0 2018dfc: 92 10 00 1b mov %i3, %o1 2018e00: 94 10 00 1c mov %i4, %o2 2018e04: 40 00 01 37 call 20192e0 2018e08: 96 10 20 0b mov 0xb, %o3 MSDOS_DIR_NAME(short_node), MSDOS_NAME_MAX); if (name_type == MSDOS_NAME_INVALID) { 2018e0c: a4 92 20 00 orcc %o0, 0, %l2 2018e10: 02 80 00 e0 be 2019190 <== NEVER TAKEN 2018e14: 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; 2018e18: c0 2f bf 8c clrb [ %fp + -116 ] /* set up last write date and time */ time_ret = time(NULL); 2018e1c: 40 00 24 0a call 2021e44