=============================================================================== 02005af8 : */ static void IMFS_dump_directory( IMFS_jnode_t *the_directory, int level ) { 2005af8: 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; 2005afc: f4 06 20 50 ld [ %i0 + 0x50 ], %i2 2005b00: 39 00 80 8f sethi %hi(0x2023c00), %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 )); 2005b04: 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 ); 2005b08: 80 a6 80 18 cmp %i2, %i0 2005b0c: 02 80 00 30 be 2005bcc 2005b10: b8 17 23 20 or %i4, 0x320, %i4 2005b14: 37 00 80 87 sethi %hi(0x2021c00), %i3 case IMFS_FIFO: fprintf(stdout, " FIFO not printed\n" ); return; default: fprintf(stdout, " bad type %d\n", IMFS_type( the_jnode ) ); 2005b18: 29 00 80 88 sethi %hi(0x2022000), %l4 return; } puts(""); 2005b1c: 21 00 80 87 sethi %hi(0x2021c00), %l0 case IMFS_SYM_LINK: fprintf(stdout, " links not printed\n" ); return; case IMFS_FIFO: fprintf(stdout, " FIFO not printed\n" ); 2005b20: 27 00 80 88 sethi %hi(0x2022000), %l3 case IMFS_HARD_LINK: fprintf(stdout, " links not printed\n" ); return; case IMFS_SYM_LINK: fprintf(stdout, " links not printed\n" ); 2005b24: 25 00 80 87 sethi %hi(0x2021c00), %l2 the_node = the_node->next ) { the_jnode = (IMFS_jnode_t *) the_node; for ( i=0 ; i<=level ; i++ ) fprintf(stdout, "...." ); 2005b28: b6 16 e3 b8 or %i3, 0x3b8, %i3 case IMFS_FIFO: fprintf(stdout, " FIFO not printed\n" ); return; default: fprintf(stdout, " bad type %d\n", IMFS_type( the_jnode ) ); 2005b2c: a8 15 20 28 or %l4, 0x28, %l4 return; } puts(""); 2005b30: a0 14 23 50 or %l0, 0x350, %l0 case IMFS_SYM_LINK: fprintf(stdout, " links not printed\n" ); return; case IMFS_FIFO: fprintf(stdout, " FIFO not printed\n" ); 2005b34: a6 14 e0 10 or %l3, 0x10, %l3 case IMFS_HARD_LINK: fprintf(stdout, " links not printed\n" ); return; case IMFS_SYM_LINK: fprintf(stdout, " links not printed\n" ); 2005b38: a4 14 a3 f8 or %l2, 0x3f8, %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 ); 2005b3c: 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++ ) 2005b40: 80 a6 60 00 cmp %i1, 0 2005b44: 06 80 00 0c bl 2005b74 <== NEVER TAKEN 2005b48: ba 10 20 00 clr %i5 fprintf(stdout, "...." ); 2005b4c: c2 07 00 00 ld [ %i4 ], %g1 2005b50: 90 10 00 1b mov %i3, %o0 2005b54: d6 00 60 08 ld [ %g1 + 8 ], %o3 2005b58: 92 10 20 01 mov 1, %o1 2005b5c: 40 00 3c 30 call 2014c1c 2005b60: 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++ ) 2005b64: ba 07 60 01 inc %i5 2005b68: 80 a6 40 1d cmp %i1, %i5 2005b6c: 36 bf ff f9 bge,a 2005b50 2005b70: c2 07 00 00 ld [ %i4 ], %g1 IMFS_jnode_t *the_jnode ) { IMFS_assert( the_jnode ); fprintf(stdout, "%s", the_jnode->name ); 2005b74: c2 07 00 00 ld [ %i4 ], %g1 2005b78: 90 06 a0 0c add %i2, 0xc, %o0 2005b7c: 40 00 39 0c call 2013fac 2005b80: 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; 2005b84: c2 06 a0 4c ld [ %i2 + 0x4c ], %g1 2005b88: d4 00 40 00 ld [ %g1 ], %o2 switch( IMFS_type( the_jnode ) ) { 2005b8c: 80 a2 a0 06 cmp %o2, 6 2005b90: 28 80 00 11 bleu,a 2005bd4 <== ALWAYS TAKEN 2005b94: 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 ) ); 2005b98: c2 07 00 00 ld [ %i4 ], %g1 <== NOT EXECUTED 2005b9c: 92 10 00 14 mov %l4, %o1 <== NOT EXECUTED 2005ba0: 40 00 38 b3 call 2013e6c <== NOT EXECUTED 2005ba4: 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; 2005ba8: 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 ) ) 2005bac: c2 00 40 00 ld [ %g1 ], %g1 2005bb0: 80 a0 60 00 cmp %g1, 0 2005bb4: 22 80 00 19 be,a 2005c18 2005bb8: 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 ) { 2005bbc: 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 ); 2005bc0: 80 a6 80 18 cmp %i2, %i0 2005bc4: 12 bf ff e0 bne 2005b44 2005bc8: 80 a6 60 00 cmp %i1, 0 2005bcc: 81 c7 e0 08 ret 2005bd0: 81 e8 00 00 restore ) { IMFS_assert( the_jnode ); fprintf(stdout, "%s", the_jnode->name ); switch( IMFS_type( the_jnode ) ) { 2005bd4: 03 00 80 16 sethi %hi(0x2005800), %g1 2005bd8: 82 10 62 dc or %g1, 0x2dc, %g1 ! 2005adc 2005bdc: c2 00 40 0a ld [ %g1 + %o2 ], %g1 2005be0: 81 c0 40 00 jmp %g1 2005be4: 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" ); 2005be8: c2 07 00 00 ld [ %i4 ], %g1 2005bec: 90 10 00 12 mov %l2, %o0 2005bf0: d6 00 60 08 ld [ %g1 + 8 ], %o3 2005bf4: 92 10 20 01 mov 1, %o1 2005bf8: 40 00 3c 09 call 2014c1c 2005bfc: 94 10 20 13 mov 0x13, %o2 2005c00: 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 ) ) 2005c04: c2 00 40 00 ld [ %g1 ], %g1 2005c08: 80 a0 60 00 cmp %g1, 0 2005c0c: 32 bf ff ed bne,a 2005bc0 <== ALWAYS TAKEN 2005c10: f4 06 80 00 ld [ %i2 ], %i2 IMFS_dump_directory( the_jnode, level + 1 ); 2005c14: 90 10 00 1a mov %i2, %o0 <== NOT EXECUTED 2005c18: 7f ff ff b8 call 2005af8 2005c1c: 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 ) { 2005c20: 10 bf ff e8 b 2005bc0 2005c24: 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)", 2005c28: c2 07 00 00 ld [ %i4 ], %g1 2005c2c: d4 06 a0 54 ld [ %i2 + 0x54 ], %o2 2005c30: d0 00 60 08 ld [ %g1 + 8 ], %o0 2005c34: d6 06 a0 58 ld [ %i2 + 0x58 ], %o3 2005c38: 13 00 80 87 sethi %hi(0x2021c00), %o1 2005c3c: 40 00 38 8c call 2013e6c 2005c40: 92 12 63 d8 or %o1, 0x3d8, %o1 ! 2021fd8 default: fprintf(stdout, " bad type %d\n", IMFS_type( the_jnode ) ); return; } puts(""); 2005c44: 40 00 3f f7 call 2015c20 2005c48: 90 10 00 10 mov %l0, %o0 2005c4c: 10 bf ff d8 b 2005bac 2005c50: c2 06 a0 4c ld [ %i2 + 0x4c ], %g1 case IMFS_DIRECTORY: fprintf(stdout, "/" ); break; case IMFS_DEVICE: fprintf(stdout, " (device %" PRId32 ", %" PRId32 ")", 2005c54: c2 07 00 00 ld [ %i4 ], %g1 2005c58: d4 06 a0 50 ld [ %i2 + 0x50 ], %o2 2005c5c: d0 00 60 08 ld [ %g1 + 8 ], %o0 2005c60: d6 06 a0 54 ld [ %i2 + 0x54 ], %o3 2005c64: 13 00 80 87 sethi %hi(0x2021c00), %o1 2005c68: 40 00 38 81 call 2013e6c 2005c6c: 92 12 63 c0 or %o1, 0x3c0, %o1 ! 2021fc0 2005c70: 30 bf ff f5 b,a 2005c44 IMFS_assert( the_jnode ); fprintf(stdout, "%s", the_jnode->name ); switch( IMFS_type( the_jnode ) ) { case IMFS_DIRECTORY: fprintf(stdout, "/" ); 2005c74: c2 07 00 00 ld [ %i4 ], %g1 2005c78: 90 10 20 2f mov 0x2f, %o0 2005c7c: 40 00 38 98 call 2013edc 2005c80: d2 00 60 08 ld [ %g1 + 8 ], %o1 2005c84: 30 bf ff f0 b,a 2005c44 case IMFS_SYM_LINK: fprintf(stdout, " links not printed\n" ); return; case IMFS_FIFO: fprintf(stdout, " FIFO not printed\n" ); 2005c88: c2 07 00 00 ld [ %i4 ], %g1 2005c8c: 90 10 00 13 mov %l3, %o0 2005c90: d6 00 60 08 ld [ %g1 + 8 ], %o3 2005c94: 92 10 20 01 mov 1, %o1 2005c98: 40 00 3b e1 call 2014c1c 2005c9c: 94 10 20 12 mov 0x12, %o2 2005ca0: 10 bf ff c3 b 2005bac 2005ca4: 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 ")", 2005ca8: c2 07 00 00 ld [ %i4 ], %g1 2005cac: d4 06 a0 54 ld [ %i2 + 0x54 ], %o2 2005cb0: d0 00 60 08 ld [ %g1 + 8 ], %o0 2005cb4: 13 00 80 87 sethi %hi(0x2021c00), %o1 2005cb8: 40 00 38 6d call 2013e6c 2005cbc: 92 12 63 e8 or %o1, 0x3e8, %o1 ! 2021fe8 2005cc0: 30 bf ff e1 b,a 2005c44 =============================================================================== 0200c0c4 : rtems_filesystem_eval_path_context_t *ctx, void *arg, const char *token, size_t tokenlen ) { 200c0c4: 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; 200c0c8: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 bool access_ok = rtems_filesystem_eval_path_check_access( 200c0cc: 90 10 00 18 mov %i0, %o0 200c0d0: d4 07 20 30 ld [ %i4 + 0x30 ], %o2 200c0d4: d6 17 20 3c lduh [ %i4 + 0x3c ], %o3 200c0d8: d8 17 20 3e lduh [ %i4 + 0x3e ], %o4 200c0dc: 40 00 03 09 call 200cd00 200c0e0: 92 10 20 01 mov 1, %o1 dir->st_mode, dir->st_uid, dir->st_gid ); if ( access_ok ) { 200c0e4: 80 8a 20 ff btst 0xff, %o0 200c0e8: 12 80 00 04 bne 200c0f8 200c0ec: 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)) { 200c0f0: 81 c7 e0 08 ret 200c0f4: 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] == '.'; 200c0f8: 02 80 00 58 be 200c258 200c0fc: 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] == '.'; 200c100: 22 80 00 37 be,a 200c1dc 200c104: c2 4e 80 00 ldsb [ %i2 ], %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200c108: 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 ); 200c10c: b2 07 20 54 add %i4, 0x54, %i1 while ( current != tail ) { 200c110: 80 a7 40 19 cmp %i5, %i1 200c114: 02 80 00 30 be 200c1d4 200c118: 90 07 60 0c add %i5, 0xc, %o0 IMFS_jnode_t *entry = (IMFS_jnode_t *) current; bool match = strncmp( entry->name, token, tokenlen ) == 0 200c11c: 92 10 00 1a mov %i2, %o1 200c120: 40 00 13 9e call 2010f98 200c124: 94 10 00 1b mov %i3, %o2 && entry->name [tokenlen] == '\0'; 200c128: 80 a2 20 00 cmp %o0, 0 200c12c: 12 80 00 26 bne 200c1c4 200c130: 82 07 40 1b add %i5, %i3, %g1 200c134: c2 48 60 0c ldsb [ %g1 + 0xc ], %g1 200c138: 80 a0 60 00 cmp %g1, 0 200c13c: 32 80 00 23 bne,a 200c1c8 200c140: 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; 200c144: 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 ); 200c148: c4 06 20 04 ld [ %i0 + 4 ], %g2 200c14c: c2 00 40 00 ld [ %g1 ], %g1 200c150: 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; 200c154: c0 26 20 0c clr [ %i0 + 0xc ] 200c158: 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; 200c15c: 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)) { 200c160: 80 a0 60 02 cmp %g1, 2 200c164: 02 80 00 43 be 200c270 200c168: 86 10 00 02 mov %g2, %g3 entry = entry->info.hard_link.link_node; } if ( type == IMFS_SYM_LINK && (follow_sym_link || !terminal)) { 200c16c: 80 a0 60 03 cmp %g1, 3 200c170: 02 80 00 28 be 200c210 200c174: 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 ) { 200c178: 32 80 00 2c bne,a 200c228 200c17c: c4 17 20 34 lduh [ %i4 + 0x34 ], %g2 if ( node->info.directory.mt_fs != NULL ) { 200c180: f6 07 60 5c ld [ %i5 + 0x5c ], %i3 200c184: 80 a6 e0 00 cmp %i3, 0 200c188: 02 80 00 27 be 200c224 200c18c: 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( 200c190: d4 07 60 30 ld [ %i5 + 0x30 ], %o2 200c194: d6 17 60 3c lduh [ %i5 + 0x3c ], %o3 200c198: d8 17 60 3e lduh [ %i5 + 0x3e ], %o4 200c19c: 40 00 02 d9 call 200cd00 200c1a0: 92 10 20 01 mov 1, %o1 RTEMS_FS_PERMS_EXEC, entry->st_mode, entry->st_uid, entry->st_gid ); if ( access_ok ) { 200c1a4: 80 8a 20 ff btst 0xff, %o0 200c1a8: 02 bf ff d2 be 200c0f0 <== NEVER TAKEN 200c1ac: 90 10 00 18 mov %i0, %o0 rtems_filesystem_eval_path_restart( ctx, fs_root_ptr ); 200c1b0: 92 06 e0 24 add %i3, 0x24, %o1 200c1b4: 7f ff e3 15 call 2004e08 200c1b8: b0 10 20 01 mov 1, %i0 200c1bc: 81 c7 e0 08 ret 200c1c0: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Next( Chain_Node *the_node ) { return the_node->next; 200c1c4: 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 ) { 200c1c8: 80 a6 40 1d cmp %i1, %i5 200c1cc: 12 bf ff d4 bne 200c11c 200c1d0: 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; 200c1d4: 81 c7 e0 08 ret 200c1d8: 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] == '.'; 200c1dc: 80 a0 60 2e cmp %g1, 0x2e 200c1e0: 32 bf ff cb bne,a 200c10c 200c1e4: fa 07 20 50 ld [ %i4 + 0x50 ], %i5 200c1e8: c2 4e a0 01 ldsb [ %i2 + 1 ], %g1 200c1ec: 80 a0 60 2e cmp %g1, 0x2e 200c1f0: 32 bf ff c7 bne,a 200c10c <== NEVER TAKEN 200c1f4: 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; 200c1f8: 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 ) { 200c1fc: 80 a7 60 00 cmp %i5, 0 200c200: 02 bf ff f5 be 200c1d4 200c204: 01 00 00 00 nop 200c208: 10 bf ff d0 b 200c148 200c20c: 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)) { 200c210: 80 a0 a0 00 cmp %g2, 0 200c214: 02 80 00 20 be 200c294 200c218: 80 89 20 10 btst 0x10, %g4 200c21c: 32 80 00 1f bne,a 200c298 200c220: 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; 200c224: 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; 200c228: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 200c22c: 84 00 bf ff add %g2, -1, %g2 200c230: c4 37 20 34 sth %g2, [ %i4 + 0x34 ] ++entry->reference_count; 200c234: c4 17 60 34 lduh [ %i5 + 0x34 ], %g2 200c238: c2 00 60 04 ld [ %g1 + 4 ], %g1 200c23c: 84 00 a0 01 inc %g2 200c240: c4 37 60 34 sth %g2, [ %i5 + 0x34 ] currentloc->node_access = entry; 200c244: fa 26 20 20 st %i5, [ %i0 + 0x20 ] 200c248: c2 26 20 28 st %g1, [ %i0 + 0x28 ] void *arg, const char *token, size_t tokenlen ) { rtems_filesystem_eval_path_generic_status status = 200c24c: b0 08 e0 ff and %g3, 0xff, %i0 status = RTEMS_FILESYSTEM_EVAL_PATH_GENERIC_NO_ENTRY; } } return status; } 200c250: 81 c7 e0 08 ret 200c254: 81 e8 00 00 restore static inline bool rtems_filesystem_is_current_directory( const char *token, size_t tokenlen ) { return tokenlen == 1 && token [0] == '.'; 200c258: c2 4e 80 00 ldsb [ %i2 ], %g1 200c25c: 80 a0 60 2e cmp %g1, 0x2e 200c260: 32 bf ff ab bne,a 200c10c 200c264: fa 07 20 50 ld [ %i4 + 0x50 ], %i5 200c268: 10 bf ff b7 b 200c144 200c26c: 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)) { 200c270: 80 a0 a0 00 cmp %g2, 0 200c274: 12 80 00 04 bne 200c284 200c278: 80 89 20 08 btst 8, %g4 entry = entry->info.hard_link.link_node; 200c27c: 10 bf ff ea b 200c224 200c280: 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)) { 200c284: 22 bf ff e9 be,a 200c228 200c288: c4 17 20 34 lduh [ %i4 + 0x34 ], %g2 200c28c: 10 bf ff e6 b 200c224 200c290: 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; 200c294: fa 07 60 50 ld [ %i5 + 0x50 ], %i5 rtems_filesystem_eval_path_recursive( ctx, target, strlen( target ) ); 200c298: 40 00 13 0e call 2010ed0 200c29c: 90 10 00 1d mov %i5, %o0 200c2a0: 92 10 00 1d mov %i5, %o1 200c2a4: 94 10 00 08 mov %o0, %o2 200c2a8: 7f ff e2 f1 call 2004e6c 200c2ac: 90 10 00 18 mov %i0, %o0 200c2b0: 30 bf ff 90 b,a 200c0f0 =============================================================================== 02003a28 : static ssize_t IMFS_fifo_write( rtems_libio_t *iop, const void *buffer, size_t count ) { 2003a28: 9d e3 bf 98 save %sp, -104, %sp IMFS_jnode_t *jnode = iop->pathinfo.node_access; 2003a2c: fa 06 20 1c ld [ %i0 + 0x1c ], %i5 int err = pipe_write(JNODE2PIPE(jnode), buffer, count, iop); 2003a30: 96 10 00 18 mov %i0, %o3 2003a34: d0 07 60 50 ld [ %i5 + 0x50 ], %o0 2003a38: 92 10 00 19 mov %i1, %o1 2003a3c: 40 00 2c e5 call 200edd0 2003a40: 94 10 00 1a mov %i2, %o2 if (err > 0) { 2003a44: b0 92 20 00 orcc %o0, 0, %i0 2003a48: 04 80 00 09 ble 2003a6c 2003a4c: 90 07 bf f8 add %fp, -8, %o0 IMFS_mtime_ctime_update(jnode); 2003a50: 40 00 04 4e call 2004b88 2003a54: 92 10 20 00 clr %o1 2003a58: c2 07 bf f8 ld [ %fp + -8 ], %g1 2003a5c: c2 27 60 44 st %g1, [ %i5 + 0x44 ] 2003a60: c2 27 60 48 st %g1, [ %i5 + 0x48 ] 2003a64: 81 c7 e0 08 ret 2003a68: 81 e8 00 00 restore } IMFS_FIFO_RETURN(err); 2003a6c: 80 a6 20 00 cmp %i0, 0 2003a70: 12 80 00 04 bne 2003a80 <== ALWAYS TAKEN 2003a74: 01 00 00 00 nop } 2003a78: 81 c7 e0 08 ret <== NOT EXECUTED 2003a7c: 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); 2003a80: 40 00 36 4e call 20113b8 <__errno> 2003a84: 01 00 00 00 nop 2003a88: 82 20 00 18 neg %i0, %g1 2003a8c: c2 22 00 00 st %g1, [ %o0 ] } 2003a90: 81 c7 e0 08 ret 2003a94: 91 e8 3f ff restore %g0, -1, %o0 =============================================================================== 0200c304 : ((IMFS_jnode_t *)( rtems_chain_head( jnode_get_control( jnode ) )->next)) void IMFS_fsunmount( rtems_filesystem_mount_table_entry_t *temp_mt_entry ) { 200c304: 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; 200c308: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 200c30c: c6 00 a0 08 ld [ %g2 + 8 ], %g3 200c310: f2 00 80 00 ld [ %g2 ], %i1 200c314: f4 00 a0 04 ld [ %g2 + 4 ], %i2 200c318: f6 00 a0 0c ld [ %g2 + 0xc ], %i3 200c31c: f8 00 a0 10 ld [ %g2 + 0x10 ], %i4 200c320: c8 00 a0 14 ld [ %g2 + 0x14 ], %g4 200c324: c2 00 e0 4c ld [ %g3 + 0x4c ], %g1 200c328: f2 27 bf e8 st %i1, [ %fp + -24 ] 200c32c: f4 27 bf ec st %i2, [ %fp + -20 ] 200c330: c6 27 bf f0 st %g3, [ %fp + -16 ] 200c334: f6 27 bf f4 st %i3, [ %fp + -12 ] 200c338: f8 27 bf f8 st %i4, [ %fp + -8 ] 200c33c: 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; 200c340: c0 20 a0 08 clr [ %g2 + 8 ] 200c344: 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; 200c348: ba 10 00 03 mov %g3, %i5 200c34c: c2 00 60 04 ld [ %g1 + 4 ], %g1 */ temp_mt_entry->mt_fs_root->location.node_access = NULL; do { next = jnode->Parent; 200c350: f8 07 60 08 ld [ %i5 + 8 ], %i4 loc.node_access = (void *)jnode; 200c354: fa 27 bf f0 st %i5, [ %fp + -16 ] IMFS_Set_handlers( &loc ); if ( !IMFS_is_directory( jnode ) || jnode_has_no_children( jnode ) ) { 200c358: 80 a0 a0 00 cmp %g2, 0 200c35c: 12 80 00 13 bne 200c3a8 <== NEVER TAKEN 200c360: c2 27 bf f8 st %g1, [ %fp + -8 ] 200c364: 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 ); 200c368: 84 07 60 54 add %i5, 0x54, %g2 200c36c: 80 a0 40 02 cmp %g1, %g2 200c370: 02 80 00 0f be 200c3ac 200c374: 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; 200c378: 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); 200c37c: 80 a7 60 00 cmp %i5, 0 200c380: 02 80 00 21 be 200c404 <== NEVER TAKEN 200c384: 01 00 00 00 nop 200c388: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 */ temp_mt_entry->mt_fs_root->location.node_access = NULL; do { next = jnode->Parent; 200c38c: f8 07 60 08 ld [ %i5 + 8 ], %i4 200c390: c4 00 40 00 ld [ %g1 ], %g2 200c394: c2 00 60 04 ld [ %g1 + 4 ], %g1 loc.node_access = (void *)jnode; 200c398: fa 27 bf f0 st %i5, [ %fp + -16 ] IMFS_Set_handlers( &loc ); if ( !IMFS_is_directory( jnode ) || jnode_has_no_children( jnode ) ) { 200c39c: 80 a0 a0 00 cmp %g2, 0 200c3a0: 02 bf ff f1 be 200c364 200c3a4: c2 27 bf f8 st %g1, [ %fp + -8 ] result = IMFS_rmnod( NULL, &loc ); 200c3a8: 90 10 20 00 clr %o0 200c3ac: 7f ff db fb call 2003398 200c3b0: 92 07 bf e8 add %fp, -24, %o1 if ( result != 0 ) 200c3b4: 80 a2 20 00 cmp %o0, 0 200c3b8: 12 80 00 15 bne 200c40c <== NEVER TAKEN 200c3bc: 11 37 ab 6f sethi %hi(0xdeadbc00), %o0 rtems_fatal_error_occurred( 0xdeadbeef ); IMFS_node_destroy( jnode ); 200c3c0: 7f ff db 14 call 2003010 200c3c4: 90 10 00 1d mov %i5, %o0 jnode = next; } if ( jnode != NULL ) { 200c3c8: 80 a7 20 00 cmp %i4, 0 200c3cc: 02 80 00 0e be 200c404 200c3d0: 01 00 00 00 nop 200c3d4: c2 07 20 4c ld [ %i4 + 0x4c ], %g1 200c3d8: c4 00 40 00 ld [ %g1 ], %g2 if ( IMFS_is_directory( jnode ) ) { 200c3dc: 80 a0 a0 00 cmp %g2, 0 200c3e0: 12 bf ff db bne 200c34c <== NEVER TAKEN 200c3e4: ba 10 00 1c mov %i4, %i5 200c3e8: 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 ); 200c3ec: 86 07 20 54 add %i4, 0x54, %g3 if ( jnode_has_children( jnode ) ) 200c3f0: 80 a7 40 03 cmp %i5, %g3 200c3f4: 12 bf ff e3 bne 200c380 200c3f8: 80 a7 60 00 cmp %i5, 0 200c3fc: 10 bf ff d4 b 200c34c 200c400: ba 10 00 1c mov %i4, %i5 200c404: 81 c7 e0 08 ret 200c408: 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 ); 200c40c: 7f ff f0 41 call 2008510 <== NOT EXECUTED 200c410: 90 12 22 ef or %o0, 0x2ef, %o0 <== NOT EXECUTED =============================================================================== 02002efc : 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] ) { 2002efc: 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 ) ); 2002f00: 90 10 20 01 mov 1, %o0 2002f04: 40 00 01 c8 call 2003624 2002f08: 92 10 20 24 mov 0x24, %o1 if ( fs_info != NULL ) { 2002f0c: ba 92 20 00 orcc %o0, 0, %i5 2002f10: 02 80 00 34 be 2002fe0 2002f14: 03 00 80 73 sethi %hi(0x201cc00), %g1 IMFS_jnode_t *root_node; fs_info->instance = imfs_instance++; 2002f18: c4 00 61 24 ld [ %g1 + 0x124 ], %g2 ! 201cd24 memcpy( 2002f1c: 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++; 2002f20: 86 00 a0 01 add %g2, 1, %g3 memcpy( 2002f24: 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++; 2002f28: c4 27 40 00 st %g2, [ %i5 ] 2002f2c: c6 20 61 24 st %g3, [ %g1 + 0x124 ] memcpy( 2002f30: 40 00 34 d4 call 2010280 2002f34: 90 07 60 08 add %i5, 8, %o0 fs_info->node_controls, node_controls, sizeof( fs_info->node_controls ) ); root_node = IMFS_allocate_node( 2002f38: d2 07 60 08 ld [ %i5 + 8 ], %o1 2002f3c: 90 10 00 1d mov %i5, %o0 2002f40: 96 10 20 00 clr %o3 2002f44: 15 00 80 6a sethi %hi(0x201a800), %o2 2002f48: 9a 10 20 00 clr %o5 2002f4c: 94 12 a2 90 or %o2, 0x290, %o2 2002f50: 19 00 00 10 sethi %hi(0x4000), %o4 2002f54: 40 00 24 0e call 200bf8c 2002f58: 98 13 21 ed or %o4, 0x1ed, %o4 ! 41ed "", 0, (S_IFDIR | 0755), NULL ); if ( root_node != NULL ) { 2002f5c: 80 a2 20 00 cmp %o0, 0 2002f60: 02 80 00 20 be 2002fe0 <== NEVER TAKEN 2002f64: 09 00 80 6c sethi %hi(0x201b000), %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; 2002f68: 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; 2002f6c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 2002f70: c6 00 a0 04 ld [ %g2 + 4 ], %g3 0, (S_IFDIR | 0755), NULL ); if ( root_node != NULL ) { mt_entry->fs_info = fs_info; 2002f74: fa 26 20 08 st %i5, [ %i0 + 8 ] mt_entry->ops = op_table; 2002f78: f2 26 20 0c st %i1, [ %i0 + 0xc ] errno = ENOMEM; rv = -1; } if ( rv == 0 ) { IMFS_determine_bytes_per_block( 2002f7c: 05 00 80 71 sethi %hi(0x201c400), %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; 2002f80: 88 11 23 74 or %g4, 0x374, %g4 errno = ENOMEM; rv = -1; } if ( rv == 0 ) { IMFS_determine_bytes_per_block( 2002f84: c4 00 a1 fc ld [ %g2 + 0x1fc ], %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; 2002f88: c8 26 20 2c st %g4, [ %i0 + 0x2c ] mt_entry->mt_fs_root->location.node_access = root_node; 2002f8c: 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) { 2002f90: 80 a0 a0 10 cmp %g2, 0x10 2002f94: 02 80 00 0f be 2002fd0 2002f98: c6 20 60 10 st %g3, [ %g1 + 0x10 ] is_valid = true; break; } if(bit_mask > requested_bytes_per_block) 2002f9c: 80 a0 a0 0f cmp %g2, 0xf 2002fa0: 04 80 00 0b ble 2002fcc 2002fa4: 82 10 20 20 mov 0x20, %g1 2002fa8: 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) { 2002fac: 80 a0 80 01 cmp %g2, %g1 2002fb0: 22 80 00 09 be,a 2002fd4 2002fb4: 03 00 80 73 sethi %hi(0x201cc00), %g1 is_valid = true; break; } if(bit_mask > requested_bytes_per_block) 2002fb8: 26 80 00 06 bl,a 2002fd0 <== NEVER TAKEN 2002fbc: 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) { 2002fc0: 86 80 ff ff addcc %g3, -1, %g3 2002fc4: 12 bf ff fa bne 2002fac <== ALWAYS TAKEN 2002fc8: 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); 2002fcc: 84 10 20 80 mov 0x80, %g2 break; } if(bit_mask > requested_bytes_per_block) break; } *dest_bytes_per_block = ((is_valid) 2002fd0: 03 00 80 73 sethi %hi(0x201cc00), %g1 2002fd4: c4 20 61 20 st %g2, [ %g1 + 0x120 ] ! 201cd20 const IMFS_node_control *const node_controls [IMFS_TYPE_COUNT] ) { static int imfs_instance; int rv = 0; 2002fd8: 81 c7 e0 08 ret 2002fdc: 91 e8 20 00 restore %g0, 0, %o0 } else { errno = ENOMEM; rv = -1; } } else { errno = ENOMEM; 2002fe0: 40 00 32 61 call 200f964 <__errno> 2002fe4: b0 10 3f ff mov -1, %i0 2002fe8: 82 10 20 0c mov 0xc, %g1 2002fec: c2 22 00 00 st %g1, [ %o0 ] IMFS_MEMFILE_DEFAULT_BYTES_PER_BLOCK ); } return rv; } 2002ff0: 81 c7 e0 08 ret 2002ff4: 81 e8 00 00 restore =============================================================================== 02004b5c : const char *path, mode_t mode, const IMFS_node_control *node_control, void *context ) { 2004b5c: 9d e3 bf 48 save %sp, -184, %sp int rv = 0; mode &= ~rtems_filesystem_umask; 2004b60: 03 00 80 84 sethi %hi(0x2021000), %g1 2004b64: c2 00 61 f0 ld [ %g1 + 0x1f0 ], %g1 ! 20211f0 switch (mode & S_IFMT) { 2004b68: 05 00 00 08 sethi %hi(0x2000), %g2 void *context ) { int rv = 0; mode &= ~rtems_filesystem_umask; 2004b6c: c2 00 60 08 ld [ %g1 + 8 ], %g1 2004b70: b2 2e 40 01 andn %i1, %g1, %i1 switch (mode & S_IFMT) { 2004b74: 03 00 00 3c sethi %hi(0xf000), %g1 2004b78: 82 0e 40 01 and %i1, %g1, %g1 2004b7c: 80 a0 40 02 cmp %g1, %g2 2004b80: 22 80 00 0c be,a 2004bb0 2004b84: c2 06 80 00 ld [ %i2 ], %g1 2004b88: 08 80 00 1d bleu 2004bfc <== NEVER TAKEN 2004b8c: 05 00 00 04 sethi %hi(0x1000), %g2 2004b90: 05 00 00 18 sethi %hi(0x6000), %g2 2004b94: 80 a0 40 02 cmp %g1, %g2 2004b98: 02 80 00 05 be 2004bac 2004b9c: 05 00 00 20 sethi %hi(0x8000), %g2 2004ba0: 80 a0 40 02 cmp %g1, %g2 2004ba4: 12 80 00 19 bne 2004c08 <== ALWAYS TAKEN 2004ba8: 01 00 00 00 nop rv = -1; break; } if ( rv == 0 ) { if ( node_control->imfs_type == IMFS_GENERIC ) { 2004bac: c2 06 80 00 ld [ %i2 ], %g1 2004bb0: 80 a0 60 07 cmp %g1, 7 2004bb4: 12 80 00 15 bne 2004c08 2004bb8: 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 = 2004bbc: 94 10 20 78 mov 0x78, %o2 2004bc0: 40 00 08 65 call 2006d54 2004bc4: 90 07 bf c8 add %fp, -56, %o0 rtems_filesystem_eval_path_start( &ctx, path, eval_flags ); if ( IMFS_is_imfs_instance( currentloc ) ) { 2004bc8: 7f ff ff d2 call 2004b10 2004bcc: ba 10 00 08 mov %o0, %i5 2004bd0: 80 8a 20 ff btst 0xff, %o0 2004bd4: 12 80 00 13 bne 2004c20 2004bd8: d4 1f bf d0 ldd [ %fp + -48 ], %o2 IMFS_update_mtime( parent ); } else { rv = -1; } } else { rtems_filesystem_eval_path_error( &ctx, ENOTSUP ); 2004bdc: 90 07 bf c8 add %fp, -56, %o0 2004be0: 92 10 20 86 mov 0x86, %o1 2004be4: 40 00 07 a0 call 2006a64 2004be8: b0 10 3f ff mov -1, %i0 rv = -1; } rtems_filesystem_eval_path_cleanup( &ctx ); 2004bec: 40 00 08 9a call 2006e54 2004bf0: 90 07 bf c8 add %fp, -56, %o0 2004bf4: 81 c7 e0 08 ret 2004bf8: 81 e8 00 00 restore { int rv = 0; mode &= ~rtems_filesystem_umask; switch (mode & S_IFMT) { 2004bfc: 80 a0 40 02 cmp %g1, %g2 <== NOT EXECUTED 2004c00: 22 bf ff ec be,a 2004bb0 <== NOT EXECUTED 2004c04: c2 06 80 00 ld [ %i2 ], %g1 <== NOT EXECUTED rv = -1; } rtems_filesystem_eval_path_cleanup( &ctx ); } else { errno = EINVAL; 2004c08: 40 00 3e 15 call 201445c <__errno> 2004c0c: b0 10 3f ff mov -1, %i0 2004c10: 82 10 20 16 mov 0x16, %g1 2004c14: c2 22 00 00 st %g1, [ %o0 ] 2004c18: 81 c7 e0 08 ret 2004c1c: 81 e8 00 00 restore if ( IMFS_is_imfs_instance( currentloc ) ) { IMFS_types_union info; IMFS_jnode_t *new_node; info.generic.context = context; 2004c20: f6 27 bf b0 st %i3, [ %fp + -80 ] new_node = IMFS_create_node_with_control( 2004c24: 90 10 00 1d mov %i5, %o0 2004c28: 92 10 00 1a mov %i2, %o1 2004c2c: 98 10 00 19 mov %i1, %o4 2004c30: 9a 07 bf b0 add %fp, -80, %o5 2004c34: 40 00 2f d8 call 2010b94 2004c38: b0 10 3f ff mov -1, %i0 rtems_filesystem_eval_path_get_tokenlen( &ctx ), mode, &info ); if ( new_node != NULL ) { 2004c3c: 80 a2 20 00 cmp %o0, 0 2004c40: 02 bf ff eb be 2004bec 2004c44: 92 10 20 00 clr %o1 IMFS_jnode_t *parent = currentloc->node_access; 2004c48: fa 07 60 08 ld [ %i5 + 8 ], %i5 IMFS_update_ctime( parent ); 2004c4c: 40 00 02 99 call 20056b0 2004c50: 90 07 bf a8 add %fp, -88, %o0 2004c54: c2 07 bf a8 ld [ %fp + -88 ], %g1 IMFS_update_mtime( parent ); 2004c58: 90 07 bf a8 add %fp, -88, %o0 ); if ( new_node != NULL ) { IMFS_jnode_t *parent = currentloc->node_access; IMFS_update_ctime( parent ); 2004c5c: c2 27 60 48 st %g1, [ %i5 + 0x48 ] IMFS_update_mtime( parent ); 2004c60: 40 00 02 94 call 20056b0 2004c64: 92 10 20 00 clr %o1 2004c68: c2 07 bf a8 ld [ %fp + -88 ], %g1 2004c6c: b0 10 20 00 clr %i0 2004c70: c2 27 60 44 st %g1, [ %i5 + 0x44 ] } else { rtems_filesystem_eval_path_error( &ctx, ENOTSUP ); rv = -1; } rtems_filesystem_eval_path_cleanup( &ctx ); 2004c74: 40 00 08 78 call 2006e54 2004c78: 90 07 bf c8 add %fp, -56, %o0 2004c7c: 81 c7 e0 08 ret 2004c80: 81 e8 00 00 restore =============================================================================== 0200e61c : */ MEMFILE_STATIC int IMFS_memfile_addblock( IMFS_jnode_t *the_jnode, unsigned int block ) { 200e61c: 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 ); 200e620: 94 10 20 01 mov 1, %o2 200e624: 90 10 00 18 mov %i0, %o0 200e628: 7f ff fe ba call 200e110 200e62c: 92 10 00 19 mov %i1, %o1 if ( *block_entry_ptr ) 200e630: 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 ); 200e634: ba 10 00 08 mov %o0, %i5 if ( *block_entry_ptr ) 200e638: 80 a0 60 00 cmp %g1, 0 200e63c: 12 80 00 08 bne 200e65c 200e640: b0 10 20 00 clr %i0 return 0; /* * There is no memory for this block number so allocate it. */ memory = memfile_alloc_block(); 200e644: 7f ff fe a6 call 200e0dc 200e648: 01 00 00 00 nop if ( !memory ) 200e64c: 80 a2 20 00 cmp %o0, 0 200e650: 02 80 00 05 be 200e664 <== NEVER TAKEN 200e654: 01 00 00 00 nop return 1; *block_entry_ptr = memory; 200e658: d0 27 40 00 st %o0, [ %i5 ] return 0; 200e65c: 81 c7 e0 08 ret 200e660: 81 e8 00 00 restore } 200e664: 81 c7 e0 08 ret <== NOT EXECUTED 200e668: 91 e8 20 01 restore %g0, 1, %o0 <== NOT EXECUTED =============================================================================== 0200e890 : MEMFILE_STATIC int IMFS_memfile_extend( IMFS_jnode_t *the_jnode, bool zero_fill, off_t new_length ) { 200e890: 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 ) 200e894: 25 00 80 73 sethi %hi(0x201cc00), %l2 200e898: fa 04 a1 20 ld [ %l2 + 0x120 ], %i5 ! 201cd20 200e89c: b9 37 60 02 srl %i5, 2, %i4 200e8a0: 92 10 00 1c mov %i4, %o1 200e8a4: 40 00 27 74 call 2018674 <.umul> 200e8a8: 90 07 20 01 add %i4, 1, %o0 200e8ac: 92 10 00 1c mov %i4, %o1 200e8b0: 40 00 27 71 call 2018674 <.umul> 200e8b4: 90 02 20 01 inc %o0 200e8b8: 92 10 00 1d mov %i5, %o1 200e8bc: 40 00 27 6e call 2018674 <.umul> 200e8c0: 90 02 3f ff add %o0, -1, %o0 200e8c4: 82 10 20 00 clr %g1 200e8c8: 80 a0 40 1a cmp %g1, %i2 200e8cc: 04 80 00 58 ble 200ea2c <== ALWAYS TAKEN 200e8d0: 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 ) 200e8d4: e2 07 20 50 ld [ %i4 + 0x50 ], %l1 <== NOT EXECUTED 200e8d8: 80 a6 80 11 cmp %i2, %l1 200e8dc: 04 80 00 3f ble 200e9d8 <== ALWAYS TAKEN 200e8e0: 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; 200e8e4: a7 3f 60 1f sra %i5, 0x1f, %l3 <== NOT EXECUTED 200e8e8: 96 10 00 1d mov %i5, %o3 200e8ec: 94 10 00 13 mov %l3, %o2 200e8f0: 90 10 00 1a mov %i2, %o0 200e8f4: 40 00 28 f2 call 2018cbc <__divdi3> 200e8f8: 92 10 00 1b mov %i3, %o1 old_blocks = the_jnode->info.file.size / IMFS_MEMFILE_BYTES_PER_BLOCK; 200e8fc: 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; 200e900: b0 10 00 09 mov %o1, %i0 old_blocks = the_jnode->info.file.size / IMFS_MEMFILE_BYTES_PER_BLOCK; 200e904: 90 10 00 11 mov %l1, %o0 200e908: 92 10 00 10 mov %l0, %o1 200e90c: 40 00 28 ec call 2018cbc <__divdi3> 200e910: 94 10 00 13 mov %l3, %o2 200e914: a2 10 00 09 mov %o1, %l1 offset = the_jnode->info.file.size - old_blocks * IMFS_MEMFILE_BYTES_PER_BLOCK; 200e918: 90 10 00 09 mov %o1, %o0 200e91c: 40 00 27 56 call 2018674 <.umul> 200e920: 92 10 00 1d mov %i5, %o1 /* * Now allocate each of those blocks. */ for ( block=old_blocks ; block<=new_blocks ; block++ ) { 200e924: ba 10 00 11 mov %l1, %i5 200e928: 80 a6 00 11 cmp %i0, %l1 200e92c: 1a 80 00 07 bcc 200e948 <== ALWAYS TAKEN 200e930: 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); 200e934: 10 80 00 1d b 200e9a8 <== NOT EXECUTED 200e938: 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++ ) { 200e93c: 80 a6 00 1d cmp %i0, %i5 200e940: 0a 80 00 1a bcs 200e9a8 200e944: 92 10 20 00 clr %o1 if ( !IMFS_memfile_addblock( the_jnode, block ) ) { 200e948: 92 10 00 1d mov %i5, %o1 200e94c: 7f ff ff 34 call 200e61c 200e950: 90 10 00 1c mov %i4, %o0 200e954: 80 a2 20 00 cmp %o0, 0 200e958: 12 80 00 26 bne 200e9f0 <== NEVER TAKEN 200e95c: 80 a6 60 00 cmp %i1, 0 if ( zero_fill ) { 200e960: 22 bf ff f7 be,a 200e93c 200e964: ba 07 60 01 inc %i5 size_t count = IMFS_MEMFILE_BYTES_PER_BLOCK - offset; block_p *block_ptr = 200e968: 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; 200e96c: e6 04 a1 20 ld [ %l2 + 0x120 ], %l3 block_p *block_ptr = 200e970: 94 10 20 00 clr %o2 200e974: 7f ff fd e7 call 200e110 200e978: 90 10 00 1c mov %i4, %o0 IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); memset( &(*block_ptr) [offset], 0, count); 200e97c: 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; 200e980: 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); 200e984: 90 02 00 10 add %o0, %l0, %o0 200e988: 92 10 20 00 clr %o1 200e98c: 40 00 06 7a call 2010374 200e990: 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++ ) { 200e994: ba 07 60 01 inc %i5 200e998: 80 a6 00 1d cmp %i0, %i5 200e99c: 1a bf ff eb bcc 200e948 200e9a0: 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); 200e9a4: 92 10 20 00 clr %o1 } /* * Set the new length of the file. */ the_jnode->info.file.size = new_length; 200e9a8: f4 3f 20 50 std %i2, [ %i4 + 0x50 ] IMFS_update_ctime(the_jnode); 200e9ac: 7f ff d3 f8 call 200398c 200e9b0: 90 07 bf f8 add %fp, -8, %o0 200e9b4: c2 07 bf f8 ld [ %fp + -8 ], %g1 IMFS_update_mtime(the_jnode); 200e9b8: 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); 200e9bc: c2 27 20 48 st %g1, [ %i4 + 0x48 ] IMFS_update_mtime(the_jnode); 200e9c0: 7f ff d3 f3 call 200398c 200e9c4: 92 10 20 00 clr %o1 200e9c8: c2 07 bf f8 ld [ %fp + -8 ], %g1 200e9cc: c2 27 20 44 st %g1, [ %i4 + 0x44 ] return 0; 200e9d0: 81 c7 e0 08 ret 200e9d4: 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 ) 200e9d8: 12 80 00 04 bne 200e9e8 <== NEVER TAKEN 200e9dc: 80 a6 c0 10 cmp %i3, %l0 200e9e0: 18 bf ff c2 bgu 200e8e8 <== ALWAYS TAKEN 200e9e4: 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; } 200e9e8: 81 c7 e0 08 ret <== NOT EXECUTED 200e9ec: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED memset( &(*block_ptr) [offset], 0, count); offset = 0; } } else { for ( ; block>=old_blocks ; block-- ) { 200e9f0: 80 a7 40 11 cmp %i5, %l1 <== NOT EXECUTED 200e9f4: 0a 80 00 08 bcs 200ea14 <== NOT EXECUTED 200e9f8: 92 10 00 1d mov %i5, %o1 <== NOT EXECUTED IMFS_memfile_remove_block( the_jnode, block ); 200e9fc: 7f ff ff 99 call 200e860 <== NOT EXECUTED 200ea00: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED memset( &(*block_ptr) [offset], 0, count); offset = 0; } } else { for ( ; block>=old_blocks ; block-- ) { 200ea04: ba 07 7f ff add %i5, -1, %i5 <== NOT EXECUTED 200ea08: 80 a4 40 1d cmp %l1, %i5 <== NOT EXECUTED 200ea0c: 08 bf ff fc bleu 200e9fc <== NOT EXECUTED 200ea10: 92 10 00 1d mov %i5, %o1 <== NOT EXECUTED IMFS_memfile_remove_block( the_jnode, block ); } rtems_set_errno_and_return_minus_one( ENOSPC ); 200ea14: 40 00 03 d4 call 200f964 <__errno> <== NOT EXECUTED 200ea18: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 200ea1c: 82 10 20 1c mov 0x1c, %g1 <== NOT EXECUTED 200ea20: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 200ea24: 81 c7 e0 08 ret <== NOT EXECUTED 200ea28: 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 ) 200ea2c: 12 80 00 04 bne 200ea3c <== NEVER TAKEN 200ea30: 80 a2 00 1b cmp %o0, %i3 200ea34: 38 bf ff a9 bgu,a 200e8d8 200ea38: e2 07 20 50 ld [ %i4 + 0x50 ], %l1 rtems_set_errno_and_return_minus_one( EFBIG ); 200ea3c: 40 00 03 ca call 200f964 <__errno> 200ea40: b0 10 3f ff mov -1, %i0 200ea44: 82 10 20 1b mov 0x1b, %g1 200ea48: c2 22 00 00 st %g1, [ %o0 ] 200ea4c: 81 c7 e0 08 ret 200ea50: 81 e8 00 00 restore =============================================================================== 0200e110 : #endif IMFS_jnode_t *the_jnode, unsigned int block, int malloc_it ) { 200e110: 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 ) { 200e114: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e118: fa 00 61 20 ld [ %g1 + 0x120 ], %i5 ! 201cd20 200e11c: bb 37 60 02 srl %i5, 2, %i5 200e120: 82 07 7f ff add %i5, -1, %g1 200e124: 80 a6 40 01 cmp %i1, %g1 200e128: 38 80 00 0b bgu,a 200e154 200e12c: 90 07 60 01 add %i5, 1, %o0 p = info->indirect; if ( malloc_it ) { 200e130: 80 a6 a0 00 cmp %i2, 0 200e134: 12 80 00 4e bne 200e26c 200e138: d0 06 20 58 ld [ %i0 + 0x58 ], %o0 info->indirect = p; } return &info->indirect[ my_block ]; } if ( !p ) 200e13c: 80 a2 20 00 cmp %o0, 0 200e140: 02 80 00 6d be 200e2f4 <== NEVER TAKEN 200e144: 01 00 00 00 nop return 0; return &info->indirect[ my_block ]; 200e148: b3 2e 60 02 sll %i1, 2, %i1 200e14c: 81 c7 e0 08 ret 200e150: 91 ea 00 19 restore %o0, %i1, %o0 /* * Is the block number in the doubly indirect portion? */ if ( my_block <= LAST_DOUBLY_INDIRECT ) { 200e154: 40 00 29 48 call 2018674 <.umul> 200e158: 92 10 00 1d mov %i5, %o1 200e15c: 82 02 3f ff add %o0, -1, %g1 200e160: 80 a6 40 01 cmp %i1, %g1 200e164: 08 80 00 2b bleu 200e210 200e168: b8 10 00 08 mov %o0, %i4 } /* * Is the block number in the triply indirect portion? */ if ( my_block <= LAST_TRIPLY_INDIRECT ) { 200e16c: 90 02 20 01 inc %o0 200e170: 40 00 29 41 call 2018674 <.umul> 200e174: 92 10 00 1d mov %i5, %o1 200e178: 90 02 3f ff add %o0, -1, %o0 200e17c: 80 a6 40 08 cmp %i1, %o0 200e180: 18 80 00 5d bgu 200e2f4 <== NEVER TAKEN 200e184: b2 26 40 1c sub %i1, %i4, %i1 my_block -= FIRST_TRIPLY_INDIRECT; singly = my_block % IMFS_MEMFILE_BLOCK_SLOTS; 200e188: 92 10 00 1d mov %i5, %o1 200e18c: 40 00 2a 20 call 2018a0c <.urem> 200e190: 90 10 00 19 mov %i1, %o0 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200e194: 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; 200e198: a0 10 00 08 mov %o0, %l0 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200e19c: 40 00 29 70 call 201875c <.udiv> 200e1a0: 90 10 00 19 mov %i1, %o0 triply = doubly / IMFS_MEMFILE_BLOCK_SLOTS; 200e1a4: 92 10 00 1d mov %i5, %o1 200e1a8: 40 00 29 6d call 201875c <.udiv> 200e1ac: b8 10 00 08 mov %o0, %i4 doubly %= IMFS_MEMFILE_BLOCK_SLOTS; 200e1b0: 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; 200e1b4: b6 10 00 08 mov %o0, %i3 doubly %= IMFS_MEMFILE_BLOCK_SLOTS; 200e1b8: 40 00 2a 15 call 2018a0c <.urem> 200e1bc: 90 10 00 1c mov %i4, %o0 p = info->triply_indirect; if ( malloc_it ) { 200e1c0: 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; 200e1c4: ba 10 00 08 mov %o0, %i5 p = info->triply_indirect; if ( malloc_it ) { 200e1c8: 02 80 00 3d be 200e2bc 200e1cc: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 if ( !p ) { 200e1d0: 80 a2 20 00 cmp %o0, 0 200e1d4: 02 80 00 66 be 200e36c 200e1d8: 01 00 00 00 nop if ( !p ) return 0; info->triply_indirect = p; } p1 = (block_p *) p[ triply ]; 200e1dc: b7 2e e0 02 sll %i3, 2, %i3 200e1e0: c4 02 00 1b ld [ %o0 + %i3 ], %g2 if ( !p1 ) { 200e1e4: 80 a0 a0 00 cmp %g2, 0 200e1e8: 02 80 00 5a be 200e350 200e1ec: b6 02 00 1b add %o0, %i3, %i3 if ( !p1 ) return 0; p[ triply ] = (block_p) p1; } p2 = (block_p *)p1[ doubly ]; 200e1f0: bb 2f 60 02 sll %i5, 2, %i5 200e1f4: d0 00 80 1d ld [ %g2 + %i5 ], %o0 if ( !p2 ) { 200e1f8: 80 a2 20 00 cmp %o0, 0 200e1fc: 02 80 00 47 be 200e318 200e200: 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 ]; 200e204: b1 2c 20 02 sll %l0, 2, %i0 200e208: 81 c7 e0 08 ret 200e20c: 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; 200e210: b2 26 40 1d sub %i1, %i5, %i1 singly = my_block % IMFS_MEMFILE_BLOCK_SLOTS; 200e214: 92 10 00 1d mov %i5, %o1 200e218: 40 00 29 fd call 2018a0c <.urem> 200e21c: 90 10 00 19 mov %i1, %o0 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200e220: 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; 200e224: b8 10 00 08 mov %o0, %i4 doubly = my_block / IMFS_MEMFILE_BLOCK_SLOTS; 200e228: 40 00 29 4d call 201875c <.udiv> 200e22c: 90 10 00 19 mov %i1, %o0 p = info->doubly_indirect; 200e230: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 if ( malloc_it ) { 200e234: 80 a6 a0 00 cmp %i2, 0 200e238: 02 80 00 17 be 200e294 200e23c: ba 10 00 08 mov %o0, %i5 if ( !p ) { 200e240: 80 a0 60 00 cmp %g1, 0 200e244: 02 80 00 3c be 200e334 200e248: 01 00 00 00 nop if ( !p ) return 0; info->doubly_indirect = p; } p1 = (block_p *)p[ doubly ]; 200e24c: bb 2f 60 02 sll %i5, 2, %i5 200e250: d0 00 40 1d ld [ %g1 + %i5 ], %o0 if ( !p1 ) { 200e254: 80 a2 20 00 cmp %o0, 0 200e258: 02 80 00 29 be 200e2fc 200e25c: ba 00 40 1d add %g1, %i5, %i5 if ( !p1 ) return 0; p[ doubly ] = (block_p) p1; } return (block_p *)&p1[ singly ]; 200e260: b1 2f 20 02 sll %i4, 2, %i0 200e264: 81 c7 e0 08 ret 200e268: 91 ea 00 18 restore %o0, %i0, %o0 if ( my_block <= LAST_INDIRECT ) { p = info->indirect; if ( malloc_it ) { if ( !p ) { 200e26c: 80 a2 20 00 cmp %o0, 0 200e270: 32 bf ff b7 bne,a 200e14c 200e274: b3 2e 60 02 sll %i1, 2, %i1 p = memfile_alloc_block(); 200e278: 7f ff ff 99 call 200e0dc 200e27c: 01 00 00 00 nop if ( !p ) 200e280: 80 a2 20 00 cmp %o0, 0 200e284: 02 80 00 1c be 200e2f4 <== NEVER TAKEN 200e288: 01 00 00 00 nop return 0; info->indirect = p; 200e28c: 10 bf ff af b 200e148 200e290: d0 26 20 58 st %o0, [ %i0 + 0x58 ] } return (block_p *)&p1[ singly ]; } if ( !p ) 200e294: 80 a0 60 00 cmp %g1, 0 200e298: 02 80 00 17 be 200e2f4 <== NEVER TAKEN 200e29c: bb 2a 20 02 sll %o0, 2, %i5 return 0; p = (block_p *)p[ doubly ]; 200e2a0: c2 00 40 1d ld [ %g1 + %i5 ], %g1 if ( !p ) 200e2a4: 80 a0 60 00 cmp %g1, 0 200e2a8: 02 80 00 13 be 200e2f4 <== NEVER TAKEN 200e2ac: 01 00 00 00 nop return 0; return (block_p *)&p[ singly ]; 200e2b0: b1 2f 20 02 sll %i4, 2, %i0 200e2b4: 81 c7 e0 08 ret 200e2b8: 91 e8 40 18 restore %g1, %i0, %o0 p1[ doubly ] = (block_p) p2; } return (block_p *)&p2[ singly ]; } if ( !p ) 200e2bc: 80 a2 20 00 cmp %o0, 0 200e2c0: 02 80 00 0d be 200e2f4 <== NEVER TAKEN 200e2c4: b7 2e e0 02 sll %i3, 2, %i3 return 0; p1 = (block_p *) p[ triply ]; 200e2c8: c2 02 00 1b ld [ %o0 + %i3 ], %g1 if ( !p1 ) 200e2cc: 80 a0 60 00 cmp %g1, 0 200e2d0: 02 80 00 09 be 200e2f4 <== NEVER TAKEN 200e2d4: bb 2f 60 02 sll %i5, 2, %i5 return 0; p2 = (block_p *)p1[ doubly ]; 200e2d8: c2 00 40 1d ld [ %g1 + %i5 ], %g1 if ( !p2 ) 200e2dc: 80 a0 60 00 cmp %g1, 0 200e2e0: 02 80 00 05 be 200e2f4 <== NEVER TAKEN 200e2e4: 01 00 00 00 nop return 0; return (block_p *)&p2[ singly ]; 200e2e8: b1 2c 20 02 sll %l0, 2, %i0 /* * This means the requested block number is out of range. */ return 0; } 200e2ec: 81 c7 e0 08 ret 200e2f0: 91 e8 40 18 restore %g1, %i0, %o0 if ( malloc_it ) { if ( !p ) { p = memfile_alloc_block(); if ( !p ) return 0; 200e2f4: 81 c7 e0 08 ret <== NOT EXECUTED 200e2f8: 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(); 200e2fc: 7f ff ff 78 call 200e0dc 200e300: 01 00 00 00 nop if ( !p1 ) 200e304: 80 a2 20 00 cmp %o0, 0 200e308: 02 bf ff fb be 200e2f4 <== NEVER TAKEN 200e30c: 01 00 00 00 nop return 0; p[ doubly ] = (block_p) p1; 200e310: 10 bf ff d4 b 200e260 200e314: d0 27 40 00 st %o0, [ %i5 ] p[ triply ] = (block_p) p1; } p2 = (block_p *)p1[ doubly ]; if ( !p2 ) { p2 = memfile_alloc_block(); 200e318: 7f ff ff 71 call 200e0dc 200e31c: 01 00 00 00 nop if ( !p2 ) 200e320: 80 a2 20 00 cmp %o0, 0 200e324: 02 bf ff f4 be 200e2f4 <== NEVER TAKEN 200e328: 01 00 00 00 nop return 0; p1[ doubly ] = (block_p) p2; 200e32c: 10 bf ff b6 b 200e204 200e330: d0 27 40 00 st %o0, [ %i5 ] p = info->doubly_indirect; if ( malloc_it ) { if ( !p ) { p = memfile_alloc_block(); 200e334: 7f ff ff 6a call 200e0dc 200e338: 01 00 00 00 nop if ( !p ) 200e33c: 82 92 20 00 orcc %o0, 0, %g1 200e340: 02 bf ff ed be 200e2f4 <== NEVER TAKEN 200e344: 01 00 00 00 nop return 0; info->doubly_indirect = p; 200e348: 10 bf ff c1 b 200e24c 200e34c: c2 26 20 5c st %g1, [ %i0 + 0x5c ] info->triply_indirect = p; } p1 = (block_p *) p[ triply ]; if ( !p1 ) { p1 = memfile_alloc_block(); 200e350: 7f ff ff 63 call 200e0dc 200e354: 01 00 00 00 nop if ( !p1 ) 200e358: 84 92 20 00 orcc %o0, 0, %g2 200e35c: 02 bf ff e6 be 200e2f4 <== NEVER TAKEN 200e360: 01 00 00 00 nop return 0; p[ triply ] = (block_p) p1; 200e364: 10 bf ff a3 b 200e1f0 200e368: c4 26 c0 00 st %g2, [ %i3 ] p = info->triply_indirect; if ( malloc_it ) { if ( !p ) { p = memfile_alloc_block(); 200e36c: 7f ff ff 5c call 200e0dc 200e370: 01 00 00 00 nop if ( !p ) 200e374: 80 a2 20 00 cmp %o0, 0 200e378: 02 bf ff df be 200e2f4 <== NEVER TAKEN 200e37c: 01 00 00 00 nop return 0; info->triply_indirect = p; 200e380: 10 bf ff 97 b 200e1dc 200e384: d0 26 20 60 st %o0, [ %i0 + 0x60 ] =============================================================================== 0200e388 : IMFS_jnode_t *the_jnode, off_t start, unsigned char *destination, unsigned int length ) { 200e388: 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; 200e38c: c2 06 20 4c ld [ %i0 + 0x4c ], %g1 200e390: 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 ) { 200e394: c2 00 40 00 ld [ %g1 ], %g1 IMFS_jnode_t *the_jnode, off_t start, unsigned char *destination, unsigned int length ) { 200e398: a0 10 00 19 mov %i1, %l0 200e39c: 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 ) { 200e3a0: 80 a0 60 05 cmp %g1, 5 200e3a4: 02 80 00 67 be 200e540 200e3a8: a8 10 00 1b mov %i3, %l4 /* * 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 ) 200e3ac: c4 06 20 50 ld [ %i0 + 0x50 ], %g2 200e3b0: 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; 200e3b4: 82 10 00 1a mov %i2, %g1 if ( last_byte > the_jnode->info.file.size ) 200e3b8: c8 06 20 54 ld [ %i0 + 0x54 ], %g4 200e3bc: 80 a0 c0 02 cmp %g3, %g2 200e3c0: 04 80 00 41 ble 200e4c4 <== ALWAYS TAKEN 200e3c4: ba 07 00 1a add %i4, %i2, %i5 my_length = the_jnode->info.file.size - start; 200e3c8: 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; 200e3cc: 27 00 80 73 sethi %hi(0x201cc00), %l3 <== NOT EXECUTED 200e3d0: fa 04 e1 20 ld [ %l3 + 0x120 ], %i5 ! 201cd20 200e3d4: 90 10 00 10 mov %l0, %o0 200e3d8: b7 3f 60 1f sra %i5, 0x1f, %i3 200e3dc: 96 10 00 1d mov %i5, %o3 200e3e0: 94 10 00 1b mov %i3, %o2 200e3e4: 40 00 2b 21 call 2019068 <__moddi3> 200e3e8: 92 10 00 11 mov %l1, %o1 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200e3ec: 90 10 00 10 mov %l0, %o0 */ /* * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; 200e3f0: aa 10 00 09 mov %o1, %l5 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200e3f4: 94 10 00 1b mov %i3, %o2 200e3f8: 92 10 00 11 mov %l1, %o1 200e3fc: 40 00 2a 30 call 2018cbc <__divdi3> 200e400: 96 10 00 1d mov %i5, %o3 if ( start_offset ) { 200e404: 80 a5 60 00 cmp %l5, 0 200e408: 02 80 00 4b be 200e534 200e40c: b4 10 00 09 mov %o1, %i2 to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK - start_offset; 200e410: ba 27 40 15 sub %i5, %l5, %i5 200e414: 80 a7 00 1d cmp %i4, %i5 200e418: 18 80 00 5d bgu 200e58c 200e41c: 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 ); 200e420: 90 10 00 12 mov %l2, %o0 200e424: 92 10 00 1a mov %i2, %o1 200e428: 94 10 20 00 clr %o2 200e42c: 7f ff ff 39 call 200e110 200e430: b0 10 20 00 clr %i0 if ( !block_ptr ) 200e434: 80 a2 20 00 cmp %o0, 0 200e438: 02 80 00 53 be 200e584 <== NEVER TAKEN 200e43c: 94 10 00 19 mov %i1, %o2 return copied; memcpy( dest, &(*block_ptr)[ start_offset ], to_copy ); 200e440: d2 02 00 00 ld [ %o0 ], %o1 200e444: 90 10 00 14 mov %l4, %o0 200e448: 40 00 07 8e call 2010280 200e44c: 92 02 40 15 add %o1, %l5, %o1 200e450: fa 04 e1 20 ld [ %l3 + 0x120 ], %i5 dest += to_copy; 200e454: b6 05 00 19 add %l4, %i1, %i3 block++; 200e458: b4 06 a0 01 inc %i2 my_length -= to_copy; 200e45c: 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 ) { 200e460: 80 a7 00 1d cmp %i4, %i5 200e464: 1a 80 00 0e bcc 200e49c 200e468: 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 ) { 200e46c: 10 80 00 1e b 200e4e4 200e470: 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 ); 200e474: d2 00 40 00 ld [ %g1 ], %o1 200e478: 40 00 07 82 call 2010280 200e47c: 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 ) { 200e480: c2 04 e1 20 ld [ %l3 + 0x120 ], %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; 200e484: b6 06 c0 1d add %i3, %i5, %i3 block++; 200e488: 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 ) { 200e48c: 80 a0 40 1c cmp %g1, %i4 200e490: 18 80 00 14 bgu 200e4e0 200e494: b2 06 40 1d add %i1, %i5, %i1 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200e498: 94 10 20 00 clr %o2 200e49c: 92 10 00 1a mov %i2, %o1 200e4a0: 7f ff ff 1c call 200e110 200e4a4: 90 10 00 12 mov %l2, %o0 if ( !block_ptr ) return copied; memcpy( dest, &(*block_ptr)[ 0 ], to_copy ); 200e4a8: 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 ); 200e4ac: 82 10 00 08 mov %o0, %g1 if ( !block_ptr ) 200e4b0: 80 a0 60 00 cmp %g1, 0 200e4b4: 12 bf ff f0 bne 200e474 <== ALWAYS TAKEN 200e4b8: 90 10 00 1b mov %i3, %o0 IMFS_assert( my_length < IMFS_MEMFILE_BYTES_PER_BLOCK ); if ( my_length ) { block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); if ( !block_ptr ) return copied; 200e4bc: 81 c7 e0 08 ret <== NOT EXECUTED 200e4c0: 91 e8 00 19 restore %g0, %i1, %o0 <== 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 ) 200e4c4: 12 bf ff c3 bne 200e3d0 <== NEVER TAKEN 200e4c8: 27 00 80 73 sethi %hi(0x201cc00), %l3 200e4cc: 80 a7 40 04 cmp %i5, %g4 200e4d0: 08 bf ff c1 bleu 200e3d4 200e4d4: fa 04 e1 20 ld [ %l3 + 0x120 ], %i5 my_length = the_jnode->info.file.size - start; 200e4d8: 10 bf ff be b 200e3d0 200e4dc: b8 21 00 01 sub %g4, %g1, %i4 /* * Phase 3: possibly the first part of one block */ IMFS_assert( my_length < IMFS_MEMFILE_BYTES_PER_BLOCK ); if ( my_length ) { 200e4e0: 80 a7 20 00 cmp %i4, 0 200e4e4: 02 80 00 0e be 200e51c 200e4e8: 90 07 bf f8 add %fp, -8, %o0 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200e4ec: 90 10 00 12 mov %l2, %o0 200e4f0: 92 10 00 1a mov %i2, %o1 200e4f4: 7f ff ff 07 call 200e110 200e4f8: 94 10 20 00 clr %o2 if ( !block_ptr ) 200e4fc: 80 a2 20 00 cmp %o0, 0 200e500: 02 bf ff ef be 200e4bc <== NEVER TAKEN 200e504: 94 10 00 1c mov %i4, %o2 return copied; memcpy( dest, &(*block_ptr)[ 0 ], my_length ); 200e508: d2 02 00 00 ld [ %o0 ], %o1 200e50c: 90 10 00 1b mov %i3, %o0 200e510: 40 00 07 5c call 2010280 200e514: b2 06 40 1c add %i1, %i4, %i1 copied += my_length; } IMFS_update_atime( the_jnode ); 200e518: 90 07 bf f8 add %fp, -8, %o0 200e51c: 7f ff d5 1c call 200398c 200e520: 92 10 20 00 clr %o1 200e524: c2 07 bf f8 ld [ %fp + -8 ], %g1 200e528: c2 24 a0 40 st %g1, [ %l2 + 0x40 ] return copied; } 200e52c: 81 c7 e0 08 ret 200e530: 91 e8 00 19 restore %g0, %i1, %o0 unsigned int last_byte; unsigned int copied; unsigned int start_offset; unsigned char *dest; dest = destination; 200e534: b6 10 00 14 mov %l4, %i3 */ last_byte = start + length; if ( last_byte > the_jnode->info.file.size ) my_length = the_jnode->info.file.size - start; copied = 0; 200e538: 10 bf ff ca b 200e460 200e53c: b2 10 20 00 clr %i1 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)) 200e540: f4 1e 20 50 ldd [ %i0 + 0x50 ], %i2 200e544: 82 10 20 00 clr %g1 200e548: 86 a6 c0 11 subcc %i3, %l1, %g3 200e54c: 84 66 80 19 subx %i2, %i1, %g2 200e550: 80 a0 40 02 cmp %g1, %g2 200e554: 04 80 00 10 ble 200e594 <== ALWAYS TAKEN 200e558: d2 06 20 58 ld [ %i0 + 0x58 ], %o1 my_length = the_jnode->info.linearfile.size - start; memcpy(dest, &file_ptr[start], my_length); 200e55c: 92 02 40 11 add %o1, %l1, %o1 <== NOT EXECUTED unsigned char *file_ptr; file_ptr = (unsigned char *)the_jnode->info.linearfile.direct; if (my_length > (the_jnode->info.linearfile.size - start)) my_length = the_jnode->info.linearfile.size - start; 200e560: b0 26 c0 11 sub %i3, %l1, %i0 memcpy(dest, &file_ptr[start], my_length); 200e564: 90 10 00 14 mov %l4, %o0 200e568: 40 00 07 46 call 2010280 200e56c: 94 10 00 18 mov %i0, %o2 IMFS_update_atime( the_jnode ); 200e570: 90 07 bf f8 add %fp, -8, %o0 200e574: 7f ff d5 06 call 200398c 200e578: 92 10 20 00 clr %o1 200e57c: c2 07 bf f8 ld [ %fp + -8 ], %g1 200e580: c2 24 a0 40 st %g1, [ %l2 + 0x40 ] return my_length; 200e584: 81 c7 e0 08 ret 200e588: 81 e8 00 00 restore 200e58c: 10 bf ff a5 b 200e420 200e590: b2 10 00 1d mov %i5, %i1 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)) 200e594: 12 80 00 04 bne 200e5a4 <== NEVER TAKEN 200e598: 80 a7 00 03 cmp %i4, %g3 200e59c: 38 bf ff f1 bgu,a 200e560 <== ALWAYS TAKEN 200e5a0: 92 02 40 11 add %o1, %l1, %o1 my_length = the_jnode->info.linearfile.size - start; memcpy(dest, &file_ptr[start], my_length); 200e5a4: 92 02 40 11 add %o1, %l1, %o1 <== NOT EXECUTED /* * Linear files (as created from a tar file are easier to handle * than block files). */ my_length = length; 200e5a8: b0 10 00 1c mov %i4, %i0 <== NOT EXECUTED file_ptr = (unsigned char *)the_jnode->info.linearfile.direct; if (my_length > (the_jnode->info.linearfile.size - start)) my_length = the_jnode->info.linearfile.size - start; memcpy(dest, &file_ptr[start], my_length); 200e5ac: 90 10 00 14 mov %l4, %o0 <== NOT EXECUTED 200e5b0: 40 00 07 34 call 2010280 <== NOT EXECUTED 200e5b4: 94 10 00 18 mov %i0, %o2 <== NOT EXECUTED IMFS_update_atime( the_jnode ); 200e5b8: 90 07 bf f8 add %fp, -8, %o0 <== NOT EXECUTED 200e5bc: 7f ff d4 f4 call 200398c <== NOT EXECUTED 200e5c0: 92 10 20 00 clr %o1 <== NOT EXECUTED 200e5c4: c2 07 bf f8 ld [ %fp + -8 ], %g1 <== NOT EXECUTED 200e5c8: c2 24 a0 40 st %g1, [ %l2 + 0x40 ] <== NOT EXECUTED return my_length; 200e5cc: 81 c7 e0 08 ret <== NOT EXECUTED 200e5d0: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200e6e8 : * is better to stick to simple, easy to understand algorithms. */ IMFS_jnode_t *IMFS_memfile_remove( IMFS_jnode_t *the_jnode ) { 200e6e8: 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; 200e6ec: 39 00 80 73 sethi %hi(0x201cc00), %i4 * + doubly indirect * + triply indirect */ info = &the_jnode->info.file; if ( info->indirect ) { 200e6f0: 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; 200e6f4: f4 07 21 20 ld [ %i4 + 0x120 ], %i2 * + doubly indirect * + triply indirect */ info = &the_jnode->info.file; if ( info->indirect ) { 200e6f8: 80 a0 60 00 cmp %g1, 0 200e6fc: 02 80 00 05 be 200e710 200e700: b5 36 a0 02 srl %i2, 2, %i2 memfile_free_blocks_in_table( &info->indirect, to_free ); 200e704: 90 06 20 58 add %i0, 0x58, %o0 200e708: 7f ff ff e2 call 200e690 200e70c: 92 10 00 1a mov %i2, %o1 } if ( info->doubly_indirect ) { 200e710: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 200e714: 80 a0 60 00 cmp %g1, 0 200e718: 02 80 00 1b be 200e784 200e71c: c4 07 21 20 ld [ %i4 + 0x120 ], %g2 for ( i=0 ; i <== NEVER TAKEN 200e72c: 90 10 20 00 clr %o0 200e730: 37 00 80 73 sethi %hi(0x201cc00), %i3 200e734: ba 10 20 00 clr %i5 200e738: 10 80 00 03 b 200e744 200e73c: b6 16 e1 20 or %i3, 0x120, %i3 200e740: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 if ( info->doubly_indirect[i] ) { 200e744: 91 2a 20 02 sll %o0, 2, %o0 200e748: c4 00 40 08 ld [ %g1 + %o0 ], %g2 200e74c: 80 a0 a0 00 cmp %g2, 0 200e750: 02 80 00 04 be 200e760 <== NEVER TAKEN 200e754: 90 00 40 08 add %g1, %o0, %o0 memfile_free_blocks_in_table( 200e758: 7f ff ff ce call 200e690 200e75c: 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 200e774: 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 ); 200e778: 90 06 20 5c add %i0, 0x5c, %o0 200e77c: 7f ff ff c5 call 200e690 200e780: 92 10 00 1a mov %i2, %o1 } if ( info->triply_indirect ) { 200e784: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 200e788: 80 a2 20 00 cmp %o0, 0 200e78c: 02 80 00 33 be 200e858 200e790: c4 07 21 20 ld [ %i4 + 0x120 ], %g2 for ( i=0 ; i <== NEVER TAKEN 200e7a0: 90 06 20 60 add %i0, 0x60, %o0 <== NOT EXECUTED p = (block_p *) info->triply_indirect[i]; 200e7a4: f8 02 00 00 ld [ %o0 ], %i4 if ( !p ) /* ensure we have a valid pointer */ 200e7a8: 80 a7 20 00 cmp %i4, 0 200e7ac: 22 80 00 29 be,a 200e850 <== NEVER TAKEN 200e7b0: 90 06 20 60 add %i0, 0x60, %o0 <== NOT EXECUTED 200e7b4: 37 00 80 73 sethi %hi(0x201cc00), %i3 } if ( info->triply_indirect ) { for ( i=0 ; itriply_indirect[i]; 200e7b8: a0 10 20 00 clr %l0 if ( !p ) /* ensure we have a valid pointer */ 200e7bc: b2 10 20 00 clr %i1 200e7c0: b6 16 e1 20 or %i3, 0x120, %i3 break; for ( j=0 ; j <== NEVER TAKEN 200e7cc: 90 02 00 10 add %o0, %l0, %o0 <== NOT EXECUTED 200e7d0: 90 10 20 00 clr %o0 200e7d4: ba 10 20 00 clr %i5 if ( p[j] ) { 200e7d8: 91 2a 20 02 sll %o0, 2, %o0 200e7dc: c2 07 00 08 ld [ %i4 + %o0 ], %g1 200e7e0: 80 a0 60 00 cmp %g1, 0 200e7e4: 02 80 00 04 be 200e7f4 <== NEVER TAKEN 200e7e8: 90 07 00 08 add %i4, %o0, %o0 memfile_free_blocks_in_table( (block_p **)&p[j], to_free); 200e7ec: 7f ff ff a9 call 200e690 200e7f0: 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 200e808: 90 10 00 1d mov %i5, %o0 200e80c: 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( 200e810: 90 02 00 10 add %o0, %l0, %o0 200e814: 7f ff ff 9f call 200e690 200e818: 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 200e830: 90 06 20 60 add %i0, 0x60, %o0 p = (block_p *) info->triply_indirect[i]; 200e834: 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( 200e838: a1 2e 60 02 sll %i1, 2, %l0 } if ( info->triply_indirect ) { for ( i=0 ; itriply_indirect[i]; 200e83c: f8 02 00 10 ld [ %o0 + %l0 ], %i4 if ( !p ) /* ensure we have a valid pointer */ 200e840: 80 a7 20 00 cmp %i4, 0 200e844: 12 bf ff e1 bne 200e7c8 <== ALWAYS TAKEN 200e848: 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( 200e84c: 90 06 20 60 add %i0, 0x60, %o0 <== NOT EXECUTED 200e850: 7f ff ff 90 call 200e690 200e854: 92 10 00 1a mov %i2, %o1 (block_p **)&info->triply_indirect, to_free ); } return the_jnode; } 200e858: 81 c7 e0 08 ret 200e85c: 81 e8 00 00 restore =============================================================================== 0200e860 : */ MEMFILE_STATIC int IMFS_memfile_remove_block( IMFS_jnode_t *the_jnode, unsigned int block ) { 200e860: 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 ); 200e864: 94 10 20 00 clr %o2 <== NOT EXECUTED 200e868: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 200e86c: 7f ff fe 29 call 200e110 <== NOT EXECUTED 200e870: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED 200e874: 82 10 00 08 mov %o0, %g1 <== NOT EXECUTED IMFS_assert( block_ptr ); ptr = *block_ptr; 200e878: d0 02 00 00 ld [ %o0 ], %o0 <== NOT EXECUTED *block_ptr = 0; memfile_free_block( ptr ); return 1; } 200e87c: 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 ); 200e880: 7f ff ff 7b call 200e66c <== NOT EXECUTED 200e884: c0 20 40 00 clr [ %g1 ] <== NOT EXECUTED return 1; } 200e888: 81 c7 e0 08 ret <== NOT EXECUTED 200e88c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200ea54 : IMFS_jnode_t *the_jnode, off_t start, const unsigned char *source, unsigned int length ) { 200ea54: 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 ) { 200ea58: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 200ea5c: 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; 200ea60: 96 07 00 1a add %i4, %i2, %o3 if ( last_byte > the_jnode->info.file.size ) { 200ea64: 80 a0 80 01 cmp %g2, %g1 200ea68: 14 80 00 5e bg 200ebe0 <== NEVER TAKEN 200ea6c: c6 06 20 54 ld [ %i0 + 0x54 ], %g3 200ea70: 80 a0 80 01 cmp %g2, %g1 200ea74: 02 80 00 59 be 200ebd8 <== ALWAYS TAKEN 200ea78: 80 a2 c0 03 cmp %o3, %g3 */ /* * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; 200ea7c: 21 00 80 73 sethi %hi(0x201cc00), %l0 <== NOT EXECUTED 200ea80: fa 04 21 20 ld [ %l0 + 0x120 ], %i5 ! 201cd20 200ea84: 90 10 00 19 mov %i1, %o0 200ea88: a3 3f 60 1f sra %i5, 0x1f, %l1 200ea8c: 92 10 00 1a mov %i2, %o1 200ea90: 94 10 00 11 mov %l1, %o2 200ea94: 40 00 29 75 call 2019068 <__moddi3> 200ea98: 96 10 00 1d mov %i5, %o3 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200ea9c: 90 10 00 19 mov %i1, %o0 */ /* * Phase 1: possibly the last part of one block */ start_offset = start % IMFS_MEMFILE_BYTES_PER_BLOCK; 200eaa0: a4 10 00 09 mov %o1, %l2 block = start / IMFS_MEMFILE_BYTES_PER_BLOCK; 200eaa4: 94 10 00 11 mov %l1, %o2 200eaa8: 92 10 00 1a mov %i2, %o1 200eaac: 40 00 28 84 call 2018cbc <__divdi3> 200eab0: 96 10 00 1d mov %i5, %o3 status = IMFS_memfile_extend( the_jnode, zero_fill, last_byte ); if ( status ) return status; } copied = 0; 200eab4: 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 ) { 200eab8: 80 a4 a0 00 cmp %l2, 0 200eabc: 02 80 00 16 be 200eb14 200eac0: b4 10 00 09 mov %o1, %i2 to_copy = IMFS_MEMFILE_BYTES_PER_BLOCK - start_offset; 200eac4: b2 27 40 12 sub %i5, %l2, %i1 200eac8: 80 a6 40 1c cmp %i1, %i4 200eacc: 38 80 00 02 bgu,a 200ead4 200ead0: 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 ); 200ead4: 90 10 00 18 mov %i0, %o0 200ead8: 92 10 00 1a mov %i2, %o1 200eadc: 7f ff fd 8d call 200e110 200eae0: 94 10 20 00 clr %o2 if ( !block_ptr ) 200eae4: 80 a2 20 00 cmp %o0, 0 200eae8: 02 80 00 22 be 200eb70 <== NEVER TAKEN 200eaec: 82 10 20 00 clr %g1 block, to_copy, src ); #endif memcpy( &(*block_ptr)[ start_offset ], src, to_copy ); 200eaf0: d0 02 00 00 ld [ %o0 ], %o0 200eaf4: 92 10 00 1b mov %i3, %o1 200eaf8: 90 02 00 12 add %o0, %l2, %o0 200eafc: 40 00 05 e1 call 2010280 200eb00: 94 10 00 19 mov %i1, %o2 200eb04: fa 04 21 20 ld [ %l0 + 0x120 ], %i5 src += to_copy; 200eb08: b6 06 c0 19 add %i3, %i1, %i3 block++; 200eb0c: b4 06 a0 01 inc %i2 my_length -= to_copy; 200eb10: 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 ) { 200eb14: 80 a7 00 1d cmp %i4, %i5 200eb18: 1a 80 00 0e bcc 200eb50 200eb1c: 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 ) { 200eb20: 10 80 00 17 b 200eb7c 200eb24: 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 ); 200eb28: d0 02 00 00 ld [ %o0 ], %o0 200eb2c: 40 00 05 d5 call 2010280 200eb30: 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 ) { 200eb34: c2 04 21 20 ld [ %l0 + 0x120 ], %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; 200eb38: b6 06 c0 1d add %i3, %i5, %i3 block++; 200eb3c: 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 ) { 200eb40: 80 a0 40 1c cmp %g1, %i4 200eb44: 18 80 00 0d bgu 200eb78 200eb48: b2 06 40 1d add %i1, %i5, %i1 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200eb4c: 92 10 00 1a mov %i2, %o1 200eb50: 94 10 20 00 clr %o2 200eb54: 7f ff fd 6f call 200e110 200eb58: 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 ); 200eb5c: 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 ) 200eb60: 80 a2 20 00 cmp %o0, 0 200eb64: 12 bf ff f1 bne 200eb28 <== ALWAYS TAKEN 200eb68: 94 10 00 1d mov %i5, %o2 200eb6c: 82 10 00 19 mov %i1, %g1 <== NOT EXECUTED } IMFS_mtime_ctime_update( the_jnode ); return copied; } 200eb70: 81 c7 e0 08 ret <== NOT EXECUTED 200eb74: 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 ) { 200eb78: 80 a7 20 00 cmp %i4, 0 200eb7c: 02 80 00 0f be 200ebb8 200eb80: 90 07 bf f8 add %fp, -8, %o0 block_ptr = IMFS_memfile_get_block_pointer( the_jnode, block, 0 ); 200eb84: 90 10 00 18 mov %i0, %o0 200eb88: 92 10 00 1a mov %i2, %o1 200eb8c: 7f ff fd 61 call 200e110 200eb90: 94 10 20 00 clr %o2 if ( !block_ptr ) 200eb94: 80 a2 20 00 cmp %o0, 0 200eb98: 02 bf ff f6 be 200eb70 <== NEVER TAKEN 200eb9c: 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 ); 200eba0: d0 02 00 00 ld [ %o0 ], %o0 200eba4: 92 10 00 1b mov %i3, %o1 200eba8: 94 10 00 1c mov %i4, %o2 200ebac: 40 00 05 b5 call 2010280 200ebb0: b2 06 40 1c add %i1, %i4, %i1 my_length = 0; copied += to_copy; } IMFS_mtime_ctime_update( the_jnode ); 200ebb4: 90 07 bf f8 add %fp, -8, %o0 200ebb8: 7f ff d3 75 call 200398c 200ebbc: 92 10 20 00 clr %o1 200ebc0: c4 07 bf f8 ld [ %fp + -8 ], %g2 return copied; 200ebc4: 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 ); 200ebc8: c4 26 20 44 st %g2, [ %i0 + 0x44 ] 200ebcc: c4 26 20 48 st %g2, [ %i0 + 0x48 ] return copied; } 200ebd0: 81 c7 e0 08 ret 200ebd4: 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 ) { 200ebd8: 08 bf ff aa bleu 200ea80 200ebdc: 21 00 80 73 sethi %hi(0x201cc00), %l0 bool zero_fill = start > the_jnode->info.file.size; 200ebe0: 80 a6 40 01 cmp %i1, %g1 200ebe4: 04 80 00 0b ble 200ec10 <== ALWAYS TAKEN 200ebe8: 92 10 20 01 mov 1, %o1 status = IMFS_memfile_extend( the_jnode, zero_fill, last_byte ); 200ebec: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 200ebf0: 92 0a 60 01 and %o1, 1, %o1 200ebf4: 7f ff ff 27 call 200e890 200ebf8: 94 10 20 00 clr %o2 if ( status ) 200ebfc: 82 92 20 00 orcc %o0, 0, %g1 200ec00: 02 bf ff a0 be 200ea80 200ec04: 21 00 80 73 sethi %hi(0x201cc00), %l0 } IMFS_mtime_ctime_update( the_jnode ); return copied; } 200ec08: 81 c7 e0 08 ret 200ec0c: 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; 200ec10: 02 80 00 0b be 200ec3c <== ALWAYS TAKEN 200ec14: 80 a6 80 03 cmp %i2, %g3 200ec18: 92 10 20 00 clr %o1 <== NOT EXECUTED status = IMFS_memfile_extend( the_jnode, zero_fill, last_byte ); 200ec1c: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 200ec20: 92 0a 60 01 and %o1, 1, %o1 200ec24: 7f ff ff 1b call 200e890 200ec28: 94 10 20 00 clr %o2 if ( status ) 200ec2c: 82 92 20 00 orcc %o0, 0, %g1 200ec30: 02 bf ff 94 be 200ea80 200ec34: 21 00 80 73 sethi %hi(0x201cc00), %l0 200ec38: 30 bf ff f4 b,a 200ec08 * 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; 200ec3c: 18 bf ff ed bgu 200ebf0 200ec40: 90 10 00 18 mov %i0, %o0 200ec44: 10 bf ff f7 b 200ec20 200ec48: 92 10 20 00 clr %o1 =============================================================================== 02003100 : const char *name, size_t namelen, mode_t mode, dev_t dev ) { 2003100: 9d e3 bf 80 save %sp, -128, %sp dev_t dev, IMFS_jnode_types_t *type, IMFS_types_union *info ) { if ( S_ISDIR( mode ) ) { 2003104: 03 00 00 3c sethi %hi(0xf000), %g1 2003108: 05 00 00 10 sethi %hi(0x4000), %g2 200310c: 82 0e c0 01 and %i3, %g1, %g1 2003110: 80 a0 40 02 cmp %g1, %g2 2003114: 02 80 00 2b be 20031c0 2003118: 05 00 00 20 sethi %hi(0x8000), %g2 *type = IMFS_DIRECTORY; } else if ( S_ISREG( mode ) ) { 200311c: 80 a0 40 02 cmp %g1, %g2 2003120: 02 80 00 2a be 20031c8 2003124: 09 00 00 2c sethi %hi(0xb000), %g4 *type = IMFS_MEMORY_FILE; } else if ( S_ISBLK( mode ) || S_ISCHR( mode ) ) { 2003128: 05 00 00 08 sethi %hi(0x2000), %g2 200312c: 88 0e c0 04 and %i3, %g4, %g4 2003130: 80 a1 00 02 cmp %g4, %g2 2003134: 02 80 00 07 be 2003150 2003138: 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 )) { 200313c: 80 a0 40 02 cmp %g1, %g2 2003140: 22 80 00 06 be,a 2003158 <== ALWAYS TAKEN 2003144: 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 = 2003148: 10 80 00 05 b 200315c <== NOT EXECUTED 200314c: 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( 2003150: 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; 2003154: 86 10 20 01 mov 1, %g3 2003158: c4 06 20 14 ld [ %i0 + 0x14 ], %g2 (const IMFS_fs_info_t *) parentloc->mt_entry->fs_info; return IMFS_create_node_with_control( 200315c: 82 00 e0 02 add %g3, 2, %g1 2003160: c4 00 a0 08 ld [ %g2 + 8 ], %g2 2003164: 83 28 60 02 sll %g1, 2, %g1 2003168: d2 00 80 01 ld [ %g2 + %g1 ], %o1 200316c: 90 10 00 18 mov %i0, %o0 2003170: 94 10 00 19 mov %i1, %o2 2003174: 96 10 00 1a mov %i2, %o3 2003178: 98 10 00 1b mov %i3, %o4 200317c: 40 00 23 b6 call 200c054 2003180: 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 ) { 2003184: 80 a2 20 00 cmp %o0, 0 2003188: 02 80 00 12 be 20031d0 200318c: 92 10 20 00 clr %o1 IMFS_jnode_t *parent = parentloc->node_access; 2003190: fa 06 20 08 ld [ %i0 + 8 ], %i5 IMFS_update_ctime( parent ); 2003194: 40 00 01 fe call 200398c 2003198: 90 07 bf e0 add %fp, -32, %o0 200319c: c2 07 bf e0 ld [ %fp + -32 ], %g1 IMFS_update_mtime( parent ); 20031a0: 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 ); 20031a4: c2 27 60 48 st %g1, [ %i5 + 0x48 ] IMFS_update_mtime( parent ); 20031a8: 40 00 01 f9 call 200398c 20031ac: 92 10 20 00 clr %o1 20031b0: c2 07 bf e0 ld [ %fp + -32 ], %g1 20031b4: c2 27 60 44 st %g1, [ %i5 + 0x44 ] size_t namelen, mode_t mode, dev_t dev ) { int rv = 0; 20031b8: 81 c7 e0 08 ret 20031bc: 91 e8 20 00 restore %g0, 0, %o0 IMFS_jnode_types_t *type, IMFS_types_union *info ) { if ( S_ISDIR( mode ) ) { *type = IMFS_DIRECTORY; 20031c0: 10 bf ff e6 b 2003158 20031c4: 86 10 20 00 clr %g3 } else if ( S_ISREG( mode ) ) { *type = IMFS_MEMORY_FILE; 20031c8: 10 bf ff e4 b 2003158 20031cc: 86 10 20 04 mov 4, %g3 } else { rv = -1; } return rv; } 20031d0: 81 c7 e0 08 ret 20031d4: 91 e8 3f ff restore %g0, -1, %o0 =============================================================================== 020031d8 : #endif #include "imfs.h" int IMFS_mount( rtems_filesystem_mount_table_entry_t *mt_entry ) { 20031d8: 9d e3 bf a0 save %sp, -96, %sp int rv = 0; IMFS_jnode_t *node = mt_entry->mt_point_node->location.node_access; 20031dc: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 20031e0: 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; 20031e4: c4 00 60 4c ld [ %g1 + 0x4c ], %g2 if ( IMFS_is_directory( node ) ) { 20031e8: c4 00 80 00 ld [ %g2 ], %g2 20031ec: 80 a0 a0 00 cmp %g2, 0 20031f0: 12 80 00 0f bne 200322c 20031f4: 01 00 00 00 nop if ( node->info.directory.mt_fs == NULL ) { 20031f8: c4 00 60 5c ld [ %g1 + 0x5c ], %g2 20031fc: 80 a0 a0 00 cmp %g2, 0 2003200: 12 80 00 05 bne 2003214 <== NEVER TAKEN 2003204: 01 00 00 00 nop node->info.directory.mt_fs = mt_entry; 2003208: 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; 200320c: 81 c7 e0 08 ret 2003210: 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; 2003214: 40 00 31 d4 call 200f964 <__errno> <== NOT EXECUTED 2003218: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 200321c: 82 10 20 10 mov 0x10, %g1 <== NOT EXECUTED 2003220: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2003224: 81 c7 e0 08 ret <== NOT EXECUTED 2003228: 81 e8 00 00 restore <== NOT EXECUTED rv = -1; } } else { errno = ENOTDIR; 200322c: 40 00 31 ce call 200f964 <__errno> 2003230: b0 10 3f ff mov -1, %i0 2003234: 82 10 20 14 mov 0x14, %g1 2003238: c2 22 00 00 st %g1, [ %o0 ] rv = -1; } return rv; } 200323c: 81 c7 e0 08 ret 2003240: 81 e8 00 00 restore =============================================================================== 0200c4a8 : static IMFS_jnode_t *IMFS_node_remove_directory( IMFS_jnode_t *node, const IMFS_jnode_t *root_node ) { 200c4a8: 9d e3 bf a0 save %sp, -96, %sp if ( !rtems_chain_is_empty( &node->info.directory.Entries ) ) { 200c4ac: 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 ); 200c4b0: 82 06 20 54 add %i0, 0x54, %g1 200c4b4: 80 a0 80 01 cmp %g2, %g1 200c4b8: 12 80 00 10 bne 200c4f8 200c4bc: 80 a6 00 19 cmp %i0, %i1 errno = ENOTEMPTY; node = NULL; } else if ( node == root_node || IMFS_is_mount_point( node ) ) { 200c4c0: 02 80 00 08 be 200c4e0 200c4c4: 01 00 00 00 nop 200c4c8: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 200c4cc: 80 a0 60 00 cmp %g1, 0 200c4d0: 12 80 00 04 bne 200c4e0 <== NEVER TAKEN 200c4d4: 01 00 00 00 nop errno = EBUSY; node = NULL; } return node; } 200c4d8: 81 c7 e0 08 ret 200c4dc: 81 e8 00 00 restore { if ( !rtems_chain_is_empty( &node->info.directory.Entries ) ) { errno = ENOTEMPTY; node = NULL; } else if ( node == root_node || IMFS_is_mount_point( node ) ) { errno = EBUSY; 200c4e0: 40 00 0d 21 call 200f964 <__errno> 200c4e4: b0 10 20 00 clr %i0 200c4e8: 82 10 20 10 mov 0x10, %g1 200c4ec: c2 22 00 00 st %g1, [ %o0 ] node = NULL; } return node; } 200c4f0: 81 c7 e0 08 ret 200c4f4: 81 e8 00 00 restore IMFS_jnode_t *node, const IMFS_jnode_t *root_node ) { if ( !rtems_chain_is_empty( &node->info.directory.Entries ) ) { errno = ENOTEMPTY; 200c4f8: 40 00 0d 1b call 200f964 <__errno> 200c4fc: b0 10 20 00 clr %i0 200c500: 82 10 20 5a mov 0x5a, %g1 200c504: c2 22 00 00 st %g1, [ %o0 ] 200c508: 81 c7 e0 08 ret 200c50c: 81 e8 00 00 restore =============================================================================== 02003244 : rtems_filesystem_node_types_t IMFS_node_type( const rtems_filesystem_location_info_t *loc ) { const IMFS_jnode_t *node = loc->node_access; 2003244: 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; 2003248: c2 00 a0 4c ld [ %g2 + 0x4c ], %g1 200324c: 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 ) { 2003250: 80 a0 60 02 cmp %g1, 2 2003254: 02 80 00 06 be 200326c 2003258: 80 a0 60 05 cmp %g1, 5 200325c: 02 80 00 08 be 200327c <== NEVER TAKEN 2003260: 90 10 20 04 mov 4, %o0 type = imfs_type; break; } return type; } 2003264: 81 c3 e0 08 retl 2003268: 90 10 00 01 mov %g1, %o0 200326c: c2 00 a0 50 ld [ %g2 + 0x50 ], %g1 2003270: 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; 2003274: 81 c3 e0 08 retl 2003278: d0 00 40 00 ld [ %g1 ], %o0 200327c: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 02003284 : node = loc->node_access; IMFS_assert( node->control.imfs_type == IMFS_SYM_LINK ); for( i=0; ((iinfo.sym_link.name[i] != '\0')); i++ ) 2003284: 80 a2 a0 00 cmp %o2, 0 2003288: 02 80 00 16 be 20032e0 <== NEVER TAKEN 200328c: c8 02 20 08 ld [ %o0 + 8 ], %g4 2003290: c2 01 20 50 ld [ %g4 + 0x50 ], %g1 2003294: c4 48 40 00 ldsb [ %g1 ], %g2 2003298: 80 a0 a0 00 cmp %g2, 0 200329c: 02 80 00 11 be 20032e0 <== NEVER TAKEN 20032a0: c2 08 40 00 ldub [ %g1 ], %g1 20032a4: 84 10 20 00 clr %g2 20032a8: 10 80 00 07 b 20032c4 20032ac: 90 10 20 00 clr %o0 20032b0: c2 01 20 50 ld [ %g4 + 0x50 ], %g1 20032b4: c6 48 40 08 ldsb [ %g1 + %o0 ], %g3 20032b8: 80 a0 e0 00 cmp %g3, 0 20032bc: 02 80 00 07 be 20032d8 20032c0: c2 08 40 08 ldub [ %g1 + %o0 ], %g1 buf[i] = node->info.sym_link.name[i]; 20032c4: 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++ ) 20032c8: 90 02 20 01 inc %o0 20032cc: 80 a2 00 0a cmp %o0, %o2 20032d0: 12 bf ff f8 bne 20032b0 20032d4: 84 10 00 08 mov %o0, %g2 buf[i] = node->info.sym_link.name[i]; return i; } 20032d8: 81 c3 e0 08 retl 20032dc: 01 00 00 00 nop 20032e0: 81 c3 e0 08 retl <== NOT EXECUTED 20032e4: 90 10 20 00 clr %o0 ! 0 <== NOT EXECUTED =============================================================================== 020032e8 : const rtems_filesystem_location_info_t *oldloc, const rtems_filesystem_location_info_t *newparentloc, const char *name, size_t namelen ) { 20032e8: 9d e3 bf 98 save %sp, -104, %sp int rv = 0; IMFS_jnode_t *node = oldloc->node_access; 20032ec: 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 ) { 20032f0: c2 07 60 08 ld [ %i5 + 8 ], %g1 20032f4: 80 a0 60 00 cmp %g1, 0 20032f8: 02 80 00 22 be 2003380 <== NEVER TAKEN 20032fc: f4 06 a0 08 ld [ %i2 + 8 ], %i2 if ( namelen < IMFS_NAME_MAX ) { 2003300: 80 a7 20 1f cmp %i4, 0x1f 2003304: 18 80 00 19 bgu 2003368 <== NEVER TAKEN 2003308: 94 10 00 1c mov %i4, %o2 memcpy( node->name, name, namelen ); 200330c: 92 10 00 1b mov %i3, %o1 2003310: 40 00 33 dc call 2010280 2003314: 90 07 60 0c add %i5, 0xc, %o0 node->name [namelen] = '\0'; 2003318: b8 07 40 1c add %i5, %i4, %i4 200331c: c0 2f 20 0c clrb [ %i4 + 0xc ] { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 2003320: c2 07 60 04 ld [ %i5 + 4 ], %g1 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 2003324: 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 ); 2003328: 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; 200332c: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 2003330: 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; 2003334: 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; 2003338: f4 27 60 08 st %i2, [ %i5 + 8 ] the_node->next = tail; 200333c: c6 27 40 00 st %g3, [ %i5 ] tail->previous = the_node; 2003340: fa 26 a0 58 st %i5, [ %i2 + 0x58 ] old_last->next = the_node; 2003344: fa 20 40 00 st %i5, [ %g1 ] the_node->previous = old_last; 2003348: c2 27 60 04 st %g1, [ %i5 + 4 ] IMFS_remove_from_directory( node ); IMFS_add_to_directory( new_parent, node ); IMFS_update_ctime( node ); 200334c: 90 07 bf f8 add %fp, -8, %o0 2003350: 40 00 01 8f call 200398c 2003354: 92 10 20 00 clr %o1 2003358: c2 07 bf f8 ld [ %fp + -8 ], %g1 200335c: c2 27 60 48 st %g1, [ %i5 + 0x48 ] const rtems_filesystem_location_info_t *newparentloc, const char *name, size_t namelen ) { int rv = 0; 2003360: 81 c7 e0 08 ret 2003364: 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; 2003368: 40 00 31 7f call 200f964 <__errno> <== NOT EXECUTED 200336c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2003370: 82 10 20 5b mov 0x5b, %g1 <== NOT EXECUTED 2003374: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2003378: 81 c7 e0 08 ret <== NOT EXECUTED 200337c: 81 e8 00 00 restore <== NOT EXECUTED rv = -1; } } else { errno = EINVAL; 2003380: 40 00 31 79 call 200f964 <__errno> <== NOT EXECUTED 2003384: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2003388: 82 10 20 16 mov 0x16, %g1 <== NOT EXECUTED 200338c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED rv = -1; } return rv; } 2003390: 81 c7 e0 08 ret <== NOT EXECUTED 2003394: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200348c : #endif #include "imfs.h" int IMFS_unmount( rtems_filesystem_mount_table_entry_t *mt_entry ) { 200348c: 9d e3 bf a0 save %sp, -96, %sp int rv = 0; IMFS_jnode_t *node = mt_entry->mt_point_node->location.node_access; 2003490: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 2003494: 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; 2003498: c4 00 60 4c ld [ %g1 + 0x4c ], %g2 if ( IMFS_is_directory( node ) ) { 200349c: c4 00 80 00 ld [ %g2 ], %g2 20034a0: 80 a0 a0 00 cmp %g2, 0 20034a4: 12 80 00 0f bne 20034e0 <== NEVER TAKEN 20034a8: 01 00 00 00 nop if ( node->info.directory.mt_fs == mt_entry ) { 20034ac: c4 00 60 5c ld [ %g1 + 0x5c ], %g2 20034b0: 80 a0 80 18 cmp %g2, %i0 20034b4: 12 80 00 05 bne 20034c8 <== NEVER TAKEN 20034b8: 01 00 00 00 nop node->info.directory.mt_fs = NULL; 20034bc: c0 20 60 5c clr [ %g1 + 0x5c ] #include "imfs.h" int IMFS_unmount( rtems_filesystem_mount_table_entry_t *mt_entry ) { int rv = 0; 20034c0: 81 c7 e0 08 ret 20034c4: 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; 20034c8: 40 00 31 27 call 200f964 <__errno> <== NOT EXECUTED 20034cc: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20034d0: 82 10 20 16 mov 0x16, %g1 <== NOT EXECUTED 20034d4: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 20034d8: 81 c7 e0 08 ret <== NOT EXECUTED 20034dc: 81 e8 00 00 restore <== NOT EXECUTED rv = -1; } } else { errno = ENOTDIR; 20034e0: 40 00 31 21 call 200f964 <__errno> <== NOT EXECUTED 20034e4: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20034e8: 82 10 20 14 mov 0x14, %g1 <== NOT EXECUTED 20034ec: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED rv = -1; } return rv; } 20034f0: 81 c7 e0 08 ret <== NOT EXECUTED 20034f4: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02003bb8 : void RTEMS_Malloc_Initialize( void *heap_begin, uintptr_t heap_size, size_t sbrk_amount ) { 2003bb8: 9d e3 bf a0 save %sp, -96, %sp bool separate_areas = !rtems_configuration_get_unified_work_area(); /* * If configured, initialize the statistics support */ if ( rtems_malloc_statistics_helpers != NULL ) { 2003bbc: 03 00 80 73 sethi %hi(0x201cc00), %g1 2003bc0: c2 00 60 f8 ld [ %g1 + 0xf8 ], %g1 ! 201ccf8 void *heap_begin, uintptr_t heap_size, size_t sbrk_amount ) { bool separate_areas = !rtems_configuration_get_unified_work_area(); 2003bc4: 3b 00 80 71 sethi %hi(0x201c400), %i5 /* * If configured, initialize the statistics support */ if ( rtems_malloc_statistics_helpers != NULL ) { 2003bc8: 80 a0 60 00 cmp %g1, 0 void *heap_begin, uintptr_t heap_size, size_t sbrk_amount ) { bool separate_areas = !rtems_configuration_get_unified_work_area(); 2003bcc: ba 17 60 cc or %i5, 0xcc, %i5 /* * If configured, initialize the statistics support */ if ( rtems_malloc_statistics_helpers != NULL ) { 2003bd0: 02 80 00 05 be 2003be4 2003bd4: f8 0f 60 35 ldub [ %i5 + 0x35 ], %i4 (*rtems_malloc_statistics_helpers->initialize)(); 2003bd8: c2 00 40 00 ld [ %g1 ], %g1 2003bdc: 9f c0 40 00 call %g1 2003be0: 01 00 00 00 nop } /* * Initialize the garbage collection list to start with nothing on it. */ malloc_deferred_frees_initialize(); 2003be4: 7f ff ff db call 2003b50 2003be8: 01 00 00 00 nop /* * Initialize the optional sbrk support for extending the heap */ if ( rtems_malloc_sbrk_helpers != NULL ) { 2003bec: 03 00 80 73 sethi %hi(0x201cc00), %g1 2003bf0: c2 00 60 f4 ld [ %g1 + 0xf4 ], %g1 ! 201ccf4 2003bf4: 80 a0 60 00 cmp %g1, 0 2003bf8: 02 80 00 08 be 2003c18 2003bfc: 90 10 00 18 mov %i0, %o0 void *new_heap_begin = (*rtems_malloc_sbrk_helpers->initialize)( 2003c00: c2 00 40 00 ld [ %g1 ], %g1 heap_begin, sbrk_amount ); heap_size -= (uintptr_t) new_heap_begin - (uintptr_t) heap_begin; 2003c04: b2 06 00 19 add %i0, %i1, %i1 /* * Initialize the optional sbrk support for extending the heap */ if ( rtems_malloc_sbrk_helpers != NULL ) { void *new_heap_begin = (*rtems_malloc_sbrk_helpers->initialize)( 2003c08: 9f c0 40 00 call %g1 2003c0c: 92 10 00 1a mov %i2, %o1 heap_begin, sbrk_amount ); heap_size -= (uintptr_t) new_heap_begin - (uintptr_t) heap_begin; heap_begin = new_heap_begin; 2003c10: b0 10 00 08 mov %o0, %i0 void *new_heap_begin = (*rtems_malloc_sbrk_helpers->initialize)( heap_begin, sbrk_amount ); heap_size -= (uintptr_t) new_heap_begin - (uintptr_t) heap_begin; 2003c14: b2 26 40 08 sub %i1, %o0, %i1 * of the time under UNIX because zero'ing memory when it is first * given to a process eliminates the chance of a process seeing data * left over from another process. This would be a security violation. */ if ( separate_areas && rtems_configuration_get_do_zero_of_workspace() ) { 2003c18: 80 8f 20 ff btst 0xff, %i4 2003c1c: 22 80 00 0b be,a 2003c48 2003c20: c2 0f 60 34 ldub [ %i5 + 0x34 ], %g1 2003c24: 39 00 80 71 sethi %hi(0x201c400), %i4 if ( status == 0 ) { rtems_fatal_error_occurred( RTEMS_NO_MEMORY ); } } MSBUMP( space_available, _Protected_heap_Get_size(RTEMS_Malloc_Heap) ); 2003c28: 3b 00 80 74 sethi %hi(0x201d000), %i5 2003c2c: d0 07 21 bc ld [ %i4 + 0x1bc ], %o0 2003c30: 40 00 18 02 call 2009c38 <_Protected_heap_Get_size> 2003c34: f8 07 60 b0 ld [ %i5 + 0xb0 ], %i4 2003c38: 90 02 00 1c add %o0, %i4, %o0 2003c3c: d0 27 60 b0 st %o0, [ %i5 + 0xb0 ] 2003c40: 81 c7 e0 08 ret 2003c44: 81 e8 00 00 restore * of the time under UNIX because zero'ing memory when it is first * given to a process eliminates the chance of a process seeing data * left over from another process. This would be a security violation. */ if ( separate_areas && rtems_configuration_get_do_zero_of_workspace() ) { 2003c48: 80 a0 60 00 cmp %g1, 0 2003c4c: 12 80 00 0c bne 2003c7c 2003c50: 39 00 80 71 sethi %hi(0x201c400), %i4 void *area_begin, uintptr_t area_size, uintptr_t page_size ) { return _Heap_Initialize( heap, area_begin, area_size, page_size ); 2003c54: d0 07 21 bc ld [ %i4 + 0x1bc ], %o0 ! 201c5bc 2003c58: 92 10 00 18 mov %i0, %o1 2003c5c: 94 10 00 19 mov %i1, %o2 2003c60: 40 00 14 ee call 2009018 <_Heap_Initialize> 2003c64: 96 10 20 08 mov 8, %o3 RTEMS_Malloc_Heap, heap_begin, heap_size, CPU_HEAP_ALIGNMENT ); if ( status == 0 ) { 2003c68: 80 a2 20 00 cmp %o0, 0 2003c6c: 32 bf ff f0 bne,a 2003c2c 2003c70: 3b 00 80 74 sethi %hi(0x201d000), %i5 rtems_fatal_error_occurred( RTEMS_NO_MEMORY ); 2003c74: 40 00 12 27 call 2008510 2003c78: 90 10 20 1a mov 0x1a, %o0 * given to a process eliminates the chance of a process seeing data * left over from another process. This would be a security violation. */ if ( separate_areas && rtems_configuration_get_do_zero_of_workspace() ) { memset( heap_begin, 0, heap_size ); 2003c7c: 92 10 20 00 clr %o1 2003c80: 94 10 00 19 mov %i1, %o2 2003c84: 40 00 31 bc call 2010374 2003c88: 90 10 00 18 mov %i0, %o0 2003c8c: 39 00 80 71 sethi %hi(0x201c400), %i4 2003c90: d0 07 21 bc ld [ %i4 + 0x1bc ], %o0 ! 201c5bc 2003c94: 92 10 00 18 mov %i0, %o1 2003c98: 94 10 00 19 mov %i1, %o2 2003c9c: 40 00 14 df call 2009018 <_Heap_Initialize> 2003ca0: 96 10 20 08 mov 8, %o3 RTEMS_Malloc_Heap, heap_begin, heap_size, CPU_HEAP_ALIGNMENT ); if ( status == 0 ) { 2003ca4: 80 a2 20 00 cmp %o0, 0 2003ca8: 32 bf ff e1 bne,a 2003c2c <== ALWAYS TAKEN 2003cac: 3b 00 80 74 sethi %hi(0x201d000), %i5 2003cb0: 30 bf ff f1 b,a 2003c74 <== NOT EXECUTED =============================================================================== 02025030 : static rtems_printk_plugin_t print_handler; static void Stack_check_Dump_threads_usage( Thread_Control *the_thread ) { 2025030: 9d e3 bf 98 save %sp, -104, %sp /* * Obtain interrupt stack information */ #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if (the_thread == (Thread_Control *) -1) { 2025034: 80 a6 3f ff cmp %i0, -1 2025038: 02 80 00 56 be 2025190 202503c: ba 06 20 b0 add %i0, 0xb0, %i5 current = 0; } else #endif { stack = &the_thread->Start.Initial_stack; current = (void *)_CPU_Context_Get_SP( &the_thread->Registers ); 2025040: e2 06 21 38 ld [ %i0 + 0x138 ], %l1 2025044: f8 06 20 b4 ld [ %i0 + 0xb4 ], %i4 } low = Stack_check_usable_stack_start(stack); size = Stack_check_usable_stack_size(stack); 2025048: f4 07 40 00 ld [ %i5 ], %i2 /* * start at lower memory and find first word that does not * match pattern */ base += PATTERN_SIZE_WORDS; 202504c: 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); 2025050: 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++) 2025054: 86 0e bf fc and %i2, -4, %g3 2025058: 86 00 40 03 add %g1, %g3, %g3 202505c: 80 a0 40 03 cmp %g1, %g3 2025060: 1a 80 00 10 bcc 20250a0 <== NEVER TAKEN 2025064: 05 29 69 69 sethi %hi(0xa5a5a400), %g2 if (*base != U32_PATTERN) 2025068: c8 07 20 20 ld [ %i4 + 0x20 ], %g4 202506c: 84 10 a1 a5 or %g2, 0x1a5, %g2 2025070: 80 a1 00 02 cmp %g4, %g2 2025074: 22 80 00 08 be,a 2025094 <== ALWAYS TAKEN 2025078: 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); 202507c: 10 80 00 37 b 2025158 <== NOT EXECUTED 2025080: 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) 2025084: 80 a0 80 04 cmp %g2, %g4 2025088: 12 80 00 34 bne 2025158 202508c: 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++) 2025090: 82 00 60 04 add %g1, 4, %g1 2025094: 80 a0 c0 01 cmp %g3, %g1 2025098: 38 bf ff fb bgu,a 2025084 <== ALWAYS TAKEN 202509c: c4 00 40 00 ld [ %g1 ], %g2 else used = 0; #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if ( the_thread ) 20250a0: 80 a6 20 00 cmp %i0, 0 <== NOT EXECUTED 20250a4: 02 80 00 31 be 2025168 <== NOT EXECUTED 20250a8: a0 10 20 00 clr %l0 <== NOT EXECUTED #endif { (*print_handler)( 20250ac: f2 06 20 08 ld [ %i0 + 8 ], %i1 20250b0: 39 00 81 94 sethi %hi(0x2065000), %i4 20250b4: 37 00 81 94 sethi %hi(0x2065000), %i3 20250b8: e4 07 22 2c ld [ %i4 + 0x22c ], %l2 20250bc: f0 06 e2 30 ld [ %i3 + 0x230 ], %i0 20250c0: 94 07 bf f8 add %fp, -8, %o2 20250c4: 92 10 20 05 mov 5, %o1 20250c8: 7f ff a9 6e call 200f680 20250cc: 90 10 00 19 mov %i1, %o0 20250d0: 13 00 81 70 sethi %hi(0x205c000), %o1 20250d4: 96 10 00 08 mov %o0, %o3 20250d8: 94 10 00 19 mov %i1, %o2 20250dc: 90 10 00 12 mov %l2, %o0 20250e0: 9f c6 00 00 call %i0 20250e4: 92 12 62 30 or %o1, 0x230, %o1 (*print_handler)( print_context, " %010p - %010p %010p %8" PRId32 " ", stack->area, stack->area + stack->size - 1, 20250e8: d4 07 60 04 ld [ %i5 + 4 ], %o2 20250ec: d6 07 40 00 ld [ %i5 ], %o3 else { (*print_handler)( print_context, "0x%08" PRIx32 " INTR", ~0 ); } #endif (*print_handler)( 20250f0: c4 06 e2 30 ld [ %i3 + 0x230 ], %g2 20250f4: d0 07 22 2c ld [ %i4 + 0x22c ], %o0 print_context, " %010p - %010p %010p %8" PRId32 " ", stack->area, stack->area + stack->size - 1, 20250f8: 96 02 ff ff add %o3, -1, %o3 else { (*print_handler)( print_context, "0x%08" PRIx32 " INTR", ~0 ); } #endif (*print_handler)( 20250fc: 13 00 81 70 sethi %hi(0x205c000), %o1 2025100: 96 02 80 0b add %o2, %o3, %o3 2025104: 92 12 62 50 or %o1, 0x250, %o1 2025108: 98 10 00 11 mov %l1, %o4 202510c: 9f c0 80 00 call %g2 2025110: 9a 10 00 1a mov %i2, %o5 stack->area + stack->size - 1, current, size ); if (Stack_check_Initialized == 0) { 2025114: 05 00 81 94 sethi %hi(0x2065000), %g2 2025118: c4 00 a2 28 ld [ %g2 + 0x228 ], %g2 ! 2065228 (*print_handler)( print_context, "Unavailable\n" ); 202511c: c2 06 e2 30 ld [ %i3 + 0x230 ], %g1 stack->area + stack->size - 1, current, size ); if (Stack_check_Initialized == 0) { 2025120: 80 a0 a0 00 cmp %g2, 0 2025124: 12 80 00 07 bne 2025140 <== ALWAYS TAKEN 2025128: d0 07 22 2c ld [ %i4 + 0x22c ], %o0 (*print_handler)( print_context, "Unavailable\n" ); 202512c: 13 00 81 70 sethi %hi(0x205c000), %o1 <== NOT EXECUTED 2025130: 9f c0 40 00 call %g1 <== NOT EXECUTED 2025134: 92 12 62 70 or %o1, 0x270, %o1 ! 205c270 <== NOT EXECUTED 2025138: 81 c7 e0 08 ret <== NOT EXECUTED 202513c: 81 e8 00 00 restore <== NOT EXECUTED } else { (*print_handler)( print_context, "%8" PRId32 "\n", used ); 2025140: 94 10 00 10 mov %l0, %o2 2025144: 13 00 81 70 sethi %hi(0x205c000), %o1 2025148: 9f c0 40 00 call %g1 202514c: 92 12 62 80 or %o1, 0x280, %o1 ! 205c280 2025150: 81 c7 e0 08 ret 2025154: 81 e8 00 00 restore else used = 0; #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if ( the_thread ) 2025158: 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 ); 202515c: a0 04 00 1a add %l0, %i2, %l0 else used = 0; #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) if ( the_thread ) 2025160: 12 bf ff d3 bne 20250ac 2025164: 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 ); 2025168: 37 00 81 94 sethi %hi(0x2065000), %i3 202516c: 39 00 81 94 sethi %hi(0x2065000), %i4 2025170: c2 06 e2 30 ld [ %i3 + 0x230 ], %g1 2025174: d0 07 22 2c ld [ %i4 + 0x22c ], %o0 2025178: 94 10 3f ff mov -1, %o2 202517c: 13 00 81 70 sethi %hi(0x205c000), %o1 2025180: 9f c0 40 00 call %g1 2025184: 92 12 62 40 or %o1, 0x240, %o1 ! 205c240 (*print_handler)( print_context, " %010p - %010p %010p %8" PRId32 " ", stack->area, stack->area + stack->size - 1, 2025188: 10 bf ff d9 b 20250ec 202518c: 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) 2025190: 3b 00 81 97 sethi %hi(0x2065c00), %i5 2025194: ba 17 62 78 or %i5, 0x278, %i5 ! 2065e78 2025198: f8 07 60 04 ld [ %i5 + 4 ], %i4 202519c: 80 a7 20 00 cmp %i4, 0 20251a0: 02 bf ff e6 be 2025138 <== NEVER TAKEN 20251a4: a2 10 20 00 clr %l1 return; stack = &Stack_check_Interrupt_stack; the_thread = 0; 20251a8: 10 bf ff a8 b 2025048 20251ac: b0 10 20 00 clr %i0 =============================================================================== 020252a4 : Thread_Control *running, bool pattern_ok ) RTEMS_COMPILER_NO_RETURN_ATTRIBUTE; void Stack_check_report_blown_task(Thread_Control *running, bool pattern_ok) { 20252a4: 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"); 20252a8: 11 00 81 70 sethi %hi(0x205c000), %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); 20252ac: fa 06 20 b4 ld [ %i0 + 0xb4 ], %i5 char name[32]; printk("BLOWN STACK!!!\n"); 20252b0: 7f ff 7c b3 call 200457c 20252b4: 90 12 22 88 or %o0, 0x288, %o0 printk("task control block: 0x%08" PRIxPTR "\n", running); 20252b8: 92 10 00 18 mov %i0, %o1 20252bc: 11 00 81 70 sethi %hi(0x205c000), %o0 20252c0: 7f ff 7c af call 200457c 20252c4: 90 12 22 98 or %o0, 0x298, %o0 ! 205c298 printk("task ID: 0x%08lx\n", (unsigned long) running->Object.id); 20252c8: d2 06 20 08 ld [ %i0 + 8 ], %o1 20252cc: 11 00 81 70 sethi %hi(0x205c000), %o0 20252d0: 7f ff 7c ab call 200457c 20252d4: 90 12 22 b8 or %o0, 0x2b8, %o0 ! 205c2b8 printk( 20252d8: d2 06 20 0c ld [ %i0 + 0xc ], %o1 20252dc: 11 00 81 70 sethi %hi(0x205c000), %o0 20252e0: 7f ff 7c a7 call 200457c 20252e4: 90 12 22 d0 or %o0, 0x2d0, %o0 ! 205c2d0 "task name: 0x%08" PRIx32 "\n", running->Object.name.name_u32 ); printk( 20252e8: d0 06 20 08 ld [ %i0 + 8 ], %o0 20252ec: 94 07 bf e0 add %fp, -32, %o2 20252f0: 7f ff a8 e4 call 200f680 20252f4: 92 10 20 20 mov 0x20, %o1 20252f8: 92 10 00 08 mov %o0, %o1 20252fc: 11 00 81 70 sethi %hi(0x205c000), %o0 2025300: 7f ff 7c 9f call 200457c 2025304: 90 12 22 e8 or %o0, 0x2e8, %o0 ! 205c2e8 ); printk( "task stack area (%lu Bytes): 0x%08" PRIxPTR " .. 0x%08" PRIxPTR "\n", (unsigned long) stack->size, stack->area, ((char *) stack->area + stack->size) 2025308: d4 06 20 b4 ld [ %i0 + 0xb4 ], %o2 202530c: d2 06 20 b0 ld [ %i0 + 0xb0 ], %o1 ); printk( "task name string: %s\n", rtems_object_get_name(running->Object.id, sizeof(name), name) ); printk( 2025310: 11 00 81 70 sethi %hi(0x205c000), %o0 2025314: 96 02 80 09 add %o2, %o1, %o3 2025318: 7f ff 7c 99 call 200457c 202531c: 90 12 23 00 or %o0, 0x300, %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) { 2025320: 80 a6 60 00 cmp %i1, 0 2025324: 02 80 00 04 be 2025334 <== ALWAYS TAKEN 2025328: 92 10 20 10 mov 0x10, %o1 rtems_configuration_get_user_multiprocessing_table()->node ); } #endif rtems_fatal_error_occurred(0x81); 202532c: 7f ff 8b d4 call 200827c 2025330: 90 10 20 81 mov 0x81, %o0 (unsigned long) stack->size, stack->area, ((char *) stack->area + stack->size) ); if (!pattern_ok) { printk( 2025334: 11 00 81 70 sethi %hi(0x205c000), %o0 2025338: 94 07 60 08 add %i5, 8, %o2 202533c: 90 12 23 30 or %o0, 0x330, %o0 2025340: 7f ff 7c 8f call 200457c 2025344: 96 07 60 18 add %i5, 0x18, %o3 2025348: 30 bf ff f9 b,a 202532c =============================================================================== 020086e8 <_API_extensions_Run_postdriver>: /* * _API_extensions_Run_postdriver */ void _API_extensions_Run_postdriver( void ) { 20086e8: 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; 20086ec: 39 00 80 75 sethi %hi(0x201d400), %i4 20086f0: fa 07 20 14 ld [ %i4 + 0x14 ], %i5 ! 201d414 <_API_extensions_List> 20086f4: b8 17 20 14 or %i4, 0x14, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 20086f8: b8 07 20 04 add %i4, 4, %i4 20086fc: 80 a7 40 1c cmp %i5, %i4 2008700: 02 80 00 09 be 2008724 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN 2008704: 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)(); 2008708: c2 07 60 08 ld [ %i5 + 8 ], %g1 200870c: 9f c0 40 00 call %g1 2008710: 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 ) { 2008714: 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 ); 2008718: 80 a7 40 1c cmp %i5, %i4 200871c: 32 bf ff fc bne,a 200870c <_API_extensions_Run_postdriver+0x24><== NEVER TAKEN 2008720: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED 2008724: 81 c7 e0 08 ret 2008728: 81 e8 00 00 restore =============================================================================== 0200872c <_API_extensions_Run_postswitch>: /* * _API_extensions_Run_postswitch */ void _API_extensions_Run_postswitch( void ) { 200872c: 9d e3 bf a0 save %sp, -96, %sp 2008730: 39 00 80 75 sethi %hi(0x201d400), %i4 2008734: fa 07 20 14 ld [ %i4 + 0x14 ], %i5 ! 201d414 <_API_extensions_List> 2008738: 37 00 80 75 sethi %hi(0x201d400), %i3 200873c: b8 17 20 14 or %i4, 0x14, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2008740: b8 07 20 04 add %i4, 4, %i4 2008744: 80 a7 40 1c cmp %i5, %i4 2008748: 02 80 00 09 be 200876c <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN 200874c: b6 16 e0 50 or %i3, 0x50, %i3 !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (API_extensions_Control *) the_node; (*the_extension->postswitch_hook)( _Thread_Executing ); 2008750: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2008754: 9f c0 40 00 call %g1 2008758: d0 06 e0 0c ld [ %i3 + 0xc ], %o0 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { 200875c: fa 07 40 00 ld [ %i5 ], %i5 void _API_extensions_Run_postswitch( void ) { Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2008760: 80 a7 40 1c cmp %i5, %i4 2008764: 32 bf ff fc bne,a 2008754 <_API_extensions_Run_postswitch+0x28><== NEVER TAKEN 2008768: c2 07 60 0c ld [ %i5 + 0xc ], %g1 <== NOT EXECUTED 200876c: 81 c7 e0 08 ret 2008770: 81 e8 00 00 restore =============================================================================== 02011d54 <_CORE_message_queue_Initialize>: CORE_message_queue_Control *the_message_queue, CORE_message_queue_Attributes *the_message_queue_attributes, uint32_t maximum_pending_messages, size_t maximum_message_size ) { 2011d54: 9d e3 bf a0 save %sp, -96, %sp size_t message_buffering_required = 0; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; the_message_queue->number_of_pending_messages = 0; 2011d58: c0 26 20 48 clr [ %i0 + 0x48 ] ) { size_t message_buffering_required = 0; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; 2011d5c: f4 26 20 44 st %i2, [ %i0 + 0x44 ] /* * Round size up to multiple of a pointer for chain init and * check for overflow on adding overhead to each message. */ allocated_message_size = maximum_message_size; if (allocated_message_size & (sizeof(uint32_t) - 1)) { 2011d60: 80 8e e0 03 btst 3, %i3 2011d64: 02 80 00 0b be 2011d90 <_CORE_message_queue_Initialize+0x3c> 2011d68: f6 26 20 4c st %i3, [ %i0 + 0x4c ] allocated_message_size += sizeof(uint32_t); 2011d6c: 96 06 e0 04 add %i3, 4, %o3 allocated_message_size &= ~(sizeof(uint32_t) - 1); 2011d70: 96 0a ff fc and %o3, -4, %o3 } if (allocated_message_size < maximum_message_size) 2011d74: 80 a6 c0 0b cmp %i3, %o3 2011d78: 08 80 00 08 bleu 2011d98 <_CORE_message_queue_Initialize+0x44><== ALWAYS TAKEN 2011d7c: ba 02 e0 10 add %o3, 0x10, %i5 return false; 2011d80: b0 10 20 00 clr %i0 <== NOT EXECUTED STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2011d84: b0 0e 20 01 and %i0, 1, %i0 2011d88: 81 c7 e0 08 ret 2011d8c: 81 e8 00 00 restore /* * Round size up to multiple of a pointer for chain init and * check for overflow on adding overhead to each message. */ allocated_message_size = maximum_message_size; if (allocated_message_size & (sizeof(uint32_t) - 1)) { 2011d90: 96 10 00 1b mov %i3, %o3 /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ if ( !size_t_mult32_with_overflow( 2011d94: ba 02 e0 10 add %o3, 0x10, %i5 size_t a, size_t b, size_t *c ) { long long x = (long long)a*b; 2011d98: 90 10 20 00 clr %o0 2011d9c: 92 10 00 1a mov %i2, %o1 2011da0: 94 10 20 00 clr %o2 2011da4: 40 00 41 7d call 2022398 <__muldi3> 2011da8: 96 10 00 1d mov %i5, %o3 if ( x > SIZE_MAX ) 2011dac: 80 a2 20 00 cmp %o0, 0 2011db0: 34 bf ff f5 bg,a 2011d84 <_CORE_message_queue_Initialize+0x30> 2011db4: b0 10 20 00 clr %i0 /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 2011db8: 40 00 0c a2 call 2015040 <_Workspace_Allocate> 2011dbc: 90 10 00 09 mov %o1, %o0 return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 2011dc0: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 2011dc4: 80 a2 20 00 cmp %o0, 0 2011dc8: 02 bf ff ee be 2011d80 <_CORE_message_queue_Initialize+0x2c><== NEVER TAKEN 2011dcc: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 2011dd0: 90 06 20 60 add %i0, 0x60, %o0 2011dd4: 94 10 00 1a mov %i2, %o2 2011dd8: 7f ff ff c6 call 2011cf0 <_Chain_Initialize> 2011ddc: 96 10 00 1d mov %i5, %o3 */ RTEMS_INLINE_ROUTINE bool _CORE_message_queue_Is_priority( CORE_message_queue_Attributes *the_attribute ) { return 2011de0: c4 06 40 00 ld [ %i1 ], %g2 RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 2011de4: 82 06 20 50 add %i0, 0x50, %g1 2011de8: 84 18 a0 01 xor %g2, 1, %g2 allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); _Thread_queue_Initialize( 2011dec: 80 a0 00 02 cmp %g0, %g2 2011df0: 84 06 20 54 add %i0, 0x54, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 2011df4: c2 26 20 58 st %g1, [ %i0 + 0x58 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2011df8: c4 26 20 50 st %g2, [ %i0 + 0x50 ] 2011dfc: 90 10 00 18 mov %i0, %o0 head->previous = NULL; 2011e00: c0 26 20 54 clr [ %i0 + 0x54 ] 2011e04: 92 60 3f ff subx %g0, -1, %o1 2011e08: 94 10 20 80 mov 0x80, %o2 2011e0c: 96 10 20 06 mov 6, %o3 2011e10: 40 00 0a 3a call 20146f8 <_Thread_queue_Initialize> 2011e14: b0 10 20 01 mov 1, %i0 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2011e18: b0 0e 20 01 and %i0, 1, %i0 2011e1c: 81 c7 e0 08 ret 2011e20: 81 e8 00 00 restore =============================================================================== 02008a94 <_CORE_mutex_Seize>: Objects_Id _id, bool _wait, Watchdog_Interval _timeout, ISR_Level _level ) { 2008a94: 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 ) 2008a98: 3b 00 80 74 sethi %hi(0x201d000), %i5 2008a9c: c2 07 62 30 ld [ %i5 + 0x230 ], %g1 ! 201d230 <_Thread_Dispatch_disable_level> 2008aa0: 80 a0 60 00 cmp %g1, 0 2008aa4: 02 80 00 20 be 2008b24 <_CORE_mutex_Seize+0x90> 2008aa8: f8 27 a0 54 st %i4, [ %fp + 0x54 ] _CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level ); 2008aac: 80 a6 a0 00 cmp %i2, 0 2008ab0: 02 80 00 2d be 2008b64 <_CORE_mutex_Seize+0xd0> 2008ab4: 90 10 00 18 mov %i0, %o0 2008ab8: 03 00 80 74 sethi %hi(0x201d000), %g1 2008abc: c2 00 63 70 ld [ %g1 + 0x370 ], %g1 ! 201d370 <_System_state_Current> 2008ac0: 80 a0 60 01 cmp %g1, 1 2008ac4: 38 80 00 2f bgu,a 2008b80 <_CORE_mutex_Seize+0xec> 2008ac8: 90 10 20 00 clr %o0 2008acc: 40 00 12 cf call 200d608 <_CORE_mutex_Seize_interrupt_trylock> 2008ad0: 92 07 a0 54 add %fp, 0x54, %o1 2008ad4: 80 a2 20 00 cmp %o0, 0 2008ad8: 02 80 00 28 be 2008b78 <_CORE_mutex_Seize+0xe4> <== ALWAYS TAKEN 2008adc: 01 00 00 00 nop * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2008ae0: c4 07 62 30 ld [ %i5 + 0x230 ], %g2 2008ae4: 03 00 80 75 sethi %hi(0x201d400), %g1 2008ae8: c2 00 60 5c ld [ %g1 + 0x5c ], %g1 ! 201d45c <_Per_CPU_Information+0xc> 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; 2008aec: 86 10 20 01 mov 1, %g3 2008af0: c6 26 20 30 st %g3, [ %i0 + 0x30 ] 2008af4: f0 20 60 44 st %i0, [ %g1 + 0x44 ] 2008af8: f2 20 60 20 st %i1, [ %g1 + 0x20 ] 2008afc: 82 00 a0 01 add %g2, 1, %g1 2008b00: c2 27 62 30 st %g1, [ %i5 + 0x230 ] return _Thread_Dispatch_disable_level; 2008b04: c2 07 62 30 ld [ %i5 + 0x230 ], %g1 2008b08: 7f ff e7 1b call 2002774 2008b0c: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 2008b10: 90 10 00 18 mov %i0, %o0 2008b14: 7f ff ff b9 call 20089f8 <_CORE_mutex_Seize_interrupt_blocking> 2008b18: 92 10 00 1b mov %i3, %o1 2008b1c: 81 c7 e0 08 ret 2008b20: 81 e8 00 00 restore 2008b24: 90 10 00 18 mov %i0, %o0 2008b28: 40 00 12 b8 call 200d608 <_CORE_mutex_Seize_interrupt_trylock> 2008b2c: 92 07 a0 54 add %fp, 0x54, %o1 2008b30: 80 a2 20 00 cmp %o0, 0 2008b34: 02 bf ff fa be 2008b1c <_CORE_mutex_Seize+0x88> 2008b38: 80 a6 a0 00 cmp %i2, 0 2008b3c: 12 bf ff e9 bne 2008ae0 <_CORE_mutex_Seize+0x4c> 2008b40: 01 00 00 00 nop 2008b44: 7f ff e7 0c call 2002774 2008b48: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 2008b4c: 03 00 80 75 sethi %hi(0x201d400), %g1 2008b50: c2 00 60 5c ld [ %g1 + 0x5c ], %g1 ! 201d45c <_Per_CPU_Information+0xc> 2008b54: 84 10 20 01 mov 1, %g2 2008b58: c4 20 60 34 st %g2, [ %g1 + 0x34 ] 2008b5c: 81 c7 e0 08 ret 2008b60: 81 e8 00 00 restore 2008b64: 40 00 12 a9 call 200d608 <_CORE_mutex_Seize_interrupt_trylock> 2008b68: 92 07 a0 54 add %fp, 0x54, %o1 2008b6c: 80 a2 20 00 cmp %o0, 0 2008b70: 12 bf ff f5 bne 2008b44 <_CORE_mutex_Seize+0xb0> <== NEVER TAKEN 2008b74: 01 00 00 00 nop 2008b78: 81 c7 e0 08 ret 2008b7c: 81 e8 00 00 restore 2008b80: 92 10 20 00 clr %o1 2008b84: 40 00 01 c2 call 200928c <_Internal_error_Occurred> 2008b88: 94 10 20 12 mov 0x12, %o2 =============================================================================== 02008d08 <_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 ) { 2008d08: 9d e3 bf a0 save %sp, -96, %sp 2008d0c: ba 10 00 18 mov %i0, %i5 Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2008d10: b0 10 20 00 clr %i0 if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 2008d14: 40 00 07 bb call 200ac00 <_Thread_queue_Dequeue> 2008d18: 90 10 00 1d mov %i5, %o0 2008d1c: 80 a2 20 00 cmp %o0, 0 2008d20: 02 80 00 04 be 2008d30 <_CORE_semaphore_Surrender+0x28> 2008d24: 01 00 00 00 nop status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); } return status; } 2008d28: 81 c7 e0 08 ret 2008d2c: 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 ); 2008d30: 7f ff e6 8d call 2002764 2008d34: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 2008d38: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 2008d3c: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 2008d40: 80 a0 40 02 cmp %g1, %g2 2008d44: 1a 80 00 05 bcc 2008d58 <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN 2008d48: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 2008d4c: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2008d50: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 2008d54: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 2008d58: 7f ff e6 87 call 2002774 2008d5c: 01 00 00 00 nop } return status; } 2008d60: 81 c7 e0 08 ret 2008d64: 81 e8 00 00 restore =============================================================================== 020088c4 <_Chain_Initialize>: Chain_Control *the_chain, void *starting_address, size_t number_nodes, size_t node_size ) { 20088c4: 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; 20088c8: 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 ); 20088cc: ba 06 20 04 add %i0, 4, %i5 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 20088d0: 80 a6 a0 00 cmp %i2, 0 20088d4: 02 80 00 13 be 2008920 <_Chain_Initialize+0x5c> <== NEVER TAKEN 20088d8: 92 06 bf ff add %i2, -1, %o1 20088dc: 86 10 00 09 mov %o1, %g3 20088e0: 82 10 00 19 mov %i1, %g1 20088e4: 84 10 00 18 mov %i0, %g2 current->next = next; 20088e8: c2 20 80 00 st %g1, [ %g2 ] next->previous = current; 20088ec: c4 20 60 04 st %g2, [ %g1 + 4 ] Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 20088f0: 86 00 ff ff add %g3, -1, %g3 20088f4: 84 10 00 01 mov %g1, %g2 20088f8: 80 a0 ff ff cmp %g3, -1 20088fc: 12 bf ff fb bne 20088e8 <_Chain_Initialize+0x24> 2008900: 82 00 40 1b add %g1, %i3, %g1 * node_size - size of node in bytes * * Output parameters: NONE */ void _Chain_Initialize( 2008904: 40 00 3f 5c call 2018674 <.umul> 2008908: 90 10 00 1b mov %i3, %o0 200890c: 90 06 40 08 add %i1, %o0, %o0 current = next; next = (Chain_Node *) _Addresses_Add_offset( (void *) next, node_size ); } current->next = tail; 2008910: fa 22 00 00 st %i5, [ %o0 ] tail->previous = current; 2008914: d0 26 20 08 st %o0, [ %i0 + 8 ] 2008918: 81 c7 e0 08 ret 200891c: 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; 2008920: 10 bf ff fc b 2008910 <_Chain_Initialize+0x4c> <== NOT EXECUTED 2008924: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED =============================================================================== 02007934 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 2007934: 9d e3 bf a0 save %sp, -96, %sp rtems_event_set event_condition; rtems_event_set seized_events; rtems_option option_set; RTEMS_API_Control *api; api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 2007938: fa 06 21 50 ld [ %i0 + 0x150 ], %i5 option_set = (rtems_option) the_thread->Wait.option; _ISR_Disable( level ); 200793c: 7f ff eb 8a call 2002764 2007940: f6 06 20 30 ld [ %i0 + 0x30 ], %i3 pending_events = api->pending_events; 2007944: c4 07 40 00 ld [ %i5 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 2007948: 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 ) ) { 200794c: 86 88 40 02 andcc %g1, %g2, %g3 2007950: 02 80 00 39 be 2007a34 <_Event_Surrender+0x100> 2007954: 09 00 80 75 sethi %hi(0x201d400), %g4 /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && 2007958: 88 11 20 50 or %g4, 0x50, %g4 ! 201d450 <_Per_CPU_Information> 200795c: f8 01 20 08 ld [ %g4 + 8 ], %i4 2007960: 80 a7 20 00 cmp %i4, 0 2007964: 32 80 00 1c bne,a 20079d4 <_Event_Surrender+0xa0> 2007968: c8 01 20 0c ld [ %g4 + 0xc ], %g4 */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_for_event ( States_Control the_states ) { return (the_states & STATES_WAITING_FOR_EVENT); 200796c: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 } /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { 2007970: 80 89 21 00 btst 0x100, %g4 2007974: 02 80 00 30 be 2007a34 <_Event_Surrender+0x100> 2007978: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 200797c: 02 80 00 04 be 200798c <_Event_Surrender+0x58> 2007980: 80 8e e0 02 btst 2, %i3 2007984: 02 80 00 2c be 2007a34 <_Event_Surrender+0x100> <== NEVER TAKEN 2007988: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events, seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 200798c: 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) ); 2007990: 84 28 80 03 andn %g2, %g3, %g2 /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { api->pending_events = _Event_sets_Clear( pending_events, seized_events ); 2007994: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 2007998: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 200799c: c6 20 40 00 st %g3, [ %g1 ] _ISR_Flash( level ); 20079a0: 7f ff eb 75 call 2002774 20079a4: 01 00 00 00 nop 20079a8: 7f ff eb 6f call 2002764 20079ac: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 20079b0: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 20079b4: 80 a0 60 02 cmp %g1, 2 20079b8: 02 80 00 21 be 2007a3c <_Event_Surrender+0x108> 20079bc: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 20079c0: 7f ff eb 6d call 2002774 20079c4: 33 04 00 ff sethi %hi(0x1003fc00), %i1 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 20079c8: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 20079cc: 40 00 0a bc call 200a4bc <_Thread_Clear_state> 20079d0: 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() && 20079d4: 80 a6 00 04 cmp %i0, %g4 20079d8: 32 bf ff e6 bne,a 2007970 <_Event_Surrender+0x3c> 20079dc: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 20079e0: 09 00 80 75 sethi %hi(0x201d400), %g4 20079e4: f8 01 20 b0 ld [ %g4 + 0xb0 ], %i4 ! 201d4b0 <_Event_Sync_state> /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && 20079e8: 80 a7 20 02 cmp %i4, 2 20079ec: 02 80 00 07 be 2007a08 <_Event_Surrender+0xd4> <== NEVER TAKEN 20079f0: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 20079f4: f8 01 20 b0 ld [ %g4 + 0xb0 ], %i4 * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 20079f8: 80 a7 20 01 cmp %i4, 1 20079fc: 32 bf ff dd bne,a 2007970 <_Event_Surrender+0x3c> 2007a00: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { 2007a04: 80 a0 40 03 cmp %g1, %g3 2007a08: 02 80 00 04 be 2007a18 <_Event_Surrender+0xe4> 2007a0c: 80 8e e0 02 btst 2, %i3 2007a10: 02 80 00 09 be 2007a34 <_Event_Surrender+0x100> <== NEVER TAKEN 2007a14: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events,seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2007a18: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 2007a1c: 84 28 80 03 andn %g2, %g3, %g2 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { api->pending_events = _Event_sets_Clear( pending_events,seized_events ); 2007a20: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 2007a24: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2007a28: c6 20 40 00 st %g3, [ %g1 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 2007a2c: 82 10 20 03 mov 3, %g1 2007a30: c2 21 20 b0 st %g1, [ %g4 + 0xb0 ] _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 2007a34: 7f ff eb 50 call 2002774 2007a38: 91 e8 00 08 restore %g0, %o0, %o0 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 2007a3c: 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 ); 2007a40: 7f ff eb 4d call 2002774 2007a44: 33 04 00 ff sethi %hi(0x1003fc00), %i1 (void) _Watchdog_Remove( &the_thread->Timer ); 2007a48: 40 00 0f 64 call 200b7d8 <_Watchdog_Remove> 2007a4c: 90 06 20 48 add %i0, 0x48, %o0 2007a50: b2 16 63 f8 or %i1, 0x3f8, %i1 2007a54: 40 00 0a 9a call 200a4bc <_Thread_Clear_state> 2007a58: 81 e8 00 00 restore =============================================================================== 02007a5c <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 2007a5c: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 2007a60: 90 10 00 18 mov %i0, %o0 2007a64: 40 00 0b 96 call 200a8bc <_Thread_Get> 2007a68: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2007a6c: c2 07 bf fc ld [ %fp + -4 ], %g1 2007a70: 80 a0 60 00 cmp %g1, 0 2007a74: 12 80 00 16 bne 2007acc <_Event_Timeout+0x70> <== NEVER TAKEN 2007a78: 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 ); 2007a7c: 7f ff eb 3a call 2002764 2007a80: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 2007a84: 03 00 80 75 sethi %hi(0x201d400), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 2007a88: c2 00 60 5c ld [ %g1 + 0x5c ], %g1 ! 201d45c <_Per_CPU_Information+0xc> 2007a8c: 80 a7 40 01 cmp %i5, %g1 2007a90: 02 80 00 11 be 2007ad4 <_Event_Timeout+0x78> 2007a94: c0 27 60 24 clr [ %i5 + 0x24 ] if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; } the_thread->Wait.return_code = RTEMS_TIMEOUT; 2007a98: 82 10 20 06 mov 6, %g1 2007a9c: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 2007aa0: 7f ff eb 35 call 2002774 2007aa4: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2007aa8: 90 10 00 1d mov %i5, %o0 2007aac: 13 04 00 ff sethi %hi(0x1003fc00), %o1 2007ab0: 40 00 0a 83 call 200a4bc <_Thread_Clear_state> 2007ab4: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 2007ab8: 03 00 80 74 sethi %hi(0x201d000), %g1 2007abc: c4 00 62 30 ld [ %g1 + 0x230 ], %g2 ! 201d230 <_Thread_Dispatch_disable_level> 2007ac0: 84 00 bf ff add %g2, -1, %g2 2007ac4: c4 20 62 30 st %g2, [ %g1 + 0x230 ] return _Thread_Dispatch_disable_level; 2007ac8: c2 00 62 30 ld [ %g1 + 0x230 ], %g1 2007acc: 81 c7 e0 08 ret 2007ad0: 81 e8 00 00 restore } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) 2007ad4: 03 00 80 75 sethi %hi(0x201d400), %g1 2007ad8: c4 00 60 b0 ld [ %g1 + 0xb0 ], %g2 ! 201d4b0 <_Event_Sync_state> 2007adc: 80 a0 a0 01 cmp %g2, 1 2007ae0: 32 bf ff ef bne,a 2007a9c <_Event_Timeout+0x40> 2007ae4: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 2007ae8: 84 10 20 02 mov 2, %g2 2007aec: c4 20 60 b0 st %g2, [ %g1 + 0xb0 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 2007af0: 10 bf ff eb b 2007a9c <_Event_Timeout+0x40> 2007af4: 82 10 20 06 mov 6, %g1 =============================================================================== 0200d794 <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200d794: 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 200d798: a2 06 60 04 add %i1, 4, %l1 Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200d79c: 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 ) { 200d7a0: 80 a6 40 11 cmp %i1, %l1 200d7a4: 18 80 00 85 bgu 200d9b8 <_Heap_Allocate_aligned_with_boundary+0x224> 200d7a8: ea 06 20 10 ld [ %i0 + 0x10 ], %l5 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 200d7ac: 80 a6 e0 00 cmp %i3, 0 200d7b0: 12 80 00 7c bne 200d9a0 <_Heap_Allocate_aligned_with_boundary+0x20c> 200d7b4: 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; 200d7b8: 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 ) { 200d7bc: 80 a4 00 1d cmp %l0, %i5 200d7c0: 02 80 00 18 be 200d820 <_Heap_Allocate_aligned_with_boundary+0x8c> 200d7c4: 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; 200d7c8: 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 200d7cc: ae 05 60 07 add %l5, 7, %l7 + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200d7d0: ac 25 80 19 sub %l6, %i1, %l6 200d7d4: 10 80 00 0b b 200d800 <_Heap_Allocate_aligned_with_boundary+0x6c> 200d7d8: 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 ) { 200d7dc: 12 80 00 18 bne 200d83c <_Heap_Allocate_aligned_with_boundary+0xa8> 200d7e0: b0 07 60 08 add %i5, 8, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200d7e4: 80 a6 20 00 cmp %i0, 0 200d7e8: 12 80 00 4d bne 200d91c <_Heap_Allocate_aligned_with_boundary+0x188><== ALWAYS TAKEN 200d7ec: b8 07 20 01 inc %i4 break; } block = block->next; 200d7f0: 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 ) { 200d7f4: 80 a4 00 1d cmp %l0, %i5 200d7f8: 22 80 00 0b be,a 200d824 <_Heap_Allocate_aligned_with_boundary+0x90> 200d7fc: 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 ) { 200d800: c2 07 60 04 ld [ %i5 + 4 ], %g1 200d804: 80 a4 40 01 cmp %l1, %g1 200d808: 0a bf ff f5 bcs 200d7dc <_Heap_Allocate_aligned_with_boundary+0x48> 200d80c: 80 a6 a0 00 cmp %i2, 0 if ( alloc_begin != 0 ) { break; } block = block->next; 200d810: 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 ) { 200d814: 80 a4 00 1d cmp %l0, %i5 200d818: 12 bf ff fa bne 200d800 <_Heap_Allocate_aligned_with_boundary+0x6c> 200d81c: b8 07 20 01 inc %i4 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200d820: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 200d824: 80 a0 40 1c cmp %g1, %i4 200d828: 1a 80 00 03 bcc 200d834 <_Heap_Allocate_aligned_with_boundary+0xa0> 200d82c: b0 10 20 00 clr %i0 stats->max_search = search_count; 200d830: f8 24 20 44 st %i4, [ %l0 + 0x44 ] } return (void *) alloc_begin; 200d834: 81 c7 e0 08 ret 200d838: 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; 200d83c: 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; 200d840: 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; 200d844: 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; 200d848: 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; 200d84c: 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); 200d850: 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; 200d854: 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 200d858: a4 00 80 12 add %g2, %l2, %l2 200d85c: 40 00 2c 6c call 2018a0c <.urem> 200d860: 90 10 00 18 mov %i0, %o0 200d864: 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 ) { 200d868: 80 a4 80 18 cmp %l2, %i0 200d86c: 1a 80 00 06 bcc 200d884 <_Heap_Allocate_aligned_with_boundary+0xf0> 200d870: a6 07 60 08 add %i5, 8, %l3 200d874: 90 10 00 12 mov %l2, %o0 200d878: 40 00 2c 65 call 2018a0c <.urem> 200d87c: 92 10 00 1a mov %i2, %o1 200d880: b0 24 80 08 sub %l2, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 200d884: 80 a6 e0 00 cmp %i3, 0 200d888: 02 80 00 37 be 200d964 <_Heap_Allocate_aligned_with_boundary+0x1d0> 200d88c: 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; 200d890: 86 06 00 19 add %i0, %i1, %g3 200d894: 92 10 00 1b mov %i3, %o1 200d898: 90 10 00 03 mov %g3, %o0 200d89c: 40 00 2c 5c call 2018a0c <.urem> 200d8a0: c6 27 bf f8 st %g3, [ %fp + -8 ] 200d8a4: c6 07 bf f8 ld [ %fp + -8 ], %g3 200d8a8: 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 ) { 200d8ac: 80 a6 00 08 cmp %i0, %o0 200d8b0: 1a 80 00 2c bcc 200d960 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200d8b4: a4 04 c0 19 add %l3, %i1, %l2 200d8b8: 80 a2 00 03 cmp %o0, %g3 200d8bc: 2a 80 00 12 bcs,a 200d904 <_Heap_Allocate_aligned_with_boundary+0x170> 200d8c0: 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 ) { 200d8c4: 10 80 00 28 b 200d964 <_Heap_Allocate_aligned_with_boundary+0x1d0> 200d8c8: 80 a4 c0 18 cmp %l3, %i0 200d8cc: 92 10 00 1a mov %i2, %o1 200d8d0: 40 00 2c 4f call 2018a0c <.urem> 200d8d4: 90 10 00 18 mov %i0, %o0 200d8d8: 92 10 00 1b mov %i3, %o1 200d8dc: 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; 200d8e0: ac 06 00 19 add %i0, %i1, %l6 200d8e4: 40 00 2c 4a call 2018a0c <.urem> 200d8e8: 90 10 00 16 mov %l6, %o0 200d8ec: 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 ) { 200d8f0: 80 a2 00 16 cmp %o0, %l6 200d8f4: 1a 80 00 1b bcc 200d960 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200d8f8: 80 a6 00 08 cmp %i0, %o0 200d8fc: 1a 80 00 19 bcc 200d960 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200d900: 80 a4 80 08 cmp %l2, %o0 if ( boundary_line < boundary_floor ) { 200d904: 08 bf ff f2 bleu 200d8cc <_Heap_Allocate_aligned_with_boundary+0x138> 200d908: b0 22 00 19 sub %o0, %i1, %i0 return 0; 200d90c: b0 10 20 00 clr %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200d910: 80 a6 20 00 cmp %i0, 0 200d914: 02 bf ff b7 be 200d7f0 <_Heap_Allocate_aligned_with_boundary+0x5c><== ALWAYS TAKEN 200d918: 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; 200d91c: c6 04 20 48 ld [ %l0 + 0x48 ], %g3 stats->searches += search_count; 200d920: 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; 200d924: 86 00 e0 01 inc %g3 stats->searches += search_count; 200d928: 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; 200d92c: c6 24 20 48 st %g3, [ %l0 + 0x48 ] stats->searches += search_count; 200d930: c4 24 20 4c st %g2, [ %l0 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200d934: 90 10 00 10 mov %l0, %o0 200d938: 92 10 00 1d mov %i5, %o1 200d93c: 94 10 00 18 mov %i0, %o2 200d940: 7f ff ee 07 call 200915c <_Heap_Block_allocate> 200d944: 96 10 00 19 mov %i1, %o3 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200d948: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 200d94c: 80 a0 40 1c cmp %g1, %i4 200d950: 2a bf ff b9 bcs,a 200d834 <_Heap_Allocate_aligned_with_boundary+0xa0> 200d954: f8 24 20 44 st %i4, [ %l0 + 0x44 ] stats->max_search = search_count; } return (void *) alloc_begin; } 200d958: 81 c7 e0 08 ret 200d95c: 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 ) { 200d960: 80 a4 c0 18 cmp %l3, %i0 200d964: 18 bf ff ea bgu 200d90c <_Heap_Allocate_aligned_with_boundary+0x178> 200d968: 82 10 3f f8 mov -8, %g1 200d96c: 90 10 00 18 mov %i0, %o0 200d970: a4 20 40 1d sub %g1, %i5, %l2 200d974: 92 10 00 15 mov %l5, %o1 200d978: 40 00 2c 25 call 2018a0c <.urem> 200d97c: 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 ) { 200d980: 90 a4 80 08 subcc %l2, %o0, %o0 200d984: 02 bf ff 99 be 200d7e8 <_Heap_Allocate_aligned_with_boundary+0x54> 200d988: 80 a6 20 00 cmp %i0, 0 200d98c: 80 a2 00 14 cmp %o0, %l4 200d990: 1a bf ff 96 bcc 200d7e8 <_Heap_Allocate_aligned_with_boundary+0x54> 200d994: 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; 200d998: 10 bf ff de b 200d910 <_Heap_Allocate_aligned_with_boundary+0x17c> 200d99c: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 200d9a0: 18 80 00 06 bgu 200d9b8 <_Heap_Allocate_aligned_with_boundary+0x224> 200d9a4: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 200d9a8: 22 bf ff 84 be,a 200d7b8 <_Heap_Allocate_aligned_with_boundary+0x24> 200d9ac: 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; 200d9b0: 10 bf ff 83 b 200d7bc <_Heap_Allocate_aligned_with_boundary+0x28> 200d9b4: 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; 200d9b8: 81 c7 e0 08 ret 200d9bc: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200d9d8 <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200d9d8: 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; 200d9dc: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200d9e0: c0 27 bf fc clr [ %fp + -4 ] uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; uintptr_t const extend_area_begin = (uintptr_t) extend_area_begin_ptr; uintptr_t const extend_area_end = extend_area_begin + extend_area_size; 200d9e4: a0 06 40 1a add %i1, %i2, %l0 uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { Heap_Statistics *const stats = &heap->stats; Heap_Block *const first_block = heap->first_block; 200d9e8: ee 06 20 20 ld [ %i0 + 0x20 ], %l7 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; 200d9ec: e2 06 20 10 ld [ %i0 + 0x10 ], %l1 uintptr_t const min_block_size = heap->min_block_size; 200d9f0: 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 ) { 200d9f4: 80 a6 40 10 cmp %i1, %l0 200d9f8: 08 80 00 06 bleu 200da10 <_Heap_Extend+0x38> 200d9fc: e6 06 20 30 ld [ %i0 + 0x30 ], %l3 return false; 200da00: b0 10 20 00 clr %i0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200da04: b0 0e 20 01 and %i0, 1, %i0 200da08: 81 c7 e0 08 ret 200da0c: 81 e8 00 00 restore if ( extend_area_end < extend_area_begin ) { return false; } extend_area_ok = _Heap_Get_first_and_last_block( 200da10: 90 10 00 19 mov %i1, %o0 200da14: 92 10 00 1a mov %i2, %o1 200da18: 94 10 00 11 mov %l1, %o2 200da1c: 98 07 bf f8 add %fp, -8, %o4 200da20: 7f ff ed 74 call 2008ff0 <_Heap_Get_first_and_last_block> 200da24: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200da28: 80 8a 20 ff btst 0xff, %o0 200da2c: 02 bf ff f5 be 200da00 <_Heap_Extend+0x28> 200da30: ba 10 00 17 mov %l7, %i5 200da34: aa 10 20 00 clr %l5 200da38: ac 10 20 00 clr %l6 200da3c: a4 10 20 00 clr %l2 200da40: 10 80 00 10 b 200da80 <_Heap_Extend+0xa8> 200da44: a8 10 20 00 clr %l4 return false; } if ( extend_area_end == sub_area_begin ) { merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { 200da48: 2a 80 00 02 bcs,a 200da50 <_Heap_Extend+0x78> 200da4c: ac 10 00 1d mov %i5, %l6 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200da50: 80 a7 00 19 cmp %i4, %i1 200da54: 22 80 00 1e be,a 200dacc <_Heap_Extend+0xf4> 200da58: 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 ) { 200da5c: 80 a6 40 1c cmp %i1, %i4 200da60: 38 80 00 02 bgu,a 200da68 <_Heap_Extend+0x90> 200da64: 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; 200da68: fa 02 20 04 ld [ %o0 + 4 ], %i5 200da6c: 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); 200da70: 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 ); 200da74: 80 a5 c0 1d cmp %l7, %i5 200da78: 22 80 00 1c be,a 200dae8 <_Heap_Extend+0x110> 200da7c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 return false; } do { uintptr_t const sub_area_begin = (start_block != first_block) ? (uintptr_t) start_block : heap->area_begin; 200da80: 80 a7 40 17 cmp %i5, %l7 200da84: 22 80 00 03 be,a 200da90 <_Heap_Extend+0xb8> 200da88: f4 06 20 18 ld [ %i0 + 0x18 ], %i2 200da8c: b4 10 00 1d mov %i5, %i2 uintptr_t const sub_area_end = start_block->prev_size; 200da90: f8 07 40 00 ld [ %i5 ], %i4 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200da94: 92 10 00 11 mov %l1, %o1 200da98: 40 00 2c a2 call 2018d20 <.urem> 200da9c: 90 10 00 1c mov %i4, %o0 200daa0: 82 07 3f f8 add %i4, -8, %g1 Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 200daa4: 80 a6 80 10 cmp %i2, %l0 200daa8: 0a 80 00 69 bcs 200dc4c <_Heap_Extend+0x274> 200daac: 90 20 40 08 sub %g1, %o0, %o0 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; } if ( extend_area_end == sub_area_begin ) { 200dab0: 80 a6 80 10 cmp %i2, %l0 200dab4: 12 bf ff e5 bne 200da48 <_Heap_Extend+0x70> 200dab8: 80 a4 00 1c cmp %l0, %i4 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 ) { 200dabc: 80 a7 00 19 cmp %i4, %i1 200dac0: 12 bf ff e7 bne 200da5c <_Heap_Extend+0x84> <== ALWAYS TAKEN 200dac4: a8 10 00 1d mov %i5, %l4 start_block->prev_size = extend_area_end; 200dac8: 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; 200dacc: fa 02 20 04 ld [ %o0 + 4 ], %i5 200dad0: 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); 200dad4: 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 ); 200dad8: 80 a5 c0 1d cmp %l7, %i5 200dadc: 12 bf ff e9 bne 200da80 <_Heap_Extend+0xa8> <== NEVER TAKEN 200dae0: a4 10 00 08 mov %o0, %l2 if ( extend_area_begin < heap->area_begin ) { 200dae4: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200dae8: 80 a6 40 01 cmp %i1, %g1 200daec: 3a 80 00 53 bcc,a 200dc38 <_Heap_Extend+0x260> 200daf0: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200daf4: f2 26 20 18 st %i1, [ %i0 + 0x18 ] } else if ( heap->area_end < extend_area_end ) { heap->area_end = extend_area_end; } extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; 200daf8: c2 07 bf f8 ld [ %fp + -8 ], %g1 200dafc: 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 ) { 200db00: c8 06 20 20 ld [ %i0 + 0x20 ], %g4 heap->area_begin = extend_area_begin; } else if ( heap->area_end < extend_area_end ) { heap->area_end = extend_area_end; } extend_first_block_size = 200db04: 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; 200db08: e0 20 40 00 st %l0, [ %g1 ] extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 200db0c: 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 = 200db10: 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; 200db14: 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 ) { 200db18: 80 a1 00 01 cmp %g4, %g1 200db1c: 08 80 00 41 bleu 200dc20 <_Heap_Extend+0x248> 200db20: c0 20 a0 04 clr [ %g2 + 4 ] heap->first_block = extend_first_block; 200db24: c2 26 20 20 st %g1, [ %i0 + 0x20 ] } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200db28: 80 a5 20 00 cmp %l4, 0 200db2c: 02 80 00 4d be 200dc60 <_Heap_Extend+0x288> 200db30: 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; 200db34: fa 06 20 10 ld [ %i0 + 0x10 ], %i5 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up( uintptr_t value, uintptr_t alignment ) { uintptr_t remainder = value % alignment; 200db38: 92 10 00 1d mov %i5, %o1 200db3c: 40 00 2c 79 call 2018d20 <.urem> 200db40: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200db44: 80 a2 20 00 cmp %o0, 0 200db48: 02 80 00 04 be 200db58 <_Heap_Extend+0x180> 200db4c: c4 05 00 00 ld [ %l4 ], %g2 return value - remainder + alignment; 200db50: b2 06 40 1d add %i1, %i5, %i1 200db54: 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 = 200db58: 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; 200db5c: 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 = 200db60: 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; 200db64: 84 10 a0 01 or %g2, 1, %g2 _Heap_Free_block( heap, new_first_block ); 200db68: 90 10 00 18 mov %i0, %o0 200db6c: 92 10 00 01 mov %g1, %o1 200db70: 7f ff ff 90 call 200d9b0 <_Heap_Free_block> 200db74: c4 26 7f fc st %g2, [ %i1 + -4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200db78: 80 a4 a0 00 cmp %l2, 0 200db7c: 02 80 00 40 be 200dc7c <_Heap_Extend+0x2a4> 200db80: 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); 200db84: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 uintptr_t extend_area_end ) { uintptr_t const page_size = heap->page_size; uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const last_block_new_size = _Heap_Align_down( 200db88: a0 24 00 12 sub %l0, %l2, %l0 200db8c: 40 00 2c 65 call 2018d20 <.urem> 200db90: 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) 200db94: c2 04 a0 04 ld [ %l2 + 4 ], %g1 200db98: a0 24 00 08 sub %l0, %o0, %l0 200db9c: 82 20 40 10 sub %g1, %l0, %g1 | HEAP_PREV_BLOCK_USED; 200dba0: 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 = 200dba4: 84 04 00 12 add %l0, %l2, %g2 200dba8: 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; 200dbac: c2 04 a0 04 ld [ %l2 + 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 ); 200dbb0: 90 10 00 18 mov %i0, %o0 200dbb4: 82 08 60 01 and %g1, 1, %g1 200dbb8: 92 10 00 12 mov %l2, %o1 block->size_and_flag = size | flag; 200dbbc: a0 14 00 01 or %l0, %g1, %l0 200dbc0: 7f ff ff 7c call 200d9b0 <_Heap_Free_block> 200dbc4: e0 24 a0 04 st %l0, [ %l2 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200dbc8: 80 a4 a0 00 cmp %l2, 0 200dbcc: 02 80 00 39 be 200dcb0 <_Heap_Extend+0x2d8> 200dbd0: 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 200dbd4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 * This feature will be used to terminate the scattered heap area list. See * also _Heap_Extend(). */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( 200dbd8: fa 06 20 20 ld [ %i0 + 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; 200dbdc: 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; 200dbe0: c4 06 20 2c ld [ %i0 + 0x2c ], %g2 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200dbe4: c6 06 20 30 ld [ %i0 + 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( 200dbe8: 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; 200dbec: 88 09 20 01 and %g4, 1, %g4 block->size_and_flag = size | flag; 200dbf0: 88 17 40 04 or %i5, %g4, %g4 200dbf4: c8 20 60 04 st %g4, [ %g1 + 4 ] 200dbf8: a6 20 c0 13 sub %g3, %l3, %l3 /* Statistics */ stats->size += extended_size; 200dbfc: 82 00 80 13 add %g2, %l3, %g1 if ( extended_size_ptr != NULL ) 200dc00: 80 a6 e0 00 cmp %i3, 0 200dc04: 02 80 00 32 be 200dccc <_Heap_Extend+0x2f4> <== NEVER TAKEN 200dc08: c2 26 20 2c st %g1, [ %i0 + 0x2c ] *extended_size_ptr = extended_size; 200dc0c: e6 26 c0 00 st %l3, [ %i3 ] return true; 200dc10: b0 10 20 01 mov 1, %i0 } 200dc14: b0 0e 20 01 and %i0, 1, %i0 200dc18: 81 c7 e0 08 ret 200dc1c: 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 ) { 200dc20: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200dc24: 80 a0 40 02 cmp %g1, %g2 200dc28: 2a bf ff c0 bcs,a 200db28 <_Heap_Extend+0x150> 200dc2c: c4 26 20 24 st %g2, [ %i0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200dc30: 10 bf ff bf b 200db2c <_Heap_Extend+0x154> 200dc34: 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 ) { 200dc38: 80 a4 00 01 cmp %l0, %g1 200dc3c: 38 bf ff af bgu,a 200daf8 <_Heap_Extend+0x120> 200dc40: e0 26 20 1c st %l0, [ %i0 + 0x1c ] heap->area_end = extend_area_end; } extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; 200dc44: 10 bf ff ae b 200dafc <_Heap_Extend+0x124> 200dc48: 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 ( 200dc4c: 80 a6 40 1c cmp %i1, %i4 200dc50: 1a bf ff 99 bcc 200dab4 <_Heap_Extend+0xdc> 200dc54: 80 a6 80 10 cmp %i2, %l0 uintptr_t extend_first_block_size = 0; uintptr_t extended_size = 0; bool extend_area_ok = false; if ( extend_area_end < extend_area_begin ) { return false; 200dc58: 10 bf ff 6b b 200da04 <_Heap_Extend+0x2c> 200dc5c: b0 10 20 00 clr %i0 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 ) { 200dc60: 80 a5 a0 00 cmp %l6, 0 200dc64: 02 bf ff c6 be 200db7c <_Heap_Extend+0x1a4> 200dc68: 80 a4 a0 00 cmp %l2, 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; 200dc6c: ac 25 80 02 sub %l6, %g2, %l6 200dc70: 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 = 200dc74: 10 bf ff c2 b 200db7c <_Heap_Extend+0x1a4> 200dc78: 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 ) { 200dc7c: 80 a5 60 00 cmp %l5, 0 200dc80: 02 bf ff d2 be 200dbc8 <_Heap_Extend+0x1f0> 200dc84: 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; 200dc88: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 200dc8c: c2 07 bf fc ld [ %fp + -4 ], %g1 200dc90: 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 ); 200dc94: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 200dc98: 84 10 80 03 or %g2, %g3, %g2 200dc9c: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200dca0: c4 00 60 04 ld [ %g1 + 4 ], %g2 200dca4: 84 10 a0 01 or %g2, 1, %g2 200dca8: 10 bf ff c8 b 200dbc8 <_Heap_Extend+0x1f0> 200dcac: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200dcb0: 32 bf ff ca bne,a 200dbd8 <_Heap_Extend+0x200> 200dcb4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200dcb8: d2 07 bf f8 ld [ %fp + -8 ], %o1 200dcbc: 7f ff ff 3d call 200d9b0 <_Heap_Free_block> 200dcc0: 90 10 00 18 mov %i0, %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 200dcc4: 10 bf ff c5 b 200dbd8 <_Heap_Extend+0x200> 200dcc8: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 stats->size += extended_size; if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; 200dccc: 10 bf ff 4e b 200da04 <_Heap_Extend+0x2c> <== NOT EXECUTED 200dcd0: b0 10 20 01 mov 1, %i0 <== NOT EXECUTED =============================================================================== 0200d9c0 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200d9c0: 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 ) { 200d9c4: 80 a6 60 00 cmp %i1, 0 200d9c8: 02 80 00 3c be 200dab8 <_Heap_Free+0xf8> 200d9cc: 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); 200d9d0: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200d9d4: 40 00 2c 0e call 2018a0c <.urem> 200d9d8: 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 200d9dc: 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); 200d9e0: 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); 200d9e4: 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; 200d9e8: 80 a2 00 02 cmp %o0, %g2 200d9ec: 0a 80 00 30 bcs 200daac <_Heap_Free+0xec> 200d9f0: 82 10 20 00 clr %g1 200d9f4: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 200d9f8: 80 a2 00 04 cmp %o0, %g4 200d9fc: 38 80 00 2d bgu,a 200dab0 <_Heap_Free+0xf0> 200da00: b0 08 60 ff and %g1, 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; 200da04: f6 02 20 04 ld [ %o0 + 4 ], %i3 200da08: 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); 200da0c: 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; 200da10: 80 a0 80 03 cmp %g2, %g3 200da14: 38 80 00 27 bgu,a 200dab0 <_Heap_Free+0xf0> <== NEVER TAKEN 200da18: b0 08 60 ff and %g1, 0xff, %i0 <== NOT EXECUTED 200da1c: 80 a1 00 03 cmp %g4, %g3 200da20: 2a 80 00 24 bcs,a 200dab0 <_Heap_Free+0xf0> <== NEVER TAKEN 200da24: 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; 200da28: f8 00 e0 04 ld [ %g3 + 4 ], %i4 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200da2c: 80 8f 20 01 btst 1, %i4 200da30: 02 80 00 1f be 200daac <_Heap_Free+0xec> <== NEVER TAKEN 200da34: 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 )); 200da38: 02 80 00 23 be 200dac4 <_Heap_Free+0x104> 200da3c: b8 0f 3f fe and %i4, -2, %i4 200da40: 82 00 c0 1c add %g3, %i4, %g1 200da44: c2 00 60 04 ld [ %g1 + 4 ], %g1 200da48: 80 88 60 01 btst 1, %g1 200da4c: 12 80 00 1f bne 200dac8 <_Heap_Free+0x108> 200da50: 80 8e e0 01 btst 1, %i3 if ( !_Heap_Is_prev_used( block ) ) { 200da54: 02 80 00 20 be 200dad4 <_Heap_Free+0x114> 200da58: 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; 200da5c: c4 00 e0 08 ld [ %g3 + 8 ], %g2 Heap_Block *prev = old_block->prev; 200da60: c2 00 e0 0c ld [ %g3 + 0xc ], %g1 new_block->next = next; 200da64: c4 22 20 08 st %g2, [ %o0 + 8 ] new_block->prev = prev; 200da68: 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; 200da6c: b8 07 00 1d add %i4, %i5, %i4 next->prev = new_block; 200da70: d0 20 a0 0c st %o0, [ %g2 + 0xc ] prev->next = new_block; 200da74: d0 20 60 08 st %o0, [ %g1 + 8 ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200da78: 84 17 20 01 or %i4, 1, %g2 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200da7c: 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; 200da80: c4 22 20 04 st %g2, [ %o0 + 4 ] } } /* Statistics */ --stats->used_blocks; ++stats->frees; 200da84: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200da88: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 ++stats->frees; stats->free_size += block_size; 200da8c: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 } } /* Statistics */ --stats->used_blocks; ++stats->frees; 200da90: 82 00 60 01 inc %g1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200da94: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; stats->free_size += block_size; 200da98: ba 00 c0 1d add %g3, %i5, %i5 } } /* Statistics */ --stats->used_blocks; ++stats->frees; 200da9c: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200daa0: c4 26 20 40 st %g2, [ %i0 + 0x40 ] ++stats->frees; stats->free_size += block_size; 200daa4: fa 26 20 30 st %i5, [ %i0 + 0x30 ] return( true ); 200daa8: 82 10 20 01 mov 1, %g1 200daac: b0 08 60 ff and %g1, 0xff, %i0 200dab0: 81 c7 e0 08 ret 200dab4: 81 e8 00 00 restore 200dab8: b0 08 60 ff and %g1, 0xff, %i0 200dabc: 81 c7 e0 08 ret 200dac0: 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 ) ) { 200dac4: 80 8e e0 01 btst 1, %i3 200dac8: 32 80 00 1e bne,a 200db40 <_Heap_Free+0x180> 200dacc: 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 200dad0: 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; 200dad4: 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); 200dad8: 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; 200dadc: 80 a0 80 1b cmp %g2, %i3 200dae0: 18 bf ff f3 bgu 200daac <_Heap_Free+0xec> <== NEVER TAKEN 200dae4: 82 10 20 00 clr %g1 200dae8: 80 a1 00 1b cmp %g4, %i3 200daec: 2a bf ff f1 bcs,a 200dab0 <_Heap_Free+0xf0> <== NEVER TAKEN 200daf0: 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; 200daf4: 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) ) { 200daf8: 80 88 a0 01 btst 1, %g2 200dafc: 02 bf ff ec be 200daac <_Heap_Free+0xec> <== NEVER TAKEN 200db00: 80 8e 60 ff btst 0xff, %i1 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200db04: 22 80 00 21 be,a 200db88 <_Heap_Free+0x1c8> 200db08: 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; 200db0c: c2 00 e0 08 ld [ %g3 + 8 ], %g1 Heap_Block *prev = block->prev; 200db10: 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; 200db14: c6 06 20 38 ld [ %i0 + 0x38 ], %g3 prev->next = next; 200db18: c2 20 a0 08 st %g1, [ %g2 + 8 ] next->prev = prev; 200db1c: c4 20 60 0c st %g2, [ %g1 + 0xc ] 200db20: 82 00 ff ff add %g3, -1, %g1 200db24: 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; 200db28: b8 07 40 1c add %i5, %i4, %i4 200db2c: 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; 200db30: 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; 200db34: 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; 200db38: 10 bf ff d3 b 200da84 <_Heap_Free+0xc4> 200db3c: 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; 200db40: 82 17 60 01 or %i5, 1, %g1 200db44: c2 22 20 04 st %g1, [ %o0 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200db48: c8 00 e0 04 ld [ %g3 + 4 ], %g4 ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200db4c: f0 22 20 0c st %i0, [ %o0 + 0xc ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200db50: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200db54: c4 22 20 08 st %g2, [ %o0 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200db58: 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; 200db5c: 84 09 3f fe and %g4, -2, %g2 next_block->prev_size = block_size; 200db60: 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; 200db64: 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 ) { 200db68: 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; 200db6c: 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; 200db70: d0 26 20 08 st %o0, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200db74: 80 a0 40 02 cmp %g1, %g2 200db78: 08 bf ff c3 bleu 200da84 <_Heap_Free+0xc4> 200db7c: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200db80: 10 bf ff c1 b 200da84 <_Heap_Free+0xc4> 200db84: 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; 200db88: 82 16 a0 01 or %i2, 1, %g1 200db8c: c2 26 e0 04 st %g1, [ %i3 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200db90: c2 00 e0 04 ld [ %g3 + 4 ], %g1 next_block->prev_size = size; 200db94: 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; 200db98: 82 08 7f fe and %g1, -2, %g1 200db9c: 10 bf ff ba b 200da84 <_Heap_Free+0xc4> 200dba0: c2 20 e0 04 st %g1, [ %g3 + 4 ] =============================================================================== 0201257c <_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; 201257c: 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; 2012580: c0 22 40 00 clr [ %o1 ] info->largest = 0; 2012584: c0 22 60 04 clr [ %o1 + 4 ] info->total = 0; 2012588: c0 22 60 08 clr [ %o1 + 8 ] for(the_block = _Heap_Free_list_first(the_heap); 201258c: 88 10 20 01 mov 1, %g4 2012590: 9a 10 20 00 clr %o5 2012594: 80 a2 00 01 cmp %o0, %g1 2012598: 12 80 00 04 bne 20125a8 <_Heap_Get_free_information+0x2c> <== ALWAYS TAKEN 201259c: 86 10 20 00 clr %g3 20125a0: 30 80 00 10 b,a 20125e0 <_Heap_Get_free_information+0x64><== NOT EXECUTED 20125a4: 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; 20125a8: c4 00 60 04 ld [ %g1 + 4 ], %g2 20125ac: 98 01 20 01 add %g4, 1, %o4 20125b0: 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 ) 20125b4: 80 a0 80 0d cmp %g2, %o5 20125b8: 08 80 00 03 bleu 20125c4 <_Heap_Get_free_information+0x48> 20125bc: 86 00 c0 02 add %g3, %g2, %g3 info->largest = the_size; 20125c0: 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) 20125c4: 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); 20125c8: 80 a2 00 01 cmp %o0, %g1 20125cc: 32 bf ff f6 bne,a 20125a4 <_Heap_Get_free_information+0x28> 20125d0: da 02 60 04 ld [ %o1 + 4 ], %o5 20125d4: c8 22 40 00 st %g4, [ %o1 ] 20125d8: 81 c3 e0 08 retl 20125dc: c6 22 60 08 st %g3, [ %o1 + 8 ] 20125e0: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 0200ae8c <_Heap_Greedy_allocate>: Heap_Block *_Heap_Greedy_allocate( Heap_Control *heap, uintptr_t remaining_free_space ) { 200ae8c: 9d e3 bf a0 save %sp, -96, %sp void *free_space = remaining_free_space > 0 ? _Heap_Allocate( heap, remaining_free_space ) : NULL; 200ae90: b4 10 20 00 clr %i2 200ae94: 80 a6 60 00 cmp %i1, 0 200ae98: 12 80 00 1b bne 200af04 <_Heap_Greedy_allocate+0x78> 200ae9c: b8 10 00 18 mov %i0, %i4 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200aea0: fa 07 20 08 ld [ %i4 + 8 ], %i5 Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); Heap_Block *current = _Heap_Free_list_first( heap ); Heap_Block *blocks = NULL; while ( current != free_list_tail ) { 200aea4: 80 a7 00 1d cmp %i4, %i5 200aea8: 22 80 00 12 be,a 200aef0 <_Heap_Greedy_allocate+0x64> <== NEVER TAKEN 200aeac: b0 10 20 00 clr %i0 <== NOT EXECUTED 200aeb0: 10 80 00 03 b 200aebc <_Heap_Greedy_allocate+0x30> 200aeb4: b6 10 20 00 clr %i3 _Heap_Block_size( current ) - HEAP_BLOCK_HEADER_SIZE ); current->next = blocks; blocks = current; current = _Heap_Free_list_first( heap ); 200aeb8: 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; 200aebc: d6 07 60 04 ld [ %i5 + 4 ], %o3 Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); Heap_Block *current = _Heap_Free_list_first( heap ); Heap_Block *blocks = NULL; while ( current != free_list_tail ) { _Heap_Block_allocate( 200aec0: 92 10 00 1d mov %i5, %o1 200aec4: 96 0a ff fe and %o3, -2, %o3 200aec8: 94 07 60 08 add %i5, 8, %o2 200aecc: 90 10 00 1c mov %i4, %o0 200aed0: 40 00 00 e0 call 200b250 <_Heap_Block_allocate> 200aed4: 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; 200aed8: f6 27 60 08 st %i3, [ %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; 200aedc: c2 07 20 08 ld [ %i4 + 8 ], %g1 : NULL; Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); Heap_Block *current = _Heap_Free_list_first( heap ); Heap_Block *blocks = NULL; while ( current != free_list_tail ) { 200aee0: 80 a7 00 01 cmp %i4, %g1 200aee4: 12 bf ff f5 bne 200aeb8 <_Heap_Greedy_allocate+0x2c> 200aee8: b6 10 00 1d mov %i5, %i3 200aeec: b0 10 00 1d mov %i5, %i0 current->next = blocks; blocks = current; current = _Heap_Free_list_first( heap ); } _Heap_Free( heap, free_space ); 200aef0: 90 10 00 1c mov %i4, %o0 200aef4: 40 00 1e 01 call 20126f8 <_Heap_Free> 200aef8: 92 10 00 1a mov %i2, %o1 return blocks; } 200aefc: 81 c7 e0 08 ret 200af00: 81 e8 00 00 restore * @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 ); 200af04: 90 10 00 18 mov %i0, %o0 200af08: 92 10 00 19 mov %i1, %o1 200af0c: 94 10 20 00 clr %o2 200af10: 40 00 1d 6f call 20124cc <_Heap_Allocate_aligned_with_boundary> 200af14: 96 10 20 00 clr %o3 200af18: 10 bf ff e2 b 200aea0 <_Heap_Greedy_allocate+0x14> 200af1c: b4 10 00 08 mov %o0, %i2 =============================================================================== 0200af20 <_Heap_Greedy_free>: void _Heap_Greedy_free( Heap_Control *heap, Heap_Block *blocks ) { 200af20: 9d e3 bf a0 save %sp, -96, %sp while ( blocks != NULL ) { 200af24: 80 a6 60 00 cmp %i1, 0 200af28: 02 80 00 09 be 200af4c <_Heap_Greedy_free+0x2c> <== NEVER TAKEN 200af2c: 01 00 00 00 nop Heap_Block *current = blocks; blocks = blocks->next; 200af30: fa 06 60 08 ld [ %i1 + 8 ], %i5 _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) ); 200af34: 92 06 60 08 add %i1, 8, %o1 200af38: 40 00 1d f0 call 20126f8 <_Heap_Free> 200af3c: 90 10 00 18 mov %i0, %o0 void _Heap_Greedy_free( Heap_Control *heap, Heap_Block *blocks ) { while ( blocks != NULL ) { 200af40: b2 97 60 00 orcc %i5, 0, %i1 200af44: 32 bf ff fc bne,a 200af34 <_Heap_Greedy_free+0x14> 200af48: fa 06 60 08 ld [ %i1 + 8 ], %i5 200af4c: 81 c7 e0 08 ret 200af50: 81 e8 00 00 restore =============================================================================== 02012648 <_Heap_Iterate>: void _Heap_Iterate( Heap_Control *heap, Heap_Block_visitor visitor, void *visitor_arg ) { 2012648: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *current = heap->first_block; 201264c: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 Heap_Block *end = heap->last_block; 2012650: f8 06 20 24 ld [ %i0 + 0x24 ], %i4 bool stop = false; while ( !stop && current != end ) { 2012654: 80 a0 40 1c cmp %g1, %i4 2012658: 32 80 00 08 bne,a 2012678 <_Heap_Iterate+0x30> <== ALWAYS TAKEN 201265c: d2 00 60 04 ld [ %g1 + 4 ], %o1 2012660: 30 80 00 10 b,a 20126a0 <_Heap_Iterate+0x58> <== NOT EXECUTED 2012664: 90 1a 20 01 xor %o0, 1, %o0 2012668: 80 8a 20 ff btst 0xff, %o0 201266c: 02 80 00 0d be 20126a0 <_Heap_Iterate+0x58> <== NEVER TAKEN 2012670: 01 00 00 00 nop 2012674: 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 ); 2012678: 90 10 00 01 mov %g1, %o0 201267c: 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); 2012680: 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; 2012684: d4 07 60 04 ld [ %i5 + 4 ], %o2 2012688: 96 10 00 1a mov %i2, %o3 201268c: 9f c6 40 00 call %i1 2012690: 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 ) { 2012694: 80 a7 00 1d cmp %i4, %i5 2012698: 12 bf ff f3 bne 2012664 <_Heap_Iterate+0x1c> 201269c: 82 10 00 1d mov %i5, %g1 20126a0: 81 c7 e0 08 ret 20126a4: 81 e8 00 00 restore =============================================================================== 0200dccc <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 200dccc: 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); 200dcd0: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200dcd4: 40 00 2b 4e call 2018a0c <.urem> 200dcd8: 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 200dcdc: 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); 200dce0: 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); 200dce4: 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; 200dce8: 80 a2 00 01 cmp %o0, %g1 200dcec: 0a 80 00 16 bcs 200dd44 <_Heap_Size_of_alloc_area+0x78> 200dcf0: 84 10 20 00 clr %g2 200dcf4: c6 06 20 24 ld [ %i0 + 0x24 ], %g3 200dcf8: 80 a2 00 03 cmp %o0, %g3 200dcfc: 18 80 00 13 bgu 200dd48 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200dd00: 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; 200dd04: c8 02 20 04 ld [ %o0 + 4 ], %g4 200dd08: 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); 200dd0c: 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; 200dd10: 80 a0 40 08 cmp %g1, %o0 200dd14: 18 80 00 0d bgu 200dd48 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200dd18: 01 00 00 00 nop 200dd1c: 80 a0 c0 08 cmp %g3, %o0 200dd20: 0a 80 00 0a bcs 200dd48 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200dd24: 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; 200dd28: 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 ) 200dd2c: 80 88 60 01 btst 1, %g1 200dd30: 02 80 00 06 be 200dd48 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200dd34: 90 22 00 19 sub %o0, %i1, %o0 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 200dd38: 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; 200dd3c: 90 02 20 04 add %o0, 4, %o0 200dd40: d0 26 80 00 st %o0, [ %i2 ] 200dd44: b0 08 a0 ff and %g2, 0xff, %i0 200dd48: 81 c7 e0 08 ret 200dd4c: 81 e8 00 00 restore =============================================================================== 02009f2c <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 2009f2c: 9d e3 bf 80 save %sp, -128, %sp uintptr_t const page_size = heap->page_size; 2009f30: f6 06 20 10 ld [ %i0 + 0x10 ], %i3 uintptr_t const min_block_size = heap->min_block_size; 2009f34: e0 06 20 14 ld [ %i0 + 0x14 ], %l0 Heap_Block *const first_block = heap->first_block; 2009f38: 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; 2009f3c: 80 a6 a0 00 cmp %i2, 0 2009f40: 02 80 00 0c be 2009f70 <_Heap_Walk+0x44> 2009f44: e2 06 20 24 ld [ %i0 + 0x24 ], %l1 if ( !_System_state_Is_up( _System_state_Get() ) ) { 2009f48: 03 00 80 7e sethi %hi(0x201f800), %g1 2009f4c: c4 00 60 90 ld [ %g1 + 0x90 ], %g2 ! 201f890 <_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; 2009f50: 07 00 80 27 sethi %hi(0x2009c00), %g3 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; 2009f54: 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() ) ) { 2009f58: 80 a0 a0 03 cmp %g2, 3 2009f5c: 02 80 00 0c be 2009f8c <_Heap_Walk+0x60> <== ALWAYS TAKEN 2009f60: ae 10 e2 c8 or %g3, 0x2c8, %l7 2009f64: b0 08 60 ff and %g1, 0xff, %i0 2009f68: 81 c7 e0 08 ret 2009f6c: 81 e8 00 00 restore 2009f70: 03 00 80 7e sethi %hi(0x201f800), %g1 2009f74: c4 00 60 90 ld [ %g1 + 0x90 ], %g2 ! 201f890 <_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; 2009f78: 07 00 80 27 sethi %hi(0x2009c00), %g3 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; 2009f7c: 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() ) ) { 2009f80: 80 a0 a0 03 cmp %g2, 3 2009f84: 12 bf ff f8 bne 2009f64 <_Heap_Walk+0x38> 2009f88: ae 10 e2 c0 or %g3, 0x2c0, %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)( 2009f8c: da 06 20 18 ld [ %i0 + 0x18 ], %o5 2009f90: c8 06 20 1c ld [ %i0 + 0x1c ], %g4 2009f94: c4 06 20 08 ld [ %i0 + 8 ], %g2 2009f98: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2009f9c: 90 10 00 19 mov %i1, %o0 2009fa0: c8 23 a0 5c st %g4, [ %sp + 0x5c ] 2009fa4: f8 23 a0 60 st %i4, [ %sp + 0x60 ] 2009fa8: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 2009fac: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 2009fb0: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2009fb4: 92 10 20 00 clr %o1 2009fb8: 96 10 00 1b mov %i3, %o3 2009fbc: 15 00 80 70 sethi %hi(0x201c000), %o2 2009fc0: 98 10 00 10 mov %l0, %o4 2009fc4: 9f c5 c0 00 call %l7 2009fc8: 94 12 a3 b0 or %o2, 0x3b0, %o2 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 2009fcc: 80 a6 e0 00 cmp %i3, 0 2009fd0: 02 80 00 2a be 200a078 <_Heap_Walk+0x14c> 2009fd4: 80 8e e0 07 btst 7, %i3 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 2009fd8: 12 80 00 2f bne 200a094 <_Heap_Walk+0x168> 2009fdc: 90 10 00 10 mov %l0, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2009fe0: 7f ff de e4 call 2001b70 <.urem> 2009fe4: 92 10 00 1b mov %i3, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 2009fe8: 80 a2 20 00 cmp %o0, 0 2009fec: 12 80 00 32 bne 200a0b4 <_Heap_Walk+0x188> 2009ff0: 90 07 20 08 add %i4, 8, %o0 2009ff4: 7f ff de df call 2001b70 <.urem> 2009ff8: 92 10 00 1b mov %i3, %o1 ); return false; } if ( 2009ffc: 80 a2 20 00 cmp %o0, 0 200a000: 32 80 00 35 bne,a 200a0d4 <_Heap_Walk+0x1a8> 200a004: 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; 200a008: ec 07 20 04 ld [ %i4 + 4 ], %l6 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 200a00c: b4 8d a0 01 andcc %l6, 1, %i2 200a010: 22 80 00 38 be,a 200a0f0 <_Heap_Walk+0x1c4> 200a014: 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; 200a018: c2 04 60 04 ld [ %l1 + 4 ], %g1 200a01c: 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); 200a020: 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; 200a024: fa 00 60 04 ld [ %g1 + 4 ], %i5 ); return false; } if ( _Heap_Is_free( last_block ) ) { 200a028: 80 8f 60 01 btst 1, %i5 200a02c: 02 80 00 0c be 200a05c <_Heap_Walk+0x130> 200a030: 80 a7 00 01 cmp %i4, %g1 ); return false; } if ( 200a034: 02 80 00 35 be 200a108 <_Heap_Walk+0x1dc> 200a038: 90 10 00 19 mov %i1, %o0 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 200a03c: 92 10 20 01 mov 1, %o1 200a040: 15 00 80 71 sethi %hi(0x201c400), %o2 200a044: 9f c5 c0 00 call %l7 200a048: 94 12 a1 28 or %o2, 0x128, %o2 ! 201c528 <__log2table+0x2d8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a04c: 82 10 20 00 clr %g1 200a050: b0 08 60 ff and %g1, 0xff, %i0 200a054: 81 c7 e0 08 ret 200a058: 81 e8 00 00 restore return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 200a05c: 90 10 00 19 mov %i1, %o0 200a060: 92 10 20 01 mov 1, %o1 200a064: 15 00 80 71 sethi %hi(0x201c400), %o2 200a068: 9f c5 c0 00 call %l7 200a06c: 94 12 a1 10 or %o2, 0x110, %o2 ! 201c510 <__log2table+0x2c0> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a070: 10 bf ff f8 b 200a050 <_Heap_Walk+0x124> 200a074: 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" ); 200a078: 90 10 00 19 mov %i1, %o0 200a07c: 92 10 20 01 mov 1, %o1 200a080: 15 00 80 71 sethi %hi(0x201c400), %o2 200a084: 9f c5 c0 00 call %l7 200a088: 94 12 a0 48 or %o2, 0x48, %o2 ! 201c448 <__log2table+0x1f8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a08c: 10 bf ff f1 b 200a050 <_Heap_Walk+0x124> 200a090: 82 10 20 00 clr %g1 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 200a094: 90 10 00 19 mov %i1, %o0 200a098: 92 10 20 01 mov 1, %o1 200a09c: 15 00 80 71 sethi %hi(0x201c400), %o2 200a0a0: 96 10 00 1b mov %i3, %o3 200a0a4: 9f c5 c0 00 call %l7 200a0a8: 94 12 a0 60 or %o2, 0x60, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a0ac: 10 bf ff e9 b 200a050 <_Heap_Walk+0x124> 200a0b0: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 200a0b4: 90 10 00 19 mov %i1, %o0 200a0b8: 92 10 20 01 mov 1, %o1 200a0bc: 15 00 80 71 sethi %hi(0x201c400), %o2 200a0c0: 96 10 00 10 mov %l0, %o3 200a0c4: 9f c5 c0 00 call %l7 200a0c8: 94 12 a0 80 or %o2, 0x80, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a0cc: 10 bf ff e1 b 200a050 <_Heap_Walk+0x124> 200a0d0: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 200a0d4: 92 10 20 01 mov 1, %o1 200a0d8: 15 00 80 71 sethi %hi(0x201c400), %o2 200a0dc: 96 10 00 1c mov %i4, %o3 200a0e0: 9f c5 c0 00 call %l7 200a0e4: 94 12 a0 a8 or %o2, 0xa8, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a0e8: 10 bf ff da b 200a050 <_Heap_Walk+0x124> 200a0ec: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 200a0f0: 92 10 20 01 mov 1, %o1 200a0f4: 15 00 80 71 sethi %hi(0x201c400), %o2 200a0f8: 9f c5 c0 00 call %l7 200a0fc: 94 12 a0 e0 or %o2, 0xe0, %o2 ! 201c4e0 <__log2table+0x290> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a100: 10 bf ff d4 b 200a050 <_Heap_Walk+0x124> 200a104: 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; 200a108: 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; 200a10c: 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 ) { 200a110: 80 a6 00 1d cmp %i0, %i5 200a114: 02 80 00 0d be 200a148 <_Heap_Walk+0x21c> 200a118: 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; 200a11c: 80 a3 40 1d cmp %o5, %i5 200a120: 28 80 00 bf bleu,a 200a41c <_Heap_Walk+0x4f0> <== ALWAYS TAKEN 200a124: e6 06 20 24 ld [ %i0 + 0x24 ], %l3 if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 200a128: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 200a12c: 92 10 20 01 mov 1, %o1 200a130: 15 00 80 71 sethi %hi(0x201c400), %o2 200a134: 96 10 00 1d mov %i5, %o3 200a138: 9f c5 c0 00 call %l7 200a13c: 94 12 a1 58 or %o2, 0x158, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a140: 10 bf ff c4 b 200a050 <_Heap_Walk+0x124> 200a144: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 200a148: 27 00 80 71 sethi %hi(0x201c400), %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)( 200a14c: 25 00 80 71 sethi %hi(0x201c400), %l2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200a150: aa 10 00 1c mov %i4, %l5 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 200a154: a6 14 e3 88 or %l3, 0x388, %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)( 200a158: a4 14 a3 70 or %l2, 0x370, %l2 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 200a15c: 29 00 80 71 sethi %hi(0x201c400), %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; 200a160: 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); 200a164: 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; 200a168: 80 a3 40 1d cmp %o5, %i5 200a16c: 28 80 00 0b bleu,a 200a198 <_Heap_Walk+0x26c> <== ALWAYS TAKEN 200a170: 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)( 200a174: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 200a178: 92 10 20 01 mov 1, %o1 200a17c: 96 10 00 15 mov %l5, %o3 200a180: 15 00 80 71 sethi %hi(0x201c400), %o2 200a184: 98 10 00 1d mov %i5, %o4 200a188: 9f c5 c0 00 call %l7 200a18c: 94 12 a2 00 or %o2, 0x200, %o2 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 200a190: 10 bf ff 75 b 2009f64 <_Heap_Walk+0x38> 200a194: 82 10 20 00 clr %g1 200a198: 80 a3 c0 1d cmp %o7, %i5 200a19c: 0a bf ff f7 bcs 200a178 <_Heap_Walk+0x24c> 200a1a0: 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; 200a1a4: 9e 1d 40 11 xor %l5, %l1, %o7 200a1a8: 80 a0 00 0f cmp %g0, %o7 200a1ac: 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; 200a1b0: 90 10 00 16 mov %l6, %o0 200a1b4: da 27 bf fc st %o5, [ %fp + -4 ] 200a1b8: 7f ff de 6e call 2001b70 <.urem> 200a1bc: 92 10 00 1b mov %i3, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 200a1c0: 80 a2 20 00 cmp %o0, 0 200a1c4: 02 80 00 18 be 200a224 <_Heap_Walk+0x2f8> 200a1c8: da 07 bf fc ld [ %fp + -4 ], %o5 200a1cc: 80 8b 60 ff btst 0xff, %o5 200a1d0: 12 80 00 8b bne 200a3fc <_Heap_Walk+0x4d0> 200a1d4: 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; 200a1d8: de 07 60 04 ld [ %i5 + 4 ], %o7 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 200a1dc: 80 8b e0 01 btst 1, %o7 200a1e0: 02 80 00 2b be 200a28c <_Heap_Walk+0x360> 200a1e4: 80 a6 a0 00 cmp %i2, 0 if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 200a1e8: 22 80 00 21 be,a 200a26c <_Heap_Walk+0x340> 200a1ec: da 05 40 00 ld [ %l5 ], %o5 (*printer)( 200a1f0: 90 10 00 19 mov %i1, %o0 200a1f4: 92 10 20 00 clr %o1 200a1f8: 94 10 00 12 mov %l2, %o2 200a1fc: 96 10 00 15 mov %l5, %o3 200a200: 9f c5 c0 00 call %l7 200a204: 98 10 00 16 mov %l6, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 200a208: 80 a7 00 1d cmp %i4, %i5 200a20c: 02 80 00 51 be 200a350 <_Heap_Walk+0x424> 200a210: aa 10 00 1d mov %i5, %l5 200a214: ec 07 60 04 ld [ %i5 + 4 ], %l6 200a218: da 06 20 20 ld [ %i0 + 0x20 ], %o5 200a21c: 10 bf ff d1 b 200a160 <_Heap_Walk+0x234> 200a220: b4 0d a0 01 and %l6, 1, %i2 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 200a224: 80 a5 80 10 cmp %l6, %l0 200a228: 0a 80 00 69 bcs 200a3cc <_Heap_Walk+0x4a0> 200a22c: 80 8b 60 ff btst 0xff, %o5 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 200a230: 80 a5 40 1d cmp %l5, %i5 200a234: 2a bf ff ea bcs,a 200a1dc <_Heap_Walk+0x2b0> 200a238: de 07 60 04 ld [ %i5 + 4 ], %o7 200a23c: 80 8b 60 ff btst 0xff, %o5 200a240: 22 bf ff e7 be,a 200a1dc <_Heap_Walk+0x2b0> 200a244: de 07 60 04 ld [ %i5 + 4 ], %o7 (*printer)( 200a248: 90 10 00 19 mov %i1, %o0 200a24c: 92 10 20 01 mov 1, %o1 200a250: 96 10 00 15 mov %l5, %o3 200a254: 15 00 80 71 sethi %hi(0x201c400), %o2 200a258: 98 10 00 1d mov %i5, %o4 200a25c: 9f c5 c0 00 call %l7 200a260: 94 12 a2 90 or %o2, 0x290, %o2 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 200a264: 10 bf ff 40 b 2009f64 <_Heap_Walk+0x38> 200a268: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 200a26c: 96 10 00 15 mov %l5, %o3 200a270: 90 10 00 19 mov %i1, %o0 200a274: 92 10 20 00 clr %o1 200a278: 94 10 00 13 mov %l3, %o2 200a27c: 9f c5 c0 00 call %l7 200a280: 98 10 00 16 mov %l6, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 200a284: 10 bf ff e2 b 200a20c <_Heap_Walk+0x2e0> 200a288: 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 ? 200a28c: 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)( 200a290: de 06 20 08 ld [ %i0 + 8 ], %o7 200a294: 80 a3 c0 0d cmp %o7, %o5 200a298: 02 80 00 3d be 200a38c <_Heap_Walk+0x460> 200a29c: 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)" : ""), 200a2a0: 80 a6 00 0d cmp %i0, %o5 200a2a4: 02 80 00 40 be 200a3a4 <_Heap_Walk+0x478> 200a2a8: 96 15 23 38 or %l4, 0x338, %o3 block->next, block->next == last_free_block ? 200a2ac: 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)( 200a2b0: 80 a3 00 0f cmp %o4, %o7 200a2b4: 02 80 00 33 be 200a380 <_Heap_Walk+0x454> 200a2b8: 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)" : "") 200a2bc: 02 80 00 37 be 200a398 <_Heap_Walk+0x46c> 200a2c0: 98 15 23 38 or %l4, 0x338, %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)( 200a2c4: d6 23 a0 5c st %o3, [ %sp + 0x5c ] 200a2c8: d8 23 a0 64 st %o4, [ %sp + 0x64 ] 200a2cc: de 23 a0 60 st %o7, [ %sp + 0x60 ] 200a2d0: 90 10 00 19 mov %i1, %o0 200a2d4: 92 10 20 00 clr %o1 200a2d8: 15 00 80 71 sethi %hi(0x201c400), %o2 200a2dc: 96 10 00 15 mov %l5, %o3 200a2e0: 94 12 a2 c8 or %o2, 0x2c8, %o2 200a2e4: 9f c5 c0 00 call %l7 200a2e8: 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 ) { 200a2ec: da 07 40 00 ld [ %i5 ], %o5 200a2f0: 80 a5 80 0d cmp %l6, %o5 200a2f4: 12 80 00 19 bne 200a358 <_Heap_Walk+0x42c> 200a2f8: 80 a6 a0 00 cmp %i2, 0 ); return false; } if ( !prev_used ) { 200a2fc: 02 80 00 2d be 200a3b0 <_Heap_Walk+0x484> 200a300: 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; 200a304: 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 ) { 200a308: 80 a6 00 02 cmp %i0, %g2 200a30c: 02 80 00 0b be 200a338 <_Heap_Walk+0x40c> <== NEVER TAKEN 200a310: 92 10 20 01 mov 1, %o1 if ( free_block == block ) { 200a314: 80 a5 40 02 cmp %l5, %g2 200a318: 02 bf ff bd be 200a20c <_Heap_Walk+0x2e0> 200a31c: 80 a7 00 1d cmp %i4, %i5 return true; } free_block = free_block->next; 200a320: 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 ) { 200a324: 80 a6 00 02 cmp %i0, %g2 200a328: 12 bf ff fc bne 200a318 <_Heap_Walk+0x3ec> 200a32c: 80 a5 40 02 cmp %l5, %g2 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 200a330: 90 10 00 19 mov %i1, %o0 200a334: 92 10 20 01 mov 1, %o1 200a338: 15 00 80 71 sethi %hi(0x201c400), %o2 200a33c: 96 10 00 15 mov %l5, %o3 200a340: 9f c5 c0 00 call %l7 200a344: 94 12 a3 b0 or %o2, 0x3b0, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a348: 10 bf ff 42 b 200a050 <_Heap_Walk+0x124> 200a34c: 82 10 20 00 clr %g1 } block = next_block; } while ( block != first_block ); return true; 200a350: 10 bf ff 05 b 2009f64 <_Heap_Walk+0x38> 200a354: 82 10 20 01 mov 1, %g1 " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 200a358: fa 23 a0 5c st %i5, [ %sp + 0x5c ] 200a35c: 90 10 00 19 mov %i1, %o0 200a360: 92 10 20 01 mov 1, %o1 200a364: 15 00 80 71 sethi %hi(0x201c400), %o2 200a368: 96 10 00 15 mov %l5, %o3 200a36c: 94 12 a3 00 or %o2, 0x300, %o2 200a370: 9f c5 c0 00 call %l7 200a374: 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; 200a378: 10 bf ff 36 b 200a050 <_Heap_Walk+0x124> 200a37c: 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)( 200a380: 03 00 80 70 sethi %hi(0x201c000), %g1 200a384: 10 bf ff d0 b 200a2c4 <_Heap_Walk+0x398> 200a388: 98 10 63 90 or %g1, 0x390, %o4 ! 201c390 <__log2table+0x140> 200a38c: 03 00 80 70 sethi %hi(0x201c000), %g1 200a390: 10 bf ff c7 b 200a2ac <_Heap_Walk+0x380> 200a394: 96 10 63 70 or %g1, 0x370, %o3 ! 201c370 <__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)" : "") 200a398: 03 00 80 70 sethi %hi(0x201c000), %g1 200a39c: 10 bf ff ca b 200a2c4 <_Heap_Walk+0x398> 200a3a0: 98 10 63 a0 or %g1, 0x3a0, %o4 ! 201c3a0 <__log2table+0x150> block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 200a3a4: 17 00 80 70 sethi %hi(0x201c000), %o3 200a3a8: 10 bf ff c1 b 200a2ac <_Heap_Walk+0x380> 200a3ac: 96 12 e3 80 or %o3, 0x380, %o3 ! 201c380 <__log2table+0x130> return false; } if ( !prev_used ) { (*printer)( 200a3b0: 92 10 20 01 mov 1, %o1 200a3b4: 15 00 80 71 sethi %hi(0x201c400), %o2 200a3b8: 96 10 00 15 mov %l5, %o3 200a3bc: 9f c5 c0 00 call %l7 200a3c0: 94 12 a3 40 or %o2, 0x340, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a3c4: 10 bf ff 23 b 200a050 <_Heap_Walk+0x124> 200a3c8: 82 10 20 00 clr %g1 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 200a3cc: 02 bf ff 9a be 200a234 <_Heap_Walk+0x308> <== NEVER TAKEN 200a3d0: 80 a5 40 1d cmp %l5, %i5 (*printer)( 200a3d4: 90 10 00 19 mov %i1, %o0 200a3d8: 92 10 20 01 mov 1, %o1 200a3dc: 96 10 00 15 mov %l5, %o3 200a3e0: 15 00 80 71 sethi %hi(0x201c400), %o2 200a3e4: 98 10 00 16 mov %l6, %o4 200a3e8: 94 12 a2 60 or %o2, 0x260, %o2 200a3ec: 9f c5 c0 00 call %l7 200a3f0: 9a 10 00 10 mov %l0, %o5 block, block_size, min_block_size ); return false; 200a3f4: 10 bf fe dc b 2009f64 <_Heap_Walk+0x38> 200a3f8: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 200a3fc: 92 10 20 01 mov 1, %o1 200a400: 96 10 00 15 mov %l5, %o3 200a404: 15 00 80 71 sethi %hi(0x201c400), %o2 200a408: 98 10 00 16 mov %l6, %o4 200a40c: 9f c5 c0 00 call %l7 200a410: 94 12 a2 30 or %o2, 0x230, %o2 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 200a414: 10 bf fe d4 b 2009f64 <_Heap_Walk+0x38> 200a418: 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; 200a41c: 80 a4 c0 1d cmp %l3, %i5 200a420: 0a bf ff 43 bcs 200a12c <_Heap_Walk+0x200> <== NEVER TAKEN 200a424: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200a428: da 27 bf fc st %o5, [ %fp + -4 ] 200a42c: 90 07 60 08 add %i5, 8, %o0 200a430: 7f ff dd d0 call 2001b70 <.urem> 200a434: 92 10 00 14 mov %l4, %o1 ); return false; } if ( 200a438: 80 a2 20 00 cmp %o0, 0 200a43c: 12 80 00 36 bne 200a514 <_Heap_Walk+0x5e8> <== NEVER TAKEN 200a440: 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; 200a444: c2 07 60 04 ld [ %i5 + 4 ], %g1 200a448: 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; 200a44c: 82 07 40 01 add %i5, %g1, %g1 200a450: c2 00 60 04 ld [ %g1 + 4 ], %g1 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200a454: 80 88 60 01 btst 1, %g1 200a458: 12 80 00 27 bne 200a4f4 <_Heap_Walk+0x5c8> <== NEVER TAKEN 200a45c: a4 10 00 1d mov %i5, %l2 200a460: 10 80 00 19 b 200a4c4 <_Heap_Walk+0x598> 200a464: 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 ) { 200a468: 80 a6 00 1d cmp %i0, %i5 200a46c: 02 bf ff 37 be 200a148 <_Heap_Walk+0x21c> 200a470: 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; 200a474: 0a bf ff 2e bcs 200a12c <_Heap_Walk+0x200> 200a478: 90 10 00 19 mov %i1, %o0 200a47c: 80 a7 40 13 cmp %i5, %l3 200a480: 18 bf ff 2c bgu 200a130 <_Heap_Walk+0x204> <== NEVER TAKEN 200a484: 92 10 20 01 mov 1, %o1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200a488: da 27 bf fc st %o5, [ %fp + -4 ] 200a48c: 90 07 60 08 add %i5, 8, %o0 200a490: 7f ff dd b8 call 2001b70 <.urem> 200a494: 92 10 00 14 mov %l4, %o1 ); return false; } if ( 200a498: 80 a2 20 00 cmp %o0, 0 200a49c: 12 80 00 1e bne 200a514 <_Heap_Walk+0x5e8> 200a4a0: 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; 200a4a4: de 07 60 04 ld [ %i5 + 4 ], %o7 200a4a8: 82 10 00 12 mov %l2, %g1 200a4ac: 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; 200a4b0: 9e 03 c0 1d add %o7, %i5, %o7 200a4b4: de 03 e0 04 ld [ %o7 + 4 ], %o7 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200a4b8: 80 8b e0 01 btst 1, %o7 200a4bc: 12 80 00 0e bne 200a4f4 <_Heap_Walk+0x5c8> 200a4c0: a4 10 00 1d mov %i5, %l2 ); return false; } if ( free_block->prev != prev_block ) { 200a4c4: d8 07 60 0c ld [ %i5 + 0xc ], %o4 200a4c8: 80 a3 00 01 cmp %o4, %g1 200a4cc: 22 bf ff e7 be,a 200a468 <_Heap_Walk+0x53c> 200a4d0: fa 07 60 08 ld [ %i5 + 8 ], %i5 (*printer)( 200a4d4: 90 10 00 19 mov %i1, %o0 200a4d8: 92 10 20 01 mov 1, %o1 200a4dc: 15 00 80 71 sethi %hi(0x201c400), %o2 200a4e0: 96 10 00 1d mov %i5, %o3 200a4e4: 9f c5 c0 00 call %l7 200a4e8: 94 12 a1 c8 or %o2, 0x1c8, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a4ec: 10 bf fe d9 b 200a050 <_Heap_Walk+0x124> 200a4f0: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 200a4f4: 90 10 00 19 mov %i1, %o0 200a4f8: 92 10 20 01 mov 1, %o1 200a4fc: 15 00 80 71 sethi %hi(0x201c400), %o2 200a500: 96 10 00 1d mov %i5, %o3 200a504: 9f c5 c0 00 call %l7 200a508: 94 12 a1 a8 or %o2, 0x1a8, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a50c: 10 bf fe d1 b 200a050 <_Heap_Walk+0x124> 200a510: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 200a514: 90 10 00 19 mov %i1, %o0 200a518: 92 10 20 01 mov 1, %o1 200a51c: 15 00 80 71 sethi %hi(0x201c400), %o2 200a520: 96 10 00 1d mov %i5, %o3 200a524: 9f c5 c0 00 call %l7 200a528: 94 12 a1 78 or %o2, 0x178, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a52c: 10 bf fe c9 b 200a050 <_Heap_Walk+0x124> 200a530: 82 10 20 00 clr %g1 =============================================================================== 02008604 <_IO_Initialize_all_drivers>: * * Output Parameters: NONE */ void _IO_Initialize_all_drivers( void ) { 2008604: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 2008608: 39 00 80 75 sethi %hi(0x201d400), %i4 200860c: c2 07 20 f4 ld [ %i4 + 0xf4 ], %g1 ! 201d4f4 <_IO_Number_of_drivers> 2008610: ba 10 20 00 clr %i5 2008614: 80 a0 60 00 cmp %g1, 0 2008618: 02 80 00 0b be 2008644 <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN 200861c: b8 17 20 f4 or %i4, 0xf4, %i4 (void) rtems_io_initialize( major, 0, NULL ); 2008620: 90 10 00 1d mov %i5, %o0 2008624: 92 10 20 00 clr %o1 2008628: 40 00 13 d8 call 200d588 200862c: 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 ++ ) 2008630: c2 07 00 00 ld [ %i4 ], %g1 2008634: ba 07 60 01 inc %i5 2008638: 80 a0 40 1d cmp %g1, %i5 200863c: 18 bf ff fa bgu 2008624 <_IO_Initialize_all_drivers+0x20> 2008640: 90 10 00 1d mov %i5, %o0 2008644: 81 c7 e0 08 ret 2008648: 81 e8 00 00 restore =============================================================================== 02008534 <_IO_Manager_initialization>: * workspace. * */ void _IO_Manager_initialization(void) { 2008534: 9d e3 bf a0 save %sp, -96, %sp uint32_t index; rtems_driver_address_table *driver_table; uint32_t drivers_in_table; uint32_t number_of_drivers; driver_table = Configuration.Device_driver_table; 2008538: 03 00 80 71 sethi %hi(0x201c400), %g1 200853c: 82 10 60 cc or %g1, 0xcc, %g1 ! 201c4cc drivers_in_table = Configuration.number_of_device_drivers; 2008540: f8 00 60 3c ld [ %g1 + 0x3c ], %i4 number_of_drivers = Configuration.maximum_drivers; 2008544: f6 00 60 38 ld [ %g1 + 0x38 ], %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 ) 2008548: 80 a7 00 1b cmp %i4, %i3 200854c: 0a 80 00 08 bcs 200856c <_IO_Manager_initialization+0x38> 2008550: fa 00 60 40 ld [ %g1 + 0x40 ], %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; 2008554: 03 00 80 75 sethi %hi(0x201d400), %g1 2008558: fa 20 60 f8 st %i5, [ %g1 + 0xf8 ] ! 201d4f8 <_IO_Driver_address_table> _IO_Number_of_drivers = number_of_drivers; 200855c: 03 00 80 75 sethi %hi(0x201d400), %g1 2008560: f8 20 60 f4 st %i4, [ %g1 + 0xf4 ] ! 201d4f4 <_IO_Number_of_drivers> return; 2008564: 81 c7 e0 08 ret 2008568: 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 ) 200856c: 83 2e e0 03 sll %i3, 3, %g1 2008570: b5 2e e0 05 sll %i3, 5, %i2 2008574: 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( 2008578: 40 00 0d 28 call 200ba18 <_Workspace_Allocate_or_fatal_error> 200857c: 90 10 00 1a mov %i2, %o0 sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 2008580: 03 00 80 75 sethi %hi(0x201d400), %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 *) 2008584: 33 00 80 75 sethi %hi(0x201d400), %i1 _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 2008588: f6 20 60 f4 st %i3, [ %g1 + 0xf4 ] /* * 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 *) 200858c: d0 26 60 f8 st %o0, [ %i1 + 0xf8 ] _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; memset( 2008590: 92 10 20 00 clr %o1 2008594: 40 00 1f 78 call 2010374 2008598: 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++ ) 200859c: 80 a7 20 00 cmp %i4, 0 20085a0: 02 bf ff f1 be 2008564 <_IO_Manager_initialization+0x30> <== NEVER TAKEN 20085a4: c8 06 60 f8 ld [ %i1 + 0xf8 ], %g4 * registration. The driver table is now allocated in the * workspace. * */ void _IO_Manager_initialization(void) 20085a8: 85 2f 20 03 sll %i4, 3, %g2 20085ac: b7 2f 20 05 sll %i4, 5, %i3 20085b0: 82 10 20 00 clr %g1 20085b4: 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]; 20085b8: c4 07 40 01 ld [ %i5 + %g1 ], %g2 20085bc: 86 07 40 01 add %i5, %g1, %g3 20085c0: c4 21 00 01 st %g2, [ %g4 + %g1 ] 20085c4: f8 00 e0 04 ld [ %g3 + 4 ], %i4 20085c8: 84 01 00 01 add %g4, %g1, %g2 20085cc: f8 20 a0 04 st %i4, [ %g2 + 4 ] 20085d0: f8 00 e0 08 ld [ %g3 + 8 ], %i4 20085d4: 82 00 60 18 add %g1, 0x18, %g1 20085d8: f8 20 a0 08 st %i4, [ %g2 + 8 ] 20085dc: 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++ ) 20085e0: 80 a0 40 1b cmp %g1, %i3 _IO_Driver_address_table[index] = driver_table[index]; 20085e4: f8 20 a0 0c st %i4, [ %g2 + 0xc ] 20085e8: f8 00 e0 10 ld [ %g3 + 0x10 ], %i4 20085ec: f8 20 a0 10 st %i4, [ %g2 + 0x10 ] 20085f0: 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++ ) 20085f4: 12 bf ff f1 bne 20085b8 <_IO_Manager_initialization+0x84> 20085f8: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] 20085fc: 81 c7 e0 08 ret 2008600: 81 e8 00 00 restore =============================================================================== 02009340 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2009340: 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 ) 2009344: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 2009348: 80 a0 60 00 cmp %g1, 0 200934c: 02 80 00 26 be 20093e4 <_Objects_Allocate+0xa4> <== NEVER TAKEN 2009350: 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 ); 2009354: b8 06 20 20 add %i0, 0x20, %i4 2009358: 7f ff fd 4b call 2008884 <_Chain_Get> 200935c: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 2009360: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 2009364: 80 a0 60 00 cmp %g1, 0 2009368: 02 80 00 16 be 20093c0 <_Objects_Allocate+0x80> 200936c: 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 ) { 2009370: 80 a2 20 00 cmp %o0, 0 2009374: 02 80 00 15 be 20093c8 <_Objects_Allocate+0x88> 2009378: 01 00 00 00 nop } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 200937c: c4 07 60 08 ld [ %i5 + 8 ], %g2 2009380: d0 06 20 08 ld [ %i0 + 8 ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 2009384: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2009388: 03 00 00 3f sethi %hi(0xfc00), %g1 200938c: 82 10 63 ff or %g1, 0x3ff, %g1 ! ffff 2009390: 90 0a 00 01 and %o0, %g1, %o0 2009394: 82 08 80 01 and %g2, %g1, %g1 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 2009398: 40 00 3c f1 call 201875c <.udiv> 200939c: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 20093a0: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 20093a4: 91 2a 20 02 sll %o0, 2, %o0 20093a8: c6 00 40 08 ld [ %g1 + %o0 ], %g3 information->inactive--; 20093ac: 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 ]--; 20093b0: 86 00 ff ff add %g3, -1, %g3 20093b4: c6 20 40 08 st %g3, [ %g1 + %o0 ] information->inactive--; 20093b8: 82 00 bf ff add %g2, -1, %g1 20093bc: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 20093c0: 81 c7 e0 08 ret 20093c4: 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 ); 20093c8: 40 00 00 10 call 2009408 <_Objects_Extend_information> 20093cc: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 20093d0: 7f ff fd 2d call 2008884 <_Chain_Get> 20093d4: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 20093d8: b0 92 20 00 orcc %o0, 0, %i0 20093dc: 32 bf ff e9 bne,a 2009380 <_Objects_Allocate+0x40> 20093e0: 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; 20093e4: 81 c7 e0 08 ret 20093e8: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 02009408 <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 2009408: 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 ) 200940c: f4 06 20 34 ld [ %i0 + 0x34 ], %i2 /* * 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 ); 2009410: e2 16 20 0a lduh [ %i0 + 0xa ], %l1 index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 2009414: 80 a6 a0 00 cmp %i2, 0 2009418: 02 80 00 a5 be 20096ac <_Objects_Extend_information+0x2a4> 200941c: e0 16 20 10 lduh [ %i0 + 0x10 ], %l0 block_count = 0; else { block_count = information->maximum / information->allocation_size; 2009420: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3 2009424: a1 2c 20 10 sll %l0, 0x10, %l0 2009428: 92 10 00 1b mov %i3, %o1 200942c: 40 00 3c cc call 201875c <.udiv> 2009430: 91 34 20 10 srl %l0, 0x10, %o0 2009434: 91 2a 20 10 sll %o0, 0x10, %o0 2009438: b3 32 20 10 srl %o0, 0x10, %i1 for ( ; block < block_count; block++ ) { 200943c: 80 a6 60 00 cmp %i1, 0 2009440: 02 80 00 a2 be 20096c8 <_Objects_Extend_information+0x2c0><== NEVER TAKEN 2009444: 90 10 00 1b mov %i3, %o0 if ( information->object_blocks[ block ] == NULL ) { 2009448: c2 06 80 00 ld [ %i2 ], %g1 200944c: 80 a0 60 00 cmp %g1, 0 2009450: 02 80 00 a2 be 20096d8 <_Objects_Extend_information+0x2d0><== NEVER TAKEN 2009454: b8 10 00 11 mov %l1, %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; 2009458: 10 80 00 06 b 2009470 <_Objects_Extend_information+0x68> 200945c: 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 ) { 2009460: c2 06 80 01 ld [ %i2 + %g1 ], %g1 2009464: 80 a0 60 00 cmp %g1, 0 2009468: 22 80 00 08 be,a 2009488 <_Objects_Extend_information+0x80> 200946c: 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++ ) { 2009470: ba 07 60 01 inc %i5 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 2009474: 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++ ) { 2009478: 80 a6 40 1d cmp %i1, %i5 200947c: 18 bf ff f9 bgu 2009460 <_Objects_Extend_information+0x58> 2009480: 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; 2009484: b6 10 20 01 mov 1, %i3 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2009488: a1 34 20 10 srl %l0, 0x10, %l0 /* * 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 ) { 200948c: 03 00 00 3f sethi %hi(0xfc00), %g1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2009490: a0 04 00 08 add %l0, %o0, %l0 /* * 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 ) { 2009494: 82 10 63 ff or %g1, 0x3ff, %g1 2009498: 80 a4 00 01 cmp %l0, %g1 200949c: 18 80 00 94 bgu 20096ec <_Objects_Extend_information+0x2e4> 20094a0: 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; 20094a4: 40 00 3c 74 call 2018674 <.umul> 20094a8: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 20094ac: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 20094b0: 80 a0 60 00 cmp %g1, 0 20094b4: 02 80 00 6a be 200965c <_Objects_Extend_information+0x254> 20094b8: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 20094bc: 40 00 09 49 call 200b9e0 <_Workspace_Allocate> 20094c0: 01 00 00 00 nop if ( !new_object_block ) 20094c4: b4 92 20 00 orcc %o0, 0, %i2 20094c8: 02 80 00 89 be 20096ec <_Objects_Extend_information+0x2e4> 20094cc: 01 00 00 00 nop } /* * Do we need to grow the tables? */ if ( do_extend ) { 20094d0: 80 8e e0 ff btst 0xff, %i3 20094d4: 22 80 00 3f be,a 20095d0 <_Objects_Extend_information+0x1c8> 20094d8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 */ /* * Up the block count and maximum */ block_count++; 20094dc: b6 06 60 01 add %i1, 1, %i3 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 20094e0: 91 2e e0 01 sll %i3, 1, %o0 20094e4: 90 02 00 1b add %o0, %i3, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); 20094e8: 90 04 00 08 add %l0, %o0, %o0 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 20094ec: 90 02 00 11 add %o0, %l1, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 20094f0: 40 00 09 3c call 200b9e0 <_Workspace_Allocate> 20094f4: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { 20094f8: a4 92 20 00 orcc %o0, 0, %l2 20094fc: 02 80 00 7a be 20096e4 <_Objects_Extend_information+0x2dc> 2009500: 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 ) { 2009504: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2009508: 80 a4 40 01 cmp %l1, %g1 200950c: a6 04 80 1b add %l2, %i3, %l3 2009510: 0a 80 00 57 bcs 200966c <_Objects_Extend_information+0x264> 2009514: b6 04 c0 1b add %l3, %i3, %i3 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 2009518: 85 2c 60 02 sll %l1, 2, %g2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 200951c: 80 a4 60 00 cmp %l1, 0 2009520: 02 80 00 07 be 200953c <_Objects_Extend_information+0x134><== NEVER TAKEN 2009524: 82 10 20 00 clr %g1 local_table[ index ] = NULL; 2009528: c0 20 40 1b clr [ %g1 + %i3 ] 200952c: 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++ ) { 2009530: 80 a0 40 02 cmp %g1, %g2 2009534: 32 bf ff fe bne,a 200952c <_Objects_Extend_information+0x124><== NEVER TAKEN 2009538: c0 20 40 1b clr [ %g1 + %i3 ] <== NOT EXECUTED 200953c: b3 2e 60 02 sll %i1, 2, %i1 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2009540: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 2009544: c0 24 80 19 clr [ %l2 + %i1 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2009548: 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 ; 200954c: 80 a7 00 01 cmp %i4, %g1 2009550: 1a 80 00 0b bcc 200957c <_Objects_Extend_information+0x174><== NEVER TAKEN 2009554: c0 24 c0 19 clr [ %l3 + %i1 ] * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 2009558: 85 2f 20 02 sll %i4, 2, %g2 200955c: 87 28 e0 02 sll %g3, 2, %g3 2009560: 84 06 c0 02 add %i3, %g2, %g2 2009564: 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; 2009568: c0 20 80 01 clr [ %g2 + %g1 ] 200956c: 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 ; 2009570: 80 a0 40 03 cmp %g1, %g3 2009574: 32 bf ff fe bne,a 200956c <_Objects_Extend_information+0x164> 2009578: c0 20 80 01 clr [ %g2 + %g1 ] index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 200957c: 7f ff e4 7a call 2002764 2009580: 01 00 00 00 nop uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2009584: 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( 2009588: c4 16 20 04 lduh [ %i0 + 4 ], %g2 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 200958c: f2 06 20 34 ld [ %i0 + 0x34 ], %i1 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; 2009590: e0 36 20 10 sth %l0, [ %i0 + 0x10 ] 2009594: 87 28 e0 18 sll %g3, 0x18, %g3 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2009598: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 200959c: e4 26 20 34 st %l2, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; 20095a0: e6 26 20 30 st %l3, [ %i0 + 0x30 ] information->local_table = local_table; 20095a4: 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) | 20095a8: 03 00 00 40 sethi %hi(0x10000), %g1 20095ac: 82 10 c0 01 or %g3, %g1, %g1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 20095b0: 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) | 20095b4: a0 10 40 10 or %g1, %l0, %l0 information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 20095b8: e0 26 20 0c st %l0, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 20095bc: 7f ff e4 6e call 2002774 20095c0: 01 00 00 00 nop _Workspace_Free( old_tables ); 20095c4: 40 00 09 0f call 200ba00 <_Workspace_Free> 20095c8: 90 10 00 19 mov %i1, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 20095cc: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 20095d0: bb 2f 60 02 sll %i5, 2, %i5 20095d4: f4 20 40 1d st %i2, [ %g1 + %i5 ] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 20095d8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 20095dc: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 20095e0: d2 00 40 1d ld [ %g1 + %i5 ], %o1 20095e4: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 20095e8: 90 07 bf f4 add %fp, -12, %o0 20095ec: 7f ff fc b6 call 20088c4 <_Chain_Initialize> 20095f0: 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 ) { 20095f4: 10 80 00 0d b 2009628 <_Objects_Extend_information+0x220> 20095f8: b6 06 20 20 add %i0, 0x20, %i3 the_object->id = _Objects_Build_id( 20095fc: c6 16 20 04 lduh [ %i0 + 4 ], %g3 2009600: 85 28 a0 18 sll %g2, 0x18, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2009604: 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) | 2009608: 84 10 80 1a or %g2, %i2, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 200960c: 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) | 2009610: 84 10 80 1c or %g2, %i4, %g2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2009614: 90 10 00 1b mov %i3, %o0 2009618: 92 10 00 01 mov %g1, %o1 index++; 200961c: b8 07 20 01 inc %i4 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2009620: 7f ff fc 8e call 2008858 <_Chain_Append> 2009624: 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 ) { 2009628: 7f ff fc 97 call 2008884 <_Chain_Get> 200962c: 90 07 bf f4 add %fp, -12, %o0 2009630: 82 92 20 00 orcc %o0, 0, %g1 2009634: 32 bf ff f2 bne,a 20095fc <_Objects_Extend_information+0x1f4> 2009638: c4 06 00 00 ld [ %i0 ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 200963c: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 2009640: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 2009644: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 2009648: c8 20 c0 1d st %g4, [ %g3 + %i5 ] information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 200964c: 82 00 80 04 add %g2, %g4, %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 2009650: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 2009654: 81 c7 e0 08 ret 2009658: 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 ); 200965c: 40 00 08 ef call 200ba18 <_Workspace_Allocate_or_fatal_error> 2009660: 01 00 00 00 nop 2009664: 10 bf ff 9b b 20094d0 <_Objects_Extend_information+0xc8> 2009668: b4 10 00 08 mov %o0, %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, 200966c: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 2009670: b3 2e 60 02 sll %i1, 2, %i1 /* * 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, 2009674: 40 00 1b 03 call 2010280 2009678: 94 10 00 19 mov %i1, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 200967c: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 2009680: 94 10 00 19 mov %i1, %o2 2009684: 40 00 1a ff call 2010280 2009688: 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 *) ); 200968c: 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, 2009690: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 2009694: 94 02 80 11 add %o2, %l1, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 2009698: 90 10 00 1b mov %i3, %o0 200969c: 40 00 1a f9 call 2010280 20096a0: 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 ); 20096a4: 10 bf ff a8 b 2009544 <_Objects_Extend_information+0x13c> 20096a8: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 20096ac: 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 ); 20096b0: b8 10 00 11 mov %l1, %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; 20096b4: b6 10 20 01 mov 1, %i3 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 20096b8: ba 10 20 00 clr %i5 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 20096bc: b2 10 20 00 clr %i1 20096c0: 10 bf ff 72 b 2009488 <_Objects_Extend_information+0x80> 20096c4: a1 2c 20 10 sll %l0, 0x10, %l0 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 20096c8: b8 10 00 11 mov %l1, %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; 20096cc: b6 10 20 01 mov 1, %i3 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 20096d0: 10 bf ff 6e b 2009488 <_Objects_Extend_information+0x80> <== NOT EXECUTED 20096d4: ba 10 20 00 clr %i5 <== NOT EXECUTED else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { do_extend = false; 20096d8: 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; 20096dc: 10 bf ff 6b b 2009488 <_Objects_Extend_information+0x80> <== NOT EXECUTED 20096e0: ba 10 20 00 clr %i5 <== NOT EXECUTED (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); if ( !object_blocks ) { _Workspace_Free( new_object_block ); 20096e4: 40 00 08 c7 call 200ba00 <_Workspace_Free> 20096e8: 90 10 00 1a mov %i2, %o0 20096ec: 81 c7 e0 08 ret 20096f0: 81 e8 00 00 restore =============================================================================== 020097a4 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 20097a4: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 20097a8: 80 a6 60 00 cmp %i1, 0 20097ac: 02 80 00 19 be 2009810 <_Objects_Get_information+0x6c> 20097b0: 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 ); 20097b4: 40 00 11 67 call 200dd50 <_Objects_API_maximum_class> 20097b8: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 20097bc: 80 a2 20 00 cmp %o0, 0 20097c0: 02 80 00 14 be 2009810 <_Objects_Get_information+0x6c> 20097c4: 80 a2 00 19 cmp %o0, %i1 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 20097c8: 0a 80 00 12 bcs 2009810 <_Objects_Get_information+0x6c> 20097cc: 03 00 80 74 sethi %hi(0x201d000), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 20097d0: b1 2e 20 02 sll %i0, 2, %i0 20097d4: 82 10 61 94 or %g1, 0x194, %g1 20097d8: c2 00 40 18 ld [ %g1 + %i0 ], %g1 20097dc: 80 a0 60 00 cmp %g1, 0 20097e0: 02 80 00 0c be 2009810 <_Objects_Get_information+0x6c> <== NEVER TAKEN 20097e4: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 20097e8: f0 00 40 19 ld [ %g1 + %i1 ], %i0 if ( !info ) 20097ec: 80 a6 20 00 cmp %i0, 0 20097f0: 02 80 00 08 be 2009810 <_Objects_Get_information+0x6c> <== NEVER TAKEN 20097f4: 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 ) 20097f8: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 20097fc: 80 a0 60 00 cmp %g1, 0 2009800: 02 80 00 04 be 2009810 <_Objects_Get_information+0x6c> 2009804: 01 00 00 00 nop return NULL; #endif return info; } 2009808: 81 c7 e0 08 ret 200980c: 81 e8 00 00 restore { Objects_Information *info; int the_class_api_maximum; if ( !the_class ) return NULL; 2009810: 81 c7 e0 08 ret 2009814: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 020175e0 <_Objects_Get_name_as_string>: char *_Objects_Get_name_as_string( Objects_Id id, size_t length, char *name ) { 20175e0: 9d e3 bf 90 save %sp, -112, %sp char lname[5]; Objects_Control *the_object; Objects_Locations location; Objects_Id tmpId; if ( length == 0 ) 20175e4: 80 a6 60 00 cmp %i1, 0 20175e8: 02 80 00 3d be 20176dc <_Objects_Get_name_as_string+0xfc> 20175ec: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( name == NULL ) 20175f0: 02 80 00 3b be 20176dc <_Objects_Get_name_as_string+0xfc> 20175f4: ba 96 20 00 orcc %i0, 0, %i5 return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 20175f8: 02 80 00 36 be 20176d0 <_Objects_Get_name_as_string+0xf0> 20175fc: 03 00 80 c0 sethi %hi(0x2030000), %g1 information = _Objects_Get_information_id( tmpId ); 2017600: 7f ff e2 2e call 200feb8 <_Objects_Get_information_id> 2017604: 90 10 00 1d mov %i5, %o0 if ( !information ) 2017608: 80 a2 20 00 cmp %o0, 0 201760c: 02 80 00 34 be 20176dc <_Objects_Get_name_as_string+0xfc> 2017610: 92 10 00 1d mov %i5, %o1 return NULL; the_object = _Objects_Get( information, tmpId, &location ); 2017614: 7f ff e2 69 call 200ffb8 <_Objects_Get> 2017618: 94 07 bf f4 add %fp, -12, %o2 switch ( location ) { 201761c: c2 07 bf f4 ld [ %fp + -12 ], %g1 2017620: 80 a0 60 00 cmp %g1, 0 2017624: 32 80 00 2f bne,a 20176e0 <_Objects_Get_name_as_string+0x100> 2017628: b4 10 20 00 clr %i2 if ( information->is_string ) { s = the_object->name.name_p; } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; 201762c: c2 02 20 0c ld [ %o0 + 0xc ], %g1 lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; lname[ 4 ] = '\0'; 2017630: 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; 2017634: 87 30 60 18 srl %g1, 0x18, %g3 lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; 2017638: 85 30 60 08 srl %g1, 8, %g2 #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; 201763c: 89 30 60 10 srl %g1, 0x10, %g4 lname[ 2 ] = (u32_name >> 8) & 0xff; 2017640: c4 2f bf fa stb %g2, [ %fp + -6 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 2017644: c6 2f bf f8 stb %g3, [ %fp + -8 ] lname[ 1 ] = (u32_name >> 16) & 0xff; 2017648: c8 2f bf f9 stb %g4, [ %fp + -7 ] lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; 201764c: c2 2f bf fb stb %g1, [ %fp + -5 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2017650: b2 86 7f ff addcc %i1, -1, %i1 2017654: 02 80 00 25 be 20176e8 <_Objects_Get_name_as_string+0x108><== NEVER TAKEN 2017658: 84 10 00 03 mov %g3, %g2 201765c: 80 a0 e0 00 cmp %g3, 0 2017660: 02 80 00 17 be 20176bc <_Objects_Get_name_as_string+0xdc> 2017664: 86 10 00 1a mov %i2, %g3 2017668: 39 00 80 bc sethi %hi(0x202f000), %i4 201766c: 82 10 20 00 clr %g1 2017670: 10 80 00 06 b 2017688 <_Objects_Get_name_as_string+0xa8> 2017674: b8 17 20 40 or %i4, 0x40, %i4 2017678: fa 49 00 01 ldsb [ %g4 + %g1 ], %i5 201767c: 80 a7 60 00 cmp %i5, 0 2017680: 02 80 00 0f be 20176bc <_Objects_Get_name_as_string+0xdc> 2017684: c4 08 40 04 ldub [ %g1 + %g4 ], %g2 *d = (isprint((unsigned char)*s)) ? *s : '*'; 2017688: fa 07 00 00 ld [ %i4 ], %i5 201768c: 88 08 a0 ff and %g2, 0xff, %g4 2017690: 88 07 40 04 add %i5, %g4, %g4 2017694: fa 49 20 01 ldsb [ %g4 + 1 ], %i5 2017698: 80 8f 60 97 btst 0x97, %i5 201769c: 12 80 00 03 bne 20176a8 <_Objects_Get_name_as_string+0xc8> 20176a0: 88 07 bf f8 add %fp, -8, %g4 20176a4: 84 10 20 2a mov 0x2a, %g2 20176a8: c4 28 c0 00 stb %g2, [ %g3 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 20176ac: 82 00 60 01 inc %g1 20176b0: 80 a0 40 19 cmp %g1, %i1 20176b4: 12 bf ff f1 bne 2017678 <_Objects_Get_name_as_string+0x98> 20176b8: 86 00 e0 01 inc %g3 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; 20176bc: c0 28 c0 00 clrb [ %g3 ] _Thread_Enable_dispatch(); 20176c0: 7f ff e6 62 call 2011048 <_Thread_Enable_dispatch> 20176c4: b0 10 00 1a mov %i2, %i0 return name; } return NULL; /* unreachable path */ } 20176c8: 81 c7 e0 08 ret 20176cc: 81 e8 00 00 restore return NULL; if ( name == NULL ) return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 20176d0: c2 00 63 ec ld [ %g1 + 0x3ec ], %g1 20176d4: 10 bf ff cb b 2017600 <_Objects_Get_name_as_string+0x20> 20176d8: fa 00 60 08 ld [ %g1 + 8 ], %i5 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* not supported */ #endif case OBJECTS_ERROR: return NULL; 20176dc: b4 10 20 00 clr %i2 _Thread_Enable_dispatch(); return name; } return NULL; /* unreachable path */ } 20176e0: 81 c7 e0 08 ret 20176e4: 91 e8 00 1a restore %g0, %i2, %o0 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 20176e8: 10 bf ff f5 b 20176bc <_Objects_Get_name_as_string+0xdc> <== NOT EXECUTED 20176ec: 86 10 00 1a mov %i2, %g3 <== NOT EXECUTED =============================================================================== 02019d80 <_Objects_Get_next>: Objects_Information *information, Objects_Id id, Objects_Locations *location_p, Objects_Id *next_id_p ) { 2019d80: 9d e3 bf a0 save %sp, -96, %sp Objects_Control *object; Objects_Id next_id; if ( !information ) 2019d84: 80 a6 20 00 cmp %i0, 0 2019d88: 02 80 00 29 be 2019e2c <_Objects_Get_next+0xac> 2019d8c: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( !location_p ) 2019d90: 02 80 00 27 be 2019e2c <_Objects_Get_next+0xac> 2019d94: 80 a6 e0 00 cmp %i3, 0 return NULL; if ( !next_id_p ) 2019d98: 02 80 00 25 be 2019e2c <_Objects_Get_next+0xac> 2019d9c: 83 2e 60 10 sll %i1, 0x10, %g1 return NULL; if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX) 2019da0: 80 a0 60 00 cmp %g1, 0 2019da4: 22 80 00 13 be,a 2019df0 <_Objects_Get_next+0x70> 2019da8: 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) 2019dac: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2 2019db0: 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); 2019db4: 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) 2019db8: 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); 2019dbc: 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) 2019dc0: 80 a0 80 01 cmp %g2, %g1 2019dc4: 0a 80 00 13 bcs 2019e10 <_Objects_Get_next+0x90> 2019dc8: 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); 2019dcc: 7f ff d8 7b call 200ffb8 <_Objects_Get> 2019dd0: b2 06 60 01 inc %i1 next_id++; } while (*location_p != OBJECTS_LOCAL); 2019dd4: c2 06 80 00 ld [ %i2 ], %g1 2019dd8: 80 a0 60 00 cmp %g1, 0 2019ddc: 32 bf ff f5 bne,a 2019db0 <_Objects_Get_next+0x30> 2019de0: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2 *next_id_p = next_id; 2019de4: f2 26 c0 00 st %i1, [ %i3 ] return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; } 2019de8: 81 c7 e0 08 ret 2019dec: 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) 2019df0: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2 2019df4: 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); 2019df8: 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) 2019dfc: 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); 2019e00: 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) 2019e04: 80 a0 80 01 cmp %g2, %g1 2019e08: 1a bf ff f1 bcc 2019dcc <_Objects_Get_next+0x4c> <== ALWAYS TAKEN 2019e0c: 94 10 00 1a mov %i2, %o2 { *location_p = OBJECTS_ERROR; 2019e10: 82 10 20 01 mov 1, %g1 2019e14: c2 26 80 00 st %g1, [ %i2 ] *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; 2019e18: 90 10 20 00 clr %o0 *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; 2019e1c: 82 10 3f ff mov -1, %g1 2019e20: c2 26 c0 00 st %g1, [ %i3 ] return 0; } 2019e24: 81 c7 e0 08 ret 2019e28: 91 e8 00 08 restore %g0, %o0, %o0 { Objects_Control *object; Objects_Id next_id; if ( !information ) return NULL; 2019e2c: 10 bf ff ef b 2019de8 <_Objects_Get_next+0x68> 2019e30: 90 10 20 00 clr %o0 =============================================================================== 0201ac70 <_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; 201ac70: c4 02 20 08 ld [ %o0 + 8 ], %g2 if ( information->maximum >= index ) { 201ac74: 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; 201ac78: 92 22 40 02 sub %o1, %g2, %o1 201ac7c: 92 02 60 01 inc %o1 if ( information->maximum >= index ) { 201ac80: 80 a2 40 01 cmp %o1, %g1 201ac84: 18 80 00 09 bgu 201aca8 <_Objects_Get_no_protection+0x38> 201ac88: 93 2a 60 02 sll %o1, 2, %o1 if ( (the_object = information->local_table[ index ]) != NULL ) { 201ac8c: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 201ac90: d0 00 40 09 ld [ %g1 + %o1 ], %o0 201ac94: 80 a2 20 00 cmp %o0, 0 201ac98: 02 80 00 05 be 201acac <_Objects_Get_no_protection+0x3c> <== NEVER TAKEN 201ac9c: 82 10 20 01 mov 1, %g1 *location = OBJECTS_LOCAL; return the_object; 201aca0: 81 c3 e0 08 retl 201aca4: 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; 201aca8: 82 10 20 01 mov 1, %g1 return NULL; 201acac: 90 10 20 00 clr %o0 } 201acb0: 81 c3 e0 08 retl 201acb4: c2 22 80 00 st %g1, [ %o2 ] =============================================================================== 02010030 <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 2010030: 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; 2010034: 80 a6 20 00 cmp %i0, 0 2010038: 12 80 00 06 bne 2010050 <_Objects_Id_to_name+0x20> 201003c: 83 36 20 18 srl %i0, 0x18, %g1 2010040: 03 00 80 c0 sethi %hi(0x2030000), %g1 2010044: c2 00 63 ec ld [ %g1 + 0x3ec ], %g1 ! 20303ec <_Per_CPU_Information+0xc> 2010048: f0 00 60 08 ld [ %g1 + 8 ], %i0 201004c: 83 36 20 18 srl %i0, 0x18, %g1 2010050: 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 ) 2010054: 84 00 7f ff add %g1, -1, %g2 2010058: 80 a0 a0 02 cmp %g2, 2 201005c: 18 80 00 18 bgu 20100bc <_Objects_Id_to_name+0x8c> 2010060: 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 ] ) 2010064: 05 00 80 c0 sethi %hi(0x2030000), %g2 2010068: 84 10 a0 e4 or %g2, 0xe4, %g2 ! 20300e4 <_Objects_Information_table> 201006c: c2 00 80 01 ld [ %g2 + %g1 ], %g1 2010070: 80 a0 60 00 cmp %g1, 0 2010074: 02 80 00 12 be 20100bc <_Objects_Id_to_name+0x8c> 2010078: 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 ]; 201007c: 85 28 a0 02 sll %g2, 2, %g2 2010080: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 2010084: 80 a2 20 00 cmp %o0, 0 2010088: 02 80 00 0d be 20100bc <_Objects_Id_to_name+0x8c> <== NEVER TAKEN 201008c: 92 10 00 18 mov %i0, %o1 #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) return OBJECTS_INVALID_ID; #endif the_object = _Objects_Get( information, tmpId, &ignored_location ); 2010090: 7f ff ff ca call 200ffb8 <_Objects_Get> 2010094: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 2010098: 80 a2 20 00 cmp %o0, 0 201009c: 02 80 00 08 be 20100bc <_Objects_Id_to_name+0x8c> 20100a0: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 20100a4: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 20100a8: 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(); 20100ac: 40 00 03 e7 call 2011048 <_Thread_Enable_dispatch> 20100b0: c2 26 40 00 st %g1, [ %i1 ] 20100b4: 81 c7 e0 08 ret 20100b8: 81 e8 00 00 restore tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; 20100bc: 81 c7 e0 08 ret 20100c0: 91 e8 20 03 restore %g0, 3, %o0 =============================================================================== 02009a94 <_Objects_Shrink_information>: */ void _Objects_Shrink_information( Objects_Information *information ) { 2009a94: 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 ); 2009a98: f8 16 20 0a lduh [ %i0 + 0xa ], %i4 block_count = (information->maximum - index_base) / 2009a9c: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3 2009aa0: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 2009aa4: 92 10 00 1b mov %i3, %o1 2009aa8: 40 00 3b 2d call 201875c <.udiv> 2009aac: 90 22 00 1c sub %o0, %i4, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2009ab0: 80 a2 20 00 cmp %o0, 0 2009ab4: 02 80 00 36 be 2009b8c <_Objects_Shrink_information+0xf8> <== NEVER TAKEN 2009ab8: 01 00 00 00 nop if ( information->inactive_per_block[ block ] == 2009abc: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 2009ac0: c2 01 00 00 ld [ %g4 ], %g1 2009ac4: 80 a6 c0 01 cmp %i3, %g1 2009ac8: 02 80 00 0f be 2009b04 <_Objects_Shrink_information+0x70> <== NEVER TAKEN 2009acc: 82 10 20 00 clr %g1 2009ad0: 10 80 00 07 b 2009aec <_Objects_Shrink_information+0x58> 2009ad4: ba 10 20 04 mov 4, %i5 2009ad8: c4 01 00 1d ld [ %g4 + %i5 ], %g2 2009adc: 80 a6 c0 02 cmp %i3, %g2 2009ae0: 02 80 00 0a be 2009b08 <_Objects_Shrink_information+0x74> 2009ae4: 86 07 60 04 add %i5, 4, %g3 2009ae8: 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++ ) { 2009aec: 82 00 60 01 inc %g1 2009af0: 80 a0 40 08 cmp %g1, %o0 2009af4: 12 bf ff f9 bne 2009ad8 <_Objects_Shrink_information+0x44> 2009af8: b8 07 00 1b add %i4, %i3, %i4 2009afc: 81 c7 e0 08 ret 2009b00: 81 e8 00 00 restore if ( information->inactive_per_block[ block ] == 2009b04: 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 ); 2009b08: 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; 2009b0c: d0 06 20 20 ld [ %i0 + 0x20 ], %o0 2009b10: 10 80 00 05 b 2009b24 <_Objects_Shrink_information+0x90> 2009b14: 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 ); 2009b18: 90 96 e0 00 orcc %i3, 0, %o0 2009b1c: 22 80 00 12 be,a 2009b64 <_Objects_Shrink_information+0xd0> 2009b20: 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 ); 2009b24: c2 02 20 08 ld [ %o0 + 8 ], %g1 2009b28: 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) && 2009b2c: 80 a0 40 1c cmp %g1, %i4 2009b30: 0a bf ff fa bcs 2009b18 <_Objects_Shrink_information+0x84> 2009b34: f6 02 00 00 ld [ %o0 ], %i3 (index < (index_base + information->allocation_size))) { 2009b38: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 2009b3c: 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) && 2009b40: 80 a0 40 02 cmp %g1, %g2 2009b44: 3a bf ff f6 bcc,a 2009b1c <_Objects_Shrink_information+0x88> 2009b48: 90 96 e0 00 orcc %i3, 0, %o0 (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 2009b4c: 40 00 0e a6 call 200d5e4 <_Chain_Extract> 2009b50: 01 00 00 00 nop } } while ( the_object ); 2009b54: 90 96 e0 00 orcc %i3, 0, %o0 2009b58: 32 bf ff f4 bne,a 2009b28 <_Objects_Shrink_information+0x94><== ALWAYS TAKEN 2009b5c: 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 ] ); 2009b60: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 2009b64: 40 00 07 a7 call 200ba00 <_Workspace_Free> 2009b68: d0 00 40 1d ld [ %g1 + %i5 ], %o0 information->object_blocks[ block ] = NULL; 2009b6c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 2009b70: 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; 2009b74: c0 20 40 1d clr [ %g1 + %i5 ] information->inactive_per_block[ block ] = 0; 2009b78: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive -= information->allocation_size; 2009b7c: 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; 2009b80: c0 20 c0 1d clr [ %g3 + %i5 ] information->inactive -= information->allocation_size; 2009b84: 82 20 80 01 sub %g2, %g1, %g1 2009b88: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] return; 2009b8c: 81 c7 e0 08 ret 2009b90: 81 e8 00 00 restore =============================================================================== 0200aad8 <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 200aad8: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if (!the_node) return; 200aadc: 80 a6 60 00 cmp %i1, 0 200aae0: 02 80 00 4c be 200ac10 <_RBTree_Extract_unprotected+0x138> 200aae4: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 200aae8: c2 06 20 08 ld [ %i0 + 8 ], %g1 200aaec: 80 a0 40 19 cmp %g1, %i1 200aaf0: 02 80 00 56 be 200ac48 <_RBTree_Extract_unprotected+0x170> 200aaf4: 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]) { 200aaf8: c2 06 20 0c ld [ %i0 + 0xc ], %g1 200aafc: 80 a0 40 19 cmp %g1, %i1 200ab00: 02 80 00 56 be 200ac58 <_RBTree_Extract_unprotected+0x180> 200ab04: 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]) { 200ab08: fa 06 60 04 ld [ %i1 + 4 ], %i5 200ab0c: 80 a7 60 00 cmp %i5, 0 200ab10: 22 80 00 5a be,a 200ac78 <_RBTree_Extract_unprotected+0x1a0> 200ab14: f8 06 60 08 ld [ %i1 + 8 ], %i4 200ab18: c2 06 60 08 ld [ %i1 + 8 ], %g1 200ab1c: 80 a0 60 00 cmp %g1, 0 200ab20: 32 80 00 05 bne,a 200ab34 <_RBTree_Extract_unprotected+0x5c> 200ab24: c2 07 60 08 ld [ %i5 + 8 ], %g1 200ab28: 10 80 00 3c b 200ac18 <_RBTree_Extract_unprotected+0x140> 200ab2c: 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]; 200ab30: c2 07 60 08 ld [ %i5 + 8 ], %g1 200ab34: 80 a0 60 00 cmp %g1, 0 200ab38: 32 bf ff fe bne,a 200ab30 <_RBTree_Extract_unprotected+0x58> 200ab3c: 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]; 200ab40: f8 07 60 04 ld [ %i5 + 4 ], %i4 if(leaf) { 200ab44: 80 a7 20 00 cmp %i4, 0 200ab48: 02 80 00 48 be 200ac68 <_RBTree_Extract_unprotected+0x190> 200ab4c: 01 00 00 00 nop leaf->parent = target->parent; 200ab50: c2 07 40 00 ld [ %i5 ], %g1 200ab54: 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]; 200ab58: 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]; 200ab5c: 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]; 200ab60: 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; 200ab64: c6 07 60 0c ld [ %i5 + 0xc ], %g3 dir = target != target->parent->child[0]; 200ab68: 88 1f 40 04 xor %i5, %g4, %g4 200ab6c: 80 a0 00 04 cmp %g0, %g4 200ab70: 88 40 20 00 addx %g0, 0, %g4 target->parent->child[dir] = leaf; 200ab74: 89 29 20 02 sll %g4, 2, %g4 200ab78: 84 00 80 04 add %g2, %g4, %g2 200ab7c: f8 20 a0 04 st %i4, [ %g2 + 4 ] /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 200ab80: c4 00 60 04 ld [ %g1 + 4 ], %g2 200ab84: 84 18 80 19 xor %g2, %i1, %g2 200ab88: 80 a0 00 02 cmp %g0, %g2 200ab8c: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = target; 200ab90: 85 28 a0 02 sll %g2, 2, %g2 200ab94: 82 00 40 02 add %g1, %g2, %g1 200ab98: 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]; 200ab9c: c2 06 60 08 ld [ %i1 + 8 ], %g1 200aba0: c2 27 60 08 st %g1, [ %i5 + 8 ] if (the_node->child[RBT_RIGHT]) 200aba4: c2 06 60 08 ld [ %i1 + 8 ], %g1 200aba8: 80 a0 60 00 cmp %g1, 0 200abac: 32 80 00 02 bne,a 200abb4 <_RBTree_Extract_unprotected+0xdc><== ALWAYS TAKEN 200abb0: fa 20 40 00 st %i5, [ %g1 ] the_node->child[RBT_RIGHT]->parent = target; target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 200abb4: c2 06 60 04 ld [ %i1 + 4 ], %g1 200abb8: c2 27 60 04 st %g1, [ %i5 + 4 ] if (the_node->child[RBT_LEFT]) 200abbc: c2 06 60 04 ld [ %i1 + 4 ], %g1 200abc0: 80 a0 60 00 cmp %g1, 0 200abc4: 32 80 00 02 bne,a 200abcc <_RBTree_Extract_unprotected+0xf4> 200abc8: 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; 200abcc: c4 06 40 00 ld [ %i1 ], %g2 target->color = the_node->color; 200abd0: 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; 200abd4: c4 27 40 00 st %g2, [ %i5 ] target->color = the_node->color; 200abd8: 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 */ 200abdc: 80 a0 e0 00 cmp %g3, 0 200abe0: 32 80 00 06 bne,a 200abf8 <_RBTree_Extract_unprotected+0x120> 200abe4: c2 06 20 04 ld [ %i0 + 4 ], %g1 if (leaf) { 200abe8: 80 a7 20 00 cmp %i4, 0 200abec: 32 80 00 02 bne,a 200abf4 <_RBTree_Extract_unprotected+0x11c> 200abf0: 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; 200abf4: 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; 200abf8: c0 26 60 08 clr [ %i1 + 8 ] 200abfc: c0 26 60 04 clr [ %i1 + 4 ] 200ac00: 80 a0 60 00 cmp %g1, 0 200ac04: 02 80 00 03 be 200ac10 <_RBTree_Extract_unprotected+0x138> 200ac08: c0 26 40 00 clr [ %i1 ] 200ac0c: c0 20 60 0c clr [ %g1 + 0xc ] 200ac10: 81 c7 e0 08 ret 200ac14: 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; 200ac18: c2 06 40 00 ld [ %i1 ], %g1 200ac1c: 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]; 200ac20: 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; 200ac24: c6 06 60 0c ld [ %i1 + 0xc ], %g3 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 200ac28: c4 00 60 04 ld [ %g1 + 4 ], %g2 200ac2c: 84 18 80 19 xor %g2, %i1, %g2 200ac30: 80 a0 00 02 cmp %g0, %g2 200ac34: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = leaf; 200ac38: 85 28 a0 02 sll %g2, 2, %g2 200ac3c: 82 00 40 02 add %g1, %g2, %g1 200ac40: 10 bf ff e7 b 200abdc <_RBTree_Extract_unprotected+0x104> 200ac44: 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 ); 200ac48: 40 00 00 eb call 200aff4 <_RBTree_Next_unprotected> 200ac4c: 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; 200ac50: 10 bf ff aa b 200aaf8 <_RBTree_Extract_unprotected+0x20> 200ac54: 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 ); 200ac58: 40 00 00 e7 call 200aff4 <_RBTree_Next_unprotected> 200ac5c: 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; 200ac60: 10 bf ff aa b 200ab08 <_RBTree_Extract_unprotected+0x30> 200ac64: 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); 200ac68: 7f ff fe d3 call 200a7b4 <_RBTree_Extract_validate_unprotected> 200ac6c: 90 10 00 1d mov %i5, %o0 } victim_color = target->color; dir = target != target->parent->child[0]; 200ac70: 10 bf ff bb b 200ab5c <_RBTree_Extract_unprotected+0x84> 200ac74: 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 ) { 200ac78: 80 a7 20 00 cmp %i4, 0 200ac7c: 32 bf ff e8 bne,a 200ac1c <_RBTree_Extract_unprotected+0x144> 200ac80: 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); 200ac84: 7f ff fe cc call 200a7b4 <_RBTree_Extract_validate_unprotected> 200ac88: 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]; 200ac8c: 10 bf ff e6 b 200ac24 <_RBTree_Extract_unprotected+0x14c> 200ac90: c2 06 40 00 ld [ %i1 ], %g1 =============================================================================== 0200a7b4 <_RBTree_Extract_validate_unprotected>: ) { RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 200a7b4: c2 02 00 00 ld [ %o0 ], %g1 if(!parent->parent) return; 200a7b8: c4 00 40 00 ld [ %g1 ], %g2 200a7bc: 80 a0 a0 00 cmp %g2, 0 200a7c0: 02 80 00 3f be 200a8bc <_RBTree_Extract_validate_unprotected+0x108> 200a7c4: 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]) 200a7c8: c4 00 60 04 ld [ %g1 + 4 ], %g2 200a7cc: 80 a2 00 02 cmp %o0, %g2 200a7d0: 22 80 00 02 be,a 200a7d8 <_RBTree_Extract_validate_unprotected+0x24> 200a7d4: 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); 200a7d8: c6 02 20 0c ld [ %o0 + 0xc ], %g3 200a7dc: 80 a0 e0 01 cmp %g3, 1 200a7e0: 02 80 00 32 be 200a8a8 <_RBTree_Extract_validate_unprotected+0xf4> 200a7e4: 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) { 200a7e8: c6 00 40 00 ld [ %g1 ], %g3 200a7ec: 80 a0 e0 00 cmp %g3, 0 200a7f0: 02 80 00 2e be 200a8a8 <_RBTree_Extract_validate_unprotected+0xf4> 200a7f4: 80 a0 a0 00 cmp %g2, 0 200a7f8: 22 80 00 07 be,a 200a814 <_RBTree_Extract_validate_unprotected+0x60><== NEVER TAKEN 200a7fc: c6 00 a0 08 ld [ %g2 + 8 ], %g3 <== NOT EXECUTED 200a800: c8 00 a0 0c ld [ %g2 + 0xc ], %g4 200a804: 80 a1 20 01 cmp %g4, 1 200a808: 22 80 00 63 be,a 200a994 <_RBTree_Extract_validate_unprotected+0x1e0> 200a80c: 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]) && 200a810: c6 00 a0 08 ld [ %g2 + 8 ], %g3 200a814: 80 a0 e0 00 cmp %g3, 0 200a818: 22 80 00 07 be,a 200a834 <_RBTree_Extract_validate_unprotected+0x80> 200a81c: c6 00 a0 04 ld [ %g2 + 4 ], %g3 200a820: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 200a824: 80 a0 e0 01 cmp %g3, 1 200a828: 22 80 00 29 be,a 200a8cc <_RBTree_Extract_validate_unprotected+0x118> 200a82c: c6 00 60 04 ld [ %g1 + 4 ], %g3 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 200a830: c6 00 a0 04 ld [ %g2 + 4 ], %g3 200a834: 80 a0 e0 00 cmp %g3, 0 200a838: 22 80 00 07 be,a 200a854 <_RBTree_Extract_validate_unprotected+0xa0> 200a83c: da 20 a0 0c st %o5, [ %g2 + 0xc ] 200a840: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 200a844: 80 a0 e0 01 cmp %g3, 1 200a848: 22 80 00 21 be,a 200a8cc <_RBTree_Extract_validate_unprotected+0x118> 200a84c: c6 00 60 04 ld [ %g1 + 4 ], %g3 sibling->color = RBT_RED; 200a850: da 20 a0 0c st %o5, [ %g2 + 0xc ] 200a854: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200a858: 80 a0 a0 01 cmp %g2, 1 200a85c: 22 80 00 99 be,a 200aac0 <_RBTree_Extract_validate_unprotected+0x30c> 200a860: 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; 200a864: 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; 200a868: 80 a0 e0 00 cmp %g3, 0 200a86c: 02 80 00 6c be 200aa1c <_RBTree_Extract_validate_unprotected+0x268><== NEVER TAKEN 200a870: 90 10 00 01 mov %g1, %o0 if(!(the_node->parent->parent)) return NULL; 200a874: c4 00 c0 00 ld [ %g3 ], %g2 200a878: 80 a0 a0 00 cmp %g2, 0 200a87c: 02 80 00 69 be 200aa20 <_RBTree_Extract_validate_unprotected+0x26c> 200a880: 84 10 20 00 clr %g2 if(the_node == the_node->parent->child[RBT_LEFT]) 200a884: c4 00 e0 04 ld [ %g3 + 4 ], %g2 200a888: 80 a0 40 02 cmp %g1, %g2 200a88c: 22 80 00 0e be,a 200a8c4 <_RBTree_Extract_validate_unprotected+0x110> 200a890: 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; 200a894: 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); 200a898: c6 02 20 0c ld [ %o0 + 0xc ], %g3 200a89c: 80 a0 e0 01 cmp %g3, 1 200a8a0: 32 bf ff d3 bne,a 200a7ec <_RBTree_Extract_validate_unprotected+0x38><== ALWAYS TAKEN 200a8a4: 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; 200a8a8: c2 02 00 00 ld [ %o0 ], %g1 200a8ac: c2 00 40 00 ld [ %g1 ], %g1 200a8b0: 80 a0 60 00 cmp %g1, 0 200a8b4: 02 80 00 5f be 200aa30 <_RBTree_Extract_validate_unprotected+0x27c> 200a8b8: 01 00 00 00 nop 200a8bc: 81 c3 e0 08 retl 200a8c0: 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; 200a8c4: 10 bf ff f5 b 200a898 <_RBTree_Extract_validate_unprotected+0xe4> 200a8c8: 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]; 200a8cc: 86 1a 00 03 xor %o0, %g3, %g3 200a8d0: 80 a0 00 03 cmp %g0, %g3 200a8d4: 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); 200a8d8: 86 1b 60 01 xor %o5, 1, %g3 if (!_RBTree_Is_red(sibling->child[_RBTree_Opposite_direction(dir)])) { 200a8dc: 87 28 e0 02 sll %g3, 2, %g3 200a8e0: 88 00 80 03 add %g2, %g3, %g4 200a8e4: 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); 200a8e8: 80 a1 20 00 cmp %g4, 0 200a8ec: 22 80 00 07 be,a 200a908 <_RBTree_Extract_validate_unprotected+0x154> 200a8f0: 9b 2b 60 02 sll %o5, 2, %o5 200a8f4: d8 01 20 0c ld [ %g4 + 0xc ], %o4 200a8f8: 80 a3 20 01 cmp %o4, 1 200a8fc: 22 80 00 4f be,a 200aa38 <_RBTree_Extract_validate_unprotected+0x284> 200a900: d6 00 60 0c ld [ %g1 + 0xc ], %o3 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; 200a904: 9b 2b 60 02 sll %o5, 2, %o5 200a908: 98 00 80 0d add %g2, %o5, %o4 200a90c: 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; 200a910: 96 10 20 01 mov 1, %o3 200a914: 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; 200a918: 80 a1 20 00 cmp %g4, 0 200a91c: 02 80 00 15 be 200a970 <_RBTree_Extract_validate_unprotected+0x1bc><== NEVER TAKEN 200a920: 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]; 200a924: 96 01 00 03 add %g4, %g3, %o3 200a928: d4 02 e0 04 ld [ %o3 + 4 ], %o2 200a92c: d4 23 20 04 st %o2, [ %o4 + 4 ] if (c->child[dir]) 200a930: d8 02 e0 04 ld [ %o3 + 4 ], %o4 200a934: 80 a3 20 00 cmp %o4, 0 200a938: 32 80 00 02 bne,a 200a940 <_RBTree_Extract_validate_unprotected+0x18c> 200a93c: 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; 200a940: 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; 200a944: 96 01 00 03 add %g4, %g3, %o3 200a948: c4 22 e0 04 st %g2, [ %o3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a94c: d6 03 20 04 ld [ %o4 + 4 ], %o3 c->parent = the_node->parent; 200a950: 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; 200a954: 96 18 80 0b xor %g2, %o3, %o3 c->parent = the_node->parent; the_node->parent = c; 200a958: 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; 200a95c: 80 a0 00 0b cmp %g0, %o3 200a960: 84 40 20 00 addx %g0, 0, %g2 200a964: 85 28 a0 02 sll %g2, 2, %g2 200a968: 98 03 00 02 add %o4, %g2, %o4 200a96c: 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; 200a970: 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)]; 200a974: 84 00 40 03 add %g1, %g3, %g2 200a978: c4 00 a0 04 ld [ %g2 + 4 ], %g2 } sibling->color = parent->color; 200a97c: c8 20 a0 0c st %g4, [ %g2 + 0xc ] 200a980: 88 00 80 03 add %g2, %g3, %g4 200a984: c8 01 20 04 ld [ %g4 + 4 ], %g4 parent->color = RBT_BLACK; 200a988: c0 20 60 0c clr [ %g1 + 0xc ] sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK; 200a98c: 10 80 00 33 b 200aa58 <_RBTree_Extract_validate_unprotected+0x2a4> 200a990: 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; 200a994: c8 20 60 0c st %g4, [ %g1 + 0xc ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 200a998: 88 1b 00 08 xor %o4, %o0, %g4 200a99c: 80 a0 00 04 cmp %g0, %g4 200a9a0: 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); 200a9a4: 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; 200a9a8: 97 2a e0 02 sll %o3, 2, %o3 200a9ac: 98 00 40 0b add %g1, %o3, %o4 200a9b0: c8 03 20 04 ld [ %o4 + 4 ], %g4 200a9b4: 80 a1 20 00 cmp %g4, 0 200a9b8: 02 80 00 1c be 200aa28 <_RBTree_Extract_validate_unprotected+0x274><== NEVER TAKEN 200a9bc: 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]; 200a9c0: 95 2a a0 02 sll %o2, 2, %o2 200a9c4: 84 01 00 0a add %g4, %o2, %g2 200a9c8: d2 00 a0 04 ld [ %g2 + 4 ], %o1 200a9cc: d2 23 20 04 st %o1, [ %o4 + 4 ] if (c->child[dir]) 200a9d0: c4 00 a0 04 ld [ %g2 + 4 ], %g2 200a9d4: 80 a0 a0 00 cmp %g2, 0 200a9d8: 02 80 00 04 be 200a9e8 <_RBTree_Extract_validate_unprotected+0x234><== NEVER TAKEN 200a9dc: 94 01 00 0a add %g4, %o2, %o2 c->child[dir]->parent = the_node; 200a9e0: c2 20 80 00 st %g1, [ %g2 ] 200a9e4: c6 00 40 00 ld [ %g1 ], %g3 c->child[dir] = the_node; 200a9e8: c2 22 a0 04 st %g1, [ %o2 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a9ec: c4 00 e0 04 ld [ %g3 + 4 ], %g2 c->parent = the_node->parent; 200a9f0: 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; 200a9f4: 84 18 40 02 xor %g1, %g2, %g2 200a9f8: 80 a0 00 02 cmp %g0, %g2 200a9fc: 84 40 20 00 addx %g0, 0, %g2 200aa00: 85 28 a0 02 sll %g2, 2, %g2 200aa04: 96 00 40 0b add %g1, %o3, %o3 200aa08: 86 00 c0 02 add %g3, %g2, %g3 c->parent = the_node->parent; the_node->parent = c; 200aa0c: 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; 200aa10: c8 20 e0 04 st %g4, [ %g3 + 4 ] 200aa14: 10 bf ff 7f b 200a810 <_RBTree_Extract_validate_unprotected+0x5c> 200aa18: 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; 200aa1c: 84 10 20 00 clr %g2 <== NOT EXECUTED 200aa20: 10 bf ff 9e b 200a898 <_RBTree_Extract_validate_unprotected+0xe4> 200aa24: 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; 200aa28: 10 bf ff 7a b 200a810 <_RBTree_Extract_validate_unprotected+0x5c><== NOT EXECUTED 200aa2c: 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; 200aa30: 81 c3 e0 08 retl 200aa34: c0 22 20 0c clr [ %o0 + 0xc ] 200aa38: 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; 200aa3c: d6 20 a0 0c st %o3, [ %g2 + 0xc ] parent->color = RBT_BLACK; 200aa40: c0 20 60 0c clr [ %g1 + 0xc ] 200aa44: c4 03 20 04 ld [ %o4 + 4 ], %g2 200aa48: 80 a0 a0 00 cmp %g2, 0 200aa4c: 02 bf ff 97 be 200a8a8 <_RBTree_Extract_validate_unprotected+0xf4><== NEVER TAKEN 200aa50: c0 21 20 0c clr [ %g4 + 0xc ] 200aa54: 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]; 200aa58: 88 00 80 0d add %g2, %o5, %g4 200aa5c: d8 01 20 04 ld [ %g4 + 4 ], %o4 200aa60: 86 00 40 03 add %g1, %g3, %g3 200aa64: d8 20 e0 04 st %o4, [ %g3 + 4 ] if (c->child[dir]) 200aa68: c6 01 20 04 ld [ %g4 + 4 ], %g3 200aa6c: 80 a0 e0 00 cmp %g3, 0 200aa70: 32 80 00 02 bne,a 200aa78 <_RBTree_Extract_validate_unprotected+0x2c4> 200aa74: 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; 200aa78: 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; 200aa7c: 9a 00 80 0d add %g2, %o5, %o5 200aa80: c2 23 60 04 st %g1, [ %o5 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200aa84: c8 00 e0 04 ld [ %g3 + 4 ], %g4 c->parent = the_node->parent; 200aa88: c6 20 80 00 st %g3, [ %g2 ] the_node->parent = c; 200aa8c: 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; 200aa90: 88 18 40 04 xor %g1, %g4, %g4 200aa94: 80 a0 00 04 cmp %g0, %g4 200aa98: 82 40 20 00 addx %g0, 0, %g1 200aa9c: 83 28 60 02 sll %g1, 2, %g1 200aaa0: 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; 200aaa4: c2 02 00 00 ld [ %o0 ], %g1 200aaa8: c4 20 e0 04 st %g2, [ %g3 + 4 ] 200aaac: c2 00 40 00 ld [ %g1 ], %g1 200aab0: 80 a0 60 00 cmp %g1, 0 200aab4: 12 bf ff 82 bne 200a8bc <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN 200aab8: 01 00 00 00 nop 200aabc: 30 bf ff dd b,a 200aa30 <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED 200aac0: c2 02 00 00 ld [ %o0 ], %g1 200aac4: c2 00 40 00 ld [ %g1 ], %g1 200aac8: 80 a0 60 00 cmp %g1, 0 200aacc: 12 bf ff 7c bne 200a8bc <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN 200aad0: 01 00 00 00 nop 200aad4: 30 bf ff d7 b,a 200aa30 <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED =============================================================================== 0200b6cc <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, RBTree_Node *search_node ) { 200b6cc: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 200b6d0: 7f ff e1 c7 call 2003dec 200b6d4: b8 10 00 18 mov %i0, %i4 200b6d8: 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; 200b6dc: fa 06 20 04 ld [ %i0 + 4 ], %i5 RBTree_Node* found = NULL; int compare_result; while (iter_node) { 200b6e0: 80 a7 60 00 cmp %i5, 0 200b6e4: 02 80 00 15 be 200b738 <_RBTree_Find+0x6c> <== NEVER TAKEN 200b6e8: b0 10 20 00 clr %i0 compare_result = the_rbtree->compare_function(the_node, iter_node); 200b6ec: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 200b6f0: 92 10 00 1d mov %i5, %o1 200b6f4: 9f c0 40 00 call %g1 200b6f8: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater( int compare_result ) { return compare_result > 0; 200b6fc: 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 ) ) { 200b700: 80 a2 20 00 cmp %o0, 0 RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater( int compare_result ) { return compare_result > 0; 200b704: 82 20 40 08 sub %g1, %o0, %g1 200b708: 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]; 200b70c: 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 ) ) { 200b710: 12 80 00 06 bne 200b728 <_RBTree_Find+0x5c> 200b714: 82 07 40 01 add %i5, %g1, %g1 found = iter_node; if ( the_rbtree->is_unique ) 200b718: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2 200b71c: 80 a0 a0 00 cmp %g2, 0 200b720: 12 80 00 0a bne 200b748 <_RBTree_Find+0x7c> 200b724: b0 10 00 1d mov %i5, %i0 break; } RBTree_Direction dir = (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 200b728: 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) { 200b72c: 80 a7 60 00 cmp %i5, 0 200b730: 32 bf ff f0 bne,a 200b6f0 <_RBTree_Find+0x24> 200b734: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 return_node = _RBTree_Find_unprotected( the_rbtree, search_node ); _ISR_Enable( level ); 200b738: 7f ff e1 b1 call 2003dfc 200b73c: 90 10 00 1b mov %i3, %o0 return return_node; } 200b740: 81 c7 e0 08 ret 200b744: 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 ); 200b748: 7f ff e1 ad call 2003dfc 200b74c: 90 10 00 1b mov %i3, %o0 return return_node; } 200b750: 81 c7 e0 08 ret 200b754: 81 e8 00 00 restore =============================================================================== 0200bb38 <_RBTree_Initialize>: void *starting_address, size_t number_nodes, size_t node_size, bool is_unique ) { 200bb38: 9d e3 bf a0 save %sp, -96, %sp size_t count; RBTree_Node *next; /* TODO: Error message? */ if (!the_rbtree) return; 200bb3c: 80 a6 20 00 cmp %i0, 0 200bb40: 02 80 00 0f be 200bb7c <_RBTree_Initialize+0x44> <== NEVER TAKEN 200bb44: 80 a6 e0 00 cmp %i3, 0 RBTree_Control *the_rbtree, RBTree_Compare_function compare_function, bool is_unique ) { the_rbtree->permanent_null = NULL; 200bb48: c0 26 00 00 clr [ %i0 ] the_rbtree->root = NULL; 200bb4c: c0 26 20 04 clr [ %i0 + 4 ] the_rbtree->first[0] = NULL; 200bb50: c0 26 20 08 clr [ %i0 + 8 ] the_rbtree->first[1] = NULL; 200bb54: c0 26 20 0c clr [ %i0 + 0xc ] the_rbtree->compare_function = compare_function; 200bb58: 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-- ) { 200bb5c: 02 80 00 08 be 200bb7c <_RBTree_Initialize+0x44> <== NEVER TAKEN 200bb60: fa 2e 20 14 stb %i5, [ %i0 + 0x14 ] _RBTree_Insert_unprotected(the_rbtree, next); 200bb64: 92 10 00 1a mov %i2, %o1 200bb68: 7f ff ff 0b call 200b794 <_RBTree_Insert_unprotected> 200bb6c: 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-- ) { 200bb70: b6 86 ff ff addcc %i3, -1, %i3 200bb74: 12 bf ff fc bne 200bb64 <_RBTree_Initialize+0x2c> 200bb78: b4 06 80 1c add %i2, %i4, %i2 200bb7c: 81 c7 e0 08 ret 200bb80: 81 e8 00 00 restore =============================================================================== 0200acb8 <_RBTree_Insert_unprotected>: */ RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 200acb8: 9d e3 bf a0 save %sp, -96, %sp if(!the_node) return (RBTree_Node*)-1; 200acbc: 80 a6 60 00 cmp %i1, 0 200acc0: 02 80 00 9c be 200af30 <_RBTree_Insert_unprotected+0x278> 200acc4: b8 10 00 18 mov %i0, %i4 RBTree_Node *iter_node = the_rbtree->root; 200acc8: fa 06 20 04 ld [ %i0 + 4 ], %i5 int compare_result; if (!iter_node) { /* special case: first node inserted */ 200accc: 80 a7 60 00 cmp %i5, 0 200acd0: 32 80 00 05 bne,a 200ace4 <_RBTree_Insert_unprotected+0x2c> 200acd4: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 the_node->color = RBT_BLACK; 200acd8: 10 80 00 9a b 200af40 <_RBTree_Insert_unprotected+0x288> 200acdc: 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); 200ace0: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 200ace4: 92 10 00 1d mov %i5, %o1 200ace8: 9f c0 40 00 call %g1 200acec: 90 10 00 19 mov %i1, %o0 if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 200acf0: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2 return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); 200acf4: 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 ) ) 200acf8: 80 a0 a0 00 cmp %g2, 0 return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); 200acfc: b7 36 e0 1f srl %i3, 0x1f, %i3 if (!iter_node->child[dir]) { 200ad00: 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 ) ) 200ad04: 02 80 00 05 be 200ad18 <_RBTree_Insert_unprotected+0x60> 200ad08: 82 07 40 01 add %i5, %g1, %g1 200ad0c: 80 a2 20 00 cmp %o0, 0 200ad10: 02 80 00 8a be 200af38 <_RBTree_Insert_unprotected+0x280> 200ad14: 01 00 00 00 nop return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); if (!iter_node->child[dir]) { 200ad18: f0 00 60 04 ld [ %g1 + 4 ], %i0 200ad1c: 80 a6 20 00 cmp %i0, 0 200ad20: 32 bf ff f0 bne,a 200ace0 <_RBTree_Insert_unprotected+0x28> 200ad24: 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( 200ad28: 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]; 200ad2c: b4 06 e0 02 add %i3, 2, %i2 200ad30: 87 2e a0 02 sll %i2, 2, %g3 200ad34: 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; 200ad38: c0 26 60 08 clr [ %i1 + 8 ] 200ad3c: c0 26 60 04 clr [ %i1 + 4 ] the_node->color = RBT_RED; iter_node->child[dir] = the_node; 200ad40: 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; 200ad44: 82 10 20 01 mov 1, %g1 iter_node->child[dir] = the_node; the_node->parent = iter_node; 200ad48: 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; 200ad4c: 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( 200ad50: 9f c0 80 00 call %g2 200ad54: 90 10 00 19 mov %i1, %o0 the_node, _RBTree_First(the_rbtree, dir) ); if ( (!dir && _RBTree_Is_lesser(compare_result)) || 200ad58: 80 a6 e0 00 cmp %i3, 0 200ad5c: 12 80 00 10 bne 200ad9c <_RBTree_Insert_unprotected+0xe4> 200ad60: 80 a2 20 00 cmp %o0, 0 200ad64: 06 80 00 10 bl 200ada4 <_RBTree_Insert_unprotected+0xec> 200ad68: b5 2e a0 02 sll %i2, 2, %i2 200ad6c: 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; 200ad70: 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; 200ad74: c4 00 40 00 ld [ %g1 ], %g2 200ad78: 86 90 a0 00 orcc %g2, 0, %g3 200ad7c: 22 80 00 06 be,a 200ad94 <_RBTree_Insert_unprotected+0xdc> 200ad80: 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); 200ad84: c8 00 60 0c ld [ %g1 + 0xc ], %g4 200ad88: 80 a1 20 01 cmp %g4, 1 200ad8c: 22 80 00 08 be,a 200adac <_RBTree_Insert_unprotected+0xf4> 200ad90: f6 00 80 00 ld [ %g2 ], %i3 /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; } 200ad94: 81 c7 e0 08 ret 200ad98: 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)) ) { 200ad9c: 04 bf ff f4 ble 200ad6c <_RBTree_Insert_unprotected+0xb4> 200ada0: b5 2e a0 02 sll %i2, 2, %i2 the_rbtree->first[dir] = the_node; 200ada4: 10 bf ff f2 b 200ad6c <_RBTree_Insert_unprotected+0xb4> 200ada8: 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; 200adac: 80 a6 e0 00 cmp %i3, 0 200adb0: 02 80 00 0c be 200ade0 <_RBTree_Insert_unprotected+0x128> <== NEVER TAKEN 200adb4: 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]) 200adb8: 80 a1 00 01 cmp %g4, %g1 200adbc: 02 80 00 5b be 200af28 <_RBTree_Insert_unprotected+0x270> 200adc0: 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); 200adc4: 80 a7 60 00 cmp %i5, 0 200adc8: 22 80 00 07 be,a 200ade4 <_RBTree_Insert_unprotected+0x12c> 200adcc: fa 00 60 04 ld [ %g1 + 4 ], %i5 200add0: f8 07 60 0c ld [ %i5 + 0xc ], %i4 200add4: 80 a7 20 01 cmp %i4, 1 200add8: 22 80 00 4f be,a 200af14 <_RBTree_Insert_unprotected+0x25c> 200addc: 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]; 200ade0: fa 00 60 04 ld [ %g1 + 4 ], %i5 RBTree_Direction pdir = the_node->parent != g->child[0]; 200ade4: 88 18 40 04 xor %g1, %g4, %g4 200ade8: 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]; 200adec: ba 1e 40 1d xor %i1, %i5, %i5 RBTree_Direction pdir = the_node->parent != g->child[0]; 200adf0: 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]; 200adf4: 80 a0 00 1d cmp %g0, %i5 200adf8: 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) { 200adfc: 80 a7 40 04 cmp %i5, %g4 200ae00: 02 80 00 20 be 200ae80 <_RBTree_Insert_unprotected+0x1c8> 200ae04: 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); 200ae08: 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; 200ae0c: b7 2e e0 02 sll %i3, 2, %i3 200ae10: b6 00 40 1b add %g1, %i3, %i3 200ae14: fa 06 e0 04 ld [ %i3 + 4 ], %i5 200ae18: 80 a7 60 00 cmp %i5, 0 200ae1c: 02 80 00 16 be 200ae74 <_RBTree_Insert_unprotected+0x1bc> <== NEVER TAKEN 200ae20: 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]; 200ae24: 9e 07 40 1c add %i5, %i4, %o7 200ae28: da 03 e0 04 ld [ %o7 + 4 ], %o5 200ae2c: da 26 e0 04 st %o5, [ %i3 + 4 ] if (c->child[dir]) 200ae30: f6 03 e0 04 ld [ %o7 + 4 ], %i3 200ae34: 80 a6 e0 00 cmp %i3, 0 200ae38: 22 80 00 05 be,a 200ae4c <_RBTree_Insert_unprotected+0x194> 200ae3c: b6 07 40 1c add %i5, %i4, %i3 c->child[dir]->parent = the_node; 200ae40: c2 26 c0 00 st %g1, [ %i3 ] 200ae44: c4 00 40 00 ld [ %g1 ], %g2 c->child[dir] = the_node; 200ae48: b6 07 40 1c add %i5, %i4, %i3 200ae4c: c2 26 e0 04 st %g1, [ %i3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200ae50: f6 00 a0 04 ld [ %g2 + 4 ], %i3 c->parent = the_node->parent; 200ae54: 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; 200ae58: b6 1e c0 01 xor %i3, %g1, %i3 c->parent = the_node->parent; the_node->parent = c; 200ae5c: 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; 200ae60: 80 a0 00 1b cmp %g0, %i3 200ae64: 82 40 20 00 addx %g0, 0, %g1 200ae68: 83 28 60 02 sll %g1, 2, %g1 200ae6c: 84 00 80 01 add %g2, %g1, %g2 200ae70: fa 20 a0 04 st %i5, [ %g2 + 4 ] _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; 200ae74: b2 06 40 1c add %i1, %i4, %i1 200ae78: f2 06 60 04 ld [ %i1 + 4 ], %i1 200ae7c: c2 06 40 00 ld [ %i1 ], %g1 } the_node->parent->color = RBT_BLACK; 200ae80: 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)); 200ae84: 88 26 80 04 sub %i2, %g4, %g4 200ae88: 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; 200ae8c: bb 2f 60 02 sll %i5, 2, %i5 200ae90: ba 00 c0 1d add %g3, %i5, %i5 200ae94: c4 07 60 04 ld [ %i5 + 4 ], %g2 200ae98: 80 a0 a0 00 cmp %g2, 0 200ae9c: 02 bf ff b6 be 200ad74 <_RBTree_Insert_unprotected+0xbc> <== NEVER TAKEN 200aea0: 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]; 200aea4: 89 29 20 02 sll %g4, 2, %g4 200aea8: 82 00 80 04 add %g2, %g4, %g1 200aeac: f8 00 60 04 ld [ %g1 + 4 ], %i4 200aeb0: f8 27 60 04 st %i4, [ %i5 + 4 ] if (c->child[dir]) 200aeb4: c2 00 60 04 ld [ %g1 + 4 ], %g1 200aeb8: 80 a0 60 00 cmp %g1, 0 200aebc: 32 80 00 02 bne,a 200aec4 <_RBTree_Insert_unprotected+0x20c> 200aec0: 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; 200aec4: 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; 200aec8: 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; 200aecc: 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; 200aed0: c6 21 20 04 st %g3, [ %g4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200aed4: c8 07 60 04 ld [ %i5 + 4 ], %g4 c->parent = the_node->parent; the_node->parent = c; 200aed8: c4 20 c0 00 st %g2, [ %g3 ] 200aedc: 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; 200aee0: 86 18 c0 04 xor %g3, %g4, %g3 200aee4: 80 a0 00 03 cmp %g0, %g3 200aee8: 86 40 20 00 addx %g0, 0, %g3 200aeec: 87 28 e0 02 sll %g3, 2, %g3 200aef0: ba 07 40 03 add %i5, %g3, %i5 200aef4: 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; 200aef8: c4 00 40 00 ld [ %g1 ], %g2 200aefc: 86 90 a0 00 orcc %g2, 0, %g3 200af00: 32 bf ff a2 bne,a 200ad88 <_RBTree_Insert_unprotected+0xd0><== ALWAYS TAKEN 200af04: c8 00 60 0c ld [ %g1 + 0xc ], %g4 } } if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200af08: c0 26 60 0c clr [ %i1 + 0xc ] <== NOT EXECUTED /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; } 200af0c: 81 c7 e0 08 ret <== NOT EXECUTED 200af10: 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; 200af14: c0 27 60 0c clr [ %i5 + 0xc ] g->color = RBT_RED; 200af18: f8 20 a0 0c st %i4, [ %g2 + 0xc ] 200af1c: 82 10 00 1b mov %i3, %g1 200af20: 10 bf ff 95 b 200ad74 <_RBTree_Insert_unprotected+0xbc> 200af24: 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]; 200af28: 10 bf ff a7 b 200adc4 <_RBTree_Insert_unprotected+0x10c> 200af2c: 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; 200af30: 81 c7 e0 08 ret 200af34: 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 ) ) 200af38: 81 c7 e0 08 ret 200af3c: 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; 200af40: f2 26 20 04 st %i1, [ %i0 + 4 ] the_rbtree->first[0] = the_rbtree->first[1] = the_node; 200af44: f2 26 20 0c st %i1, [ %i0 + 0xc ] 200af48: f2 26 20 08 st %i1, [ %i0 + 8 ] the_node->parent = (RBTree_Node *) the_rbtree; 200af4c: f0 26 40 00 st %i0, [ %i1 ] the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 200af50: c0 26 60 08 clr [ %i1 + 8 ] 200af54: c0 26 60 04 clr [ %i1 + 4 ] } /* while(iter_node) */ /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; 200af58: 81 c7 e0 08 ret 200af5c: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200af90 <_RBTree_Iterate_unprotected>: const RBTree_Control *rbtree, RBTree_Direction dir, RBTree_Visitor visitor, void *visitor_arg ) { 200af90: 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); 200af94: 80 a0 00 19 cmp %g0, %i1 200af98: 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]; 200af9c: 82 00 60 02 add %g1, 2, %g1 200afa0: 83 28 60 02 sll %g1, 2, %g1 200afa4: 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 ) { 200afa8: 80 a7 60 00 cmp %i5, 0 200afac: 12 80 00 06 bne 200afc4 <_RBTree_Iterate_unprotected+0x34><== ALWAYS TAKEN 200afb0: 94 10 00 1b mov %i3, %o2 200afb4: 30 80 00 0e b,a 200afec <_RBTree_Iterate_unprotected+0x5c><== NOT EXECUTED 200afb8: 80 8f 20 ff btst 0xff, %i4 200afbc: 02 80 00 0c be 200afec <_RBTree_Iterate_unprotected+0x5c> <== NEVER TAKEN 200afc0: 94 10 00 1b mov %i3, %o2 stop = (*visitor)( current, dir, visitor_arg ); 200afc4: 90 10 00 1d mov %i5, %o0 200afc8: 9f c6 80 00 call %i2 200afcc: 92 10 00 19 mov %i1, %o1 current = _RBTree_Next_unprotected( current, dir ); 200afd0: 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 ); 200afd4: b8 10 00 08 mov %o0, %i4 current = _RBTree_Next_unprotected( current, dir ); 200afd8: 40 00 00 07 call 200aff4 <_RBTree_Next_unprotected> 200afdc: 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 ) { 200afe0: ba 92 20 00 orcc %o0, 0, %i5 200afe4: 12 bf ff f5 bne 200afb8 <_RBTree_Iterate_unprotected+0x28> 200afe8: b8 1f 20 01 xor %i4, 1, %i4 200afec: 81 c7 e0 08 ret 200aff0: 81 e8 00 00 restore =============================================================================== 020081d4 <_RTEMS_tasks_Initialize_user_tasks_body>: * * Output parameters: NONE */ void _RTEMS_tasks_Initialize_user_tasks_body( void ) { 20081d4: 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; 20081d8: 03 00 80 71 sethi %hi(0x201c400), %g1 20081dc: 82 10 61 20 or %g1, 0x120, %g1 ! 201c520 20081e0: 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 ) 20081e4: 80 a7 60 00 cmp %i5, 0 20081e8: 02 80 00 18 be 2008248 <_RTEMS_tasks_Initialize_user_tasks_body+0x74> 20081ec: 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++ ) { 20081f0: 80 a6 e0 00 cmp %i3, 0 20081f4: 02 80 00 15 be 2008248 <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN 20081f8: b8 10 20 00 clr %i4 return_value = rtems_task_create( 20081fc: d4 07 60 04 ld [ %i5 + 4 ], %o2 2008200: d0 07 40 00 ld [ %i5 ], %o0 2008204: d2 07 60 08 ld [ %i5 + 8 ], %o1 2008208: d6 07 60 14 ld [ %i5 + 0x14 ], %o3 200820c: d8 07 60 0c ld [ %i5 + 0xc ], %o4 2008210: 7f ff ff 70 call 2007fd0 2008214: 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 ) ) 2008218: 94 92 20 00 orcc %o0, 0, %o2 200821c: 12 80 00 0d bne 2008250 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2008220: d0 07 bf fc ld [ %fp + -4 ], %o0 _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); return_value = rtems_task_start( 2008224: d4 07 60 18 ld [ %i5 + 0x18 ], %o2 2008228: 40 00 00 0e call 2008260 200822c: 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 ) ) 2008230: 94 92 20 00 orcc %o0, 0, %o2 2008234: 12 80 00 07 bne 2008250 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2008238: b8 07 20 01 inc %i4 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 200823c: 80 a7 00 1b cmp %i4, %i3 2008240: 12 bf ff ef bne 20081fc <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN 2008244: ba 07 60 1c add %i5, 0x1c, %i5 2008248: 81 c7 e0 08 ret 200824c: 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 ); 2008250: 90 10 20 01 mov 1, %o0 2008254: 40 00 04 0e call 200928c <_Internal_error_Occurred> 2008258: 92 10 20 01 mov 1, %o1 =============================================================================== 0200d418 <_RTEMS_tasks_Post_switch_extension>: */ static void _RTEMS_tasks_Post_switch_extension( Thread_Control *executing ) { 200d418: 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 ]; 200d41c: fa 06 21 50 ld [ %i0 + 0x150 ], %i5 if ( !api ) 200d420: 80 a7 60 00 cmp %i5, 0 200d424: 02 80 00 1e be 200d49c <_RTEMS_tasks_Post_switch_extension+0x84><== NEVER TAKEN 200d428: 01 00 00 00 nop * Signal Processing */ asr = &api->Signal; _ISR_Disable( level ); 200d42c: 7f ff d4 ce call 2002764 200d430: 01 00 00 00 nop signal_set = asr->signals_posted; 200d434: f8 07 60 14 ld [ %i5 + 0x14 ], %i4 asr->signals_posted = 0; 200d438: c0 27 60 14 clr [ %i5 + 0x14 ] _ISR_Enable( level ); 200d43c: 7f ff d4 ce call 2002774 200d440: 01 00 00 00 nop if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ 200d444: 80 a7 20 00 cmp %i4, 0 200d448: 32 80 00 04 bne,a 200d458 <_RTEMS_tasks_Post_switch_extension+0x40> 200d44c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200d450: 81 c7 e0 08 ret 200d454: 81 e8 00 00 restore return; asr->nest_level += 1; rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200d458: d0 07 60 10 ld [ %i5 + 0x10 ], %o0 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 200d45c: 82 00 60 01 inc %g1 rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200d460: 94 07 bf fc add %fp, -4, %o2 200d464: 37 00 00 3f sethi %hi(0xfc00), %i3 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 200d468: c2 27 60 1c st %g1, [ %i5 + 0x1c ] rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200d46c: 40 00 07 e6 call 200f404 200d470: 92 16 e3 ff or %i3, 0x3ff, %o1 (*asr->handler)( signal_set ); 200d474: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200d478: 9f c0 40 00 call %g1 200d47c: 90 10 00 1c mov %i4, %o0 asr->nest_level -= 1; 200d480: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200d484: 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; 200d488: 82 00 7f ff add %g1, -1, %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 200d48c: 92 16 e3 ff or %i3, 0x3ff, %o1 200d490: 94 07 bf fc add %fp, -4, %o2 200d494: 40 00 07 dc call 200f404 200d498: c2 27 60 1c st %g1, [ %i5 + 0x1c ] 200d49c: 81 c7 e0 08 ret 200d4a0: 81 e8 00 00 restore =============================================================================== 0200d2a0 <_RTEMS_tasks_Switch_extension>: /* * Per Task Variables */ tvp = executing->task_variables; 200d2a0: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 while (tvp) { 200d2a4: 80 a0 60 00 cmp %g1, 0 200d2a8: 22 80 00 0c be,a 200d2d8 <_RTEMS_tasks_Switch_extension+0x38> 200d2ac: c2 02 61 5c ld [ %o1 + 0x15c ], %g1 tvp->tval = *tvp->ptr; 200d2b0: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->gval; 200d2b4: c6 00 60 08 ld [ %g1 + 8 ], %g3 * Per Task Variables */ tvp = executing->task_variables; while (tvp) { tvp->tval = *tvp->ptr; 200d2b8: c8 00 80 00 ld [ %g2 ], %g4 200d2bc: c8 20 60 0c st %g4, [ %g1 + 0xc ] *tvp->ptr = tvp->gval; 200d2c0: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200d2c4: c2 00 40 00 ld [ %g1 ], %g1 /* * Per Task Variables */ tvp = executing->task_variables; while (tvp) { 200d2c8: 80 a0 60 00 cmp %g1, 0 200d2cc: 32 bf ff fa bne,a 200d2b4 <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN 200d2d0: 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; 200d2d4: c2 02 61 5c ld [ %o1 + 0x15c ], %g1 while (tvp) { 200d2d8: 80 a0 60 00 cmp %g1, 0 200d2dc: 02 80 00 0d be 200d310 <_RTEMS_tasks_Switch_extension+0x70> 200d2e0: 01 00 00 00 nop tvp->gval = *tvp->ptr; 200d2e4: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->tval; 200d2e8: 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; 200d2ec: c8 00 80 00 ld [ %g2 ], %g4 200d2f0: c8 20 60 08 st %g4, [ %g1 + 8 ] *tvp->ptr = tvp->tval; 200d2f4: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200d2f8: c2 00 40 00 ld [ %g1 ], %g1 *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { 200d2fc: 80 a0 60 00 cmp %g1, 0 200d300: 32 bf ff fa bne,a 200d2e8 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN 200d304: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED 200d308: 81 c3 e0 08 retl 200d30c: 01 00 00 00 nop 200d310: 81 c3 e0 08 retl =============================================================================== 02036f08 <_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 ) { 2036f08: 9d e3 bf 98 save %sp, -104, %sp #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ Timestamp_Control uptime; #endif Thread_Control *owning_thread = the_period->owner; 2036f0c: f6 06 20 40 ld [ %i0 + 0x40 ], %i3 /* * Determine elapsed wall time since period initiated. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _TOD_Get_uptime( &uptime ); 2036f10: 7f ff 63 2d call 200fbc4 <_TOD_Get_uptime> 2036f14: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_Subtract( 2036f18: c4 1f bf f8 ldd [ %fp + -8 ], %g2 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 2036f1c: 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) { 2036f20: 03 00 81 97 sethi %hi(0x2065c00), %g1 2036f24: 82 10 60 e0 or %g1, 0xe0, %g1 ! 2065ce0 <_Per_CPU_Information> 2036f28: de 00 60 0c ld [ %g1 + 0xc ], %o7 2036f2c: ba a0 c0 1d subcc %g3, %i5, %i5 2036f30: b8 60 80 1c subx %g2, %i4, %i4 2036f34: 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; 2036f38: 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) { 2036f3c: 80 a3 c0 1b cmp %o7, %i3 2036f40: 02 80 00 05 be 2036f54 <_Rate_monotonic_Get_status+0x4c> 2036f44: f8 1e e0 80 ldd [ %i3 + 0x80 ], %i4 return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; } 2036f48: b0 09 20 01 and %g4, 1, %i0 2036f4c: 81 c7 e0 08 ret 2036f50: 81 e8 00 00 restore 2036f54: d8 18 60 20 ldd [ %g1 + 0x20 ], %o4 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2036f58: f0 1e 20 48 ldd [ %i0 + 0x48 ], %i0 2036f5c: 86 a0 c0 0d subcc %g3, %o5, %g3 2036f60: 84 60 80 0c subx %g2, %o4, %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2036f64: ba 87 40 03 addcc %i5, %g3, %i5 2036f68: b8 47 00 02 addx %i4, %g2, %i4 /* * The cpu usage info was reset while executing. Can't * determine a status. */ if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated)) 2036f6c: 80 a6 00 1c cmp %i0, %i4 2036f70: 14 bf ff f6 bg 2036f48 <_Rate_monotonic_Get_status+0x40> <== NEVER TAKEN 2036f74: 88 10 20 00 clr %g4 2036f78: 02 80 00 09 be 2036f9c <_Rate_monotonic_Get_status+0x94> 2036f7c: 80 a6 40 1d cmp %i1, %i5 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 2036f80: ba a7 40 19 subcc %i5, %i1, %i5 if (used < the_period->cpu_usage_period_initiated) return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; 2036f84: 88 10 20 01 mov 1, %g4 2036f88: b8 67 00 18 subx %i4, %i0, %i4 } 2036f8c: b0 09 20 01 and %g4, 1, %i0 2036f90: f8 3e 80 00 std %i4, [ %i2 ] 2036f94: 81 c7 e0 08 ret 2036f98: 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)) 2036f9c: 28 bf ff fa bleu,a 2036f84 <_Rate_monotonic_Get_status+0x7c> 2036fa0: ba a7 40 19 subcc %i5, %i1, %i5 return false; 2036fa4: 10 bf ff e9 b 2036f48 <_Rate_monotonic_Get_status+0x40> 2036fa8: 88 10 20 00 clr %g4 =============================================================================== 02037348 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 2037348: 9d e3 bf 98 save %sp, -104, %sp 203734c: 11 00 81 97 sethi %hi(0x2065c00), %o0 2037350: 92 10 00 18 mov %i0, %o1 2037354: 90 12 23 00 or %o0, 0x300, %o0 2037358: 7f ff 48 a8 call 20095f8 <_Objects_Get> 203735c: 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 ) { 2037360: c2 07 bf fc ld [ %fp + -4 ], %g1 2037364: 80 a0 60 00 cmp %g1, 0 2037368: 12 80 00 17 bne 20373c4 <_Rate_monotonic_Timeout+0x7c> <== NEVER TAKEN 203736c: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 2037370: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 2037374: 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); 2037378: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 203737c: 80 88 80 01 btst %g2, %g1 2037380: 22 80 00 08 be,a 20373a0 <_Rate_monotonic_Timeout+0x58> 2037384: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2037388: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 203738c: c2 07 60 08 ld [ %i5 + 8 ], %g1 2037390: 80 a0 80 01 cmp %g2, %g1 2037394: 02 80 00 1a be 20373fc <_Rate_monotonic_Timeout+0xb4> 2037398: 13 04 00 ff sethi %hi(0x1003fc00), %o1 _Thread_Unblock( the_thread ); _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { 203739c: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 20373a0: 80 a0 60 01 cmp %g1, 1 20373a4: 02 80 00 0a be 20373cc <_Rate_monotonic_Timeout+0x84> 20373a8: 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; 20373ac: c2 27 60 38 st %g1, [ %i5 + 0x38 ] * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 20373b0: 03 00 81 96 sethi %hi(0x2065800), %g1 20373b4: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 ! 2065ac0 <_Thread_Dispatch_disable_level> 20373b8: 84 00 bf ff add %g2, -1, %g2 20373bc: c4 20 62 c0 st %g2, [ %g1 + 0x2c0 ] return _Thread_Dispatch_disable_level; 20373c0: c2 00 62 c0 ld [ %g1 + 0x2c0 ], %g1 20373c4: 81 c7 e0 08 ret 20373c8: 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; 20373cc: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 20373d0: 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; 20373d4: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 20373d8: 7f ff ff 44 call 20370e8 <_Rate_monotonic_Initiate_statistics> 20373dc: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20373e0: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20373e4: 11 00 81 96 sethi %hi(0x2065800), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20373e8: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20373ec: 90 12 23 68 or %o0, 0x368, %o0 20373f0: 7f ff 4f ca call 200b318 <_Watchdog_Insert> 20373f4: 92 07 60 10 add %i5, 0x10, %o1 20373f8: 30 bf ff ee b,a 20373b0 <_Rate_monotonic_Timeout+0x68> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 20373fc: 7f ff 4b 5f call 200a178 <_Thread_Clear_state> 2037400: 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 ); 2037404: 10 bf ff f5 b 20373d8 <_Rate_monotonic_Timeout+0x90> 2037408: 90 10 00 1d mov %i5, %o0 =============================================================================== 02036fac <_Rate_monotonic_Update_statistics>: } static void _Rate_monotonic_Update_statistics( Rate_monotonic_Control *the_period ) { 2036fac: 9d e3 bf 90 save %sp, -112, %sp /* * Update the counts. */ stats = &the_period->Statistics; stats->count++; 2036fb0: c4 06 20 58 ld [ %i0 + 0x58 ], %g2 if ( the_period->state == RATE_MONOTONIC_EXPIRED ) 2036fb4: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 /* * Update the counts. */ stats = &the_period->Statistics; stats->count++; 2036fb8: 84 00 a0 01 inc %g2 if ( the_period->state == RATE_MONOTONIC_EXPIRED ) 2036fbc: 80 a0 60 04 cmp %g1, 4 2036fc0: 02 80 00 32 be 2037088 <_Rate_monotonic_Update_statistics+0xdc> 2036fc4: c4 26 20 58 st %g2, [ %i0 + 0x58 ] stats->missed_count++; /* * Grab status for time statistics. */ valid_status = 2036fc8: 90 10 00 18 mov %i0, %o0 2036fcc: 92 07 bf f8 add %fp, -8, %o1 2036fd0: 7f ff ff ce call 2036f08 <_Rate_monotonic_Get_status> 2036fd4: 94 07 bf f0 add %fp, -16, %o2 _Rate_monotonic_Get_status( the_period, &since_last_period, &executed ); if (!valid_status) 2036fd8: 80 8a 20 ff btst 0xff, %o0 2036fdc: 02 80 00 21 be 2037060 <_Rate_monotonic_Update_statistics+0xb4> 2036fe0: c4 1f bf f0 ldd [ %fp + -16 ], %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2036fe4: 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 ) ) 2036fe8: c2 06 20 60 ld [ %i0 + 0x60 ], %g1 2036fec: ba 87 40 03 addcc %i5, %g3, %i5 2036ff0: b8 47 00 02 addx %i4, %g2, %i4 2036ff4: 80 a0 40 02 cmp %g1, %g2 2036ff8: 04 80 00 1c ble 2037068 <_Rate_monotonic_Update_statistics+0xbc> 2036ffc: f8 3e 20 70 std %i4, [ %i0 + 0x70 ] stats->min_cpu_time = executed; 2037000: c4 3e 20 60 std %g2, [ %i0 + 0x60 ] if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) ) 2037004: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 2037008: 80 a0 40 02 cmp %g1, %g2 203700c: 26 80 00 05 bl,a 2037020 <_Rate_monotonic_Update_statistics+0x74><== NEVER TAKEN 2037010: c4 3e 20 68 std %g2, [ %i0 + 0x68 ] <== NOT EXECUTED 2037014: 80 a0 40 02 cmp %g1, %g2 2037018: 22 80 00 28 be,a 20370b8 <_Rate_monotonic_Update_statistics+0x10c><== ALWAYS TAKEN 203701c: 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 ); 2037020: c4 1f bf f8 ldd [ %fp + -8 ], %g2 2037024: f8 1e 20 88 ldd [ %i0 + 0x88 ], %i4 if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) 2037028: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 203702c: ba 87 40 03 addcc %i5, %g3, %i5 2037030: b8 47 00 02 addx %i4, %g2, %i4 2037034: 80 a0 40 02 cmp %g1, %g2 2037038: 14 80 00 1b bg 20370a4 <_Rate_monotonic_Update_statistics+0xf8> 203703c: f8 3e 20 88 std %i4, [ %i0 + 0x88 ] 2037040: 80 a0 40 02 cmp %g1, %g2 2037044: 22 80 00 15 be,a 2037098 <_Rate_monotonic_Update_statistics+0xec><== ALWAYS TAKEN 2037048: 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 ) ) 203704c: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED 2037050: 80 a0 40 02 cmp %g1, %g2 2037054: 16 80 00 1e bge 20370cc <_Rate_monotonic_Update_statistics+0x120><== ALWAYS TAKEN 2037058: 01 00 00 00 nop stats->max_wall_time = since_last_period; 203705c: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] <== NOT EXECUTED 2037060: 81 c7 e0 08 ret 2037064: 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 ) ) 2037068: 32 bf ff e8 bne,a 2037008 <_Rate_monotonic_Update_statistics+0x5c><== NEVER TAKEN 203706c: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 <== NOT EXECUTED 2037070: c2 06 20 64 ld [ %i0 + 0x64 ], %g1 2037074: 80 a0 40 03 cmp %g1, %g3 2037078: 28 bf ff e4 bleu,a 2037008 <_Rate_monotonic_Update_statistics+0x5c> 203707c: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 stats->min_cpu_time = executed; 2037080: 10 bf ff e1 b 2037004 <_Rate_monotonic_Update_statistics+0x58> 2037084: c4 3e 20 60 std %g2, [ %i0 + 0x60 ] */ stats = &the_period->Statistics; stats->count++; if ( the_period->state == RATE_MONOTONIC_EXPIRED ) stats->missed_count++; 2037088: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 203708c: 82 00 60 01 inc %g1 2037090: 10 bf ff ce b 2036fc8 <_Rate_monotonic_Update_statistics+0x1c> 2037094: 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 ) ) 2037098: 80 a0 40 03 cmp %g1, %g3 203709c: 28 bf ff ed bleu,a 2037050 <_Rate_monotonic_Update_statistics+0xa4> 20370a0: 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 ) ) 20370a4: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 20370a8: 80 a0 40 02 cmp %g1, %g2 20370ac: 06 bf ff ec bl 203705c <_Rate_monotonic_Update_statistics+0xb0><== NEVER TAKEN 20370b0: c4 3e 20 78 std %g2, [ %i0 + 0x78 ] 20370b4: 30 80 00 06 b,a 20370cc <_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 ) ) 20370b8: 80 a0 40 03 cmp %g1, %g3 20370bc: 3a bf ff da bcc,a 2037024 <_Rate_monotonic_Update_statistics+0x78> 20370c0: c4 1f bf f8 ldd [ %fp + -8 ], %g2 stats->max_cpu_time = executed; 20370c4: 10 bf ff d7 b 2037020 <_Rate_monotonic_Update_statistics+0x74> 20370c8: 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 ) ) 20370cc: 12 bf ff e5 bne 2037060 <_Rate_monotonic_Update_statistics+0xb4><== NEVER TAKEN 20370d0: 01 00 00 00 nop 20370d4: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 20370d8: 80 a0 40 03 cmp %g1, %g3 20370dc: 2a bf ff e1 bcs,a 2037060 <_Rate_monotonic_Update_statistics+0xb4> 20370e0: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] 20370e4: 30 bf ff df b,a 2037060 <_Rate_monotonic_Update_statistics+0xb4> =============================================================================== 0200bb8c <_Scheduler_CBS_Budget_callout>: Scheduler_CBS_Server **_Scheduler_CBS_Server_list; void _Scheduler_CBS_Budget_callout( Thread_Control *the_thread ) { 200bb8c: 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; 200bb90: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 200bb94: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200bb98: 80 a0 40 09 cmp %g1, %o1 200bb9c: 32 80 00 02 bne,a 200bba4 <_Scheduler_CBS_Budget_callout+0x18><== ALWAYS TAKEN 200bba0: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 200bba4: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200bba8: 80 a0 40 09 cmp %g1, %o1 200bbac: 02 80 00 04 be 200bbbc <_Scheduler_CBS_Budget_callout+0x30><== NEVER TAKEN 200bbb0: 90 10 00 18 mov %i0, %o0 _Thread_Change_priority(the_thread, new_priority, true); 200bbb4: 40 00 01 9b call 200c220 <_Thread_Change_priority> 200bbb8: 94 10 20 01 mov 1, %o2 /* Invoke callback function if any. */ sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; 200bbbc: fa 06 20 88 ld [ %i0 + 0x88 ], %i5 if ( sched_info->cbs_server->cbs_budget_overrun ) { 200bbc0: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200bbc4: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200bbc8: 80 a0 a0 00 cmp %g2, 0 200bbcc: 02 80 00 09 be 200bbf0 <_Scheduler_CBS_Budget_callout+0x64><== NEVER TAKEN 200bbd0: 01 00 00 00 nop _Scheduler_CBS_Get_server_id( 200bbd4: d0 00 40 00 ld [ %g1 ], %o0 200bbd8: 7f ff ff d5 call 200bb2c <_Scheduler_CBS_Get_server_id> 200bbdc: 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 ); 200bbe0: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200bbe4: c2 00 60 0c ld [ %g1 + 0xc ], %g1 200bbe8: 9f c0 40 00 call %g1 200bbec: d0 07 bf fc ld [ %fp + -4 ], %o0 200bbf0: 81 c7 e0 08 ret 200bbf4: 81 e8 00 00 restore =============================================================================== 0200b6e4 <_Scheduler_CBS_Cleanup>: #include #include #include int _Scheduler_CBS_Cleanup (void) { 200b6e4: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b6e8: 39 00 80 7f sethi %hi(0x201fc00), %i4 200b6ec: c2 07 21 bc ld [ %i4 + 0x1bc ], %g1 ! 201fdbc <_Scheduler_CBS_Maximum_servers> 200b6f0: 80 a0 60 00 cmp %g1, 0 200b6f4: 02 80 00 18 be 200b754 <_Scheduler_CBS_Cleanup+0x70> <== NEVER TAKEN 200b6f8: 03 00 80 83 sethi %hi(0x2020c00), %g1 200b6fc: 37 00 80 83 sethi %hi(0x2020c00), %i3 200b700: c4 06 e0 f8 ld [ %i3 + 0xf8 ], %g2 ! 2020cf8 <_Scheduler_CBS_Server_list> 200b704: ba 10 20 00 clr %i5 200b708: b8 17 21 bc or %i4, 0x1bc, %i4 if ( _Scheduler_CBS_Server_list[ i ] ) 200b70c: 83 2f 60 02 sll %i5, 2, %g1 200b710: c2 00 80 01 ld [ %g2 + %g1 ], %g1 200b714: 80 a0 60 00 cmp %g1, 0 200b718: 02 80 00 05 be 200b72c <_Scheduler_CBS_Cleanup+0x48> 200b71c: 90 10 00 1d mov %i5, %o0 _Scheduler_CBS_Destroy_server( i ); 200b720: 40 00 00 46 call 200b838 <_Scheduler_CBS_Destroy_server> 200b724: 01 00 00 00 nop 200b728: c4 06 e0 f8 ld [ %i3 + 0xf8 ], %g2 int _Scheduler_CBS_Cleanup (void) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b72c: c2 07 00 00 ld [ %i4 ], %g1 200b730: ba 07 60 01 inc %i5 200b734: 80 a0 40 1d cmp %g1, %i5 200b738: 18 bf ff f6 bgu 200b710 <_Scheduler_CBS_Cleanup+0x2c> 200b73c: 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; } 200b740: 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 ); 200b744: 40 00 08 56 call 200d89c <_Workspace_Free> 200b748: 90 10 00 02 mov %g2, %o0 return SCHEDULER_CBS_OK; } 200b74c: 81 c7 e0 08 ret 200b750: 81 e8 00 00 restore 200b754: 10 bf ff fb b 200b740 <_Scheduler_CBS_Cleanup+0x5c> <== NOT EXECUTED 200b758: c4 00 60 f8 ld [ %g1 + 0xf8 ], %g2 <== NOT EXECUTED =============================================================================== 0200b75c <_Scheduler_CBS_Create_server>: int _Scheduler_CBS_Create_server ( Scheduler_CBS_Parameters *params, Scheduler_CBS_Budget_overrun budget_overrun_callback, rtems_id *server_id ) { 200b75c: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; Scheduler_CBS_Server *the_server; if ( params->budget <= 0 || 200b760: c2 06 20 04 ld [ %i0 + 4 ], %g1 200b764: 80 a0 60 00 cmp %g1, 0 200b768: 04 80 00 30 ble 200b828 <_Scheduler_CBS_Create_server+0xcc> 200b76c: b8 10 00 18 mov %i0, %i4 200b770: c2 06 00 00 ld [ %i0 ], %g1 200b774: 80 a0 60 00 cmp %g1, 0 200b778: 04 80 00 2c ble 200b828 <_Scheduler_CBS_Create_server+0xcc> 200b77c: 03 00 80 7f sethi %hi(0x201fc00), %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++ ) { 200b780: c8 00 61 bc ld [ %g1 + 0x1bc ], %g4 ! 201fdbc <_Scheduler_CBS_Maximum_servers> 200b784: 80 a1 20 00 cmp %g4, 0 200b788: 02 80 00 11 be 200b7cc <_Scheduler_CBS_Create_server+0x70><== NEVER TAKEN 200b78c: 37 00 80 83 sethi %hi(0x2020c00), %i3 if ( !_Scheduler_CBS_Server_list[i] ) 200b790: fa 06 e0 f8 ld [ %i3 + 0xf8 ], %i5 ! 2020cf8 <_Scheduler_CBS_Server_list> 200b794: c2 07 40 00 ld [ %i5 ], %g1 200b798: 80 a0 60 00 cmp %g1, 0 200b79c: 02 80 00 21 be 200b820 <_Scheduler_CBS_Create_server+0xc4> 200b7a0: b0 10 20 00 clr %i0 200b7a4: 10 80 00 06 b 200b7bc <_Scheduler_CBS_Create_server+0x60> 200b7a8: 82 10 20 00 clr %g1 200b7ac: c6 07 40 02 ld [ %i5 + %g2 ], %g3 200b7b0: 80 a0 e0 00 cmp %g3, 0 200b7b4: 02 80 00 08 be 200b7d4 <_Scheduler_CBS_Create_server+0x78> 200b7b8: 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++ ) { 200b7bc: 82 00 60 01 inc %g1 200b7c0: 80 a0 40 04 cmp %g1, %g4 200b7c4: 12 bf ff fa bne 200b7ac <_Scheduler_CBS_Create_server+0x50> 200b7c8: 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; 200b7cc: 81 c7 e0 08 ret 200b7d0: 91 e8 3f e6 restore %g0, -26, %o0 *server_id = i; 200b7d4: c2 26 80 00 st %g1, [ %i2 ] _Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *) _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); 200b7d8: 40 00 08 29 call 200d87c <_Workspace_Allocate> 200b7dc: 90 10 20 10 mov 0x10, %o0 the_server = _Scheduler_CBS_Server_list[*server_id]; 200b7e0: 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 *) 200b7e4: d0 27 40 18 st %o0, [ %i5 + %i0 ] _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; 200b7e8: c4 06 e0 f8 ld [ %i3 + 0xf8 ], %g2 200b7ec: 83 28 60 02 sll %g1, 2, %g1 200b7f0: c2 00 80 01 ld [ %g2 + %g1 ], %g1 if ( !the_server ) 200b7f4: 80 a0 60 00 cmp %g1, 0 200b7f8: 02 80 00 0e be 200b830 <_Scheduler_CBS_Create_server+0xd4><== NEVER TAKEN 200b7fc: 86 10 3f ff mov -1, %g3 return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 200b800: c4 07 00 00 ld [ %i4 ], %g2 200b804: c4 20 60 04 st %g2, [ %g1 + 4 ] 200b808: c4 07 20 04 ld [ %i4 + 4 ], %g2 the_server->task_id = -1; 200b80c: 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; 200b810: c4 20 60 08 st %g2, [ %g1 + 8 ] the_server->task_id = -1; the_server->cbs_budget_overrun = budget_overrun_callback; 200b814: f2 20 60 0c st %i1, [ %g1 + 0xc ] return SCHEDULER_CBS_OK; 200b818: 81 c7 e0 08 ret 200b81c: 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] ) 200b820: 10 bf ff ed b 200b7d4 <_Scheduler_CBS_Create_server+0x78> 200b824: 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; 200b828: 81 c7 e0 08 ret 200b82c: 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; } 200b830: 81 c7 e0 08 ret <== NOT EXECUTED 200b834: 91 e8 3f ef restore %g0, -17, %o0 <== NOT EXECUTED =============================================================================== 0200b8b8 <_Scheduler_CBS_Detach_thread>: int _Scheduler_CBS_Detach_thread ( Scheduler_CBS_Server_id server_id, rtems_id task_id ) { 200b8b8: 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); 200b8bc: 92 07 bf fc add %fp, -4, %o1 200b8c0: 40 00 03 a6 call 200c758 <_Thread_Get> 200b8c4: 90 10 00 19 mov %i1, %o0 /* The routine _Thread_Get may disable dispatch and not enable again. */ if ( the_thread ) { 200b8c8: ba 92 20 00 orcc %o0, 0, %i5 200b8cc: 02 80 00 1e be 200b944 <_Scheduler_CBS_Detach_thread+0x8c> 200b8d0: 01 00 00 00 nop _Thread_Enable_dispatch(); 200b8d4: 40 00 03 94 call 200c724 <_Thread_Enable_dispatch> 200b8d8: 01 00 00 00 nop } if ( server_id >= _Scheduler_CBS_Maximum_servers ) 200b8dc: 03 00 80 7f sethi %hi(0x201fc00), %g1 200b8e0: c2 00 61 bc ld [ %g1 + 0x1bc ], %g1 ! 201fdbc <_Scheduler_CBS_Maximum_servers> 200b8e4: 80 a6 00 01 cmp %i0, %g1 200b8e8: 1a 80 00 17 bcc 200b944 <_Scheduler_CBS_Detach_thread+0x8c> 200b8ec: 03 00 80 83 sethi %hi(0x2020c00), %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] ) 200b8f0: c2 00 60 f8 ld [ %g1 + 0xf8 ], %g1 ! 2020cf8 <_Scheduler_CBS_Server_list> 200b8f4: b1 2e 20 02 sll %i0, 2, %i0 200b8f8: c2 00 40 18 ld [ %g1 + %i0 ], %g1 200b8fc: 80 a0 60 00 cmp %g1, 0 200b900: 02 80 00 13 be 200b94c <_Scheduler_CBS_Detach_thread+0x94> 200b904: 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 ) 200b908: c4 00 40 00 ld [ %g1 ], %g2 200b90c: 80 a0 80 19 cmp %g2, %i1 200b910: 12 80 00 0d bne 200b944 <_Scheduler_CBS_Detach_thread+0x8c><== NEVER TAKEN 200b914: 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; 200b918: c8 07 60 88 ld [ %i5 + 0x88 ], %g4 the_thread->budget_algorithm = the_thread->Start.budget_algorithm; 200b91c: 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; 200b920: 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; 200b924: c4 07 60 a4 ld [ %i5 + 0xa4 ], %g2 the_thread->is_preemptible = the_thread->Start.is_preemptible; 200b928: 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; 200b92c: c0 21 20 18 clr [ %g4 + 0x18 ] the_thread->budget_algorithm = the_thread->Start.budget_algorithm; 200b930: c6 27 60 78 st %g3, [ %i5 + 0x78 ] the_thread->budget_callout = the_thread->Start.budget_callout; 200b934: c4 27 60 7c st %g2, [ %i5 + 0x7c ] the_thread->is_preemptible = the_thread->Start.is_preemptible; 200b938: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ] return SCHEDULER_CBS_OK; 200b93c: 81 c7 e0 08 ret 200b940: 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; 200b944: 81 c7 e0 08 ret 200b948: 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; } 200b94c: 81 c7 e0 08 ret 200b950: 91 e8 3f e7 restore %g0, -25, %o0 =============================================================================== 0200bb2c <_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++ ) { 200bb2c: 03 00 80 7f sethi %hi(0x201fc00), %g1 200bb30: c6 00 61 bc ld [ %g1 + 0x1bc ], %g3 ! 201fdbc <_Scheduler_CBS_Maximum_servers> 200bb34: 80 a0 e0 00 cmp %g3, 0 200bb38: 02 80 00 11 be 200bb7c <_Scheduler_CBS_Get_server_id+0x50><== NEVER TAKEN 200bb3c: 03 00 80 83 sethi %hi(0x2020c00), %g1 200bb40: c8 00 60 f8 ld [ %g1 + 0xf8 ], %g4 ! 2020cf8 <_Scheduler_CBS_Server_list> 200bb44: 82 10 20 00 clr %g1 #include #include #include #include int _Scheduler_CBS_Get_server_id ( 200bb48: 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] && 200bb4c: c4 01 00 02 ld [ %g4 + %g2 ], %g2 200bb50: 80 a0 a0 00 cmp %g2, 0 200bb54: 22 80 00 07 be,a 200bb70 <_Scheduler_CBS_Get_server_id+0x44> 200bb58: 82 00 60 01 inc %g1 200bb5c: c4 00 80 00 ld [ %g2 ], %g2 200bb60: 80 a0 80 08 cmp %g2, %o0 200bb64: 22 80 00 08 be,a 200bb84 <_Scheduler_CBS_Get_server_id+0x58> 200bb68: 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++ ) { 200bb6c: 82 00 60 01 inc %g1 200bb70: 80 a0 40 03 cmp %g1, %g3 200bb74: 12 bf ff f6 bne 200bb4c <_Scheduler_CBS_Get_server_id+0x20> 200bb78: 85 28 60 02 sll %g1, 2, %g2 *server_id = i; return SCHEDULER_CBS_OK; } } return SCHEDULER_CBS_ERROR_NOSERVER; } 200bb7c: 81 c3 e0 08 retl 200bb80: 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; 200bb84: 81 c3 e0 08 retl 200bb88: 90 10 20 00 clr %o0 =============================================================================== 0200bbf8 <_Scheduler_CBS_Initialize>: } } int _Scheduler_CBS_Initialize(void) { 200bbf8: 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*) ); 200bbfc: 3b 00 80 7f sethi %hi(0x201fc00), %i5 200bc00: d0 07 61 bc ld [ %i5 + 0x1bc ], %o0 ! 201fdbc <_Scheduler_CBS_Maximum_servers> } int _Scheduler_CBS_Initialize(void) { unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( 200bc04: 40 00 07 1e call 200d87c <_Workspace_Allocate> 200bc08: 91 2a 20 02 sll %o0, 2, %o0 200bc0c: 09 00 80 83 sethi %hi(0x2020c00), %g4 _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) 200bc10: 80 a2 20 00 cmp %o0, 0 200bc14: 02 80 00 10 be 200bc54 <_Scheduler_CBS_Initialize+0x5c> <== NEVER TAKEN 200bc18: d0 21 20 f8 st %o0, [ %g4 + 0xf8 ] return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { 200bc1c: c6 07 61 bc ld [ %i5 + 0x1bc ], %g3 200bc20: 80 a0 e0 00 cmp %g3, 0 200bc24: 12 80 00 05 bne 200bc38 <_Scheduler_CBS_Initialize+0x40> <== ALWAYS TAKEN 200bc28: 82 10 20 00 clr %g1 _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; 200bc2c: 81 c7 e0 08 ret <== NOT EXECUTED 200bc30: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED 200bc34: d0 01 20 f8 ld [ %g4 + 0xf8 ], %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; 200bc38: 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++) { 200bc3c: 82 00 60 01 inc %g1 200bc40: 80 a0 40 03 cmp %g1, %g3 200bc44: 12 bf ff fc bne 200bc34 <_Scheduler_CBS_Initialize+0x3c> 200bc48: c0 22 00 02 clr [ %o0 + %g2 ] _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; 200bc4c: 81 c7 e0 08 ret 200bc50: 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; 200bc54: 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; } 200bc58: 81 c7 e0 08 ret <== NOT EXECUTED 200bc5c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200a780 <_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; 200a780: c2 02 20 88 ld [ %o0 + 0x88 ], %g1 if (deadline) { 200a784: 80 a2 60 00 cmp %o1, 0 200a788: 02 80 00 11 be 200a7cc <_Scheduler_CBS_Release_job+0x4c> 200a78c: c2 00 60 18 ld [ %g1 + 0x18 ], %g1 /* Initializing or shifting deadline. */ if (serv_info) 200a790: 80 a0 60 00 cmp %g1, 0 200a794: 02 80 00 13 be 200a7e0 <_Scheduler_CBS_Release_job+0x60> 200a798: 07 00 80 7b sethi %hi(0x201ec00), %g3 new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline) 200a79c: c4 00 60 04 ld [ %g1 + 4 ], %g2 200a7a0: d2 00 e3 b8 ld [ %g3 + 0x3b8 ], %o1 200a7a4: 92 02 40 02 add %o1, %g2, %o1 200a7a8: 05 20 00 00 sethi %hi(0x80000000), %g2 200a7ac: 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; 200a7b0: c2 00 60 08 ld [ %g1 + 8 ], %g1 200a7b4: c2 22 20 74 st %g1, [ %o0 + 0x74 ] the_thread->real_priority = new_priority; 200a7b8: d2 22 20 18 st %o1, [ %o0 + 0x18 ] _Thread_Change_priority(the_thread, new_priority, true); 200a7bc: 94 10 20 01 mov 1, %o2 200a7c0: 82 13 c0 00 mov %o7, %g1 200a7c4: 40 00 01 43 call 200acd0 <_Thread_Change_priority> 200a7c8: 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) 200a7cc: 80 a0 60 00 cmp %g1, 0 200a7d0: 12 bf ff f8 bne 200a7b0 <_Scheduler_CBS_Release_job+0x30> <== ALWAYS TAKEN 200a7d4: d2 02 20 ac ld [ %o0 + 0xac ], %o1 the_thread->cpu_time_budget = serv_info->parameters.budget; the_thread->real_priority = new_priority; 200a7d8: 10 bf ff f9 b 200a7bc <_Scheduler_CBS_Release_job+0x3c> <== NOT EXECUTED 200a7dc: 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) 200a7e0: 03 00 80 7b sethi %hi(0x201ec00), %g1 200a7e4: c2 00 63 b8 ld [ %g1 + 0x3b8 ], %g1 ! 201efb8 <_Watchdog_Ticks_since_boot> 200a7e8: 92 02 40 01 add %o1, %g1, %o1 200a7ec: 03 20 00 00 sethi %hi(0x80000000), %g1 200a7f0: 10 bf ff f2 b 200a7b8 <_Scheduler_CBS_Release_job+0x38> 200a7f4: 92 2a 40 01 andn %o1, %g1, %o1 =============================================================================== 0200a7f8 <_Scheduler_CBS_Unblock>: #include void _Scheduler_CBS_Unblock( Thread_Control *the_thread ) { 200a7f8: 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); 200a7fc: 40 00 00 5b call 200a968 <_Scheduler_EDF_Enqueue> 200a800: 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; 200a804: c2 06 20 88 ld [ %i0 + 0x88 ], %g1 200a808: 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) { 200a80c: 80 a7 60 00 cmp %i5, 0 200a810: 02 80 00 19 be 200a874 <_Scheduler_CBS_Unblock+0x7c> 200a814: 03 00 80 7b sethi %hi(0x201ec00), %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 ) { 200a818: 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 - 200a81c: d0 00 63 b8 ld [ %g1 + 0x3b8 ], %o0 200a820: f8 06 20 18 ld [ %i0 + 0x18 ], %i4 _Watchdog_Ticks_since_boot; if ( deadline*budget_left > budget*deadline_left ) { 200a824: 40 00 3e 1b call 201a090 <.umul> 200a828: 90 27 00 08 sub %i4, %o0, %o0 200a82c: d2 06 20 74 ld [ %i0 + 0x74 ], %o1 200a830: b6 10 00 08 mov %o0, %i3 200a834: 40 00 3e 17 call 201a090 <.umul> 200a838: d0 07 60 08 ld [ %i5 + 8 ], %o0 200a83c: 80 a6 c0 08 cmp %i3, %o0 200a840: 24 80 00 0e ble,a 200a878 <_Scheduler_CBS_Unblock+0x80> 200a844: 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; 200a848: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 200a84c: 80 a7 00 09 cmp %i4, %o1 200a850: 32 80 00 02 bne,a 200a858 <_Scheduler_CBS_Unblock+0x60> 200a854: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 200a858: d0 06 20 14 ld [ %i0 + 0x14 ], %o0 200a85c: 80 a2 00 09 cmp %o0, %o1 200a860: 02 80 00 07 be 200a87c <_Scheduler_CBS_Unblock+0x84> 200a864: 3b 00 80 7c sethi %hi(0x201f000), %i5 _Thread_Change_priority(the_thread, new_priority, true); 200a868: 90 10 00 18 mov %i0, %o0 200a86c: 40 00 01 19 call 200acd0 <_Thread_Change_priority> 200a870: 94 10 20 01 mov 1, %o2 200a874: 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, 200a878: 3b 00 80 7c sethi %hi(0x201f000), %i5 200a87c: ba 17 60 e0 or %i5, 0xe0, %i5 ! 201f0e0 <_Per_CPU_Information> 200a880: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200a884: d2 00 60 14 ld [ %g1 + 0x14 ], %o1 200a888: 03 00 80 78 sethi %hi(0x201e000), %g1 200a88c: c2 00 62 00 ld [ %g1 + 0x200 ], %g1 ! 201e200 <_Scheduler+0x30> 200a890: 9f c0 40 00 call %g1 200a894: 01 00 00 00 nop 200a898: 80 a2 20 00 cmp %o0, 0 200a89c: 04 80 00 0a ble 200a8c4 <_Scheduler_CBS_Unblock+0xcc> 200a8a0: 01 00 00 00 nop _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 200a8a4: c2 07 60 0c ld [ %i5 + 0xc ], %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; 200a8a8: f0 27 60 10 st %i0, [ %i5 + 0x10 ] if ( _Thread_Executing->is_preemptible || 200a8ac: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 200a8b0: 80 a0 60 00 cmp %g1, 0 200a8b4: 22 80 00 06 be,a 200a8cc <_Scheduler_CBS_Unblock+0xd4> 200a8b8: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a8bc: 82 10 20 01 mov 1, %g1 200a8c0: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] 200a8c4: 81 c7 e0 08 ret 200a8c8: 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 || 200a8cc: 80 a0 60 00 cmp %g1, 0 200a8d0: 12 bf ff fd bne 200a8c4 <_Scheduler_CBS_Unblock+0xcc> <== ALWAYS TAKEN 200a8d4: 82 10 20 01 mov 1, %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a8d8: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED 200a8dc: 30 bf ff fa b,a 200a8c4 <_Scheduler_CBS_Unblock+0xcc> <== NOT EXECUTED =============================================================================== 0200a8e0 <_Scheduler_EDF_Allocate>: #include void *_Scheduler_EDF_Allocate( Thread_Control *the_thread ) { 200a8e0: 9d e3 bf a0 save %sp, -96, %sp void *sched; Scheduler_EDF_Per_thread *schinfo; sched = _Workspace_Allocate( sizeof(Scheduler_EDF_Per_thread) ); 200a8e4: 40 00 06 c2 call 200c3ec <_Workspace_Allocate> 200a8e8: 90 10 20 18 mov 0x18, %o0 if ( sched ) { 200a8ec: 80 a2 20 00 cmp %o0, 0 200a8f0: 02 80 00 05 be 200a904 <_Scheduler_EDF_Allocate+0x24> <== NEVER TAKEN 200a8f4: 82 10 20 02 mov 2, %g1 the_thread->scheduler_info = sched; 200a8f8: d0 26 20 88 st %o0, [ %i0 + 0x88 ] schinfo = (Scheduler_EDF_Per_thread *)(the_thread->scheduler_info); schinfo->thread = the_thread; 200a8fc: f0 22 00 00 st %i0, [ %o0 ] schinfo->queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN; 200a900: c2 22 20 14 st %g1, [ %o0 + 0x14 ] } return sched; } 200a904: 81 c7 e0 08 ret 200a908: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200a964 <_Scheduler_EDF_Unblock>: #include void _Scheduler_EDF_Unblock( Thread_Control *the_thread ) { 200a964: 9d e3 bf a0 save %sp, -96, %sp _Scheduler_EDF_Enqueue(the_thread); 200a968: 7f ff ff a8 call 200a808 <_Scheduler_EDF_Enqueue> 200a96c: 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( 200a970: 3b 00 80 7c sethi %hi(0x201f000), %i5 200a974: ba 17 60 30 or %i5, 0x30, %i5 ! 201f030 <_Per_CPU_Information> 200a978: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200a97c: d0 00 60 14 ld [ %g1 + 0x14 ], %o0 200a980: 03 00 80 78 sethi %hi(0x201e000), %g1 200a984: c2 00 61 60 ld [ %g1 + 0x160 ], %g1 ! 201e160 <_Scheduler+0x30> 200a988: 9f c0 40 00 call %g1 200a98c: d2 06 20 14 ld [ %i0 + 0x14 ], %o1 200a990: 80 a2 20 00 cmp %o0, 0 200a994: 26 80 00 04 bl,a 200a9a4 <_Scheduler_EDF_Unblock+0x40> 200a998: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200a99c: 81 c7 e0 08 ret 200a9a0: 81 e8 00 00 restore _Thread_Heir->current_priority, the_thread->current_priority )) { _Thread_Heir = the_thread; 200a9a4: f0 27 60 10 st %i0, [ %i5 + 0x10 ] if ( _Thread_Executing->is_preemptible || 200a9a8: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 200a9ac: 80 a0 60 00 cmp %g1, 0 200a9b0: 22 80 00 06 be,a 200a9c8 <_Scheduler_EDF_Unblock+0x64> 200a9b4: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a9b8: 82 10 20 01 mov 1, %g1 200a9bc: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] 200a9c0: 81 c7 e0 08 ret 200a9c4: 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 || 200a9c8: 80 a0 60 00 cmp %g1, 0 200a9cc: 12 bf ff f4 bne 200a99c <_Scheduler_EDF_Unblock+0x38> <== ALWAYS TAKEN 200a9d0: 82 10 20 01 mov 1, %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a9d4: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED 200a9d8: 30 bf ff fa b,a 200a9c0 <_Scheduler_EDF_Unblock+0x5c> <== NOT EXECUTED =============================================================================== 0200a974 <_Scheduler_simple_Ready_queue_enqueue_first>: { Chain_Control *ready; Chain_Node *the_node; Thread_Control *current; ready = (Chain_Control *)_Scheduler.information; 200a974: 03 00 80 75 sethi %hi(0x201d400), %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200a978: c2 00 61 e0 ld [ %g1 + 0x1e0 ], %g1 ! 201d5e0 <_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 ) { 200a97c: c6 02 20 14 ld [ %o0 + 0x14 ], %g3 200a980: c2 00 40 00 ld [ %g1 ], %g1 200a984: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 200a988: 80 a0 80 03 cmp %g2, %g3 200a98c: 3a 80 00 08 bcc,a 200a9ac <_Scheduler_simple_Ready_queue_enqueue_first+0x38> 200a990: 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 ) { 200a994: 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 ) { 200a998: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 200a99c: 80 a0 80 03 cmp %g2, %g3 200a9a0: 2a bf ff fe bcs,a 200a998 <_Scheduler_simple_Ready_queue_enqueue_first+0x24><== NEVER TAKEN 200a9a4: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED current = (Thread_Control *)current->Object.Node.previous; 200a9a8: c2 00 60 04 ld [ %g1 + 4 ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 200a9ac: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 200a9b0: c2 22 20 04 st %g1, [ %o0 + 4 ] before_node = after_node->next; after_node->next = the_node; 200a9b4: d0 20 40 00 st %o0, [ %g1 ] the_node->next = before_node; 200a9b8: c4 22 00 00 st %g2, [ %o0 ] before_node->previous = the_node; 200a9bc: 81 c3 e0 08 retl 200a9c0: d0 20 a0 04 st %o0, [ %g2 + 4 ] =============================================================================== 02008a70 <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 2008a70: 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(); 2008a74: 03 00 80 7a sethi %hi(0x201e800), %g1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 2008a78: d2 00 63 7c ld [ %g1 + 0x37c ], %o1 ! 201eb7c 2008a7c: 11 00 03 d0 sethi %hi(0xf4000), %o0 2008a80: 40 00 47 34 call 201a750 <.udiv> 2008a84: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 2008a88: 80 a6 20 00 cmp %i0, 0 2008a8c: 02 80 00 2c be 2008b3c <_TOD_Validate+0xcc> <== NEVER TAKEN 2008a90: 82 10 20 00 clr %g1 2008a94: c4 06 20 18 ld [ %i0 + 0x18 ], %g2 2008a98: 80 a2 00 02 cmp %o0, %g2 2008a9c: 28 80 00 26 bleu,a 2008b34 <_TOD_Validate+0xc4> 2008aa0: b0 08 60 01 and %g1, 1, %i0 (the_tod->ticks >= ticks_per_second) || 2008aa4: c4 06 20 14 ld [ %i0 + 0x14 ], %g2 2008aa8: 80 a0 a0 3b cmp %g2, 0x3b 2008aac: 38 80 00 22 bgu,a 2008b34 <_TOD_Validate+0xc4> 2008ab0: b0 08 60 01 and %g1, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 2008ab4: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 2008ab8: 80 a0 a0 3b cmp %g2, 0x3b 2008abc: 38 80 00 1e bgu,a 2008b34 <_TOD_Validate+0xc4> 2008ac0: b0 08 60 01 and %g1, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 2008ac4: c4 06 20 0c ld [ %i0 + 0xc ], %g2 2008ac8: 80 a0 a0 17 cmp %g2, 0x17 2008acc: 38 80 00 1a bgu,a 2008b34 <_TOD_Validate+0xc4> 2008ad0: b0 08 60 01 and %g1, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 2008ad4: 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) || 2008ad8: 80 a0 a0 00 cmp %g2, 0 2008adc: 02 80 00 15 be 2008b30 <_TOD_Validate+0xc0> <== NEVER TAKEN 2008ae0: 80 a0 a0 0c cmp %g2, 0xc (the_tod->month == 0) || 2008ae4: 38 80 00 14 bgu,a 2008b34 <_TOD_Validate+0xc4> 2008ae8: b0 08 60 01 and %g1, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2008aec: 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) || 2008af0: 80 a0 e7 c3 cmp %g3, 0x7c3 2008af4: 28 80 00 10 bleu,a 2008b34 <_TOD_Validate+0xc4> 2008af8: b0 08 60 01 and %g1, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 2008afc: 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) || 2008b00: 80 a1 20 00 cmp %g4, 0 2008b04: 02 80 00 0b be 2008b30 <_TOD_Validate+0xc0> <== NEVER TAKEN 2008b08: 80 88 e0 03 btst 3, %g3 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 2008b0c: 32 80 00 0f bne,a 2008b48 <_TOD_Validate+0xd8> 2008b10: 85 28 a0 02 sll %g2, 2, %g2 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 2008b14: 82 00 a0 0d add %g2, 0xd, %g1 2008b18: 05 00 80 75 sethi %hi(0x201d400), %g2 2008b1c: 83 28 60 02 sll %g1, 2, %g1 2008b20: 84 10 a3 78 or %g2, 0x378, %g2 2008b24: 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 ) 2008b28: 80 a0 40 04 cmp %g1, %g4 2008b2c: 82 60 3f ff subx %g0, -1, %g1 return false; return true; } 2008b30: b0 08 60 01 and %g1, 1, %i0 2008b34: 81 c7 e0 08 ret 2008b38: 81 e8 00 00 restore 2008b3c: b0 08 60 01 and %g1, 1, %i0 <== NOT EXECUTED 2008b40: 81 c7 e0 08 ret <== NOT EXECUTED 2008b44: 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 ]; 2008b48: 03 00 80 75 sethi %hi(0x201d400), %g1 2008b4c: 82 10 63 78 or %g1, 0x378, %g1 ! 201d778 <_TOD_Days_per_month> 2008b50: c2 00 40 02 ld [ %g1 + %g2 ], %g1 if ( the_tod->day > days_in_month ) 2008b54: 80 a0 40 04 cmp %g1, %g4 2008b58: 10 bf ff f6 b 2008b30 <_TOD_Validate+0xc0> 2008b5c: 82 60 3f ff subx %g0, -1, %g1 =============================================================================== 0200a384 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 200a384: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 200a388: 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 ); 200a38c: 40 00 03 a7 call 200b228 <_Thread_Set_transient> 200a390: 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 ) 200a394: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200a398: 80 a0 40 19 cmp %g1, %i1 200a39c: 02 80 00 05 be 200a3b0 <_Thread_Change_priority+0x2c> 200a3a0: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 200a3a4: 90 10 00 18 mov %i0, %o0 200a3a8: 40 00 03 86 call 200b1c0 <_Thread_Set_priority> 200a3ac: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 200a3b0: 7f ff e0 ed call 2002764 200a3b4: 01 00 00 00 nop 200a3b8: 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; 200a3bc: f8 07 60 10 ld [ %i5 + 0x10 ], %i4 if ( state != STATES_TRANSIENT ) { 200a3c0: 80 a7 20 04 cmp %i4, 4 200a3c4: 02 80 00 18 be 200a424 <_Thread_Change_priority+0xa0> 200a3c8: 80 8e e0 04 btst 4, %i3 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 200a3cc: 02 80 00 0b be 200a3f8 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN 200a3d0: 82 0f 3f fb and %i4, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 200a3d4: 7f ff e0 e8 call 2002774 <== NOT EXECUTED 200a3d8: 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); 200a3dc: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 200a3e0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 200a3e4: 80 8f 00 01 btst %i4, %g1 <== NOT EXECUTED 200a3e8: 32 80 00 0d bne,a 200a41c <_Thread_Change_priority+0x98> <== NOT EXECUTED 200a3ec: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED 200a3f0: 81 c7 e0 08 ret 200a3f4: 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 ); 200a3f8: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 200a3fc: 7f ff e0 de call 2002774 200a400: 90 10 00 19 mov %i1, %o0 200a404: 03 00 00 ef sethi %hi(0x3bc00), %g1 200a408: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 200a40c: 80 8f 00 01 btst %i4, %g1 200a410: 02 bf ff f8 be 200a3f0 <_Thread_Change_priority+0x6c> 200a414: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 200a418: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 200a41c: 40 00 03 38 call 200b0fc <_Thread_queue_Requeue> 200a420: 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 ) ) { 200a424: 22 80 00 1a be,a 200a48c <_Thread_Change_priority+0x108> <== ALWAYS TAKEN 200a428: c0 27 60 10 clr [ %i5 + 0x10 ] 200a42c: 39 00 80 71 sethi %hi(0x201c400), %i4 <== NOT EXECUTED 200a430: b8 17 21 c0 or %i4, 0x1c0, %i4 ! 201c5c0 <_Scheduler> <== NOT EXECUTED _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 200a434: 7f ff e0 d0 call 2002774 200a438: 90 10 00 19 mov %i1, %o0 200a43c: 7f ff e0 ca call 2002764 200a440: 01 00 00 00 nop 200a444: 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(); 200a448: c2 07 20 08 ld [ %i4 + 8 ], %g1 200a44c: 9f c0 40 00 call %g1 200a450: 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 ); 200a454: 03 00 80 75 sethi %hi(0x201d400), %g1 200a458: 82 10 60 50 or %g1, 0x50, %g1 ! 201d450 <_Per_CPU_Information> 200a45c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 * We altered the set of thread priorities. So let's figure out * who is the heir and if we need to switch to them. */ _Scheduler_Schedule(); if ( !_Thread_Is_executing_also_the_heir() && 200a460: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200a464: 80 a0 80 03 cmp %g2, %g3 200a468: 02 80 00 07 be 200a484 <_Thread_Change_priority+0x100> 200a46c: 01 00 00 00 nop 200a470: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2 200a474: 80 a0 a0 00 cmp %g2, 0 200a478: 02 80 00 03 be 200a484 <_Thread_Change_priority+0x100> 200a47c: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 200a480: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 200a484: 7f ff e0 bc call 2002774 200a488: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 200a48c: 39 00 80 71 sethi %hi(0x201c400), %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 ) 200a490: 80 a6 a0 00 cmp %i2, 0 200a494: 02 80 00 06 be 200a4ac <_Thread_Change_priority+0x128> 200a498: b8 17 21 c0 or %i4, 0x1c0, %i4 200a49c: c2 07 20 28 ld [ %i4 + 0x28 ], %g1 200a4a0: 9f c0 40 00 call %g1 200a4a4: 90 10 00 1d mov %i5, %o0 200a4a8: 30 bf ff e3 b,a 200a434 <_Thread_Change_priority+0xb0> */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 200a4ac: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 200a4b0: 9f c0 40 00 call %g1 200a4b4: 90 10 00 1d mov %i5, %o0 200a4b8: 30 bf ff df b,a 200a434 <_Thread_Change_priority+0xb0> =============================================================================== 0200a6d8 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 200a6d8: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200a6dc: 90 10 00 18 mov %i0, %o0 200a6e0: 40 00 00 77 call 200a8bc <_Thread_Get> 200a6e4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200a6e8: c2 07 bf fc ld [ %fp + -4 ], %g1 200a6ec: 80 a0 60 00 cmp %g1, 0 200a6f0: 12 80 00 09 bne 200a714 <_Thread_Delay_ended+0x3c> <== NEVER TAKEN 200a6f4: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 200a6f8: 7f ff ff 71 call 200a4bc <_Thread_Clear_state> 200a6fc: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 200a700: 03 00 80 74 sethi %hi(0x201d000), %g1 200a704: c4 00 62 30 ld [ %g1 + 0x230 ], %g2 ! 201d230 <_Thread_Dispatch_disable_level> 200a708: 84 00 bf ff add %g2, -1, %g2 200a70c: c4 20 62 30 st %g2, [ %g1 + 0x230 ] return _Thread_Dispatch_disable_level; 200a710: c2 00 62 30 ld [ %g1 + 0x230 ], %g1 200a714: 81 c7 e0 08 ret 200a718: 81 e8 00 00 restore =============================================================================== 0200a71c <_Thread_Dispatch>: * INTERRUPT LATENCY: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 200a71c: 9d e3 bf 98 save %sp, -104, %sp * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200a720: 27 00 80 74 sethi %hi(0x201d000), %l3 200a724: c2 04 e2 30 ld [ %l3 + 0x230 ], %g1 ! 201d230 <_Thread_Dispatch_disable_level> 200a728: 82 00 60 01 inc %g1 200a72c: c2 24 e2 30 st %g1, [ %l3 + 0x230 ] return _Thread_Dispatch_disable_level; 200a730: c2 04 e2 30 ld [ %l3 + 0x230 ], %g1 #endif /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; 200a734: 31 00 80 75 sethi %hi(0x201d400), %i0 200a738: b0 16 20 50 or %i0, 0x50, %i0 ! 201d450 <_Per_CPU_Information> _ISR_Disable( level ); 200a73c: 7f ff e0 0a call 2002764 200a740: f2 06 20 0c ld [ %i0 + 0xc ], %i1 while ( _Thread_Dispatch_necessary == true ) { 200a744: c2 0e 20 18 ldub [ %i0 + 0x18 ], %g1 200a748: 80 a0 60 00 cmp %g1, 0 200a74c: 02 80 00 45 be 200a860 <_Thread_Dispatch+0x144> 200a750: 01 00 00 00 nop heir = _Thread_Heir; 200a754: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 _Thread_Dispatch_necessary = false; 200a758: c0 2e 20 18 clrb [ %i0 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 200a75c: 80 a6 40 10 cmp %i1, %l0 200a760: 02 80 00 40 be 200a860 <_Thread_Dispatch+0x144> 200a764: e0 26 20 0c st %l0, [ %i0 + 0xc ] 200a768: 25 00 80 74 sethi %hi(0x201d000), %l2 #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; 200a76c: 29 00 80 74 sethi %hi(0x201d000), %l4 200a770: a4 14 a2 ac or %l2, 0x2ac, %l2 #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 ); 200a774: 10 80 00 35 b 200a848 <_Thread_Dispatch+0x12c> 200a778: 23 00 80 74 sethi %hi(0x201d000), %l1 _ISR_Enable( level ); 200a77c: 7f ff df fe call 2002774 200a780: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 200a784: 40 00 0b f2 call 200d74c <_TOD_Get_uptime> 200a788: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_Subtract( 200a78c: c4 1f bf f8 ldd [ %fp + -8 ], %g2 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 200a790: f4 1e 20 20 ldd [ %i0 + 0x20 ], %i2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 200a794: f8 1e 60 80 ldd [ %i1 + 0x80 ], %i4 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 200a798: c2 04 80 00 ld [ %l2 ], %g1 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 200a79c: b6 a0 c0 1b subcc %g3, %i3, %i3 200a7a0: b4 60 80 1a subx %g2, %i2, %i2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 200a7a4: ba 87 40 1b addcc %i5, %i3, %i5 200a7a8: b8 47 00 1a addx %i4, %i2, %i4 200a7ac: f8 3e 60 80 std %i4, [ %i1 + 0x80 ] 200a7b0: 80 a0 60 00 cmp %g1, 0 200a7b4: 02 80 00 06 be 200a7cc <_Thread_Dispatch+0xb0> <== NEVER TAKEN 200a7b8: c4 3e 20 20 std %g2, [ %i0 + 0x20 ] executing->libc_reent = *_Thread_libc_reent; 200a7bc: c4 00 40 00 ld [ %g1 ], %g2 200a7c0: c4 26 61 4c st %g2, [ %i1 + 0x14c ] *_Thread_libc_reent = heir->libc_reent; 200a7c4: c4 04 21 4c ld [ %l0 + 0x14c ], %g2 200a7c8: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 200a7cc: 90 10 00 19 mov %i1, %o0 200a7d0: 40 00 03 91 call 200b614 <_User_extensions_Thread_switch> 200a7d4: 92 10 00 10 mov %l0, %o1 if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 200a7d8: 90 06 60 c0 add %i1, 0xc0, %o0 200a7dc: 40 00 04 d8 call 200bb3c <_CPU_Context_switch> 200a7e0: 92 04 20 c0 add %l0, 0xc0, %o1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200a7e4: c2 06 61 48 ld [ %i1 + 0x148 ], %g1 200a7e8: 80 a0 60 00 cmp %g1, 0 200a7ec: 02 80 00 0c be 200a81c <_Thread_Dispatch+0x100> 200a7f0: d0 04 62 a8 ld [ %l1 + 0x2a8 ], %o0 200a7f4: 80 a6 40 08 cmp %i1, %o0 200a7f8: 02 80 00 09 be 200a81c <_Thread_Dispatch+0x100> 200a7fc: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200a800: 02 80 00 04 be 200a810 <_Thread_Dispatch+0xf4> 200a804: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200a808: 40 00 04 93 call 200ba54 <_CPU_Context_save_fp> 200a80c: 90 02 21 48 add %o0, 0x148, %o0 _Context_Restore_fp( &executing->fp_context ); 200a810: 40 00 04 ae call 200bac8 <_CPU_Context_restore_fp> 200a814: 90 06 61 48 add %i1, 0x148, %o0 _Thread_Allocated_fp = executing; 200a818: f2 24 62 a8 st %i1, [ %l1 + 0x2a8 ] #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 200a81c: 7f ff df d2 call 2002764 200a820: f2 06 20 0c ld [ %i0 + 0xc ], %i1 /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 200a824: c2 0e 20 18 ldub [ %i0 + 0x18 ], %g1 200a828: 80 a0 60 00 cmp %g1, 0 200a82c: 02 80 00 0d be 200a860 <_Thread_Dispatch+0x144> 200a830: 01 00 00 00 nop heir = _Thread_Heir; 200a834: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 _Thread_Dispatch_necessary = false; 200a838: c0 2e 20 18 clrb [ %i0 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 200a83c: 80 a4 00 19 cmp %l0, %i1 200a840: 02 80 00 08 be 200a860 <_Thread_Dispatch+0x144> <== NEVER TAKEN 200a844: e0 26 20 0c st %l0, [ %i0 + 0xc ] */ #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) 200a848: c2 04 20 78 ld [ %l0 + 0x78 ], %g1 200a84c: 80 a0 60 01 cmp %g1, 1 200a850: 12 bf ff cb bne 200a77c <_Thread_Dispatch+0x60> 200a854: c2 05 21 90 ld [ %l4 + 0x190 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 200a858: 10 bf ff c9 b 200a77c <_Thread_Dispatch+0x60> 200a85c: c2 24 20 74 st %g1, [ %l0 + 0x74 ] _ISR_Disable( level ); } post_switch: _ISR_Enable( level ); 200a860: 7f ff df c5 call 2002774 200a864: 01 00 00 00 nop * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 200a868: c2 04 e2 30 ld [ %l3 + 0x230 ], %g1 200a86c: 82 00 7f ff add %g1, -1, %g1 200a870: c2 24 e2 30 st %g1, [ %l3 + 0x230 ] return _Thread_Dispatch_disable_level; 200a874: c2 04 e2 30 ld [ %l3 + 0x230 ], %g1 _Thread_Unnest_dispatch(); _API_extensions_Run_postswitch(); 200a878: 7f ff f7 ad call 200872c <_API_extensions_Run_postswitch> 200a87c: 01 00 00 00 nop 200a880: 81 c7 e0 08 ret 200a884: 81 e8 00 00 restore =============================================================================== 0200f794 <_Thread_Handler>: * Input parameters: NONE * * Output parameters: NONE */ void _Thread_Handler( void ) { 200f794: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static bool doneConstructors; bool doCons; #endif executing = _Thread_Executing; 200f798: 03 00 80 75 sethi %hi(0x201d400), %g1 200f79c: fa 00 60 5c ld [ %g1 + 0x5c ], %i5 ! 201d45c <_Per_CPU_Information+0xc> /* * Some CPUs need to tinker with the call frame or registers when the * thread actually begins to execute for the first time. This is a * hook point where the port gets a shot at doing whatever it requires. */ _Context_Initialization_at_thread_begin(); 200f7a0: 3f 00 80 3d sethi %hi(0x200f400), %i7 200f7a4: be 17 e3 94 or %i7, 0x394, %i7 ! 200f794 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 200f7a8: d0 07 60 a8 ld [ %i5 + 0xa8 ], %o0 _ISR_Set_level(level); 200f7ac: 7f ff cb f2 call 2002774 200f7b0: 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) && 200f7b4: c4 07 61 48 ld [ %i5 + 0x148 ], %g2 doCons = !doneConstructors && _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API; if (doCons) doneConstructors = true; #else doCons = !doneConstructors; 200f7b8: 03 00 80 73 sethi %hi(0x201cc00), %g1 doneConstructors = true; 200f7bc: 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; 200f7c0: f6 08 62 38 ldub [ %g1 + 0x238 ], %i3 #endif #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200f7c4: 80 a0 a0 00 cmp %g2, 0 200f7c8: 02 80 00 0c be 200f7f8 <_Thread_Handler+0x64> 200f7cc: c6 28 62 38 stb %g3, [ %g1 + 0x238 ] #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 ); 200f7d0: 39 00 80 74 sethi %hi(0x201d000), %i4 200f7d4: d0 07 22 a8 ld [ %i4 + 0x2a8 ], %o0 ! 201d2a8 <_Thread_Allocated_fp> 200f7d8: 80 a7 40 08 cmp %i5, %o0 200f7dc: 02 80 00 07 be 200f7f8 <_Thread_Handler+0x64> 200f7e0: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200f7e4: 22 80 00 05 be,a 200f7f8 <_Thread_Handler+0x64> 200f7e8: fa 27 22 a8 st %i5, [ %i4 + 0x2a8 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200f7ec: 7f ff f0 9a call 200ba54 <_CPU_Context_save_fp> 200f7f0: 90 02 21 48 add %o0, 0x148, %o0 _Thread_Allocated_fp = executing; 200f7f4: fa 27 22 a8 st %i5, [ %i4 + 0x2a8 ] /* * Take care that 'begin' extensions get to complete before * 'switch' extensions can run. This means must keep dispatch * disabled until all 'begin' extensions complete. */ _User_extensions_Thread_begin( executing ); 200f7f8: 7f ff ef 06 call 200b410 <_User_extensions_Thread_begin> 200f7fc: 90 10 00 1d mov %i5, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 200f800: 7f ff ec 22 call 200a888 <_Thread_Enable_dispatch> 200f804: 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) */ { 200f808: 80 8e e0 ff btst 0xff, %i3 200f80c: 02 80 00 0c be 200f83c <_Thread_Handler+0xa8> 200f810: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200f814: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 200f818: 80 a0 60 00 cmp %g1, 0 200f81c: 22 80 00 0c be,a 200f84c <_Thread_Handler+0xb8> <== ALWAYS TAKEN 200f820: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 * was placed in return_argument. This assumed that if it returned * anything (which is not supporting in all APIs), then it would be * able to fit in a (void *). */ _User_extensions_Thread_exitted( executing ); 200f824: 7f ff ef 0f call 200b460 <_User_extensions_Thread_exitted> 200f828: 90 10 00 1d mov %i5, %o0 _Internal_error_Occurred( 200f82c: 90 10 20 00 clr %o0 200f830: 92 10 20 01 mov 1, %o1 200f834: 7f ff e6 96 call 200928c <_Internal_error_Occurred> 200f838: 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 (); 200f83c: 40 00 33 13 call 201c488 <_init> 200f840: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200f844: 10 bf ff f5 b 200f818 <_Thread_Handler+0x84> 200f848: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 200f84c: 9f c0 40 00 call %g1 200f850: d0 07 60 98 ld [ %i5 + 0x98 ], %o0 #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 200f854: 10 bf ff f4 b 200f824 <_Thread_Handler+0x90> 200f858: d0 27 60 28 st %o0, [ %i5 + 0x28 ] =============================================================================== 0200ab4c <_Thread_Handler_initialization>: * * Output parameters: NONE */ void _Thread_Handler_initialization(void) { 200ab4c: 9d e3 bf 98 save %sp, -104, %sp uint32_t ticks_per_timeslice = 200ab50: 03 00 80 71 sethi %hi(0x201c400), %g1 200ab54: 82 10 60 cc or %g1, 0xcc, %g1 ! 201c4cc #if defined(RTEMS_MULTIPROCESSING) uint32_t maximum_proxies = _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || 200ab58: c6 00 60 2c ld [ %g1 + 0x2c ], %g3 * Output parameters: NONE */ void _Thread_Handler_initialization(void) { uint32_t ticks_per_timeslice = 200ab5c: fa 00 60 18 ld [ %g1 + 0x18 ], %i5 rtems_configuration_get_ticks_per_timeslice(); uint32_t maximum_extensions = 200ab60: f8 00 60 0c ld [ %g1 + 0xc ], %i4 #if defined(RTEMS_MULTIPROCESSING) uint32_t maximum_proxies = _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || 200ab64: 80 a0 e0 00 cmp %g3, 0 200ab68: 02 80 00 21 be 200abec <_Thread_Handler_initialization+0xa0> 200ab6c: c4 00 60 28 ld [ %g1 + 0x28 ], %g2 200ab70: c6 00 60 30 ld [ %g1 + 0x30 ], %g3 200ab74: 80 a0 e0 00 cmp %g3, 0 200ab78: 02 80 00 1d be 200abec <_Thread_Handler_initialization+0xa0><== NEVER TAKEN 200ab7c: 80 a0 a0 00 cmp %g2, 0 INTERNAL_ERROR_CORE, true, INTERNAL_ERROR_BAD_STACK_HOOK ); if ( stack_allocate_init_hook != NULL ) 200ab80: 22 80 00 05 be,a 200ab94 <_Thread_Handler_initialization+0x48> 200ab84: 03 00 80 75 sethi %hi(0x201d400), %g1 (*stack_allocate_init_hook)( rtems_configuration_get_stack_space_size() ); 200ab88: 9f c0 80 00 call %g2 200ab8c: d0 00 60 08 ld [ %g1 + 8 ], %o0 ! 201d408 <_User_extensions_List> _Thread_Dispatch_necessary = false; 200ab90: 03 00 80 75 sethi %hi(0x201d400), %g1 200ab94: 82 10 60 50 or %g1, 0x50, %g1 ! 201d450 <_Per_CPU_Information> 200ab98: c0 28 60 18 clrb [ %g1 + 0x18 ] _Thread_Executing = NULL; 200ab9c: c0 20 60 0c clr [ %g1 + 0xc ] _Thread_Heir = NULL; 200aba0: c0 20 60 10 clr [ %g1 + 0x10 ] #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Thread_Allocated_fp = NULL; 200aba4: 03 00 80 74 sethi %hi(0x201d000), %g1 200aba8: c0 20 62 a8 clr [ %g1 + 0x2a8 ] ! 201d2a8 <_Thread_Allocated_fp> #endif _Thread_Maximum_extensions = maximum_extensions; 200abac: 03 00 80 74 sethi %hi(0x201d000), %g1 200abb0: f8 20 62 b0 st %i4, [ %g1 + 0x2b0 ] ! 201d2b0 <_Thread_Maximum_extensions> _Thread_Ticks_per_timeslice = ticks_per_timeslice; 200abb4: 03 00 80 74 sethi %hi(0x201d000), %g1 200abb8: fa 20 61 90 st %i5, [ %g1 + 0x190 ] ! 201d190 <_Thread_Ticks_per_timeslice> #if defined(RTEMS_MULTIPROCESSING) if ( _System_state_Is_multiprocessing ) maximum_internal_threads += 1; #endif _Objects_Initialize_information( 200abbc: 82 10 20 08 mov 8, %g1 200abc0: 11 00 80 74 sethi %hi(0x201d000), %o0 200abc4: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 200abc8: 90 12 23 30 or %o0, 0x330, %o0 200abcc: 92 10 20 01 mov 1, %o1 200abd0: 94 10 20 01 mov 1, %o2 200abd4: 96 10 20 01 mov 1, %o3 200abd8: 98 10 21 60 mov 0x160, %o4 200abdc: 7f ff fb 4a call 2009904 <_Objects_Initialize_information> 200abe0: 9a 10 20 00 clr %o5 200abe4: 81 c7 e0 08 ret 200abe8: 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( 200abec: 90 10 20 00 clr %o0 200abf0: 92 10 20 01 mov 1, %o1 200abf4: 7f ff f9 a6 call 200928c <_Internal_error_Occurred> 200abf8: 94 10 20 0e mov 0xe, %o2 =============================================================================== 0200a96c <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 200a96c: 9d e3 bf a0 save %sp, -96, %sp 200a970: c2 07 a0 6c ld [ %fp + 0x6c ], %g1 200a974: f4 0f a0 5f ldub [ %fp + 0x5f ], %i2 200a978: e0 00 40 00 ld [ %g1 ], %l0 /* * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; 200a97c: c0 26 61 50 clr [ %i1 + 0x150 ] 200a980: c0 26 61 54 clr [ %i1 + 0x154 ] extensions_area = NULL; the_thread->libc_reent = NULL; 200a984: c0 26 61 4c clr [ %i1 + 0x14c ] /* * Allocate and Initialize the stack for this thread. */ #if !defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); 200a988: 90 10 00 19 mov %i1, %o0 200a98c: 40 00 02 36 call 200b264 <_Thread_Stack_Allocate> 200a990: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 200a994: 80 a2 00 1b cmp %o0, %i3 200a998: 0a 80 00 4b bcs 200aac4 <_Thread_Initialize+0x158> 200a99c: 80 a2 20 00 cmp %o0, 0 200a9a0: 02 80 00 49 be 200aac4 <_Thread_Initialize+0x158> <== NEVER TAKEN 200a9a4: 80 a7 20 00 cmp %i4, 0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 200a9a8: c2 06 60 bc ld [ %i1 + 0xbc ], %g1 the_stack->size = size; 200a9ac: d0 26 60 b0 st %o0, [ %i1 + 0xb0 ] Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 200a9b0: c2 26 60 b4 st %g1, [ %i1 + 0xb4 ] /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { 200a9b4: 12 80 00 48 bne 200aad4 <_Thread_Initialize+0x168> 200a9b8: b6 10 20 00 clr %i3 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 200a9bc: 39 00 80 74 sethi %hi(0x201d000), %i4 200a9c0: c2 07 22 b0 ld [ %i4 + 0x2b0 ], %g1 ! 201d2b0 <_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; 200a9c4: f6 26 61 48 st %i3, [ %i1 + 0x148 ] the_thread->Start.fp_context = fp_area; 200a9c8: f6 26 60 b8 st %i3, [ %i1 + 0xb8 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 200a9cc: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 200a9d0: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 200a9d4: c0 26 60 68 clr [ %i1 + 0x68 ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 200a9d8: 80 a0 60 00 cmp %g1, 0 200a9dc: 12 80 00 46 bne 200aaf4 <_Thread_Initialize+0x188> 200a9e0: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 200a9e4: c0 26 61 58 clr [ %i1 + 0x158 ] * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; extensions_area = NULL; 200a9e8: a2 10 20 00 clr %l1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 200a9ec: c4 07 a0 60 ld [ %fp + 0x60 ], %g2 */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 200a9f0: 03 00 80 71 sethi %hi(0x201c400), %g1 200a9f4: c4 26 60 a0 st %g2, [ %i1 + 0xa0 ] the_thread->Start.budget_callout = budget_callout; 200a9f8: c4 07 a0 64 ld [ %fp + 0x64 ], %g2 200a9fc: c2 00 61 d8 ld [ %g1 + 0x1d8 ], %g1 200aa00: c4 26 60 a4 st %g2, [ %i1 + 0xa4 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 200aa04: c4 07 a0 68 ld [ %fp + 0x68 ], %g2 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 200aa08: f4 2e 60 9c stb %i2, [ %i1 + 0x9c ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 200aa0c: c4 26 60 a8 st %g2, [ %i1 + 0xa8 ] the_thread->current_state = STATES_DORMANT; 200aa10: 84 10 20 01 mov 1, %g2 the_thread->Wait.queue = NULL; 200aa14: c0 26 60 44 clr [ %i1 + 0x44 ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 200aa18: c4 26 60 10 st %g2, [ %i1 + 0x10 ] the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 200aa1c: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 200aa20: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 200aa24: fa 26 60 ac st %i5, [ %i1 + 0xac ] 200aa28: 9f c0 40 00 call %g1 200aa2c: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 200aa30: b8 92 20 00 orcc %o0, 0, %i4 200aa34: 22 80 00 13 be,a 200aa80 <_Thread_Initialize+0x114> 200aa38: d0 06 61 4c ld [ %i1 + 0x14c ], %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 200aa3c: 90 10 00 19 mov %i1, %o0 200aa40: 40 00 01 e0 call 200b1c0 <_Thread_Set_priority> 200aa44: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200aa48: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 200aa4c: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 static inline void _Timestamp64_implementation_Set_to_zero( Timestamp64_Control *_time ) { *_time = 0; 200aa50: c0 26 60 80 clr [ %i1 + 0x80 ] 200aa54: c0 26 60 84 clr [ %i1 + 0x84 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200aa58: 83 28 60 02 sll %g1, 2, %g1 200aa5c: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 200aa60: e0 26 60 0c st %l0, [ %i1 + 0xc ] * enabled when we get here. We want to be able to run the * user extensions with dispatching enabled. The Allocator * Mutex provides sufficient protection to let the user extensions * run safely. */ extension_status = _User_extensions_Thread_create( the_thread ); 200aa64: 90 10 00 19 mov %i1, %o0 200aa68: 40 00 02 a5 call 200b4fc <_User_extensions_Thread_create> 200aa6c: b0 10 20 01 mov 1, %i0 if ( extension_status ) 200aa70: 80 8a 20 ff btst 0xff, %o0 200aa74: 32 80 00 12 bne,a 200aabc <_Thread_Initialize+0x150> 200aa78: b0 0e 20 ff and %i0, 0xff, %i0 return true; failed: _Workspace_Free( the_thread->libc_reent ); 200aa7c: d0 06 61 4c ld [ %i1 + 0x14c ], %o0 200aa80: 40 00 03 e0 call 200ba00 <_Workspace_Free> 200aa84: b0 10 20 00 clr %i0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 200aa88: 40 00 03 de call 200ba00 <_Workspace_Free> 200aa8c: d0 06 61 50 ld [ %i1 + 0x150 ], %o0 200aa90: 40 00 03 dc call 200ba00 <_Workspace_Free> 200aa94: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 _Workspace_Free( extensions_area ); 200aa98: 40 00 03 da call 200ba00 <_Workspace_Free> 200aa9c: 90 10 00 11 mov %l1, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 200aaa0: 40 00 03 d8 call 200ba00 <_Workspace_Free> 200aaa4: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 200aaa8: 40 00 03 d6 call 200ba00 <_Workspace_Free> 200aaac: 90 10 00 1c mov %i4, %o0 _Thread_Stack_Free( the_thread ); 200aab0: 40 00 01 fd call 200b2a4 <_Thread_Stack_Free> 200aab4: 90 10 00 19 mov %i1, %o0 200aab8: b0 0e 20 ff and %i0, 0xff, %i0 200aabc: 81 c7 e0 08 ret 200aac0: 81 e8 00 00 restore * Allocate and Initialize the stack for this thread. */ #if !defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ 200aac4: b0 10 20 00 clr %i0 200aac8: b0 0e 20 ff and %i0, 0xff, %i0 200aacc: 81 c7 e0 08 ret 200aad0: 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 ); 200aad4: 40 00 03 c3 call 200b9e0 <_Workspace_Allocate> 200aad8: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 200aadc: b6 92 20 00 orcc %o0, 0, %i3 200aae0: 32 bf ff b8 bne,a 200a9c0 <_Thread_Initialize+0x54> 200aae4: 39 00 80 74 sethi %hi(0x201d000), %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; 200aae8: a2 10 20 00 clr %l1 size_t actual_stack_size = 0; void *stack = NULL; #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) void *fp_area; #endif void *sched = NULL; 200aaec: 10 bf ff e4 b 200aa7c <_Thread_Initialize+0x110> 200aaf0: b8 10 20 00 clr %i4 /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { extensions_area = _Workspace_Allocate( 200aaf4: 90 00 60 01 add %g1, 1, %o0 200aaf8: 40 00 03 ba call 200b9e0 <_Workspace_Allocate> 200aafc: 91 2a 20 02 sll %o0, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 200ab00: a2 92 20 00 orcc %o0, 0, %l1 200ab04: 02 80 00 10 be 200ab44 <_Thread_Initialize+0x1d8> 200ab08: 86 10 00 11 mov %l1, %g3 goto failed; } the_thread->extensions = (void **) extensions_area; 200ab0c: e2 26 61 58 st %l1, [ %i1 + 0x158 ] 200ab10: c8 07 22 b0 ld [ %i4 + 0x2b0 ], %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++ ) 200ab14: 84 10 20 00 clr %g2 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 200ab18: 10 80 00 03 b 200ab24 <_Thread_Initialize+0x1b8> 200ab1c: 82 10 20 00 clr %g1 200ab20: c6 06 61 58 ld [ %i1 + 0x158 ], %g3 * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) the_thread->extensions[i] = NULL; 200ab24: 85 28 a0 02 sll %g2, 2, %g2 200ab28: 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++ ) 200ab2c: 82 00 60 01 inc %g1 200ab30: 80 a0 40 04 cmp %g1, %g4 200ab34: 08 bf ff fb bleu 200ab20 <_Thread_Initialize+0x1b4> 200ab38: 84 10 00 01 mov %g1, %g2 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 200ab3c: 10 bf ff ad b 200a9f0 <_Thread_Initialize+0x84> 200ab40: c4 07 a0 60 ld [ %fp + 0x60 ], %g2 size_t actual_stack_size = 0; void *stack = NULL; #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) void *fp_area; #endif void *sched = NULL; 200ab44: 10 bf ff ce b 200aa7c <_Thread_Initialize+0x110> 200ab48: b8 10 20 00 clr %i4 =============================================================================== 0200b0fc <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 200b0fc: 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 ) 200b100: 80 a6 20 00 cmp %i0, 0 200b104: 02 80 00 13 be 200b150 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN 200b108: 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 ) { 200b10c: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 200b110: 80 a7 60 01 cmp %i5, 1 200b114: 02 80 00 04 be 200b124 <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN 200b118: 01 00 00 00 nop 200b11c: 81 c7 e0 08 ret <== NOT EXECUTED 200b120: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 200b124: 7f ff dd 90 call 2002764 200b128: 01 00 00 00 nop 200b12c: b8 10 00 08 mov %o0, %i4 200b130: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 200b134: 03 00 00 ef sethi %hi(0x3bc00), %g1 200b138: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 200b13c: 80 88 80 01 btst %g2, %g1 200b140: 12 80 00 06 bne 200b158 <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN 200b144: 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 ); 200b148: 7f ff dd 8b call 2002774 200b14c: 90 10 00 1c mov %i4, %o0 200b150: 81 c7 e0 08 ret 200b154: 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 ); 200b158: 92 10 00 19 mov %i1, %o1 200b15c: 94 10 20 01 mov 1, %o2 200b160: 40 00 0b 73 call 200df2c <_Thread_queue_Extract_priority_helper> 200b164: fa 26 20 30 st %i5, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 200b168: 90 10 00 18 mov %i0, %o0 200b16c: 92 10 00 19 mov %i1, %o1 200b170: 7f ff ff 35 call 200ae44 <_Thread_queue_Enqueue_priority> 200b174: 94 07 bf fc add %fp, -4, %o2 200b178: 30 bf ff f4 b,a 200b148 <_Thread_queue_Requeue+0x4c> =============================================================================== 0200b17c <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 200b17c: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200b180: 90 10 00 18 mov %i0, %o0 200b184: 7f ff fd ce call 200a8bc <_Thread_Get> 200b188: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200b18c: c2 07 bf fc ld [ %fp + -4 ], %g1 200b190: 80 a0 60 00 cmp %g1, 0 200b194: 12 80 00 09 bne 200b1b8 <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN 200b198: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 200b19c: 40 00 0b 9d call 200e010 <_Thread_queue_Process_timeout> 200b1a0: 01 00 00 00 nop * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 200b1a4: 03 00 80 74 sethi %hi(0x201d000), %g1 200b1a8: c4 00 62 30 ld [ %g1 + 0x230 ], %g2 ! 201d230 <_Thread_Dispatch_disable_level> 200b1ac: 84 00 bf ff add %g2, -1, %g2 200b1b0: c4 20 62 30 st %g2, [ %g1 + 0x230 ] return _Thread_Dispatch_disable_level; 200b1b4: c2 00 62 30 ld [ %g1 + 0x230 ], %g1 200b1b8: 81 c7 e0 08 ret 200b1bc: 81 e8 00 00 restore =============================================================================== 02018254 <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 2018254: 9d e3 bf 88 save %sp, -120, %sp 2018258: 21 00 80 ed sethi %hi(0x203b400), %l0 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 201825c: a4 07 bf e8 add %fp, -24, %l2 2018260: b4 07 bf ec add %fp, -20, %i2 2018264: b8 07 bf f4 add %fp, -12, %i4 2018268: a2 07 bf f8 add %fp, -8, %l1 201826c: 33 00 80 ed sethi %hi(0x203b400), %i1 2018270: 27 00 80 ed sethi %hi(0x203b400), %l3 2018274: f4 27 bf e8 st %i2, [ %fp + -24 ] head->previous = NULL; 2018278: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 201827c: 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; 2018280: e2 27 bf f4 st %l1, [ %fp + -12 ] head->previous = NULL; 2018284: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 2018288: f8 27 bf fc st %i4, [ %fp + -4 ] 201828c: a0 14 22 18 or %l0, 0x218, %l0 2018290: b6 06 20 30 add %i0, 0x30, %i3 2018294: b2 16 60 68 or %i1, 0x68, %i1 2018298: ba 06 20 68 add %i0, 0x68, %i5 201829c: a6 14 e1 20 or %l3, 0x120, %l3 20182a0: ac 06 20 08 add %i0, 8, %l6 20182a4: 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; 20182a8: 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; 20182ac: 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; 20182b0: c2 04 00 00 ld [ %l0 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 20182b4: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20182b8: 90 10 00 1b mov %i3, %o0 20182bc: 92 20 40 09 sub %g1, %o1, %o1 20182c0: 94 10 00 1c mov %i4, %o2 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 20182c4: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20182c8: 40 00 12 59 call 201cc2c <_Watchdog_Adjust_to_chain> 20182cc: 01 00 00 00 nop 20182d0: d0 1e 40 00 ldd [ %i1 ], %o0 20182d4: 94 10 20 00 clr %o2 20182d8: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 20182dc: 40 00 4d 92 call 202b924 <__divdi3> 20182e0: 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; 20182e4: 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 ) { 20182e8: 80 a2 40 0a cmp %o1, %o2 20182ec: 18 80 00 2b bgu 2018398 <_Timer_server_Body+0x144> 20182f0: 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 ) { 20182f4: 80 a2 40 0a cmp %o1, %o2 20182f8: 0a 80 00 20 bcs 2018378 <_Timer_server_Body+0x124> 20182fc: 90 10 00 1d mov %i5, %o0 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 2018300: 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 ); 2018304: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2018308: 40 00 02 9f call 2018d84 <_Chain_Get> 201830c: 01 00 00 00 nop if ( timer == NULL ) { 2018310: 92 92 20 00 orcc %o0, 0, %o1 2018314: 02 80 00 10 be 2018354 <_Timer_server_Body+0x100> 2018318: 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 ) { 201831c: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 2018320: 80 a0 60 01 cmp %g1, 1 2018324: 02 80 00 19 be 2018388 <_Timer_server_Body+0x134> 2018328: 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 ) { 201832c: 12 bf ff f6 bne 2018304 <_Timer_server_Body+0xb0> <== NEVER TAKEN 2018330: 92 02 60 10 add %o1, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2018334: 40 00 12 6f call 201ccf0 <_Watchdog_Insert> 2018338: 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 ); 201833c: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2018340: 40 00 02 91 call 2018d84 <_Chain_Get> 2018344: 01 00 00 00 nop if ( timer == NULL ) { 2018348: 92 92 20 00 orcc %o0, 0, %o1 201834c: 32 bf ff f5 bne,a 2018320 <_Timer_server_Body+0xcc> <== NEVER TAKEN 2018350: 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 ); 2018354: 7f ff dd 2f call 200f810 2018358: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 201835c: c2 07 bf e8 ld [ %fp + -24 ], %g1 2018360: 80 a0 40 1a cmp %g1, %i2 2018364: 02 80 00 12 be 20183ac <_Timer_server_Body+0x158> <== ALWAYS TAKEN 2018368: 01 00 00 00 nop ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 201836c: 7f ff dd 2d call 200f820 <== NOT EXECUTED 2018370: 01 00 00 00 nop <== NOT EXECUTED 2018374: 30 bf ff cf b,a 20182b0 <_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 ); 2018378: 92 10 20 01 mov 1, %o1 ! 1 201837c: 40 00 11 fc call 201cb6c <_Watchdog_Adjust> 2018380: 94 22 80 17 sub %o2, %l7, %o2 2018384: 30 bf ff df b,a 2018300 <_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 ); 2018388: 90 10 00 1b mov %i3, %o0 201838c: 40 00 12 59 call 201ccf0 <_Watchdog_Insert> 2018390: 92 02 60 10 add %o1, 0x10, %o1 2018394: 30 bf ff dc b,a 2018304 <_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 ); 2018398: 92 22 40 0a sub %o1, %o2, %o1 201839c: 90 10 00 1d mov %i5, %o0 20183a0: 40 00 12 23 call 201cc2c <_Watchdog_Adjust_to_chain> 20183a4: 94 10 00 1c mov %i4, %o2 20183a8: 30 bf ff d6 b,a 2018300 <_Timer_server_Body+0xac> */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 20183ac: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 20183b0: 7f ff dd 1c call 200f820 20183b4: 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 ) ) { 20183b8: c2 07 bf f4 ld [ %fp + -12 ], %g1 20183bc: 80 a0 40 11 cmp %g1, %l1 20183c0: 12 80 00 0c bne 20183f0 <_Timer_server_Body+0x19c> 20183c4: 01 00 00 00 nop 20183c8: 30 80 00 13 b,a 2018414 <_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; 20183cc: 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; 20183d0: 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; 20183d4: c0 25 e0 08 clr [ %l7 + 8 ] _ISR_Enable( level ); 20183d8: 7f ff dd 12 call 200f820 20183dc: 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 ); 20183e0: d0 05 e0 20 ld [ %l7 + 0x20 ], %o0 20183e4: c2 05 e0 1c ld [ %l7 + 0x1c ], %g1 20183e8: 9f c0 40 00 call %g1 20183ec: 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 ); 20183f0: 7f ff dd 08 call 200f810 20183f4: 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; 20183f8: 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)) 20183fc: 80 a5 c0 11 cmp %l7, %l1 2018400: 32 bf ff f3 bne,a 20183cc <_Timer_server_Body+0x178> 2018404: 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 ); 2018408: 7f ff dd 06 call 200f820 201840c: 01 00 00 00 nop 2018410: 30 bf ff a7 b,a 20182ac <_Timer_server_Body+0x58> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 2018414: c0 2e 20 7c clrb [ %i0 + 0x7c ] * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2018418: c2 04 c0 00 ld [ %l3 ], %g1 201841c: 82 00 60 01 inc %g1 2018420: c2 24 c0 00 st %g1, [ %l3 ] return _Thread_Dispatch_disable_level; 2018424: c2 04 c0 00 ld [ %l3 ], %g1 /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 2018428: d0 06 00 00 ld [ %i0 ], %o0 201842c: 40 00 10 9c call 201c69c <_Thread_Set_state> 2018430: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 2018434: 7f ff ff 05 call 2018048 <_Timer_server_Reset_interval_system_watchdog> 2018438: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 201843c: 7f ff ff 17 call 2018098 <_Timer_server_Reset_tod_system_watchdog> 2018440: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 2018444: 40 00 0e 1c call 201bcb4 <_Thread_Enable_dispatch> 2018448: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 201844c: 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; 2018450: 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 ); 2018454: 40 00 12 86 call 201ce6c <_Watchdog_Remove> 2018458: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 201845c: 40 00 12 84 call 201ce6c <_Watchdog_Remove> 2018460: 90 10 00 15 mov %l5, %o0 2018464: 30 bf ff 92 b,a 20182ac <_Timer_server_Body+0x58> =============================================================================== 020180e8 <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 20180e8: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 20180ec: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 20180f0: 80 a0 60 00 cmp %g1, 0 20180f4: 02 80 00 05 be 2018108 <_Timer_server_Schedule_operation_method+0x20> 20180f8: 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 ); 20180fc: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 2018100: 40 00 03 16 call 2018d58 <_Chain_Append> 2018104: 81 e8 00 00 restore * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2018108: 03 00 80 ed sethi %hi(0x203b400), %g1 201810c: c4 00 61 20 ld [ %g1 + 0x120 ], %g2 ! 203b520 <_Thread_Dispatch_disable_level> 2018110: 84 00 a0 01 inc %g2 2018114: c4 20 61 20 st %g2, [ %g1 + 0x120 ] return _Thread_Dispatch_disable_level; 2018118: c2 00 61 20 ld [ %g1 + 0x120 ], %g1 * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 201811c: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 2018120: 80 a0 60 01 cmp %g1, 1 2018124: 02 80 00 2b be 20181d0 <_Timer_server_Schedule_operation_method+0xe8> 2018128: 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 ) { 201812c: 02 80 00 04 be 201813c <_Timer_server_Schedule_operation_method+0x54> 2018130: 01 00 00 00 nop if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 2018134: 40 00 0e e0 call 201bcb4 <_Thread_Enable_dispatch> 2018138: 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 ); 201813c: 7f ff dd b5 call 200f810 2018140: 01 00 00 00 nop 2018144: b8 10 00 08 mov %o0, %i4 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2018148: 03 00 80 ed sethi %hi(0x203b400), %g1 201814c: d0 18 60 68 ldd [ %g1 + 0x68 ], %o0 ! 203b468 <_TOD> 2018150: 94 10 20 00 clr %o2 2018154: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2018158: 40 00 4d f3 call 202b924 <__divdi3> 201815c: 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; 2018160: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 last_snapshot = ts->TOD_watchdogs.last_snapshot; 2018164: 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 ); 2018168: 86 06 20 6c add %i0, 0x6c, %g3 if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 201816c: 80 a0 40 03 cmp %g1, %g3 2018170: 02 80 00 0a be 2018198 <_Timer_server_Schedule_operation_method+0xb0> 2018174: 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 ) { 2018178: 08 80 00 34 bleu 2018248 <_Timer_server_Schedule_operation_method+0x160> 201817c: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 /* * We advanced in time. */ delta = snapshot - last_snapshot; 2018180: 84 22 40 02 sub %o1, %g2, %g2 if (delta_interval > delta) { 2018184: 80 a1 00 02 cmp %g4, %g2 2018188: 08 80 00 03 bleu 2018194 <_Timer_server_Schedule_operation_method+0xac><== NEVER TAKEN 201818c: 86 10 20 00 clr %g3 delta_interval -= delta; 2018190: 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; 2018194: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 2018198: d2 26 20 74 st %o1, [ %i0 + 0x74 ] _ISR_Enable( level ); 201819c: 7f ff dd a1 call 200f820 20181a0: 90 10 00 1c mov %i4, %o0 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 20181a4: 90 06 20 68 add %i0, 0x68, %o0 20181a8: 40 00 12 d2 call 201ccf0 <_Watchdog_Insert> 20181ac: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 20181b0: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 20181b4: 80 a0 60 00 cmp %g1, 0 20181b8: 12 bf ff df bne 2018134 <_Timer_server_Schedule_operation_method+0x4c> 20181bc: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 20181c0: 7f ff ff b6 call 2018098 <_Timer_server_Reset_tod_system_watchdog> 20181c4: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 20181c8: 40 00 0e bb call 201bcb4 <_Thread_Enable_dispatch> 20181cc: 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 ); 20181d0: 7f ff dd 90 call 200f810 20181d4: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 20181d8: 05 00 80 ed sethi %hi(0x203b400), %g2 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 20181dc: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 20181e0: c4 00 a2 18 ld [ %g2 + 0x218 ], %g2 last_snapshot = ts->Interval_watchdogs.last_snapshot; 20181e4: 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 ); 20181e8: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 20181ec: 80 a0 40 03 cmp %g1, %g3 20181f0: 02 80 00 08 be 2018210 <_Timer_server_Schedule_operation_method+0x128> 20181f4: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 20181f8: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 if (delta_interval > delta) { 20181fc: 80 a1 00 1c cmp %g4, %i4 2018200: 1a 80 00 03 bcc 201820c <_Timer_server_Schedule_operation_method+0x124> 2018204: 86 10 20 00 clr %g3 delta_interval -= delta; 2018208: 86 27 00 04 sub %i4, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 201820c: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 2018210: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 2018214: 7f ff dd 83 call 200f820 2018218: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 201821c: 90 06 20 30 add %i0, 0x30, %o0 2018220: 40 00 12 b4 call 201ccf0 <_Watchdog_Insert> 2018224: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2018228: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 201822c: 80 a0 60 00 cmp %g1, 0 2018230: 12 bf ff c1 bne 2018134 <_Timer_server_Schedule_operation_method+0x4c> 2018234: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 2018238: 7f ff ff 84 call 2018048 <_Timer_server_Reset_interval_system_watchdog> 201823c: 90 10 00 18 mov %i0, %o0 if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 2018240: 40 00 0e 9d call 201bcb4 <_Thread_Enable_dispatch> 2018244: 81 e8 00 00 restore } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 2018248: 84 01 00 02 add %g4, %g2, %g2 delta_interval += delta; 201824c: 10 bf ff d2 b 2018194 <_Timer_server_Schedule_operation_method+0xac> 2018250: 86 20 80 09 sub %g2, %o1, %g3 =============================================================================== 0200acf8 <_Timespec_Divide>: const struct timespec *lhs, const struct timespec *rhs, uint32_t *ival_percentage, uint32_t *fval_percentage ) { 200acf8: 9d e3 bf 90 save %sp, -112, %sp * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200acfc: fa 06 40 00 ld [ %i1 ], %i5 right += rhs->tv_nsec; 200ad00: d6 06 60 04 ld [ %i1 + 4 ], %o3 * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200ad04: b9 3f 60 1f sra %i5, 0x1f, %i4 200ad08: 83 2f 20 03 sll %i4, 3, %g1 200ad0c: 9b 2f 60 03 sll %i5, 3, %o5 200ad10: 85 37 60 1d srl %i5, 0x1d, %g2 200ad14: 98 10 80 01 or %g2, %g1, %o4 200ad18: 83 33 60 1b srl %o5, 0x1b, %g1 200ad1c: ad 2b 20 05 sll %o4, 5, %l6 200ad20: af 2b 60 05 sll %o5, 5, %l7 200ad24: ac 10 40 16 or %g1, %l6, %l6 200ad28: 9a a5 c0 0d subcc %l7, %o5, %o5 200ad2c: 83 33 60 1a srl %o5, 0x1a, %g1 200ad30: 98 65 80 0c subx %l6, %o4, %o4 200ad34: ab 2b 60 06 sll %o5, 6, %l5 200ad38: a9 2b 20 06 sll %o4, 6, %l4 200ad3c: 86 a5 40 0d subcc %l5, %o5, %g3 200ad40: a8 10 40 14 or %g1, %l4, %l4 200ad44: 84 65 00 0c subx %l4, %o4, %g2 200ad48: 86 80 c0 1d addcc %g3, %i5, %g3 200ad4c: 83 30 e0 1e srl %g3, 0x1e, %g1 200ad50: 84 40 80 1c addx %g2, %i4, %g2 200ad54: a7 28 e0 02 sll %g3, 2, %l3 200ad58: a5 28 a0 02 sll %g2, 2, %l2 200ad5c: 86 80 c0 13 addcc %g3, %l3, %g3 200ad60: a4 10 40 12 or %g1, %l2, %l2 200ad64: 83 30 e0 1e srl %g3, 0x1e, %g1 200ad68: 84 40 80 12 addx %g2, %l2, %g2 200ad6c: a3 28 e0 02 sll %g3, 2, %l1 200ad70: a1 28 a0 02 sll %g2, 2, %l0 200ad74: 86 80 c0 11 addcc %g3, %l1, %g3 200ad78: a0 10 40 10 or %g1, %l0, %l0 200ad7c: 93 28 e0 02 sll %g3, 2, %o1 200ad80: 84 40 80 10 addx %g2, %l0, %g2 200ad84: 83 30 e0 1e srl %g3, 0x1e, %g1 200ad88: 91 28 a0 02 sll %g2, 2, %o0 200ad8c: 86 80 c0 09 addcc %g3, %o1, %g3 200ad90: 90 10 40 08 or %g1, %o0, %o0 200ad94: bb 28 e0 09 sll %g3, 9, %i5 200ad98: 84 40 80 08 addx %g2, %o0, %g2 200ad9c: b9 30 e0 17 srl %g3, 0x17, %i4 200ada0: 89 28 a0 09 sll %g2, 9, %g4 right += rhs->tv_nsec; 200ada4: 95 3a e0 1f sra %o3, 0x1f, %o2 * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200ada8: 84 17 00 04 or %i4, %g4, %g2 right += rhs->tv_nsec; 200adac: 96 87 40 0b addcc %i5, %o3, %o3 const struct timespec *lhs, const struct timespec *rhs, uint32_t *ival_percentage, uint32_t *fval_percentage ) { 200adb0: 82 10 00 1a mov %i2, %g1 * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; right += rhs->tv_nsec; 200adb4: 94 40 80 0a addx %g2, %o2, %o2 const struct timespec *lhs, const struct timespec *rhs, uint32_t *ival_percentage, uint32_t *fval_percentage ) { 200adb8: 88 10 00 1b mov %i3, %g4 /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200adbc: f8 06 00 00 ld [ %i0 ], %i4 left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; right += rhs->tv_nsec; if ( right == 0 ) { 200adc0: 80 92 80 0b orcc %o2, %o3, %g0 200adc4: 02 80 00 62 be 200af4c <_Timespec_Divide+0x254> <== ALWAYS TAKEN 200adc8: fa 06 20 04 ld [ %i0 + 4 ], %i5 /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200adcc: b2 10 00 1c mov %i4, %i1 <== NOT EXECUTED 200add0: 9f 37 20 1d srl %i4, 0x1d, %o7 <== NOT EXECUTED 200add4: b1 3f 20 1f sra %i4, 0x1f, %i0 <== NOT EXECUTED 200add8: b9 2e 20 03 sll %i0, 3, %i4 <== NOT EXECUTED 200addc: 9b 2e 60 03 sll %i1, 3, %o5 <== NOT EXECUTED 200ade0: 98 13 c0 1c or %o7, %i4, %o4 <== NOT EXECUTED 200ade4: a3 2b 60 05 sll %o5, 5, %l1 <== NOT EXECUTED 200ade8: b9 33 60 1b srl %o5, 0x1b, %i4 <== NOT EXECUTED 200adec: 9a a4 40 0d subcc %l1, %o5, %o5 <== NOT EXECUTED 200adf0: b7 2b 60 06 sll %o5, 6, %i3 <== NOT EXECUTED 200adf4: 9f 33 60 1a srl %o5, 0x1a, %o7 <== NOT EXECUTED 200adf8: a1 2b 20 05 sll %o4, 5, %l0 <== NOT EXECUTED 200adfc: a0 17 00 10 or %i4, %l0, %l0 <== NOT EXECUTED 200ae00: 98 64 00 0c subx %l0, %o4, %o4 <== NOT EXECUTED 200ae04: 9a a6 c0 0d subcc %i3, %o5, %o5 <== NOT EXECUTED 200ae08: b5 2b 20 06 sll %o4, 6, %i2 <== NOT EXECUTED 200ae0c: b4 13 c0 1a or %o7, %i2, %i2 <== NOT EXECUTED 200ae10: 98 66 80 0c subx %i2, %o4, %o4 <== NOT EXECUTED 200ae14: b2 83 40 19 addcc %o5, %i1, %i1 <== NOT EXECUTED 200ae18: b0 43 00 18 addx %o4, %i0, %i0 <== NOT EXECUTED 200ae1c: b7 36 60 1e srl %i1, 0x1e, %i3 <== NOT EXECUTED 200ae20: 85 2e 20 02 sll %i0, 2, %g2 <== NOT EXECUTED 200ae24: 84 16 c0 02 or %i3, %g2, %g2 <== NOT EXECUTED left += lhs->tv_nsec; 200ae28: fa 27 bf fc st %i5, [ %fp + -4 ] <== NOT EXECUTED /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200ae2c: 87 2e 60 02 sll %i1, 2, %g3 <== NOT EXECUTED left += lhs->tv_nsec; 200ae30: bb 3f 60 1f sra %i5, 0x1f, %i5 <== NOT EXECUTED /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200ae34: b2 86 40 03 addcc %i1, %g3, %i1 <== NOT EXECUTED 200ae38: b0 46 00 02 addx %i0, %g2, %i0 <== NOT EXECUTED 200ae3c: 85 36 60 1e srl %i1, 0x1e, %g2 <== NOT EXECUTED left += lhs->tv_nsec; 200ae40: fa 27 bf f8 st %i5, [ %fp + -8 ] <== NOT EXECUTED /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200ae44: 93 2e 60 02 sll %i1, 2, %o1 <== NOT EXECUTED left += lhs->tv_nsec; 200ae48: f8 1f bf f8 ldd [ %fp + -8 ], %i4 <== NOT EXECUTED /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200ae4c: 92 86 40 09 addcc %i1, %o1, %o1 <== NOT EXECUTED 200ae50: 91 2e 20 02 sll %i0, 2, %o0 <== NOT EXECUTED 200ae54: 90 10 80 08 or %g2, %o0, %o0 <== NOT EXECUTED 200ae58: 85 32 60 1e srl %o1, 0x1e, %g2 <== NOT EXECUTED 200ae5c: 90 46 00 08 addx %i0, %o0, %o0 <== NOT EXECUTED 200ae60: af 2a 60 02 sll %o1, 2, %l7 <== NOT EXECUTED 200ae64: ad 2a 20 02 sll %o0, 2, %l6 <== NOT EXECUTED 200ae68: 86 82 40 17 addcc %o1, %l7, %g3 <== NOT EXECUTED 200ae6c: ac 10 80 16 or %g2, %l6, %l6 <== NOT EXECUTED 200ae70: b7 28 e0 09 sll %g3, 9, %i3 <== NOT EXECUTED 200ae74: 84 42 00 16 addx %o0, %l6, %g2 <== NOT EXECUTED 200ae78: b3 30 e0 17 srl %g3, 0x17, %i1 <== NOT EXECUTED 200ae7c: b5 28 a0 09 sll %g2, 9, %i2 <== NOT EXECUTED left += lhs->tv_nsec; 200ae80: 86 86 c0 1d addcc %i3, %i5, %g3 <== NOT EXECUTED /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200ae84: 84 16 40 1a or %i1, %i2, %g2 <== NOT EXECUTED left += lhs->tv_nsec; 200ae88: 84 40 80 1c addx %g2, %i4, %g2 <== NOT EXECUTED * Put it back in the timespec result. * * TODO: Rounding on the last digit of the fval. */ answer = (left * 100000) / right; 200ae8c: b7 28 a0 02 sll %g2, 2, %i3 <== NOT EXECUTED 200ae90: bb 28 e0 02 sll %g3, 2, %i5 <== NOT EXECUTED 200ae94: b5 30 e0 1e srl %g3, 0x1e, %i2 <== NOT EXECUTED 200ae98: ab 2f 60 05 sll %i5, 5, %l5 <== NOT EXECUTED 200ae9c: b8 16 80 1b or %i2, %i3, %i4 <== NOT EXECUTED 200aea0: 92 a5 40 1d subcc %l5, %i5, %o1 <== NOT EXECUTED 200aea4: b7 37 60 1b srl %i5, 0x1b, %i3 <== NOT EXECUTED 200aea8: a9 2f 20 05 sll %i4, 5, %l4 <== NOT EXECUTED 200aeac: a8 16 c0 14 or %i3, %l4, %l4 <== NOT EXECUTED 200aeb0: 90 65 00 1c subx %l4, %i4, %o0 <== NOT EXECUTED 200aeb4: 92 82 40 03 addcc %o1, %g3, %o1 <== NOT EXECUTED 200aeb8: 90 42 00 02 addx %o0, %g2, %o0 <== NOT EXECUTED 200aebc: 85 32 60 1e srl %o1, 0x1e, %g2 <== NOT EXECUTED 200aec0: a5 2a 20 02 sll %o0, 2, %l2 <== NOT EXECUTED 200aec4: a7 2a 60 02 sll %o1, 2, %l3 <== NOT EXECUTED 200aec8: a4 10 80 12 or %g2, %l2, %l2 <== NOT EXECUTED 200aecc: 92 82 40 13 addcc %o1, %l3, %o1 <== NOT EXECUTED 200aed0: 85 32 60 1e srl %o1, 0x1e, %g2 <== NOT EXECUTED 200aed4: 90 42 00 12 addx %o0, %l2, %o0 <== NOT EXECUTED 200aed8: a3 2a 60 02 sll %o1, 2, %l1 <== NOT EXECUTED 200aedc: a1 2a 20 02 sll %o0, 2, %l0 <== NOT EXECUTED 200aee0: 92 82 40 11 addcc %o1, %l1, %o1 <== NOT EXECUTED 200aee4: a0 10 80 10 or %g2, %l0, %l0 <== NOT EXECUTED 200aee8: 85 2a 60 05 sll %o1, 5, %g2 <== NOT EXECUTED 200aeec: 90 42 00 10 addx %o0, %l0, %o0 <== NOT EXECUTED 200aef0: 87 2a 20 05 sll %o0, 5, %g3 <== NOT EXECUTED 200aef4: c8 27 bf f0 st %g4, [ %fp + -16 ] <== NOT EXECUTED 200aef8: bb 32 60 1b srl %o1, 0x1b, %i5 <== NOT EXECUTED 200aefc: c2 27 bf f4 st %g1, [ %fp + -12 ] <== NOT EXECUTED 200af00: 90 17 40 03 or %i5, %g3, %o0 <== NOT EXECUTED 200af04: 40 00 38 50 call 2019044 <__udivdi3> <== NOT EXECUTED 200af08: 92 10 00 02 mov %g2, %o1 <== NOT EXECUTED *ival_percentage = answer / 1000; 200af0c: 94 10 20 00 clr %o2 <== NOT EXECUTED * Put it back in the timespec result. * * TODO: Rounding on the last digit of the fval. */ answer = (left * 100000) / right; 200af10: b8 10 00 08 mov %o0, %i4 <== NOT EXECUTED 200af14: ba 10 00 09 mov %o1, %i5 <== NOT EXECUTED *ival_percentage = answer / 1000; 200af18: 40 00 38 4b call 2019044 <__udivdi3> <== NOT EXECUTED 200af1c: 96 10 23 e8 mov 0x3e8, %o3 <== NOT EXECUTED 200af20: c2 07 bf f4 ld [ %fp + -12 ], %g1 <== NOT EXECUTED *fval_percentage = answer % 1000; 200af24: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED * TODO: Rounding on the last digit of the fval. */ answer = (left * 100000) / right; *ival_percentage = answer / 1000; 200af28: d2 20 40 00 st %o1, [ %g1 ] <== NOT EXECUTED *fval_percentage = answer % 1000; 200af2c: 94 10 20 00 clr %o2 <== NOT EXECUTED 200af30: 96 10 23 e8 mov 0x3e8, %o3 <== NOT EXECUTED 200af34: 40 00 39 18 call 2019394 <__umoddi3> <== NOT EXECUTED 200af38: 92 10 00 1d mov %i5, %o1 <== NOT EXECUTED 200af3c: c8 07 bf f0 ld [ %fp + -16 ], %g4 <== NOT EXECUTED 200af40: d2 21 00 00 st %o1, [ %g4 ] <== NOT EXECUTED 200af44: 81 c7 e0 08 ret <== NOT EXECUTED 200af48: 81 e8 00 00 restore <== NOT EXECUTED left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; right += rhs->tv_nsec; if ( right == 0 ) { *ival_percentage = 0; 200af4c: c0 26 80 00 clr [ %i2 ] *fval_percentage = 0; 200af50: c0 26 c0 00 clr [ %i3 ] return; 200af54: 81 c7 e0 08 ret 200af58: 81 e8 00 00 restore =============================================================================== 0200af5c <_Timespec_Less_than>: bool _Timespec_Less_than( const struct timespec *lhs, const struct timespec *rhs ) { if ( lhs->tv_sec < rhs->tv_sec ) 200af5c: c6 02 00 00 ld [ %o0 ], %g3 200af60: c4 02 40 00 ld [ %o1 ], %g2 200af64: 80 a0 c0 02 cmp %g3, %g2 200af68: 06 80 00 0a bl 200af90 <_Timespec_Less_than+0x34> <== NEVER TAKEN 200af6c: 82 10 20 01 mov 1, %g1 return true; if ( lhs->tv_sec > rhs->tv_sec ) 200af70: 80 a0 c0 02 cmp %g3, %g2 200af74: 14 80 00 07 bg 200af90 <_Timespec_Less_than+0x34> 200af78: 82 10 20 00 clr %g1 return false; /* ASSERT: lhs->tv_sec == rhs->tv_sec */ if ( lhs->tv_nsec < rhs->tv_nsec ) 200af7c: c6 02 20 04 ld [ %o0 + 4 ], %g3 200af80: c4 02 60 04 ld [ %o1 + 4 ], %g2 200af84: 80 a0 c0 02 cmp %g3, %g2 200af88: 16 80 00 04 bge 200af98 <_Timespec_Less_than+0x3c> <== ALWAYS TAKEN 200af8c: 82 10 20 01 mov 1, %g1 return true; return false; } 200af90: 81 c3 e0 08 retl 200af94: 90 08 60 01 and %g1, 1, %o0 if ( lhs->tv_sec > rhs->tv_sec ) return false; /* ASSERT: lhs->tv_sec == rhs->tv_sec */ if ( lhs->tv_nsec < rhs->tv_nsec ) 200af98: 82 10 20 00 clr %g1 return true; return false; } 200af9c: 81 c3 e0 08 retl 200afa0: 90 08 60 01 and %g1, 1, %o0 =============================================================================== 0200c198 <_Timespec_Subtract>: const struct timespec *end, struct timespec *result ) { if (end->tv_nsec < start->tv_nsec) { 200c198: c2 02 20 04 ld [ %o0 + 4 ], %g1 200c19c: c4 02 60 04 ld [ %o1 + 4 ], %g2 result->tv_sec = end->tv_sec - start->tv_sec - 1; 200c1a0: c8 02 40 00 ld [ %o1 ], %g4 const struct timespec *end, struct timespec *result ) { if (end->tv_nsec < start->tv_nsec) { 200c1a4: 80 a0 80 01 cmp %g2, %g1 200c1a8: 06 80 00 07 bl 200c1c4 <_Timespec_Subtract+0x2c> <== NEVER TAKEN 200c1ac: c6 02 00 00 ld [ %o0 ], %g3 result->tv_sec = end->tv_sec - start->tv_sec - 1; result->tv_nsec = (TOD_NANOSECONDS_PER_SECOND - start->tv_nsec) + end->tv_nsec; } else { result->tv_sec = end->tv_sec - start->tv_sec; result->tv_nsec = end->tv_nsec - start->tv_nsec; 200c1b0: 82 20 80 01 sub %g2, %g1, %g1 if (end->tv_nsec < start->tv_nsec) { result->tv_sec = end->tv_sec - start->tv_sec - 1; result->tv_nsec = (TOD_NANOSECONDS_PER_SECOND - start->tv_nsec) + end->tv_nsec; } else { result->tv_sec = end->tv_sec - start->tv_sec; 200c1b4: 86 21 00 03 sub %g4, %g3, %g3 result->tv_nsec = end->tv_nsec - start->tv_nsec; 200c1b8: c2 22 a0 04 st %g1, [ %o2 + 4 ] if (end->tv_nsec < start->tv_nsec) { result->tv_sec = end->tv_sec - start->tv_sec - 1; result->tv_nsec = (TOD_NANOSECONDS_PER_SECOND - start->tv_nsec) + end->tv_nsec; } else { result->tv_sec = end->tv_sec - start->tv_sec; 200c1bc: 81 c3 e0 08 retl 200c1c0: c6 22 80 00 st %g3, [ %o2 ] struct timespec *result ) { if (end->tv_nsec < start->tv_nsec) { result->tv_sec = end->tv_sec - start->tv_sec - 1; 200c1c4: 86 21 00 03 sub %g4, %g3, %g3 <== NOT EXECUTED result->tv_nsec = (TOD_NANOSECONDS_PER_SECOND - start->tv_nsec) + end->tv_nsec; 200c1c8: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4 <== NOT EXECUTED struct timespec *result ) { if (end->tv_nsec < start->tv_nsec) { result->tv_sec = end->tv_sec - start->tv_sec - 1; 200c1cc: 86 00 ff ff add %g3, -1, %g3 <== NOT EXECUTED result->tv_nsec = (TOD_NANOSECONDS_PER_SECOND - start->tv_nsec) + end->tv_nsec; 200c1d0: 88 11 22 00 or %g4, 0x200, %g4 <== NOT EXECUTED struct timespec *result ) { if (end->tv_nsec < start->tv_nsec) { result->tv_sec = end->tv_sec - start->tv_sec - 1; 200c1d4: c6 22 80 00 st %g3, [ %o2 ] <== NOT EXECUTED result->tv_nsec = (TOD_NANOSECONDS_PER_SECOND - start->tv_nsec) + end->tv_nsec; 200c1d8: 84 00 80 04 add %g2, %g4, %g2 <== NOT EXECUTED 200c1dc: 82 20 80 01 sub %g2, %g1, %g1 <== NOT EXECUTED ) { if (end->tv_nsec < start->tv_nsec) { result->tv_sec = end->tv_sec - start->tv_sec - 1; result->tv_nsec = 200c1e0: 81 c3 e0 08 retl <== NOT EXECUTED 200c1e4: c2 22 a0 04 st %g1, [ %o2 + 4 ] <== NOT EXECUTED =============================================================================== 0200cc48 <_Timestamp64_Divide>: const Timestamp64_Control *_lhs, const Timestamp64_Control *_rhs, uint32_t *_ival_percentage, uint32_t *_fval_percentage ) { 200cc48: 9d e3 bf a0 save %sp, -96, %sp Timestamp64_Control answer; if ( *_rhs == 0 ) { 200cc4c: d4 1e 40 00 ldd [ %i1 ], %o2 200cc50: 80 92 80 0b orcc %o2, %o3, %g0 200cc54: 22 80 00 2f be,a 200cd10 <_Timestamp64_Divide+0xc8> <== NEVER TAKEN 200cc58: 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; 200cc5c: d0 1e 00 00 ldd [ %i0 ], %o0 200cc60: 83 2a 20 02 sll %o0, 2, %g1 200cc64: 89 32 60 1e srl %o1, 0x1e, %g4 200cc68: 87 2a 60 02 sll %o1, 2, %g3 200cc6c: 84 11 00 01 or %g4, %g1, %g2 200cc70: 83 30 e0 1b srl %g3, 0x1b, %g1 200cc74: 9b 28 e0 05 sll %g3, 5, %o5 200cc78: 99 28 a0 05 sll %g2, 5, %o4 200cc7c: 86 a3 40 03 subcc %o5, %g3, %g3 200cc80: 98 10 40 0c or %g1, %o4, %o4 200cc84: 84 63 00 02 subx %o4, %g2, %g2 200cc88: 92 80 c0 09 addcc %g3, %o1, %o1 200cc8c: 83 32 60 1e srl %o1, 0x1e, %g1 200cc90: 90 40 80 08 addx %g2, %o0, %o0 200cc94: b3 2a 60 02 sll %o1, 2, %i1 200cc98: b1 2a 20 02 sll %o0, 2, %i0 200cc9c: 92 82 40 19 addcc %o1, %i1, %o1 200cca0: b0 10 40 18 or %g1, %i0, %i0 200cca4: 83 32 60 1e srl %o1, 0x1e, %g1 200cca8: 90 42 00 18 addx %o0, %i0, %o0 200ccac: bb 2a 60 02 sll %o1, 2, %i5 200ccb0: b9 2a 20 02 sll %o0, 2, %i4 200ccb4: 92 82 40 1d addcc %o1, %i5, %o1 200ccb8: b8 10 40 1c or %g1, %i4, %i4 200ccbc: 87 32 60 1b srl %o1, 0x1b, %g3 200ccc0: 90 42 00 1c addx %o0, %i4, %o0 200ccc4: 83 2a 60 05 sll %o1, 5, %g1 200ccc8: 85 2a 20 05 sll %o0, 5, %g2 200cccc: 92 10 00 01 mov %g1, %o1 200ccd0: 40 00 37 f8 call 201acb0 <__divdi3> 200ccd4: 90 10 c0 02 or %g3, %g2, %o0 *_ival_percentage = answer / 1000; 200ccd8: 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; 200ccdc: b8 10 00 08 mov %o0, %i4 200cce0: ba 10 00 09 mov %o1, %i5 *_ival_percentage = answer / 1000; 200cce4: 40 00 37 f3 call 201acb0 <__divdi3> 200cce8: 96 10 23 e8 mov 0x3e8, %o3 *_fval_percentage = answer % 1000; 200ccec: 90 10 00 1c mov %i4, %o0 * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; *_ival_percentage = answer / 1000; 200ccf0: d2 26 80 00 st %o1, [ %i2 ] *_fval_percentage = answer % 1000; 200ccf4: 94 10 20 00 clr %o2 200ccf8: 96 10 23 e8 mov 0x3e8, %o3 200ccfc: 40 00 38 d8 call 201b05c <__moddi3> 200cd00: 92 10 00 1d mov %i5, %o1 200cd04: d2 26 c0 00 st %o1, [ %i3 ] 200cd08: 81 c7 e0 08 ret 200cd0c: 81 e8 00 00 restore { Timestamp64_Control answer; if ( *_rhs == 0 ) { *_ival_percentage = 0; *_fval_percentage = 0; 200cd10: c0 26 c0 00 clr [ %i3 ] <== NOT EXECUTED return; 200cd14: 81 c7 e0 08 ret <== NOT EXECUTED 200cd18: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200b4ac <_User_extensions_Fatal>: void _User_extensions_Fatal ( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 200b4ac: 9d e3 bf a0 save %sp, -96, %sp 200b4b0: 39 00 80 75 sethi %hi(0x201d400), %i4 200b4b4: b8 17 20 08 or %i4, 8, %i4 ! 201d408 <_User_extensions_List> 200b4b8: fa 07 20 08 ld [ %i4 + 8 ], %i5 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200b4bc: 80 a7 40 1c cmp %i5, %i4 200b4c0: 02 80 00 0d be 200b4f4 <_User_extensions_Fatal+0x48> <== NEVER TAKEN 200b4c4: 01 00 00 00 nop !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.fatal != NULL ) 200b4c8: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200b4cc: 80 a0 60 00 cmp %g1, 0 200b4d0: 02 80 00 05 be 200b4e4 <_User_extensions_Fatal+0x38> 200b4d4: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.fatal)( the_source, is_internal, the_error ); 200b4d8: 92 10 00 19 mov %i1, %o1 200b4dc: 9f c0 40 00 call %g1 200b4e0: 94 10 00 1a mov %i2, %o2 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 200b4e4: fa 07 60 04 ld [ %i5 + 4 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200b4e8: 80 a7 40 1c cmp %i5, %i4 200b4ec: 32 bf ff f8 bne,a 200b4cc <_User_extensions_Fatal+0x20> 200b4f0: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200b4f4: 81 c7 e0 08 ret 200b4f8: 81 e8 00 00 restore =============================================================================== 0200b358 <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 200b358: 9d e3 bf a0 save %sp, -96, %sp User_extensions_Control *extension; uint32_t i; uint32_t number_of_extensions; User_extensions_Table *initial_extensions; number_of_extensions = Configuration.number_of_initial_extensions; 200b35c: 07 00 80 71 sethi %hi(0x201c400), %g3 200b360: 86 10 e0 cc or %g3, 0xcc, %g3 ! 201c4cc initial_extensions = Configuration.User_extension_table; 200b364: f6 00 e0 48 ld [ %g3 + 0x48 ], %i3 200b368: 3b 00 80 75 sethi %hi(0x201d400), %i5 200b36c: 09 00 80 74 sethi %hi(0x201d000), %g4 200b370: 84 17 60 08 or %i5, 8, %g2 200b374: 82 11 22 34 or %g4, 0x234, %g1 200b378: b4 00 a0 04 add %g2, 4, %i2 200b37c: b8 00 60 04 add %g1, 4, %i4 200b380: f4 27 60 08 st %i2, [ %i5 + 8 ] head->previous = NULL; 200b384: c0 20 a0 04 clr [ %g2 + 4 ] tail->previous = head; 200b388: c4 20 a0 08 st %g2, [ %g2 + 8 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 200b38c: f8 21 22 34 st %i4, [ %g4 + 0x234 ] head->previous = NULL; 200b390: c0 20 60 04 clr [ %g1 + 4 ] tail->previous = head; 200b394: c2 20 60 08 st %g1, [ %g1 + 8 ] _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 200b398: 80 a6 e0 00 cmp %i3, 0 200b39c: 02 80 00 1b be 200b408 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 200b3a0: f4 00 e0 44 ld [ %g3 + 0x44 ], %i2 extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 200b3a4: 83 2e a0 02 sll %i2, 2, %g1 200b3a8: b9 2e a0 04 sll %i2, 4, %i4 200b3ac: b8 27 00 01 sub %i4, %g1, %i4 200b3b0: b8 07 00 1a add %i4, %i2, %i4 200b3b4: b9 2f 20 02 sll %i4, 2, %i4 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) 200b3b8: 40 00 01 98 call 200ba18 <_Workspace_Allocate_or_fatal_error> 200b3bc: 90 10 00 1c mov %i4, %o0 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 200b3c0: 92 10 20 00 clr %o1 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) 200b3c4: ba 10 00 08 mov %o0, %i5 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 200b3c8: 40 00 13 eb call 2010374 200b3cc: 94 10 00 1c mov %i4, %o2 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 200b3d0: 80 a6 a0 00 cmp %i2, 0 200b3d4: 02 80 00 0d be 200b408 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 200b3d8: b8 10 20 00 clr %i4 RTEMS_INLINE_ROUTINE void _User_extensions_Add_set_with_table( User_extensions_Control *extension, const User_extensions_Table *extension_table ) { extension->Callouts = *extension_table; 200b3dc: 92 10 00 1b mov %i3, %o1 200b3e0: 94 10 20 20 mov 0x20, %o2 200b3e4: 40 00 13 a7 call 2010280 200b3e8: 90 07 60 14 add %i5, 0x14, %o0 _User_extensions_Add_set( extension ); 200b3ec: 40 00 0b 2c call 200e09c <_User_extensions_Add_set> 200b3f0: 90 10 00 1d mov %i5, %o0 200b3f4: b8 07 20 01 inc %i4 _User_extensions_Add_set_with_table (extension, &initial_extensions[i]); extension++; 200b3f8: ba 07 60 34 add %i5, 0x34, %i5 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 200b3fc: 80 a7 00 1a cmp %i4, %i2 200b400: 12 bf ff f7 bne 200b3dc <_User_extensions_Handler_initialization+0x84> 200b404: b6 06 e0 20 add %i3, 0x20, %i3 200b408: 81 c7 e0 08 ret 200b40c: 81 e8 00 00 restore =============================================================================== 0200b410 <_User_extensions_Thread_begin>: #include void _User_extensions_Thread_begin ( Thread_Control *executing ) { 200b410: 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; 200b414: 39 00 80 75 sethi %hi(0x201d400), %i4 200b418: fa 07 20 08 ld [ %i4 + 8 ], %i5 ! 201d408 <_User_extensions_List> 200b41c: b8 17 20 08 or %i4, 8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200b420: b8 07 20 04 add %i4, 4, %i4 200b424: 80 a7 40 1c cmp %i5, %i4 200b428: 02 80 00 0c be 200b458 <_User_extensions_Thread_begin+0x48><== NEVER TAKEN 200b42c: 01 00 00 00 nop !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_begin != NULL ) 200b430: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 200b434: 80 a0 60 00 cmp %g1, 0 200b438: 02 80 00 04 be 200b448 <_User_extensions_Thread_begin+0x38> 200b43c: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_begin)( executing ); 200b440: 9f c0 40 00 call %g1 200b444: 01 00 00 00 nop Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200b448: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200b44c: 80 a7 40 1c cmp %i5, %i4 200b450: 32 bf ff f9 bne,a 200b434 <_User_extensions_Thread_begin+0x24> 200b454: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 200b458: 81 c7 e0 08 ret 200b45c: 81 e8 00 00 restore =============================================================================== 0200b4fc <_User_extensions_Thread_create>: #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 200b4fc: 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; 200b500: 39 00 80 75 sethi %hi(0x201d400), %i4 200b504: fa 07 20 08 ld [ %i4 + 8 ], %i5 ! 201d408 <_User_extensions_List> 200b508: b8 17 20 08 or %i4, 8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 200b50c: b8 07 20 04 add %i4, 4, %i4 200b510: 80 a7 40 1c cmp %i5, %i4 200b514: 02 80 00 10 be 200b554 <_User_extensions_Thread_create+0x58><== NEVER TAKEN 200b518: 37 00 80 75 sethi %hi(0x201d400), %i3 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_create != NULL ) { 200b51c: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200b520: 80 a0 60 00 cmp %g1, 0 200b524: 02 80 00 08 be 200b544 <_User_extensions_Thread_create+0x48> 200b528: 84 16 e0 50 or %i3, 0x50, %g2 status = (*the_extension->Callouts.thread_create)( 200b52c: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200b530: 9f c0 40 00 call %g1 200b534: 92 10 00 18 mov %i0, %o1 _Thread_Executing, the_thread ); if ( !status ) 200b538: 80 8a 20 ff btst 0xff, %o0 200b53c: 22 80 00 0a be,a 200b564 <_User_extensions_Thread_create+0x68> 200b540: b0 10 20 00 clr %i0 User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200b544: fa 07 40 00 ld [ %i5 ], %i5 { Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 200b548: 80 a7 40 1c cmp %i5, %i4 200b54c: 32 bf ff f5 bne,a 200b520 <_User_extensions_Thread_create+0x24> 200b550: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 if ( !status ) return false; } } return true; 200b554: b0 10 20 01 mov 1, %i0 } 200b558: b0 0e 20 01 and %i0, 1, %i0 200b55c: 81 c7 e0 08 ret 200b560: 81 e8 00 00 restore 200b564: b0 0e 20 01 and %i0, 1, %i0 200b568: 81 c7 e0 08 ret 200b56c: 81 e8 00 00 restore =============================================================================== 0200b570 <_User_extensions_Thread_delete>: #include void _User_extensions_Thread_delete ( Thread_Control *the_thread ) { 200b570: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Last( Chain_Control *the_chain ) { return _Chain_Tail( the_chain )->previous; 200b574: 39 00 80 75 sethi %hi(0x201d400), %i4 200b578: b8 17 20 08 or %i4, 8, %i4 ! 201d408 <_User_extensions_List> 200b57c: fa 07 20 08 ld [ %i4 + 8 ], %i5 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200b580: 80 a7 40 1c cmp %i5, %i4 200b584: 02 80 00 0d be 200b5b8 <_User_extensions_Thread_delete+0x48><== NEVER TAKEN 200b588: 37 00 80 75 sethi %hi(0x201d400), %i3 !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_delete != NULL ) 200b58c: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200b590: 80 a0 60 00 cmp %g1, 0 200b594: 02 80 00 05 be 200b5a8 <_User_extensions_Thread_delete+0x38> 200b598: 84 16 e0 50 or %i3, 0x50, %g2 (*the_extension->Callouts.thread_delete)( 200b59c: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200b5a0: 9f c0 40 00 call %g1 200b5a4: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 200b5a8: fa 07 60 04 ld [ %i5 + 4 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200b5ac: 80 a7 40 1c cmp %i5, %i4 200b5b0: 32 bf ff f8 bne,a 200b590 <_User_extensions_Thread_delete+0x20> 200b5b4: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200b5b8: 81 c7 e0 08 ret 200b5bc: 81 e8 00 00 restore =============================================================================== 0200b460 <_User_extensions_Thread_exitted>: } void _User_extensions_Thread_exitted ( Thread_Control *executing ) { 200b460: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Last( Chain_Control *the_chain ) { return _Chain_Tail( the_chain )->previous; 200b464: 39 00 80 75 sethi %hi(0x201d400), %i4 200b468: b8 17 20 08 or %i4, 8, %i4 ! 201d408 <_User_extensions_List> 200b46c: fa 07 20 08 ld [ %i4 + 8 ], %i5 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200b470: 80 a7 40 1c cmp %i5, %i4 200b474: 02 80 00 0c be 200b4a4 <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN 200b478: 01 00 00 00 nop !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_exitted != NULL ) 200b47c: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 200b480: 80 a0 60 00 cmp %g1, 0 200b484: 02 80 00 04 be 200b494 <_User_extensions_Thread_exitted+0x34> 200b488: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_exitted)( executing ); 200b48c: 9f c0 40 00 call %g1 200b490: 01 00 00 00 nop Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 200b494: fa 07 60 04 ld [ %i5 + 4 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200b498: 80 a7 40 1c cmp %i5, %i4 200b49c: 32 bf ff f9 bne,a 200b480 <_User_extensions_Thread_exitted+0x20> 200b4a0: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 200b4a4: 81 c7 e0 08 ret 200b4a8: 81 e8 00 00 restore =============================================================================== 0200be1c <_User_extensions_Thread_restart>: #include void _User_extensions_Thread_restart ( Thread_Control *the_thread ) { 200be1c: 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; 200be20: 39 00 80 77 sethi %hi(0x201dc00), %i4 200be24: fa 07 23 38 ld [ %i4 + 0x338 ], %i5 ! 201df38 <_User_extensions_List> 200be28: b8 17 23 38 or %i4, 0x338, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200be2c: b8 07 20 04 add %i4, 4, %i4 200be30: 80 a7 40 1c cmp %i5, %i4 200be34: 02 80 00 0d be 200be68 <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN 200be38: 37 00 80 77 sethi %hi(0x201dc00), %i3 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_restart != NULL ) 200be3c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200be40: 80 a0 60 00 cmp %g1, 0 200be44: 02 80 00 05 be 200be58 <_User_extensions_Thread_restart+0x3c> 200be48: 84 16 e3 80 or %i3, 0x380, %g2 (*the_extension->Callouts.thread_restart)( 200be4c: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200be50: 9f c0 40 00 call %g1 200be54: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200be58: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200be5c: 80 a7 40 1c cmp %i5, %i4 200be60: 32 bf ff f8 bne,a 200be40 <_User_extensions_Thread_restart+0x24> 200be64: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200be68: 81 c7 e0 08 ret 200be6c: 81 e8 00 00 restore =============================================================================== 0200b5c0 <_User_extensions_Thread_start>: #include void _User_extensions_Thread_start ( Thread_Control *the_thread ) { 200b5c0: 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; 200b5c4: 39 00 80 75 sethi %hi(0x201d400), %i4 200b5c8: fa 07 20 08 ld [ %i4 + 8 ], %i5 ! 201d408 <_User_extensions_List> 200b5cc: b8 17 20 08 or %i4, 8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200b5d0: b8 07 20 04 add %i4, 4, %i4 200b5d4: 80 a7 40 1c cmp %i5, %i4 200b5d8: 02 80 00 0d be 200b60c <_User_extensions_Thread_start+0x4c><== NEVER TAKEN 200b5dc: 37 00 80 75 sethi %hi(0x201d400), %i3 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_start != NULL ) 200b5e0: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200b5e4: 80 a0 60 00 cmp %g1, 0 200b5e8: 02 80 00 05 be 200b5fc <_User_extensions_Thread_start+0x3c> 200b5ec: 84 16 e0 50 or %i3, 0x50, %g2 (*the_extension->Callouts.thread_start)( 200b5f0: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200b5f4: 9f c0 40 00 call %g1 200b5f8: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200b5fc: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200b600: 80 a7 40 1c cmp %i5, %i4 200b604: 32 bf ff f8 bne,a 200b5e4 <_User_extensions_Thread_start+0x24> 200b608: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200b60c: 81 c7 e0 08 ret 200b610: 81 e8 00 00 restore =============================================================================== 0200b614 <_User_extensions_Thread_switch>: void _User_extensions_Thread_switch ( Thread_Control *executing, Thread_Control *heir ) { 200b614: 9d e3 bf a0 save %sp, -96, %sp 200b618: 39 00 80 74 sethi %hi(0x201d000), %i4 200b61c: fa 07 22 34 ld [ %i4 + 0x234 ], %i5 ! 201d234 <_User_extensions_Switches_list> 200b620: b8 17 22 34 or %i4, 0x234, %i4 Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); 200b624: b8 07 20 04 add %i4, 4, %i4 200b628: 80 a7 40 1c cmp %i5, %i4 200b62c: 02 80 00 0a be 200b654 <_User_extensions_Thread_switch+0x40><== NEVER TAKEN 200b630: 01 00 00 00 nop !_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ; the_node = the_node->next ) { the_extension_switch = (User_extensions_Switch_control *) the_node; (*the_extension_switch->thread_switch)( executing, heir ); 200b634: c2 07 60 08 ld [ %i5 + 8 ], %g1 200b638: 90 10 00 18 mov %i0, %o0 200b63c: 9f c0 40 00 call %g1 200b640: 92 10 00 19 mov %i1, %o1 Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); !_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ; the_node = the_node->next ) { 200b644: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); 200b648: 80 a7 40 1c cmp %i5, %i4 200b64c: 32 bf ff fb bne,a 200b638 <_User_extensions_Thread_switch+0x24> 200b650: c2 07 60 08 ld [ %i5 + 8 ], %g1 200b654: 81 c7 e0 08 ret 200b658: 81 e8 00 00 restore =============================================================================== 0200d060 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200d060: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200d064: 7f ff d9 0e call 200349c 200d068: 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; 200d06c: 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 ); 200d070: 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 ) ) { 200d074: 80 a0 40 1c cmp %g1, %i4 200d078: 02 80 00 1f be 200d0f4 <_Watchdog_Adjust+0x94> 200d07c: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200d080: 12 80 00 1f bne 200d0fc <_Watchdog_Adjust+0x9c> 200d084: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200d088: 80 a6 a0 00 cmp %i2, 0 200d08c: 02 80 00 1a be 200d0f4 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200d090: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200d094: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200d098: 80 a6 80 02 cmp %i2, %g2 200d09c: 1a 80 00 0a bcc 200d0c4 <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN 200d0a0: b6 10 20 01 mov 1, %i3 _Watchdog_First( header )->delta_interval -= units; 200d0a4: 10 80 00 1d b 200d118 <_Watchdog_Adjust+0xb8> <== NOT EXECUTED 200d0a8: 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 ) { 200d0ac: 02 80 00 12 be 200d0f4 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200d0b0: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200d0b4: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200d0b8: 80 a0 80 1a cmp %g2, %i2 200d0bc: 38 80 00 17 bgu,a 200d118 <_Watchdog_Adjust+0xb8> 200d0c0: 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; 200d0c4: 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; 200d0c8: b4 26 80 02 sub %i2, %g2, %i2 _Watchdog_First( header )->delta_interval = 1; _ISR_Enable( level ); 200d0cc: 7f ff d8 f8 call 20034ac 200d0d0: 01 00 00 00 nop _Watchdog_Tickle( header ); 200d0d4: 40 00 00 a8 call 200d374 <_Watchdog_Tickle> 200d0d8: 90 10 00 18 mov %i0, %o0 _ISR_Disable( level ); 200d0dc: 7f ff d8 f0 call 200349c 200d0e0: 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; 200d0e4: c2 06 00 00 ld [ %i0 ], %g1 if ( _Chain_Is_empty( header ) ) 200d0e8: 80 a7 00 01 cmp %i4, %g1 200d0ec: 12 bf ff f0 bne 200d0ac <_Watchdog_Adjust+0x4c> 200d0f0: 80 a6 a0 00 cmp %i2, 0 } break; } } _ISR_Enable( level ); 200d0f4: 7f ff d8 ee call 20034ac 200d0f8: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 200d0fc: 12 bf ff fe bne 200d0f4 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200d100: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200d104: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200d108: b4 00 80 1a add %g2, %i2, %i2 200d10c: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 200d110: 7f ff d8 e7 call 20034ac 200d114: 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; 200d118: 10 bf ff f7 b 200d0f4 <_Watchdog_Adjust+0x94> 200d11c: c4 20 60 10 st %g2, [ %g1 + 0x10 ] =============================================================================== 0200b7d8 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 200b7d8: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 200b7dc: 7f ff db e2 call 2002764 200b7e0: 01 00 00 00 nop previous_state = the_watchdog->state; 200b7e4: fa 06 20 08 ld [ %i0 + 8 ], %i5 switch ( previous_state ) { 200b7e8: 80 a7 60 01 cmp %i5, 1 200b7ec: 02 80 00 2a be 200b894 <_Watchdog_Remove+0xbc> 200b7f0: 03 00 80 74 sethi %hi(0x201d000), %g1 200b7f4: 1a 80 00 09 bcc 200b818 <_Watchdog_Remove+0x40> 200b7f8: 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; 200b7fc: 03 00 80 74 sethi %hi(0x201d000), %g1 200b800: c2 00 63 28 ld [ %g1 + 0x328 ], %g1 ! 201d328 <_Watchdog_Ticks_since_boot> 200b804: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200b808: 7f ff db db call 2002774 200b80c: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200b810: 81 c7 e0 08 ret 200b814: 81 e8 00 00 restore Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); previous_state = the_watchdog->state; switch ( previous_state ) { 200b818: 18 bf ff fa bgu 200b800 <_Watchdog_Remove+0x28> <== NEVER TAKEN 200b81c: 03 00 80 74 sethi %hi(0x201d000), %g1 RTEMS_INLINE_ROUTINE Watchdog_Control *_Watchdog_Next( Watchdog_Control *the_watchdog ) { return ( (Watchdog_Control *) the_watchdog->Node.next ); 200b820: c2 06 00 00 ld [ %i0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 200b824: c0 26 20 08 clr [ %i0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 200b828: c4 00 40 00 ld [ %g1 ], %g2 200b82c: 80 a0 a0 00 cmp %g2, 0 200b830: 02 80 00 07 be 200b84c <_Watchdog_Remove+0x74> 200b834: 05 00 80 74 sethi %hi(0x201d000), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 200b838: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200b83c: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 200b840: 84 00 c0 02 add %g3, %g2, %g2 200b844: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 200b848: 05 00 80 74 sethi %hi(0x201d000), %g2 200b84c: c4 00 a3 24 ld [ %g2 + 0x324 ], %g2 ! 201d324 <_Watchdog_Sync_count> 200b850: 80 a0 a0 00 cmp %g2, 0 200b854: 22 80 00 07 be,a 200b870 <_Watchdog_Remove+0x98> 200b858: c4 06 20 04 ld [ %i0 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 200b85c: 05 00 80 75 sethi %hi(0x201d400), %g2 200b860: c6 00 a0 58 ld [ %g2 + 0x58 ], %g3 ! 201d458 <_Per_CPU_Information+0x8> 200b864: 05 00 80 74 sethi %hi(0x201d000), %g2 200b868: c6 20 a2 c4 st %g3, [ %g2 + 0x2c4 ] ! 201d2c4 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 200b86c: c4 06 20 04 ld [ %i0 + 4 ], %g2 next->previous = previous; 200b870: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 200b874: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200b878: 03 00 80 74 sethi %hi(0x201d000), %g1 200b87c: c2 00 63 28 ld [ %g1 + 0x328 ], %g1 ! 201d328 <_Watchdog_Ticks_since_boot> 200b880: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200b884: 7f ff db bc call 2002774 200b888: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200b88c: 81 c7 e0 08 ret 200b890: 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; 200b894: c2 00 63 28 ld [ %g1 + 0x328 ], %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; 200b898: 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; 200b89c: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200b8a0: 7f ff db b5 call 2002774 200b8a4: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200b8a8: 81 c7 e0 08 ret 200b8ac: 81 e8 00 00 restore =============================================================================== 0200ca7c <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200ca7c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200ca80: 7f ff d9 85 call 2003094 200ca84: 01 00 00 00 nop 200ca88: b6 10 00 08 mov %o0, %i3 printk( "Watchdog Chain: %s %p\n", name, header ); 200ca8c: 11 00 80 74 sethi %hi(0x201d000), %o0 200ca90: 94 10 00 19 mov %i1, %o2 200ca94: 92 10 00 18 mov %i0, %o1 200ca98: 7f ff e1 91 call 20050dc 200ca9c: 90 12 22 20 or %o0, 0x220, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200caa0: 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 ); 200caa4: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200caa8: 80 a7 40 19 cmp %i5, %i1 200caac: 02 80 00 0f be 200cae8 <_Watchdog_Report_chain+0x6c> 200cab0: 11 00 80 74 sethi %hi(0x201d000), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200cab4: 92 10 00 1d mov %i5, %o1 200cab8: 40 00 00 0f call 200caf4 <_Watchdog_Report> 200cabc: 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 ) 200cac0: 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 ) ; 200cac4: 80 a7 40 19 cmp %i5, %i1 200cac8: 12 bf ff fc bne 200cab8 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 200cacc: 92 10 00 1d mov %i5, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200cad0: 11 00 80 74 sethi %hi(0x201d000), %o0 200cad4: 92 10 00 18 mov %i0, %o1 200cad8: 7f ff e1 81 call 20050dc 200cadc: 90 12 22 38 or %o0, 0x238, %o0 } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); 200cae0: 7f ff d9 71 call 20030a4 200cae4: 91 e8 00 1b restore %g0, %i3, %o0 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200cae8: 7f ff e1 7d call 20050dc 200caec: 90 12 22 48 or %o0, 0x248, %o0 200caf0: 30 bf ff fc b,a 200cae0 <_Watchdog_Report_chain+0x64> =============================================================================== 0200b7fc <_Workspace_String_duplicate>: char *_Workspace_String_duplicate( const char *string, size_t len ) { 200b7fc: 9d e3 bf a0 save %sp, -96, %sp char *dup = _Workspace_Allocate(len + 1); 200b800: 7f ff ff e2 call 200b788 <_Workspace_Allocate> 200b804: 90 06 60 01 add %i1, 1, %o0 if (dup != NULL) { 200b808: ba 92 20 00 orcc %o0, 0, %i5 200b80c: 02 80 00 05 be 200b820 <_Workspace_String_duplicate+0x24> <== NEVER TAKEN 200b810: 92 10 00 18 mov %i0, %o1 dup [len] = '\0'; 200b814: c0 2f 40 19 clrb [ %i5 + %i1 ] memcpy(dup, string, len); 200b818: 40 00 12 a5 call 20102ac 200b81c: 94 10 00 19 mov %i1, %o2 } return dup; } 200b820: 81 c7 e0 08 ret 200b824: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02019fe4 <__kill>: #endif int __kill( pid_t pid, int sig ) { return 0; } 2019fe4: 81 c3 e0 08 retl <== NOT EXECUTED 2019fe8: 90 10 20 00 clr %o0 <== NOT EXECUTED =============================================================================== 02012cd0 <_fat_block_read>: uint32_t start, uint32_t offset, uint32_t count, void *buff ) { 2012cd0: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; ssize_t cmpltd = 0; uint32_t blk = start; uint32_t ofs = offset; rtems_bdbuf_buffer *block = NULL; 2012cd4: c0 27 bf fc clr [ %fp + -4 ] uint32_t start, uint32_t offset, uint32_t count, void *buff ) { 2012cd8: a0 10 00 18 mov %i0, %l0 uint32_t blk = start; uint32_t ofs = offset; rtems_bdbuf_buffer *block = NULL; uint32_t c = 0; while (count > 0) 2012cdc: 80 a6 e0 00 cmp %i3, 0 2012ce0: 12 80 00 12 bne 2012d28 <_fat_block_read+0x58> <== ALWAYS TAKEN 2012ce4: b0 10 20 00 clr %i0 2012ce8: 30 80 00 1a b,a 2012d50 <_fat_block_read+0x80> <== NOT EXECUTED { rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) return -1; c = MIN(count, (fs_info->vol.bps - ofs)); 2012cec: fa 14 00 00 lduh [ %l0 ], %i5 memcpy((buff + cmpltd), (block->buffer + ofs), c); 2012cf0: c2 07 bf fc ld [ %fp + -4 ], %g1 { rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) return -1; c = MIN(count, (fs_info->vol.bps - ofs)); 2012cf4: ba 27 40 1a sub %i5, %i2, %i5 2012cf8: 80 a7 40 1b cmp %i5, %i3 2012cfc: 08 80 00 03 bleu 2012d08 <_fat_block_read+0x38> 2012d00: b2 06 60 01 inc %i1 2012d04: ba 10 00 1b mov %i3, %i5 memcpy((buff + cmpltd), (block->buffer + ofs), c); 2012d08: d2 00 60 1c ld [ %g1 + 0x1c ], %o1 2012d0c: 94 10 00 1d mov %i5, %o2 2012d10: 40 00 23 1e call 201b988 2012d14: 92 02 40 1a add %o1, %i2, %o1 count -= c; cmpltd += c; 2012d18: b0 07 40 18 add %i5, %i0, %i0 uint32_t blk = start; uint32_t ofs = offset; rtems_bdbuf_buffer *block = NULL; uint32_t c = 0; while (count > 0) 2012d1c: b6 a6 c0 1d subcc %i3, %i5, %i3 2012d20: 02 80 00 0c be 2012d50 <_fat_block_read+0x80> 2012d24: b4 10 20 00 clr %i2 { rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); 2012d28: 92 10 00 19 mov %i1, %o1 2012d2c: 94 10 20 01 mov 1, %o2 2012d30: 96 07 bf fc add %fp, -4, %o3 2012d34: 7f ff ff 00 call 2012934 2012d38: 90 10 00 10 mov %l0, %o0 if (rc != RC_OK) 2012d3c: 80 a2 20 00 cmp %o0, 0 2012d40: 02 bf ff eb be 2012cec <_fat_block_read+0x1c> <== ALWAYS TAKEN 2012d44: 90 07 00 18 add %i4, %i0, %o0 cmpltd += c; blk++; ofs = 0; } return cmpltd; } 2012d48: 81 c7 e0 08 ret <== NOT EXECUTED 2012d4c: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED 2012d50: 81 c7 e0 08 ret 2012d54: 81 e8 00 00 restore =============================================================================== 02012d58 <_fat_block_write>: fat_fs_info_t *fs_info, uint32_t start, uint32_t offset, uint32_t count, const void *buff) { 2012d58: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; ssize_t cmpltd = 0; uint32_t blk = start; uint32_t ofs = offset; rtems_bdbuf_buffer *block = NULL; 2012d5c: c0 27 bf fc clr [ %fp + -4 ] fat_fs_info_t *fs_info, uint32_t start, uint32_t offset, uint32_t count, const void *buff) { 2012d60: a0 10 00 18 mov %i0, %l0 uint32_t blk = start; uint32_t ofs = offset; rtems_bdbuf_buffer *block = NULL; uint32_t c = 0; while(count > 0) 2012d64: 80 a6 e0 00 cmp %i3, 0 2012d68: 02 80 00 29 be 2012e0c <_fat_block_write+0xb4> <== NEVER TAKEN 2012d6c: b0 10 20 00 clr %i0 } static inline void fat_buf_mark_modified(fat_fs_info_t *fs_info) { fs_info->c.modified = true; 2012d70: 10 80 00 13 b 2012dbc <_fat_block_write+0x64> 2012d74: a2 10 20 01 mov 1, %l1 c = MIN(count, (fs_info->vol.bps - ofs)); if (c == fs_info->vol.bps) rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_GET, &block); else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); 2012d78: 96 07 bf fc add %fp, -4, %o3 2012d7c: 7f ff fe ee call 2012934 2012d80: 90 10 00 10 mov %l0, %o0 if (rc != RC_OK) return -1; memcpy((block->buffer + ofs), (buff + cmpltd), c); 2012d84: 92 07 00 18 add %i4, %i0, %o1 if (c == fs_info->vol.bps) rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_GET, &block); else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) 2012d88: 80 a2 20 00 cmp %o0, 0 2012d8c: 12 80 00 1e bne 2012e04 <_fat_block_write+0xac> <== NEVER TAKEN 2012d90: 94 10 00 1d mov %i5, %o2 return -1; memcpy((block->buffer + ofs), (buff + cmpltd), c); 2012d94: c2 07 bf fc ld [ %fp + -4 ], %g1 fat_buf_mark_modified(fs_info); count -= c; cmpltd +=c; 2012d98: b0 07 40 18 add %i5, %i0, %i0 else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) return -1; memcpy((block->buffer + ofs), (buff + cmpltd), c); 2012d9c: d0 00 60 1c ld [ %g1 + 0x1c ], %o0 fat_buf_mark_modified(fs_info); count -= c; cmpltd +=c; blk++; 2012da0: b2 06 60 01 inc %i1 else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) return -1; memcpy((block->buffer + ofs), (buff + cmpltd), c); 2012da4: 40 00 22 f9 call 201b988 2012da8: 90 02 00 1a add %o0, %i2, %o0 2012dac: e2 2c 20 7c stb %l1, [ %l0 + 0x7c ] uint32_t blk = start; uint32_t ofs = offset; rtems_bdbuf_buffer *block = NULL; uint32_t c = 0; while(count > 0) 2012db0: b6 a6 c0 1d subcc %i3, %i5, %i3 2012db4: 02 80 00 16 be 2012e0c <_fat_block_write+0xb4> 2012db8: b4 10 20 00 clr %i2 { c = MIN(count, (fs_info->vol.bps - ofs)); 2012dbc: c2 14 00 00 lduh [ %l0 ], %g1 2012dc0: ba 20 40 1a sub %g1, %i2, %i5 2012dc4: 80 a7 40 1b cmp %i5, %i3 2012dc8: 08 80 00 03 bleu 2012dd4 <_fat_block_write+0x7c> 2012dcc: 92 10 00 19 mov %i1, %o1 2012dd0: ba 10 00 1b mov %i3, %i5 if (c == fs_info->vol.bps) 2012dd4: 80 a0 40 1d cmp %g1, %i5 2012dd8: 32 bf ff e8 bne,a 2012d78 <_fat_block_write+0x20> 2012ddc: 94 10 20 01 mov 1, %o2 rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_GET, &block); 2012de0: 92 10 00 19 mov %i1, %o1 2012de4: 94 10 20 02 mov 2, %o2 2012de8: 90 10 00 10 mov %l0, %o0 2012dec: 7f ff fe d2 call 2012934 2012df0: 96 07 bf fc add %fp, -4, %o3 else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) return -1; memcpy((block->buffer + ofs), (buff + cmpltd), c); 2012df4: 92 07 00 18 add %i4, %i0, %o1 if (c == fs_info->vol.bps) rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_GET, &block); else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) 2012df8: 80 a2 20 00 cmp %o0, 0 2012dfc: 02 bf ff e6 be 2012d94 <_fat_block_write+0x3c> <== ALWAYS TAKEN 2012e00: 94 10 00 1d mov %i5, %o2 cmpltd +=c; blk++; ofs = 0; } return cmpltd; } 2012e04: 81 c7 e0 08 ret <== NOT EXECUTED 2012e08: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED 2012e0c: 81 c7 e0 08 ret 2012e10: 81 e8 00 00 restore =============================================================================== 02012e14 <_fat_block_zero>: _fat_block_zero( fat_fs_info_t *fs_info, uint32_t start, uint32_t offset, uint32_t count) { 2012e14: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; uint32_t blk = start; uint32_t ofs = offset; rtems_bdbuf_buffer *block = NULL; 2012e18: c0 27 bf fc clr [ %fp + -4 ] uint32_t c = 0; while(count > 0) 2012e1c: 80 a6 e0 00 cmp %i3, 0 2012e20: 12 80 00 14 bne 2012e70 <_fat_block_zero+0x5c> <== ALWAYS TAKEN 2012e24: b8 10 20 01 mov 1, %i4 count -= c; blk++; ofs = 0; } return 0; 2012e28: 81 c7 e0 08 ret <== NOT EXECUTED 2012e2c: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED c = MIN(count, (fs_info->vol.bps - ofs)); if (c == fs_info->vol.bps) rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_GET, &block); else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); 2012e30: 96 07 bf fc add %fp, -4, %o3 2012e34: 7f ff fe c0 call 2012934 2012e38: 90 10 00 18 mov %i0, %o0 if (rc != RC_OK) return -1; memset((block->buffer + ofs), 0, c); 2012e3c: 92 10 20 00 clr %o1 if (c == fs_info->vol.bps) rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_GET, &block); else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) 2012e40: 80 a2 20 00 cmp %o0, 0 2012e44: 12 80 00 1d bne 2012eb8 <_fat_block_zero+0xa4> <== NEVER TAKEN 2012e48: 94 10 00 1d mov %i5, %o2 return -1; memset((block->buffer + ofs), 0, c); 2012e4c: c2 07 bf fc ld [ %fp + -4 ], %g1 fat_buf_mark_modified(fs_info); count -= c; blk++; 2012e50: b2 06 60 01 inc %i1 else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) return -1; memset((block->buffer + ofs), 0, c); 2012e54: d0 00 60 1c ld [ %g1 + 0x1c ], %o0 2012e58: 40 00 23 09 call 201ba7c 2012e5c: 90 02 00 1a add %o0, %i2, %o0 2012e60: f8 2e 20 7c stb %i4, [ %i0 + 0x7c ] uint32_t blk = start; uint32_t ofs = offset; rtems_bdbuf_buffer *block = NULL; uint32_t c = 0; while(count > 0) 2012e64: b6 a6 c0 1d subcc %i3, %i5, %i3 2012e68: 02 80 00 16 be 2012ec0 <_fat_block_zero+0xac> 2012e6c: b4 10 20 00 clr %i2 { c = MIN(count, (fs_info->vol.bps - ofs)); 2012e70: c2 16 00 00 lduh [ %i0 ], %g1 2012e74: ba 20 40 1a sub %g1, %i2, %i5 2012e78: 80 a7 40 1b cmp %i5, %i3 2012e7c: 08 80 00 03 bleu 2012e88 <_fat_block_zero+0x74> <== ALWAYS TAKEN 2012e80: 92 10 00 19 mov %i1, %o1 2012e84: ba 10 00 1b mov %i3, %i5 <== NOT EXECUTED if (c == fs_info->vol.bps) 2012e88: 80 a0 40 1d cmp %g1, %i5 2012e8c: 32 bf ff e9 bne,a 2012e30 <_fat_block_zero+0x1c> 2012e90: 94 10 20 01 mov 1, %o2 rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_GET, &block); 2012e94: 92 10 00 19 mov %i1, %o1 2012e98: 94 10 20 02 mov 2, %o2 2012e9c: 90 10 00 18 mov %i0, %o0 2012ea0: 7f ff fe a5 call 2012934 2012ea4: 96 07 bf fc add %fp, -4, %o3 else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) return -1; memset((block->buffer + ofs), 0, c); 2012ea8: 92 10 20 00 clr %o1 if (c == fs_info->vol.bps) rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_GET, &block); else rc = fat_buf_access(fs_info, blk, FAT_OP_TYPE_READ, &block); if (rc != RC_OK) 2012eac: 80 a2 20 00 cmp %o0, 0 2012eb0: 02 bf ff e7 be 2012e4c <_fat_block_zero+0x38> <== ALWAYS TAKEN 2012eb4: 94 10 00 1d mov %i5, %o2 count -= c; blk++; ofs = 0; } return 0; } 2012eb8: 81 c7 e0 08 ret <== NOT EXECUTED 2012ebc: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED count -= c; blk++; ofs = 0; } return 0; 2012ec0: b0 10 20 00 clr %i0 2012ec4: 81 c7 e0 08 ret 2012ec8: 81 e8 00 00 restore =============================================================================== 02003a38 <_gettimeofday>: int _gettimeofday( struct timeval *tp, struct timezone *tzp ) { return gettimeofday( tp, tzp ); 2003a38: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED 2003a3c: 7f ff ff d4 call 200398c <== NOT EXECUTED 2003a40: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED =============================================================================== 0200403c <_lstat_r>: struct _reent *ptr __attribute__((unused)), const char *path, struct stat *buf ) { return _STAT_NAME( path, buf ); 200403c: 90 10 00 09 mov %o1, %o0 <== NOT EXECUTED 2004040: 92 10 00 0a mov %o2, %o1 <== NOT EXECUTED 2004044: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED 2004048: 7f ff ff e9 call 2003fec <== NOT EXECUTED 200404c: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED =============================================================================== 02004978 <_stat_r>: struct _reent *ptr __attribute__((unused)), const char *path, struct stat *buf ) { return _STAT_NAME( path, buf ); 2004978: 90 10 00 09 mov %o1, %o0 <== NOT EXECUTED 200497c: 92 10 00 0a mov %o2, %o1 <== NOT EXECUTED 2004980: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED 2004984: 7f ff ff e9 call 2004928 <== NOT EXECUTED 2004988: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED =============================================================================== 02004794 : speed_t cfgetispeed( const struct termios *tp ) { return (tp->c_cflag / (CIBAUD / CBAUD)) & CBAUD; 2004794: d0 12 20 08 lduh [ %o0 + 8 ], %o0 <== NOT EXECUTED 2004798: 03 00 00 04 sethi %hi(0x1000), %g1 <== NOT EXECUTED 200479c: 82 10 60 0f or %g1, 0xf, %g1 ! 100f <== NOT EXECUTED } 20047a0: 81 c3 e0 08 retl <== NOT EXECUTED 20047a4: 90 0a 00 01 and %o0, %g1, %o0 <== NOT EXECUTED =============================================================================== 020047a8 : speed_t cfgetospeed( const struct termios *tp ) { return tp->c_cflag & CBAUD; 20047a8: d0 02 20 08 ld [ %o0 + 8 ], %o0 <== NOT EXECUTED 20047ac: 03 00 00 04 sethi %hi(0x1000), %g1 <== NOT EXECUTED 20047b0: 82 10 60 0f or %g1, 0xf, %g1 ! 100f <== NOT EXECUTED } 20047b4: 81 c3 e0 08 retl <== NOT EXECUTED 20047b8: 90 0a 00 01 and %o0, %g1, %o0 <== NOT EXECUTED =============================================================================== 020047bc : int cfsetispeed( struct termios *tp, speed_t speed ) { 20047bc: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED if ( speed & ~CBAUD ) 20047c0: 05 3f ff fb sethi %hi(0xffffec00), %g2 <== NOT EXECUTED 20047c4: 84 10 a3 f0 or %g2, 0x3f0, %g2 ! ffffeff0 <== NOT EXECUTED 20047c8: 80 8e 40 02 btst %i1, %g2 <== NOT EXECUTED 20047cc: 12 80 00 0a bne 20047f4 <== NOT EXECUTED 20047d0: 82 10 00 18 mov %i0, %g1 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EINVAL ); tp->c_cflag = (tp->c_cflag & ~CIBAUD) | (speed * (CIBAUD / CBAUD)); 20047d4: c4 06 20 08 ld [ %i0 + 8 ], %g2 <== NOT EXECUTED 20047d8: 07 04 03 c0 sethi %hi(0x100f0000), %g3 <== NOT EXECUTED 20047dc: b3 2e 60 10 sll %i1, 0x10, %i1 <== NOT EXECUTED 20047e0: 84 28 80 03 andn %g2, %g3, %g2 <== NOT EXECUTED 20047e4: b2 16 40 02 or %i1, %g2, %i1 <== NOT EXECUTED 20047e8: f2 20 60 08 st %i1, [ %g1 + 8 ] <== NOT EXECUTED return 0; } 20047ec: 81 c7 e0 08 ret <== NOT EXECUTED 20047f0: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED struct termios *tp, speed_t speed ) { if ( speed & ~CBAUD ) rtems_set_errno_and_return_minus_one( EINVAL ); 20047f4: 40 00 31 da call 2010f5c <__errno> <== NOT EXECUTED 20047f8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20047fc: 82 10 20 16 mov 0x16, %g1 <== NOT EXECUTED 2004800: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2004804: 81 c7 e0 08 ret <== NOT EXECUTED 2004808: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200480c : int cfsetospeed( struct termios *tp, speed_t speed ) { 200480c: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED if ( speed & ~CBAUD ) 2004810: 03 3f ff fb sethi %hi(0xffffec00), %g1 <== NOT EXECUTED 2004814: 82 10 63 f0 or %g1, 0x3f0, %g1 ! ffffeff0 <== NOT EXECUTED 2004818: 80 8e 40 01 btst %i1, %g1 <== NOT EXECUTED 200481c: 12 80 00 08 bne 200483c <== NOT EXECUTED 2004820: 84 10 00 18 mov %i0, %g2 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EINVAL ); tp->c_cflag = (tp->c_cflag & ~CBAUD) | speed; 2004824: c6 06 20 08 ld [ %i0 + 8 ], %g3 <== NOT EXECUTED 2004828: 82 08 c0 01 and %g3, %g1, %g1 <== NOT EXECUTED 200482c: b2 16 40 01 or %i1, %g1, %i1 <== NOT EXECUTED 2004830: f2 20 a0 08 st %i1, [ %g2 + 8 ] <== NOT EXECUTED return 0; } 2004834: 81 c7 e0 08 ret <== NOT EXECUTED 2004838: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED struct termios *tp, speed_t speed ) { if ( speed & ~CBAUD ) rtems_set_errno_and_return_minus_one( EINVAL ); 200483c: 40 00 31 c8 call 2010f5c <__errno> <== NOT EXECUTED 2004840: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2004844: 82 10 20 16 mov 0x16, %g1 <== NOT EXECUTED 2004848: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 200484c: 81 c7 e0 08 ret <== NOT EXECUTED 2004850: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02008dec : rtems_rbtree_control *chunk_tree, rtems_rbheap_chunk *a, rtems_rbheap_chunk *b ) { if (b != NULL_PAGE && rtems_rbheap_is_chunk_free(b)) { 2008dec: 80 a2 ff f8 cmp %o3, -8 2008df0: 02 80 00 23 be 2008e7c 2008df4: 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); 2008df8: c2 02 c0 00 ld [ %o3 ], %g1 2008dfc: 80 a0 60 00 cmp %g1, 0 2008e00: 22 80 00 1c be,a 2008e70 2008e04: c4 02 e0 04 ld [ %o3 + 4 ], %g2 if (b->begin < a->begin) { 2008e08: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3 2008e0c: c4 02 a0 18 ld [ %o2 + 0x18 ], %g2 2008e10: 80 a0 c0 02 cmp %g3, %g2 2008e14: 3a 80 00 07 bcc,a 2008e30 2008e18: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4 2008e1c: 84 10 00 0a mov %o2, %g2 2008e20: c2 02 80 00 ld [ %o2 ], %g1 2008e24: 94 10 00 0b mov %o3, %o2 2008e28: 96 10 00 02 mov %g2, %o3 a = b; b = t; } a->size += b->size; 2008e2c: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4 2008e30: c6 02 e0 1c ld [ %o3 + 0x1c ], %g3 { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 2008e34: c4 02 e0 04 ld [ %o3 + 4 ], %g2 2008e38: 86 01 00 03 add %g4, %g3, %g3 2008e3c: c6 22 a0 1c st %g3, [ %o2 + 0x1c ] next->previous = previous; previous->next = next; 2008e40: c2 20 80 00 st %g1, [ %g2 ] Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; next->previous = previous; 2008e44: c4 20 60 04 st %g2, [ %g1 + 4 ] ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 2008e48: c2 02 00 00 ld [ %o0 ], %g1 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 2008e4c: d0 22 e0 04 st %o0, [ %o3 + 4 ] before_node = after_node->next; after_node->next = the_node; 2008e50: d6 22 00 00 st %o3, [ %o0 ] the_node->next = before_node; 2008e54: 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); 2008e58: 90 10 00 09 mov %o1, %o0 before_node->previous = the_node; 2008e5c: d6 20 60 04 st %o3, [ %g1 + 4 ] 2008e60: 92 02 e0 08 add %o3, 8, %o1 2008e64: 82 13 c0 00 mov %o7, %g1 2008e68: 40 00 07 1c call 200aad8 <_RBTree_Extract_unprotected> 2008e6c: 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); 2008e70: 80 a0 a0 00 cmp %g2, 0 2008e74: 32 bf ff e6 bne,a 2008e0c <== NEVER TAKEN 2008e78: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3 <== NOT EXECUTED 2008e7c: 81 c3 e0 08 retl =============================================================================== 02003c68 : #include #include int chroot( const char *path ) { 2003c68: 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( 2003c6c: 94 10 20 19 mov 0x19, %o2 2003c70: 92 10 00 18 mov %i0, %o1 2003c74: 90 07 bf c8 add %fp, -56, %o0 2003c78: 17 00 80 48 sethi %hi(0x2012000), %o3 2003c7c: 96 12 e0 c4 or %o3, 0xc4, %o3 ! 20120c4 2003c80: 40 00 05 00 call 2005080 2003c84: 98 02 ff fc add %o3, -4, %o4 2003c88: 92 07 bf e0 add %fp, -32, %o1 2003c8c: 40 00 06 18 call 20054ec 2003c90: 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 ); 2003c94: 40 00 06 a7 call 2005730 2003c98: 90 07 bf b0 add %fp, -80, %o0 if ( !rtems_filesystem_global_location_is_null( new_current_loc ) ) { 2003c9c: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 2003ca0: 39 00 80 46 sethi %hi(0x2011800), %i4 2003ca4: b8 17 23 04 or %i4, 0x304, %i4 ! 2011b04 2003ca8: 80 a0 40 1c cmp %g1, %i4 2003cac: 02 80 00 16 be 2003d04 2003cb0: d0 27 bf ac st %o0, [ %fp + -84 ] rtems_filesystem_global_location_t *new_root_loc = 2003cb4: 40 00 06 63 call 2005640 2003cb8: 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)( 2003cbc: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 2003cc0: 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 = 2003cc4: c2 00 60 14 ld [ %g1 + 0x14 ], %g1 2003cc8: 9f c0 40 00 call %g1 2003ccc: 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 ) { 2003cd0: 80 a2 20 00 cmp %o0, 0 2003cd4: 02 80 00 13 be 2003d20 2003cd8: 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 ) ) { 2003cdc: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2003ce0: 80 a0 40 1c cmp %g1, %i4 2003ce4: 02 80 00 06 be 2003cfc <== NEVER TAKEN 2003ce8: 01 00 00 00 nop errno = eno; 2003cec: 40 00 1f 0b call 200b918 <__errno> 2003cf0: 01 00 00 00 nop 2003cf4: 82 10 20 14 mov 0x14, %g1 ! 14 2003cf8: 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 ); 2003cfc: 40 00 06 31 call 20055c0 2003d00: 90 10 00 1d mov %i5, %o0 } } else { rv = -1; } rtems_filesystem_eval_path_cleanup( &ctx ); 2003d04: 40 00 05 29 call 20051a8 2003d08: 90 07 bf c8 add %fp, -56, %o0 if ( rv != 0 ) { rtems_filesystem_global_location_release( new_current_loc ); 2003d0c: d0 07 bf ac ld [ %fp + -84 ], %o0 2003d10: 40 00 06 2c call 20055c0 2003d14: b0 10 3f ff mov -1, %i0 } return rv; } 2003d18: 81 c7 e0 08 ret 2003d1c: 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(); 2003d20: 40 00 03 2d call 20049d4 2003d24: 01 00 00 00 nop if (sc == RTEMS_SUCCESSFUL) { 2003d28: 80 a2 20 00 cmp %o0, 0 2003d2c: 02 80 00 09 be 2003d50 2003d30: 80 a2 20 0d cmp %o0, 0xd rtems_filesystem_global_location_assign( &rtems_filesystem_current, new_current_loc ); } else { if (sc != RTEMS_UNSATISFIED) { 2003d34: 02 bf ff f2 be 2003cfc <== NEVER TAKEN 2003d38: 01 00 00 00 nop errno = ENOMEM; 2003d3c: 40 00 1e f7 call 200b918 <__errno> 2003d40: 01 00 00 00 nop 2003d44: 82 10 20 0c mov 0xc, %g1 ! c 2003d48: 10 bf ff ed b 2003cfc 2003d4c: 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( 2003d50: 39 00 80 48 sethi %hi(0x2012000), %i4 2003d54: d0 07 20 bc ld [ %i4 + 0xbc ], %o0 ! 20120bc 2003d58: 92 10 00 1d mov %i5, %o1 2003d5c: 40 00 06 2f call 2005618 2003d60: 90 02 20 04 add %o0, 4, %o0 &rtems_filesystem_root, new_root_loc ); rtems_filesystem_global_location_assign( 2003d64: d2 07 bf ac ld [ %fp + -84 ], %o1 2003d68: d0 07 20 bc ld [ %i4 + 0xbc ], %o0 2003d6c: 40 00 06 2b call 2005618 2003d70: b0 10 20 00 clr %i0 } } else { rv = -1; } rtems_filesystem_eval_path_cleanup( &ctx ); 2003d74: 40 00 05 0d call 20051a8 2003d78: 90 07 bf c8 add %fp, -56, %o0 2003d7c: 81 c7 e0 08 ret 2003d80: 81 e8 00 00 restore =============================================================================== 020037e0 : dev_t dev, const char *name, rtems_disk_device **dd_ptr, char **alloc_name_ptr ) { 20037e0: 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) { 20037e4: 25 00 80 84 sethi %hi(0x2021000), %l2 20037e8: fa 04 a2 08 ld [ %l2 + 0x208 ], %i5 ! 2021208 20037ec: 80 a6 00 1d cmp %i0, %i5 20037f0: 1a 80 00 30 bcc 20038b0 20037f4: a2 10 00 18 mov %i0, %l1 20037f8: 03 00 80 84 sethi %hi(0x2021000), %g1 20037fc: e0 00 62 0c ld [ %g1 + 0x20c ], %l0 ! 202120c 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) { 2003800: 83 2c 60 03 sll %l1, 3, %g1 2003804: fa 04 00 01 ld [ %l0 + %g1 ], %i5 2003808: a0 04 00 01 add %l0, %g1, %l0 200380c: 80 a7 60 00 cmp %i5, 0 2003810: 02 80 00 0f be 200384c 2003814: f0 04 20 04 ld [ %l0 + 4 ], %i0 2003818: 80 a6 40 18 cmp %i1, %i0 200381c: 1a 80 00 0d bcc 2003850 2003820: 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; 2003824: 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) { 2003828: a0 87 40 01 addcc %i5, %g1, %l0 200382c: 02 80 00 1f be 20038a8 <== NEVER TAKEN 2003830: 01 00 00 00 nop return RTEMS_NO_MEMORY; } if (*dd_entry != NULL) { 2003834: c2 07 40 01 ld [ %i5 + %g1 ], %g1 2003838: 80 a0 60 00 cmp %g1, 0 200383c: 02 80 00 36 be 2003914 2003840: b0 10 20 0c mov 0xc, %i0 *dd_entry = dd; *dd_ptr = dd; *alloc_name_ptr = alloc_name; return RTEMS_SUCCESSFUL; } 2003844: 81 c7 e0 08 ret 2003848: 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) { 200384c: 80 a6 20 00 cmp %i0, 0 2003850: 12 80 00 2b bne 20038fc 2003854: a4 10 20 08 mov 8, %l2 new_size = DISKTAB_INITIAL_SIZE; } else { new_size = 2 * old_size; } if (minor >= new_size) { 2003858: 80 a6 40 12 cmp %i1, %l2 200385c: 3a 80 00 02 bcc,a 2003864 2003860: a4 06 60 01 add %i1, 1, %l2 new_size = minor + 1; } table = realloc(table, new_size * sizeof(*table)); 2003864: 90 10 00 1d mov %i5, %o0 2003868: 40 00 08 ce call 2005ba0 200386c: 93 2c a0 02 sll %l2, 2, %o1 if (table == NULL) { 2003870: ba 92 20 00 orcc %o0, 0, %i5 2003874: 02 80 00 0d be 20038a8 2003878: 94 24 80 18 sub %l2, %i0, %o2 return NULL; } memset(table + old_size, 0, (new_size - old_size) * sizeof(*table)); 200387c: 91 2e 20 02 sll %i0, 2, %o0 2003880: 92 10 20 00 clr %o1 2003884: 90 07 40 08 add %i5, %o0, %o0 2003888: 40 00 43 fa call 2014870 200388c: 95 2a a0 02 sll %o2, 2, %o2 disktab [major].minor = table; 2003890: fa 24 00 00 st %i5, [ %l0 ] disktab [major].size = new_size; 2003894: e4 24 20 04 st %l2, [ %l0 + 4 ] } return disktab [major].minor + minor; 2003898: 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) { 200389c: a0 87 40 01 addcc %i5, %g1, %l0 20038a0: 32 bf ff e6 bne,a 2003838 <== ALWAYS TAKEN 20038a4: c2 07 40 01 ld [ %i5 + %g1 ], %g1 alloc_name = strdup(name); if (alloc_name == NULL) { free(dd); return RTEMS_NO_MEMORY; 20038a8: 81 c7 e0 08 ret 20038ac: 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; 20038b0: 27 00 80 84 sethi %hi(0x2021000), %l3 rtems_device_major_number old_size = disktab_size; rtems_device_major_number new_size = 2 * old_size; 20038b4: b1 2f 60 01 sll %i5, 1, %i0 if (major >= new_size) { 20038b8: 80 a4 40 18 cmp %l1, %i0 20038bc: 0a 80 00 03 bcs 20038c8 <== NEVER TAKEN 20038c0: d0 04 e2 0c ld [ %l3 + 0x20c ], %o0 new_size = major + 1; 20038c4: b0 04 60 01 add %l1, 1, %i0 } table = realloc(table, new_size * sizeof(*table)); 20038c8: 40 00 08 b6 call 2005ba0 20038cc: 93 2e 20 03 sll %i0, 3, %o1 if (table == NULL) { 20038d0: a0 92 20 00 orcc %o0, 0, %l0 20038d4: 02 bf ff f5 be 20038a8 <== ALWAYS TAKEN 20038d8: 94 26 00 1d sub %i0, %i5, %o2 return NULL; } memset(table + old_size, 0, (new_size - old_size) * sizeof(*table)); 20038dc: 91 2f 60 03 sll %i5, 3, %o0 <== NOT EXECUTED 20038e0: 92 10 20 00 clr %o1 <== NOT EXECUTED 20038e4: 90 04 00 08 add %l0, %o0, %o0 <== NOT EXECUTED 20038e8: 40 00 43 e2 call 2014870 <== NOT EXECUTED 20038ec: 95 2a a0 03 sll %o2, 3, %o2 <== NOT EXECUTED disktab = table; 20038f0: e0 24 e2 0c st %l0, [ %l3 + 0x20c ] <== NOT EXECUTED disktab_size = new_size; 20038f4: 10 bf ff c3 b 2003800 <== NOT EXECUTED 20038f8: f0 24 a2 08 st %i0, [ %l2 + 0x208 ] <== NOT EXECUTED rtems_device_minor_number new_size = 0; if (old_size == 0) { new_size = DISKTAB_INITIAL_SIZE; } else { new_size = 2 * old_size; 20038fc: a5 2e 20 01 sll %i0, 1, %l2 } if (minor >= new_size) { 2003900: 80 a6 40 12 cmp %i1, %l2 2003904: 0a bf ff d9 bcs 2003868 <== ALWAYS TAKEN 2003908: 90 10 00 1d mov %i5, %o0 200390c: 10 bf ff d7 b 2003868 <== NOT EXECUTED 2003910: a4 06 60 01 add %i1, 1, %l2 <== NOT EXECUTED if (*dd_entry != NULL) { return RTEMS_RESOURCE_IN_USE; } dd = malloc(sizeof(*dd)); 2003914: 40 00 05 d9 call 2005078 2003918: 90 10 20 78 mov 0x78, %o0 if (dd == NULL) { 200391c: ba 92 20 00 orcc %o0, 0, %i5 2003920: 02 bf ff e2 be 20038a8 <== NEVER TAKEN 2003924: 80 a6 a0 00 cmp %i2, 0 return RTEMS_NO_MEMORY; } if (name != NULL) { 2003928: 02 80 00 0f be 2003964 200392c: b0 10 20 00 clr %i0 alloc_name = strdup(name); 2003930: 40 00 45 07 call 2014d4c 2003934: 90 10 00 1a mov %i2, %o0 if (alloc_name == NULL) { 2003938: b0 92 20 00 orcc %o0, 0, %i0 200393c: 02 80 00 16 be 2003994 <== NEVER TAKEN 2003940: b4 10 00 08 mov %o0, %i2 return RTEMS_NO_MEMORY; } } if (name != NULL) { if (mknod(alloc_name, 0777 | S_IFBLK, dev) < 0) { 2003944: 94 10 00 11 mov %l1, %o2 2003948: 13 00 00 18 sethi %hi(0x6000), %o1 200394c: 96 10 00 19 mov %i1, %o3 2003950: 40 00 06 3e call 2005248 2003954: 92 12 61 ff or %o1, 0x1ff, %o1 2003958: 80 a2 20 00 cmp %o0, 0 200395c: 06 80 00 07 bl 2003978 <== NEVER TAKEN 2003960: 01 00 00 00 nop free(dd); return RTEMS_UNSATISFIED; } } *dd_entry = dd; 2003964: fa 24 00 00 st %i5, [ %l0 ] *dd_ptr = dd; 2003968: fa 26 c0 00 st %i5, [ %i3 ] *alloc_name_ptr = alloc_name; 200396c: f0 27 00 00 st %i0, [ %i4 ] return RTEMS_SUCCESSFUL; 2003970: 81 c7 e0 08 ret 2003974: 91 e8 20 00 restore %g0, 0, %o0 } } if (name != NULL) { if (mknod(alloc_name, 0777 | S_IFBLK, dev) < 0) { free(alloc_name); 2003978: 40 00 04 5e call 2004af0 <== NOT EXECUTED 200397c: 90 10 00 1a mov %i2, %o0 <== NOT EXECUTED free(dd); 2003980: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2003984: 40 00 04 5b call 2004af0 <== NOT EXECUTED 2003988: b0 10 20 0d mov 0xd, %i0 <== NOT EXECUTED return RTEMS_UNSATISFIED; 200398c: 81 c7 e0 08 ret <== NOT EXECUTED 2003990: 81 e8 00 00 restore <== NOT EXECUTED if (name != NULL) { alloc_name = strdup(name); if (alloc_name == NULL) { free(dd); 2003994: 40 00 04 57 call 2004af0 <== NOT EXECUTED 2003998: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 200399c: 30 bf ff c3 b,a 20038a8 <== NOT EXECUTED =============================================================================== 02004e3c : * 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) 2004e3c: 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) 2004e40: 90 10 20 01 mov 1, %o0 if (new_part_desc == NULL) { return RTEMS_INTERNAL_ERROR; } *new_part_desc = NULL; 2004e44: c0 26 40 00 clr [ %i1 ] if ((part_desc = calloc(1, sizeof(rtems_part_desc_t))) == NULL) 2004e48: 40 00 03 43 call 2005b54 2004e4c: 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) 2004e50: 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) 2004e54: ba 10 00 08 mov %o0, %i5 2004e58: 80 a2 20 00 cmp %o0, 0 2004e5c: 02 80 00 40 be 2004f5c <== NEVER TAKEN 2004e60: 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)); 2004e64: c6 08 60 0b ldub [ %g1 + 0xb ], %g3 2004e68: da 08 60 08 ldub [ %g1 + 8 ], %o5 2004e6c: de 08 60 09 ldub [ %g1 + 9 ], %o7 2004e70: 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)); 2004e74: f6 08 60 0d ldub [ %g1 + 0xd ], %i3 2004e78: f8 08 60 0e ldub [ %g1 + 0xe ], %i4 2004e7c: c8 08 60 0f ldub [ %g1 + 0xf ], %g4 2004e80: 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)); 2004e84: c6 2f bf ff stb %g3, [ %fp + -1 ] 2004e88: da 2f bf fc stb %o5, [ %fp + -4 ] 2004e8c: de 2f bf fd stb %o7, [ %fp + -3 ] 2004e90: f0 2f bf fe stb %i0, [ %fp + -2 ] part_desc->start = LE_TO_CPU_U32(temp); 2004e94: 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); 2004e98: 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); 2004e9c: 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)); 2004ea0: f6 2f bf fd stb %i3, [ %fp + -3 ] 2004ea4: f8 2f bf fe stb %i4, [ %fp + -2 ] 2004ea8: c8 2f bf ff stb %g4, [ %fp + -1 ] 2004eac: f4 2f bf fc stb %i2, [ %fp + -4 ] part_desc->size = LE_TO_CPU_U32(temp); 2004eb0: 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; 2004eb4: b7 28 a0 18 sll %g2, 0x18, %i3 uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 2004eb8: 89 30 a0 18 srl %g2, 0x18, %g4 byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 2004ebc: b9 30 a0 08 srl %g2, 8, %i4 byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2004ec0: 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; 2004ec4: b8 0f 20 ff and %i4, 0xff, %i4 byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2004ec8: b9 2f 20 10 sll %i4, 0x10, %i4 2004ecc: 88 11 00 1c or %g4, %i4, %g4 2004ed0: b7 28 60 18 sll %g1, 0x18, %i3 uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 2004ed4: b9 30 60 18 srl %g1, 0x18, %i4 byte3 = (value >> 16) & 0xff; 2004ed8: 85 30 a0 10 srl %g2, 0x10, %g2 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2004edc: b8 16 c0 1c or %i3, %i4, %i4 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2004ee0: 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); 2004ee4: c6 2a 00 00 stb %g3, [ %o0 ] byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2004ee8: 85 28 a0 08 sll %g2, 8, %g2 part_desc->sys_type = *(data + RTEMS_IDE_PARTITION_SYS_TYPE_OFFSET); 2004eec: d2 2a 20 01 stb %o1, [ %o0 + 1 ] 2004ef0: 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; 2004ef4: 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); 2004ef8: c4 22 20 04 st %g2, [ %o0 + 4 ] 2004efc: 88 09 20 ff and %g4, 0xff, %g4 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2004f00: 83 30 60 10 srl %g1, 0x10, %g1 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2004f04: 89 29 20 10 sll %g4, 0x10, %g4 ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2004f08: 82 08 60 ff and %g1, 0xff, %g1 byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2004f0c: b8 17 00 04 or %i4, %g4, %i4 2004f10: 83 28 60 08 sll %g1, 8, %g1 2004f14: 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) || 2004f18: 82 0a 60 7f and %o1, 0x7f, %g1 2004f1c: 80 a0 60 05 cmp %g1, 5 2004f20: 02 80 00 11 be 2004f64 2004f24: 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))); 2004f28: 92 0a 60 ff and %o1, 0xff, %o1 2004f2c: 11 00 80 91 sethi %hi(0x2024400), %o0 2004f30: 94 10 20 06 mov 6, %o2 2004f34: 40 00 43 41 call 2015c38 2004f38: 90 12 21 70 or %o0, 0x170, %o0 * use partitions that are * - extended * or * - FAT type and non-zero */ if (is_extended(part_desc->sys_type) || 2004f3c: 80 a2 20 00 cmp %o0, 0 2004f40: 02 80 00 04 be 2004f50 2004f44: 80 a7 20 00 cmp %i4, 0 ((is_fat_partition(part_desc->sys_type)) && (part_desc->size != 0))) { 2004f48: 32 80 00 08 bne,a 2004f68 <== ALWAYS TAKEN 2004f4c: fa 26 40 00 st %i5, [ %i1 ] *new_part_desc = part_desc; } else { /* empty partition */ free(part_desc); 2004f50: 90 10 00 1d mov %i5, %o0 2004f54: 40 00 03 d2 call 2005e9c 2004f58: b0 10 20 00 clr %i0 } return RTEMS_SUCCESSFUL; } 2004f5c: 81 c7 e0 08 ret 2004f60: 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; 2004f64: fa 26 40 00 st %i5, [ %i1 ] } else { /* empty partition */ free(part_desc); } return RTEMS_SUCCESSFUL; 2004f68: 81 c7 e0 08 ret 2004f6c: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 02002d5c : #endif #include "devfs.h" void devFS_Show(void) { 2002d5c: 9d e3 bf a0 save %sp, -96, %sp rtems_filesystem_location_info_t *rootloc = &rtems_filesystem_root->location; 2002d60: 03 00 80 66 sethi %hi(0x2019800), %g1 2002d64: c2 00 63 04 ld [ %g1 + 0x304 ], %g1 ! 2019b04 if (rootloc->mt_entry->ops == &devFS_ops) { 2002d68: 05 00 80 60 sethi %hi(0x2018000), %g2 2002d6c: c2 00 60 04 ld [ %g1 + 4 ], %g1 2002d70: 84 10 a0 d4 or %g2, 0xd4, %g2 2002d74: c2 00 60 14 ld [ %g1 + 0x14 ], %g1 2002d78: c6 00 60 0c ld [ %g1 + 0xc ], %g3 2002d7c: 80 a0 c0 02 cmp %g3, %g2 2002d80: 22 80 00 04 be,a 2002d90 <== ALWAYS TAKEN 2002d84: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 2002d88: 81 c7 e0 08 ret <== NOT EXECUTED 2002d8c: 81 e8 00 00 restore <== NOT EXECUTED const devFS_data *data = devFS_get_data(rootloc); size_t i = 0; size_t n = data->count; 2002d90: f0 00 60 04 ld [ %g1 + 4 ], %i0 devFS_node *nodes = data->nodes; for (i = 0; i < n; ++i) { 2002d94: 80 a6 20 00 cmp %i0, 0 2002d98: 02 bf ff fc be 2002d88 <== NEVER TAKEN 2002d9c: f8 00 40 00 ld [ %g1 ], %i4 if (current->name != NULL) { size_t j = 0; size_t m = current->namelen; printk("/"); 2002da0: 23 00 80 60 sethi %hi(0x2018000), %l1 for (j = 0; j < m; ++j) { printk("%c", current->name [j]); 2002da4: 35 00 80 60 sethi %hi(0x2018000), %i2 } printk( 2002da8: 21 00 80 60 sethi %hi(0x2018000), %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) { 2002dac: b2 10 20 00 clr %i1 if (current->name != NULL) { size_t j = 0; size_t m = current->namelen; printk("/"); 2002db0: a2 14 61 28 or %l1, 0x128, %l1 for (j = 0; j < m; ++j) { printk("%c", current->name [j]); 2002db4: b4 16 a1 40 or %i2, 0x140, %i2 } printk( 2002db8: a0 14 21 30 or %l0, 0x130, %l0 devFS_node *nodes = data->nodes; for (i = 0; i < n; ++i) { devFS_node *current = nodes + i; if (current->name != NULL) { 2002dbc: c2 07 00 00 ld [ %i4 ], %g1 2002dc0: 80 a0 60 00 cmp %g1, 0 2002dc4: 22 80 00 15 be,a 2002e18 2002dc8: b2 06 60 01 inc %i1 size_t j = 0; size_t m = current->namelen; 2002dcc: f6 07 20 04 ld [ %i4 + 4 ], %i3 printk("/"); 2002dd0: 40 00 04 b3 call 200409c 2002dd4: 90 10 00 11 mov %l1, %o0 for (j = 0; j < m; ++j) { 2002dd8: 80 a6 e0 00 cmp %i3, 0 2002ddc: 02 80 00 0a be 2002e04 <== NEVER TAKEN 2002de0: ba 10 20 00 clr %i5 printk("%c", current->name [j]); 2002de4: c2 07 00 00 ld [ %i4 ], %g1 2002de8: 90 10 00 1a mov %i2, %o0 2002dec: d2 48 40 1d ldsb [ %g1 + %i5 ], %o1 2002df0: 40 00 04 ab call 200409c 2002df4: 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) { 2002df8: 80 a7 40 1b cmp %i5, %i3 2002dfc: 32 bf ff fb bne,a 2002de8 2002e00: c2 07 00 00 ld [ %i4 ], %g1 printk("%c", current->name [j]); } printk( 2002e04: d2 07 20 08 ld [ %i4 + 8 ], %o1 2002e08: d4 07 20 0c ld [ %i4 + 0xc ], %o2 2002e0c: 40 00 04 a4 call 200409c 2002e10: 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) { 2002e14: b2 06 60 01 inc %i1 2002e18: 80 a6 40 18 cmp %i1, %i0 2002e1c: 12 bf ff e8 bne 2002dbc 2002e20: b8 07 20 14 add %i4, 0x14, %i4 2002e24: 81 c7 e0 08 ret 2002e28: 81 e8 00 00 restore =============================================================================== 0200c538 : } void devFS_eval_path( rtems_filesystem_eval_path_context_t *ctx ) { 200c538: 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; 200c53c: 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; 200c540: e2 06 00 00 ld [ %i0 ], %l1 200c544: 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; 200c548: 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; 200c54c: 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) { 200c550: 80 a4 20 00 cmp %l0, 0 200c554: 02 80 00 3d be 200c648 200c558: 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; 200c55c: b4 10 20 00 clr %i2 devFS_node *free_node = NULL; 200c560: 82 10 20 00 clr %g1 for (i = 0; (free_node == NULL || node == NULL) && i < n; ++i) { 200c564: 10 80 00 09 b 200c588 200c568: b8 10 20 00 clr %i4 200c56c: 80 a6 a0 00 cmp %i2, 0 200c570: 12 80 00 18 bne 200c5d0 200c574: b8 07 20 01 inc %i4 200c578: ba 07 60 14 add %i5, 0x14, %i5 200c57c: 80 a7 00 10 cmp %i4, %l0 200c580: 02 80 00 1f be 200c5fc 200c584: 82 10 00 1b mov %i3, %g1 devFS_node *current = nodes + i; if (current->name != NULL) { 200c588: d0 07 40 00 ld [ %i5 ], %o0 200c58c: 80 a2 20 00 cmp %o0, 0 200c590: 02 bf ff f7 be 200c56c 200c594: b6 10 00 1d mov %i5, %i3 if ( 200c598: c4 07 60 04 ld [ %i5 + 4 ], %g2 200c59c: 80 a6 40 02 cmp %i1, %g2 200c5a0: 12 bf ff f3 bne 200c56c 200c5a4: b6 10 00 01 mov %g1, %i3 current->namelen == pathlen && memcmp(current->name, path, pathlen) == 0 200c5a8: 92 10 00 11 mov %l1, %o1 200c5ac: 40 00 09 e5 call 200ed40 200c5b0: 94 10 00 19 mov %i1, %o2 200c5b4: 80 a2 20 00 cmp %o0, 0 200c5b8: 12 bf ff ee bne 200c570 200c5bc: 80 a6 a0 00 cmp %i2, 0 200c5c0: 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) { 200c5c4: 80 a6 a0 00 cmp %i2, 0 200c5c8: 02 bf ff ec be 200c578 <== NEVER TAKEN 200c5cc: b8 07 20 01 inc %i4 200c5d0: 80 a6 e0 00 cmp %i3, 0 200c5d4: 22 bf ff ea be,a 200c57c 200c5d8: 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; 200c5dc: 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) { 200c5e0: 80 88 60 40 btst 0x40, %g1 200c5e4: 12 80 00 15 bne 200c638 200c5e8: 01 00 00 00 nop currentloc->node_access = node; 200c5ec: 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; 200c5f0: c0 26 20 04 clr [ %i0 + 4 ] 200c5f4: 81 c7 e0 08 ret 200c5f8: 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) { 200c5fc: 80 a6 a0 00 cmp %i2, 0 200c600: 12 bf ff f8 bne 200c5e0 200c604: 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) { 200c608: 80 88 60 20 btst 0x20, %g1 200c60c: 02 80 00 0d be 200c640 <== NEVER TAKEN 200c610: 80 a6 e0 00 cmp %i3, 0 if (free_node != NULL) { 200c614: 02 80 00 11 be 200c658 <== NEVER TAKEN 200c618: 82 10 21 ff mov 0x1ff, %g1 free_node->mode = S_IRWXU | S_IRWXG | S_IRWXO; 200c61c: c2 26 e0 10 st %g1, [ %i3 + 0x10 ] currentloc->node_access = free_node; 200c620: f6 26 20 20 st %i3, [ %i0 + 0x20 ] rtems_filesystem_eval_path_context_t *ctx, const char *token, size_t tokenlen ) { ctx->token = token; 200c624: e2 26 20 08 st %l1, [ %i0 + 8 ] ctx->tokenlen = tokenlen; 200c628: 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; 200c62c: c0 26 20 04 clr [ %i0 + 4 ] 200c630: 81 c7 e0 08 ret 200c634: 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); 200c638: 7f ff e2 73 call 2005004 200c63c: 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); 200c640: 7f ff e2 71 call 2005004 <== NOT EXECUTED 200c644: 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) { 200c648: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 200c64c: 80 88 60 20 btst 0x20, %g1 200c650: 02 bf ff fc be 200c640 <== NEVER TAKEN 200c654: 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); 200c658: 7f ff e2 6b call 2005004 200c65c: 93 e8 20 1c restore %g0, 0x1c, %o1 =============================================================================== 02003910 : const char *name, size_t namelen, mode_t mode, dev_t dev ) { 2003910: 9d e3 bf a0 save %sp, -96, %sp int rv = 0; if (namelen != 3 || name [0] != 'd' || name [1] != 'e' || name [2] != 'v') { 2003914: 80 a6 a0 03 cmp %i2, 3 2003918: 22 80 00 18 be,a 2003978 200391c: c2 4e 40 00 ldsb [ %i1 ], %g1 if (S_ISBLK(mode) || S_ISCHR(mode)) { 2003920: 05 00 00 2c sethi %hi(0xb000), %g2 2003924: 03 00 00 08 sethi %hi(0x2000), %g1 2003928: 84 0e c0 02 and %i3, %g2, %g2 200392c: 80 a0 80 01 cmp %g2, %g1 2003930: 12 80 00 23 bne 20039bc 2003934: 01 00 00 00 nop char *dupname = malloc(namelen); 2003938: 40 00 02 0d call 200416c 200393c: 90 10 00 1a mov %i2, %o0 if (dupname != NULL) { 2003940: 84 92 20 00 orcc %o0, 0, %g2 2003944: 02 80 00 24 be 20039d4 2003948: 92 10 00 19 mov %i1, %o1 devFS_node *node = parentloc->node_access; 200394c: c2 06 20 08 ld [ %i0 + 8 ], %g1 node->name = dupname; 2003950: c4 20 40 00 st %g2, [ %g1 ] node->namelen = namelen; 2003954: f4 20 60 04 st %i2, [ %g1 + 4 ] node->major = rtems_filesystem_dev_major_t(dev); 2003958: f8 20 60 08 st %i4, [ %g1 + 8 ] node->minor = rtems_filesystem_dev_minor_t(dev); 200395c: fa 20 60 0c st %i5, [ %g1 + 0xc ] node->mode = mode; 2003960: f6 20 60 10 st %i3, [ %g1 + 0x10 ] memcpy(dupname, name, namelen); 2003964: 94 10 00 1a mov %i2, %o2 2003968: 40 00 2d 20 call 200ede8 200396c: b0 10 20 00 clr %i0 2003970: 81 c7 e0 08 ret 2003974: 81 e8 00 00 restore dev_t dev ) { int rv = 0; if (namelen != 3 || name [0] != 'd' || name [1] != 'e' || name [2] != 'v') { 2003978: 80 a0 60 64 cmp %g1, 0x64 200397c: 12 bf ff ea bne 2003924 <== NEVER TAKEN 2003980: 05 00 00 2c sethi %hi(0xb000), %g2 2003984: c2 4e 60 01 ldsb [ %i1 + 1 ], %g1 2003988: 80 a0 60 65 cmp %g1, 0x65 200398c: 12 bf ff e7 bne 2003928 <== NEVER TAKEN 2003990: 03 00 00 08 sethi %hi(0x2000), %g1 2003994: c2 4e 60 02 ldsb [ %i1 + 2 ], %g1 2003998: 80 a0 60 76 cmp %g1, 0x76 200399c: 12 bf ff e3 bne 2003928 <== NEVER TAKEN 20039a0: 03 00 00 08 sethi %hi(0x2000), %g1 } else { errno = ENOTSUP; rv = -1; } } else { if (!S_ISDIR(mode)) { 20039a4: 03 00 00 3c sethi %hi(0xf000), %g1 20039a8: b6 0e c0 01 and %i3, %g1, %i3 20039ac: 03 00 00 10 sethi %hi(0x4000), %g1 20039b0: 80 a6 c0 01 cmp %i3, %g1 20039b4: 02 bf ff ef be 2003970 <== ALWAYS TAKEN 20039b8: b0 10 20 00 clr %i0 errno = ENOTSUP; 20039bc: 40 00 2a 7c call 200e3ac <__errno> 20039c0: b0 10 3f ff mov -1, %i0 20039c4: 82 10 20 86 mov 0x86, %g1 20039c8: c2 22 00 00 st %g1, [ %o0 ] rv = -1; } } return rv; } 20039cc: 81 c7 e0 08 ret 20039d0: 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; 20039d4: 40 00 2a 76 call 200e3ac <__errno> 20039d8: b0 10 3f ff mov -1, %i0 20039dc: 82 10 20 0c mov 0xc, %g1 20039e0: c2 22 00 00 st %g1, [ %o0 ] 20039e4: 81 c7 e0 08 ret 20039e8: 81 e8 00 00 restore =============================================================================== 02003768 : */ static volatile bool diskdevs_protected; static rtems_status_code disk_lock(void) { 2003768: 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); 200376c: 03 00 80 84 sethi %hi(0x2021000), %g1 2003770: d0 00 62 04 ld [ %g1 + 0x204 ], %o0 ! 2021204 2003774: 92 10 20 00 clr %o1 2003778: 94 10 20 00 clr %o2 200377c: 40 00 16 83 call 2009188 2003780: b0 10 20 16 mov 0x16, %i0 if (sc == RTEMS_SUCCESSFUL) { 2003784: 80 a2 20 00 cmp %o0, 0 2003788: 12 80 00 05 bne 200379c <== NEVER TAKEN 200378c: 84 10 20 01 mov 1, %g2 diskdevs_protected = true; 2003790: 03 00 80 84 sethi %hi(0x2021000), %g1 return RTEMS_SUCCESSFUL; 2003794: 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; 2003798: c4 28 62 00 stb %g2, [ %g1 + 0x200 ] return RTEMS_SUCCESSFUL; } else { return RTEMS_NOT_CONFIGURED; } } 200379c: 81 c7 e0 08 ret 20037a0: 81 e8 00 00 restore =============================================================================== 020037a4 : static void disk_unlock(void) { 20037a4: 9d e3 bf a0 save %sp, -96, %sp rtems_status_code sc = RTEMS_SUCCESSFUL; diskdevs_protected = false; sc = rtems_semaphore_release(diskdevs_mutex); 20037a8: 03 00 80 84 sethi %hi(0x2021000), %g1 20037ac: d0 00 62 04 ld [ %g1 + 0x204 ], %o0 ! 2021204 static void disk_unlock(void) { rtems_status_code sc = RTEMS_SUCCESSFUL; diskdevs_protected = false; 20037b0: 03 00 80 84 sethi %hi(0x2021000), %g1 20037b4: c0 28 62 00 clrb [ %g1 + 0x200 ] ! 2021200 sc = rtems_semaphore_release(diskdevs_mutex); 20037b8: 40 00 16 c4 call 20092c8 20037bc: 01 00 00 00 nop if (sc != RTEMS_SUCCESSFUL) { 20037c0: 80 a2 20 00 cmp %o0, 0 20037c4: 12 80 00 04 bne 20037d4 <== NEVER TAKEN 20037c8: 11 37 ab 6f sethi %hi(0xdeadbc00), %o0 20037cc: 81 c7 e0 08 ret 20037d0: 81 e8 00 00 restore /* FIXME: Error number */ rtems_fatal_error_occurred(0xdeadbeef); 20037d4: 40 00 18 1f call 2009850 <== NOT EXECUTED 20037d8: 90 12 22 ef or %o0, 0x2ef, %o0 <== NOT EXECUTED =============================================================================== 02005610 : /* * Drain output queue */ static void drainOutput (struct rtems_termios_tty *tty) 2005610: 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); 2005614: 7f ff f4 54 call 2002764 2005618: 01 00 00 00 nop while (tty->rawOutBuf.Tail != tty->rawOutBuf.Head) { 200561c: c4 06 20 84 ld [ %i0 + 0x84 ], %g2 2005620: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 2005624: 80 a0 80 01 cmp %g2, %g1 2005628: 02 80 00 14 be 2005678 <== ALWAYS TAKEN 200562c: 01 00 00 00 nop tty->rawOutBufState = rob_wait; 2005630: b8 10 20 02 mov 2, %i4 ! 2 <== NOT EXECUTED 2005634: f8 26 20 94 st %i4, [ %i0 + 0x94 ] <== NOT EXECUTED rtems_interrupt_enable (level); 2005638: 7f ff f4 4f call 2002774 <== NOT EXECUTED 200563c: 01 00 00 00 nop <== NOT EXECUTED sc = rtems_semaphore_obtain( 2005640: d0 06 20 8c ld [ %i0 + 0x8c ], %o0 <== NOT EXECUTED 2005644: 92 10 20 00 clr %o1 <== NOT EXECUTED 2005648: 40 00 09 e7 call 2007de4 <== NOT EXECUTED 200564c: 94 10 20 00 clr %o2 <== NOT EXECUTED tty->rawOutBuf.Semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT); if (sc != RTEMS_SUCCESSFUL) 2005650: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2005654: 12 80 00 0b bne 2005680 <== NOT EXECUTED 2005658: 01 00 00 00 nop <== NOT EXECUTED rtems_fatal_error_occurred (sc); rtems_interrupt_disable (level); 200565c: 7f ff f4 42 call 2002764 <== NOT EXECUTED 2005660: 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) { 2005664: c4 06 20 84 ld [ %i0 + 0x84 ], %g2 <== NOT EXECUTED 2005668: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED 200566c: 80 a0 80 01 cmp %g2, %g1 <== NOT EXECUTED 2005670: 32 bf ff f2 bne,a 2005638 <== NOT EXECUTED 2005674: 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); 2005678: 7f ff f4 3f call 2002774 200567c: 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); 2005680: 40 00 0b a4 call 2008510 <== NOT EXECUTED =============================================================================== 02003e00 : int dup2( int fildes, int fildes2 ) { 2003e00: 9d e3 bf 58 save %sp, -168, %sp /* * If fildes is not valid, then fildes2 should not be closed. */ status = fstat( fildes, &buf ); 2003e04: 90 10 00 18 mov %i0, %o0 2003e08: 40 00 01 eb call 20045b4 2003e0c: 92 07 bf b8 add %fp, -72, %o1 if ( status == -1 ) 2003e10: 80 a2 3f ff cmp %o0, -1 2003e14: 02 80 00 0c be 2003e44 2003e18: 90 10 00 19 mov %i1, %o0 /* * If fildes2 is not valid, then we should not do anything either. */ status = fstat( fildes2, &buf ); 2003e1c: 40 00 01 e6 call 20045b4 2003e20: 92 07 bf b8 add %fp, -72, %o1 if ( status == -1 ) 2003e24: 80 a2 3f ff cmp %o0, -1 2003e28: 02 80 00 07 be 2003e44 <== NEVER TAKEN 2003e2c: 90 10 00 18 mov %i0, %o0 /* * This fcntl handles everything else. */ return fcntl( fildes, F_DUPFD, fildes2 ); 2003e30: 92 10 20 00 clr %o1 2003e34: 40 00 00 b0 call 20040f4 2003e38: 94 10 00 19 mov %i1, %o2 } 2003e3c: 81 c7 e0 08 ret 2003e40: 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; 2003e44: 81 c7 e0 08 ret 2003e48: 91 e8 3f ff restore %g0, -1, %o0 =============================================================================== 0200639c : /* * Echo a typed character */ static void echo (unsigned char c, struct rtems_termios_tty *tty) { 200639c: 9d e3 bf 98 save %sp, -104, %sp if ((tty->termios.c_lflag & ECHOCTL) && 20063a0: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 20063a4: 80 88 62 00 btst 0x200, %g1 20063a8: 02 80 00 0d be 20063dc <== NEVER TAKEN 20063ac: 03 00 80 71 sethi %hi(0x201c400), %g1 iscntrl(c) && (c != '\t') && (c != '\n')) { 20063b0: c2 00 63 f8 ld [ %g1 + 0x3f8 ], %g1 ! 201c7f8 <__ctype_ptr__> 20063b4: 82 00 40 18 add %g1, %i0, %g1 20063b8: 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) && 20063bc: 80 88 60 20 btst 0x20, %g1 20063c0: 02 80 00 08 be 20063e0 20063c4: 90 10 00 18 mov %i0, %o0 iscntrl(c) && (c != '\t') && (c != '\n')) { 20063c8: 82 06 3f f7 add %i0, -9, %g1 20063cc: 82 08 60 ff and %g1, 0xff, %g1 20063d0: 80 a0 60 01 cmp %g1, 1 20063d4: 18 80 00 07 bgu 20063f0 20063d8: 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); 20063dc: 90 10 00 18 mov %i0, %o0 20063e0: 7f ff ff 8f call 200621c 20063e4: 92 10 00 19 mov %i1, %o1 20063e8: 81 c7 e0 08 ret 20063ec: 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; 20063f0: 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] = '^'; 20063f4: c2 2f bf f8 stb %g1, [ %fp + -8 ] echobuf[1] = c ^ 0x40; 20063f8: f0 2f bf f9 stb %i0, [ %fp + -7 ] rtems_termios_puts (echobuf, 2, tty); 20063fc: 90 07 bf f8 add %fp, -8, %o0 2006400: 92 10 20 02 mov 2, %o1 2006404: 7f ff ff 36 call 20060dc 2006408: 94 10 00 19 mov %i1, %o2 tty->column += 2; 200640c: c2 06 60 28 ld [ %i1 + 0x28 ], %g1 2006410: 82 00 60 02 add %g1, 2, %g1 2006414: c2 26 60 28 st %g1, [ %i1 + 0x28 ] 2006418: 81 c7 e0 08 ret 200641c: 81 e8 00 00 restore =============================================================================== 020275d0 : } void endgrent(void) { if (group_fp != NULL) 20275d0: 03 00 81 95 sethi %hi(0x2065400), %g1 20275d4: d0 00 60 10 ld [ %g1 + 0x10 ], %o0 ! 2065410 20275d8: 80 a2 20 00 cmp %o0, 0 20275dc: 02 80 00 05 be 20275f0 <== NEVER TAKEN 20275e0: 01 00 00 00 nop fclose(group_fp); 20275e4: 82 13 c0 00 mov %o7, %g1 20275e8: 40 00 4d ff call 203ade4 20275ec: 9e 10 40 00 mov %g1, %o7 20275f0: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 02027434 : } void endpwent(void) { if (passwd_fp != NULL) 2027434: 03 00 81 94 sethi %hi(0x2065000), %g1 2027438: d0 00 63 30 ld [ %g1 + 0x330 ], %o0 ! 2065330 202743c: 80 a2 20 00 cmp %o0, 0 2027440: 02 80 00 05 be 2027454 <== NEVER TAKEN 2027444: 01 00 00 00 nop fclose(passwd_fp); 2027448: 82 13 c0 00 mov %o7, %g1 202744c: 40 00 4e 66 call 203ade4 2027450: 9e 10 40 00 mov %g1, %o7 2027454: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 02006420 : * 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) 2006420: 9d e3 bf a0 save %sp, -96, %sp /* * Back up over the tab */ while (tty->column > col) { rtems_termios_puts ("\b", 1, tty); 2006424: 37 00 80 6c sethi %hi(0x201b000), %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) 2006428: ba 10 00 18 mov %i0, %i5 rtems_termios_puts ("\b", 1, tty); tty->column--; } } else { if (iscntrl (c) && (tty->termios.c_lflag & ECHOCTL)) { 200642c: 35 00 80 71 sethi %hi(0x201c400), %i2 rtems_termios_puts ("\b \b", 3, tty); 2006430: 31 00 80 6c sethi %hi(0x201b000), %i0 /* * Back up over the tab */ while (tty->column > col) { rtems_termios_puts ("\b", 1, tty); 2006434: b6 16 e1 18 or %i3, 0x118, %i3 tty->column--; } } else { if (iscntrl (c) && (tty->termios.c_lflag & ECHOCTL)) { rtems_termios_puts ("\b \b", 3, tty); 2006438: 10 80 00 0f b 2006474 200643c: b0 16 21 20 or %i0, 0x120, %i0 if (tty->column) tty->column--; } if (!iscntrl (c) || (tty->termios.c_lflag & ECHOCTL)) { rtems_termios_puts ("\b \b", 3, tty); 2006440: 90 12 21 20 or %o0, 0x120, %o0 2006444: 92 10 20 03 mov 3, %o1 2006448: 7f ff ff 25 call 20060dc 200644c: 94 10 00 1d mov %i5, %o2 if (tty->column) 2006450: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2006454: 80 a0 60 00 cmp %g1, 0 2006458: 02 80 00 05 be 200646c <== NEVER TAKEN 200645c: 80 a6 60 00 cmp %i1, 0 tty->column--; 2006460: 82 00 7f ff add %g1, -1, %g1 2006464: c2 27 60 28 st %g1, [ %i5 + 0x28 ] } } } if (!lineFlag) 2006468: 80 a6 60 00 cmp %i1, 0 200646c: 02 80 00 58 be 20065cc 2006470: 01 00 00 00 nop echo ('\n', tty); return; } } while (tty->ccount) { 2006474: c4 07 60 20 ld [ %i5 + 0x20 ], %g2 2006478: 80 a0 a0 00 cmp %g2, 0 200647c: 02 80 00 54 be 20065cc 2006480: 84 00 bf ff add %g2, -1, %g2 unsigned char c = tty->cbuf[--tty->ccount]; 2006484: c8 07 60 1c ld [ %i5 + 0x1c ], %g4 if (tty->termios.c_lflag & ECHO) { 2006488: c6 07 60 3c ld [ %i5 + 0x3c ], %g3 return; } } while (tty->ccount) { unsigned char c = tty->cbuf[--tty->ccount]; 200648c: c4 27 60 20 st %g2, [ %i5 + 0x20 ] if (tty->termios.c_lflag & ECHO) { 2006490: 80 88 e0 08 btst 8, %g3 2006494: 02 bf ff f5 be 2006468 <== NEVER TAKEN 2006498: c2 09 00 02 ldub [ %g4 + %g2 ], %g1 if (!lineFlag && !(tty->termios.c_lflag & ECHOE)) { 200649c: 80 a6 60 00 cmp %i1, 0 20064a0: 12 80 00 05 bne 20064b4 20064a4: 82 08 60 ff and %g1, 0xff, %g1 20064a8: 80 88 e0 10 btst 0x10, %g3 20064ac: 22 80 00 4d be,a 20065e0 <== NEVER TAKEN 20064b0: f0 0f 60 43 ldub [ %i5 + 0x43 ], %i0 <== NOT EXECUTED echo (tty->termios.c_cc[VERASE], tty); } else if (c == '\t') { 20064b4: 80 a0 60 09 cmp %g1, 9 20064b8: 02 80 00 1e be 2006530 20064bc: 80 a0 a0 00 cmp %g2, 0 rtems_termios_puts ("\b", 1, tty); tty->column--; } } else { if (iscntrl (c) && (tty->termios.c_lflag & ECHOCTL)) { 20064c0: c4 06 a3 f8 ld [ %i2 + 0x3f8 ], %g2 20064c4: b8 00 60 01 add %g1, 1, %i4 20064c8: c2 08 80 1c ldub [ %g2 + %i4 ], %g1 20064cc: 80 88 60 20 btst 0x20, %g1 20064d0: 02 bf ff dc be 2006440 <== ALWAYS TAKEN 20064d4: 11 00 80 6c sethi %hi(0x201b000), %o0 20064d8: 80 88 e2 00 btst 0x200, %g3 <== NOT EXECUTED 20064dc: 02 bf ff e4 be 200646c <== NOT EXECUTED 20064e0: 80 a6 60 00 cmp %i1, 0 <== NOT EXECUTED rtems_termios_puts ("\b \b", 3, tty); 20064e4: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 20064e8: 92 10 20 03 mov 3, %o1 <== NOT EXECUTED 20064ec: 7f ff fe fc call 20060dc <== NOT EXECUTED 20064f0: 94 10 00 1d mov %i5, %o2 <== NOT EXECUTED if (tty->column) 20064f4: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 <== NOT EXECUTED 20064f8: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 20064fc: 12 80 00 3b bne 20065e8 <== NOT EXECUTED 2006500: 11 00 80 6c sethi %hi(0x201b000), %o0 <== NOT EXECUTED tty->column--; } if (!iscntrl (c) || (tty->termios.c_lflag & ECHOCTL)) { 2006504: c2 06 a3 f8 ld [ %i2 + 0x3f8 ], %g1 <== NOT EXECUTED 2006508: c2 08 40 1c ldub [ %g1 + %i4 ], %g1 <== NOT EXECUTED 200650c: 80 88 60 20 btst 0x20, %g1 <== NOT EXECUTED 2006510: 22 bf ff cd be,a 2006444 <== NOT EXECUTED 2006514: 90 12 21 20 or %o0, 0x120, %o0 <== NOT EXECUTED 2006518: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 <== NOT EXECUTED 200651c: 80 88 62 00 btst 0x200, %g1 <== NOT EXECUTED 2006520: 32 bf ff c9 bne,a 2006444 <== NOT EXECUTED 2006524: 90 12 21 20 or %o0, 0x120, %o0 <== NOT EXECUTED if (tty->column) tty->column--; } } } if (!lineFlag) 2006528: 10 bf ff d1 b 200646c <== NOT EXECUTED 200652c: 80 a6 60 00 cmp %i1, 0 <== NOT EXECUTED int i = 0; /* * Find the character before the tab */ while (i != tty->ccount) { 2006530: 02 80 00 17 be 200658c 2006534: f8 07 60 2c ld [ %i5 + 0x2c ], %i4 c = tty->cbuf[i++]; if (c == '\t') { col = (col | 7) + 1; } else if (iscntrl (c)) { 2006538: da 06 a3 f8 ld [ %i2 + 0x3f8 ], %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; 200653c: 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) 2006540: 10 80 00 07 b 200655c 2006544: 98 08 e2 00 and %g3, 0x200, %o4 2006548: 32 80 00 02 bne,a 2006550 <== NOT EXECUTED 200654c: b8 07 20 02 add %i4, 2, %i4 <== NOT EXECUTED int i = 0; /* * Find the character before the tab */ while (i != tty->ccount) { 2006550: 80 a0 80 01 cmp %g2, %g1 2006554: 22 80 00 0f be,a 2006590 <== NEVER TAKEN 2006558: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 <== NOT EXECUTED c = tty->cbuf[i++]; 200655c: c6 09 00 01 ldub [ %g4 + %g1 ], %g3 2006560: 82 00 60 01 inc %g1 if (c == '\t') { 2006564: 80 a0 e0 09 cmp %g3, 9 2006568: 02 80 00 1b be 20065d4 200656c: 9e 03 40 03 add %o5, %g3, %o7 col = (col | 7) + 1; } else if (iscntrl (c)) { 2006570: de 0b e0 01 ldub [ %o7 + 1 ], %o7 2006574: 80 8b e0 20 btst 0x20, %o7 2006578: 12 bf ff f4 bne 2006548 <== NEVER TAKEN 200657c: 80 a3 20 00 cmp %o4, 0 int i = 0; /* * Find the character before the tab */ while (i != tty->ccount) { 2006580: 80 a0 80 01 cmp %g2, %g1 2006584: 12 bf ff f6 bne 200655c 2006588: b8 07 20 01 inc %i4 } /* * Back up over the tab */ while (tty->column > col) { 200658c: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2006590: 80 a0 40 1c cmp %g1, %i4 2006594: 04 bf ff b6 ble 200646c <== NEVER TAKEN 2006598: 80 a6 60 00 cmp %i1, 0 rtems_termios_puts ("\b", 1, tty); 200659c: 90 10 00 1b mov %i3, %o0 20065a0: 92 10 20 01 mov 1, %o1 20065a4: 7f ff fe ce call 20060dc 20065a8: 94 10 00 1d mov %i5, %o2 tty->column--; 20065ac: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 20065b0: 82 00 7f ff add %g1, -1, %g1 } /* * Back up over the tab */ while (tty->column > col) { 20065b4: 80 a0 40 1c cmp %g1, %i4 20065b8: 14 bf ff f9 bg 200659c 20065bc: c2 27 60 28 st %g1, [ %i5 + 0x28 ] if (tty->column) tty->column--; } } } if (!lineFlag) 20065c0: 80 a6 60 00 cmp %i1, 0 20065c4: 32 bf ff ad bne,a 2006478 <== ALWAYS TAKEN 20065c8: c4 07 60 20 ld [ %i5 + 0x20 ], %g2 20065cc: 81 c7 e0 08 ret 20065d0: 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; 20065d4: b8 17 20 07 or %i4, 7, %i4 20065d8: 10 bf ff de b 2006550 20065dc: 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); 20065e0: 7f ff ff 6f call 200639c <== NOT EXECUTED 20065e4: 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--; 20065e8: 82 00 7f ff add %g1, -1, %g1 <== NOT EXECUTED 20065ec: 10 bf ff c6 b 2006504 <== NOT EXECUTED 20065f0: c2 27 60 28 st %g1, [ %i5 + 0x28 ] <== NOT EXECUTED =============================================================================== 02004b3c : size_t pathlen, int eval_flags, rtems_filesystem_global_location_t *const *global_root_ptr, rtems_filesystem_global_location_t *const *global_current_ptr ) { 2004b3c: 9d e3 bf 98 save %sp, -104, %sp memset(ctx, 0, sizeof(*ctx)); 2004b40: 92 10 20 00 clr %o1 2004b44: 90 10 00 18 mov %i0, %o0 2004b48: 40 00 2e 0b call 2010374 2004b4c: 94 10 20 38 mov 0x38, %o2 ctx->path = path; 2004b50: f2 26 00 00 st %i1, [ %i0 ] ctx->pathlen = pathlen; 2004b54: 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) { 2004b58: 80 a6 a0 00 cmp %i2, 0 2004b5c: 02 80 00 21 be 2004be0 2004b60: f6 26 20 10 st %i3, [ %i0 + 0x10 ] char c = ctx->path [0]; 2004b64: f6 0e 40 00 ldub [ %i1 ], %i3 ctx->rootloc = rtems_filesystem_global_location_obtain(global_root_ptr); 2004b68: 40 00 01 a3 call 20051f4 2004b6c: 90 10 00 1c mov %i4, %o0 gid_t node_gid ); static inline bool rtems_filesystem_is_delimiter(char c) { return c == '/' || c == '\\'; 2004b70: 83 2e e0 18 sll %i3, 0x18, %g1 2004b74: 83 38 60 18 sra %g1, 0x18, %g1 if (rtems_filesystem_is_delimiter(c)) { 2004b78: 80 a0 60 5c cmp %g1, 0x5c 2004b7c: 12 80 00 32 bne 2004c44 <== ALWAYS TAKEN 2004b80: d0 26 20 30 st %o0, [ %i0 + 0x30 ] ++ctx->path; 2004b84: c4 06 00 00 ld [ %i0 ], %g2 <== NOT EXECUTED --ctx->pathlen; 2004b88: 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; 2004b8c: 84 00 a0 01 inc %g2 --ctx->pathlen; 2004b90: 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; 2004b94: c4 26 00 00 st %g2, [ %i0 ] --ctx->pathlen; 2004b98: c2 26 20 04 st %g1, [ %i0 + 4 ] ctx->startloc = rtems_filesystem_global_location_obtain( 2004b9c: 40 00 01 96 call 20051f4 2004ba0: 90 06 20 30 add %i0, 0x30, %o0 2004ba4: d0 26 20 34 st %o0, [ %i0 + 0x34 ] 2004ba8: 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; 2004bac: d0 00 60 14 ld [ %g1 + 0x14 ], %o0 (*mt_entry->ops->lock_h)( mt_entry ); 2004bb0: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2004bb4: c2 00 40 00 ld [ %g1 ], %g1 2004bb8: 9f c0 40 00 call %g1 2004bbc: 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( 2004bc0: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 2004bc4: 40 00 1e eb call 200c770 2004bc8: 90 10 00 1d mov %i5, %o0 &ctx->currentloc, &ctx->startloc->location ); rtems_filesystem_eval_path_continue(ctx); 2004bcc: 90 10 00 18 mov %i0, %o0 2004bd0: 7f ff ff be call 2004ac8 2004bd4: b0 10 00 1d mov %i5, %i0 return &ctx->currentloc; } 2004bd8: 81 c7 e0 08 ret 2004bdc: 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; 2004be0: c0 27 bf fc clr [ %fp + -4 ] return rtems_filesystem_global_location_obtain( &global_loc ); 2004be4: 40 00 01 84 call 20051f4 2004be8: 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; 2004bec: 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(); 2004bf0: d0 26 20 30 st %o0, [ %i0 + 0x30 ] return rtems_filesystem_global_location_obtain( &global_loc ); 2004bf4: 40 00 01 80 call 20051f4 2004bf8: 90 07 bf fc add %fp, -4, %o0 ctx->startloc = rtems_filesystem_global_location_obtain_null(); errno = ENOENT; 2004bfc: 40 00 2b 5a call 200f964 <__errno> 2004c00: d0 26 20 34 st %o0, [ %i0 + 0x34 ] 2004c04: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 2004c08: 84 10 20 02 mov 2, %g2 2004c0c: 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; 2004c10: d0 00 60 14 ld [ %g1 + 0x14 ], %o0 (*mt_entry->ops->lock_h)( mt_entry ); 2004c14: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2004c18: c2 00 40 00 ld [ %g1 ], %g1 2004c1c: 9f c0 40 00 call %g1 2004c20: 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( 2004c24: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 2004c28: 40 00 1e d2 call 200c770 2004c2c: 90 10 00 1d mov %i5, %o0 &ctx->currentloc, &ctx->startloc->location ); rtems_filesystem_eval_path_continue(ctx); 2004c30: 90 10 00 18 mov %i0, %o0 2004c34: 7f ff ff a5 call 2004ac8 2004c38: b0 10 00 1d mov %i5, %i0 return &ctx->currentloc; } 2004c3c: 81 c7 e0 08 ret 2004c40: 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)) { 2004c44: 80 a0 60 2f cmp %g1, 0x2f 2004c48: 22 bf ff d0 be,a 2004b88 2004c4c: 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( 2004c50: 40 00 01 69 call 20051f4 2004c54: 90 10 00 1d mov %i5, %o0 2004c58: d0 26 20 34 st %o0, [ %i0 + 0x34 ] 2004c5c: 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; 2004c60: d0 00 60 14 ld [ %g1 + 0x14 ], %o0 (*mt_entry->ops->lock_h)( mt_entry ); 2004c64: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2004c68: c2 00 40 00 ld [ %g1 ], %g1 2004c6c: 9f c0 40 00 call %g1 2004c70: 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( 2004c74: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 2004c78: 40 00 1e be call 200c770 2004c7c: 90 10 00 1d mov %i5, %o0 &ctx->currentloc, &ctx->startloc->location ); rtems_filesystem_eval_path_continue(ctx); 2004c80: 90 10 00 18 mov %i0, %o0 2004c84: 7f ff ff 91 call 2004ac8 2004c88: b0 10 00 1d mov %i5, %i0 return &ctx->currentloc; } 2004c8c: 81 c7 e0 08 ret 2004c90: 81 e8 00 00 restore =============================================================================== 02012934 : #include "fat_fat_operations.h" int fat_buf_access(fat_fs_info_t *fs_info, uint32_t blk, int op_type, rtems_bdbuf_buffer **buf) { 2012934: 9d e3 bf 98 save %sp, -104, %sp rtems_status_code sc = RTEMS_SUCCESSFUL; uint8_t i; bool sec_of_fat; if (fs_info->c.state == FAT_CACHE_EMPTY) 2012938: c2 0e 20 7d ldub [ %i0 + 0x7d ], %g1 201293c: 80 a0 60 00 cmp %g1, 0 2012940: 22 80 00 31 be,a 2012a04 2012944: d0 06 20 58 ld [ %i0 + 0x58 ], %o0 2012948: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 fs_info->c.blk_num = blk; fs_info->c.modified = 0; fs_info->c.state = FAT_CACHE_ACTUAL; } sec_of_fat = ((fs_info->c.blk_num >= fs_info->vol.fat_loc) && 201294c: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 2012950: 80 a0 c0 01 cmp %g3, %g1 2012954: 08 80 00 3d bleu 2012a48 <== ALWAYS TAKEN 2012958: 84 10 20 00 clr %g2 (fs_info->c.blk_num < fs_info->vol.rdir_loc)); if (fs_info->c.blk_num != blk) 201295c: 80 a6 40 01 cmp %i1, %g1 2012960: 22 80 00 26 be,a 20129f8 2012964: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 { if (fs_info->c.modified) 2012968: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 201296c: 80 a0 60 00 cmp %g1, 0 2012970: 02 80 00 10 be 20129b0 2012974: 80 88 a0 ff btst 0xff, %g2 { if (sec_of_fat && !fs_info->vol.mirror) 2012978: 32 80 00 38 bne,a 2012a58 201297c: c2 0e 20 48 ldub [ %i0 + 0x48 ], %g1 memcpy(fs_info->sec_buf, fs_info->c.buf->buffer, fs_info->vol.bps); sc = rtems_bdbuf_release_modified(fs_info->c.buf); 2012980: 7f ff f9 bd call 2011074 2012984: d0 06 20 80 ld [ %i0 + 0x80 ], %o0 fs_info->c.state = FAT_CACHE_EMPTY; 2012988: c0 2e 20 7d clrb [ %i0 + 0x7d ] fs_info->c.modified = 0; if (sc != RTEMS_SUCCESSFUL) 201298c: 80 a2 20 00 cmp %o0, 0 2012990: 02 80 00 0d be 20129c4 <== ALWAYS TAKEN 2012994: c0 2e 20 7c clrb [ %i0 + 0x7c ] if (op_type == FAT_OP_TYPE_READ) 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); if (sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(EIO); 2012998: 40 00 21 47 call 201aeb4 <__errno> <== NOT EXECUTED 201299c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20129a0: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 20129a4: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 20129a8: 81 c7 e0 08 ret <== NOT EXECUTED 20129ac: 81 e8 00 00 restore <== NOT EXECUTED } } } else { sc = rtems_bdbuf_release(fs_info->c.buf); 20129b0: 7f ff f9 78 call 2010f90 20129b4: d0 06 20 80 ld [ %i0 + 0x80 ], %o0 fs_info->c.state = FAT_CACHE_EMPTY; if (sc != RTEMS_SUCCESSFUL) 20129b8: 80 a2 20 00 cmp %o0, 0 20129bc: 12 bf ff f7 bne 2012998 <== NEVER TAKEN 20129c0: c0 2e 20 7d clrb [ %i0 + 0x7d ] rtems_set_errno_and_return_minus_one(EIO); } if (op_type == FAT_OP_TYPE_READ) sc = rtems_bdbuf_read(fs_info->vol.dd, blk, &fs_info->c.buf); 20129c4: d0 06 20 58 ld [ %i0 + 0x58 ], %o0 20129c8: 92 10 00 19 mov %i1, %o1 fs_info->c.state = FAT_CACHE_EMPTY; if (sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(EIO); } if (op_type == FAT_OP_TYPE_READ) 20129cc: 80 a6 a0 01 cmp %i2, 1 20129d0: 02 80 00 5e be 2012b48 20129d4: 94 06 20 80 add %i0, 0x80, %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); 20129d8: 7f ff f8 a6 call 2010c70 20129dc: 01 00 00 00 nop if (sc != RTEMS_SUCCESSFUL) 20129e0: 80 a2 20 00 cmp %o0, 0 20129e4: 12 bf ff ed bne 2012998 <== NEVER TAKEN 20129e8: 82 10 20 01 mov 1, %g1 rtems_set_errno_and_return_minus_one(EIO); fs_info->c.blk_num = blk; 20129ec: f2 26 20 78 st %i1, [ %i0 + 0x78 ] fs_info->c.state = FAT_CACHE_ACTUAL; 20129f0: c2 2e 20 7d stb %g1, [ %i0 + 0x7d ] } *buf = fs_info->c.buf; 20129f4: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 20129f8: c2 26 c0 00 st %g1, [ %i3 ] return RC_OK; 20129fc: 81 c7 e0 08 ret 2012a00: 91 e8 20 00 restore %g0, 0, %o0 if (fs_info->c.state == FAT_CACHE_EMPTY) { if (op_type == FAT_OP_TYPE_READ) sc = rtems_bdbuf_read(fs_info->vol.dd, blk, &fs_info->c.buf); 2012a04: 92 10 00 19 mov %i1, %o1 bool sec_of_fat; if (fs_info->c.state == FAT_CACHE_EMPTY) { if (op_type == FAT_OP_TYPE_READ) 2012a08: 80 a6 a0 01 cmp %i2, 1 2012a0c: 02 80 00 4b be 2012b38 2012a10: 94 06 20 80 add %i0, 0x80, %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); 2012a14: 7f ff f8 97 call 2010c70 2012a18: 01 00 00 00 nop if (sc != RTEMS_SUCCESSFUL) 2012a1c: 80 a2 20 00 cmp %o0, 0 2012a20: 12 bf ff de bne 2012998 <== NEVER TAKEN 2012a24: 82 10 20 01 mov 1, %g1 fs_info->c.blk_num = blk; fs_info->c.modified = 0; fs_info->c.state = FAT_CACHE_ACTUAL; } sec_of_fat = ((fs_info->c.blk_num >= fs_info->vol.fat_loc) && 2012a28: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 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); if (sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(EIO); fs_info->c.blk_num = blk; 2012a2c: f2 26 20 78 st %i1, [ %i0 + 0x78 ] fs_info->c.modified = 0; fs_info->c.state = FAT_CACHE_ACTUAL; 2012a30: c2 2e 20 7d stb %g1, [ %i0 + 0x7d ] else sc = rtems_bdbuf_get(fs_info->vol.dd, blk, &fs_info->c.buf); if (sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(EIO); fs_info->c.blk_num = blk; fs_info->c.modified = 0; 2012a34: c0 2e 20 7c clrb [ %i0 + 0x7c ] fs_info->c.state = FAT_CACHE_ACTUAL; 2012a38: 82 10 00 19 mov %i1, %g1 } sec_of_fat = ((fs_info->c.blk_num >= fs_info->vol.fat_loc) && 2012a3c: 80 a0 c0 01 cmp %g3, %g1 2012a40: 18 bf ff c7 bgu 201295c <== NEVER TAKEN 2012a44: 84 10 20 00 clr %g2 2012a48: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 2012a4c: 80 a0 40 02 cmp %g1, %g2 2012a50: 10 bf ff c3 b 201295c 2012a54: 84 40 20 00 addx %g0, 0, %g2 if (fs_info->c.blk_num != blk) { if (fs_info->c.modified) { if (sec_of_fat && !fs_info->vol.mirror) 2012a58: 80 a0 60 00 cmp %g1, 0 2012a5c: 12 80 00 07 bne 2012a78 <== NEVER TAKEN 2012a60: 01 00 00 00 nop memcpy(fs_info->sec_buf, fs_info->c.buf->buffer, 2012a64: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 2012a68: d0 06 20 84 ld [ %i0 + 0x84 ], %o0 2012a6c: d2 00 60 1c ld [ %g1 + 0x1c ], %o1 2012a70: 40 00 23 c6 call 201b988 2012a74: d4 16 00 00 lduh [ %i0 ], %o2 fs_info->vol.bps); sc = rtems_bdbuf_release_modified(fs_info->c.buf); 2012a78: 7f ff f9 7f call 2011074 2012a7c: d0 06 20 80 ld [ %i0 + 0x80 ], %o0 fs_info->c.state = FAT_CACHE_EMPTY; 2012a80: c0 2e 20 7d clrb [ %i0 + 0x7d ] fs_info->c.modified = 0; if (sc != RTEMS_SUCCESSFUL) 2012a84: 80 a2 20 00 cmp %o0, 0 2012a88: 12 bf ff c4 bne 2012998 <== NEVER TAKEN 2012a8c: c0 2e 20 7c clrb [ %i0 + 0x7c ] rtems_set_errno_and_return_minus_one(EIO); if (sec_of_fat && !fs_info->vol.mirror) 2012a90: c2 0e 20 48 ldub [ %i0 + 0x48 ], %g1 2012a94: 80 a0 60 00 cmp %g1, 0 2012a98: 32 bf ff cc bne,a 20129c8 <== NEVER TAKEN 2012a9c: d0 06 20 58 ld [ %i0 + 0x58 ], %o0 <== NOT EXECUTED { rtems_bdbuf_buffer *b; for (i = 1; i < fs_info->vol.fats; i++) 2012aa0: c4 0e 20 09 ldub [ %i0 + 9 ], %g2 2012aa4: ba 10 20 01 mov 1, %i5 2012aa8: 80 a0 a0 01 cmp %g2, 1 2012aac: 18 80 00 12 bgu 2012af4 <== ALWAYS TAKEN 2012ab0: 90 10 20 01 mov 1, %o0 if (sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(EIO); } if (op_type == FAT_OP_TYPE_READ) sc = rtems_bdbuf_read(fs_info->vol.dd, blk, &fs_info->c.buf); 2012ab4: 10 bf ff c5 b 20129c8 <== NOT EXECUTED 2012ab8: d0 06 20 58 ld [ %i0 + 0x58 ], %o0 <== NOT EXECUTED fs_info->c.blk_num + fs_info->vol.fat_length * i, &b); if ( sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(ENOMEM); memcpy(b->buffer, fs_info->sec_buf, fs_info->vol.bps); 2012abc: d2 06 20 84 ld [ %i0 + 0x84 ], %o1 2012ac0: d4 16 00 00 lduh [ %i0 ], %o2 2012ac4: d0 00 60 1c ld [ %g1 + 0x1c ], %o0 2012ac8: 40 00 23 b0 call 201b988 2012acc: ba 07 60 01 inc %i5 sc = rtems_bdbuf_release_modified(b); 2012ad0: 7f ff f9 69 call 2011074 2012ad4: d0 07 bf fc ld [ %fp + -4 ], %o0 if ( sc != RTEMS_SUCCESSFUL) 2012ad8: 80 a2 20 00 cmp %o0, 0 2012adc: 12 80 00 11 bne 2012b20 <== NEVER TAKEN 2012ae0: 90 0f 60 ff and %i5, 0xff, %o0 if (sec_of_fat && !fs_info->vol.mirror) { rtems_bdbuf_buffer *b; for (i = 1; i < fs_info->vol.fats; i++) 2012ae4: c4 0e 20 09 ldub [ %i0 + 9 ], %g2 2012ae8: 80 a0 80 08 cmp %g2, %o0 2012aec: 28 bf ff b7 bleu,a 20129c8 <== ALWAYS TAKEN 2012af0: d0 06 20 58 ld [ %i0 + 0x58 ], %o0 { sc = rtems_bdbuf_get(fs_info->vol.dd, fs_info->c.blk_num + fs_info->vol.fat_length * i, 2012af4: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 2012af8: 40 00 44 d1 call 2023e3c <.umul> 2012afc: f8 06 20 58 ld [ %i0 + 0x58 ], %i4 { rtems_bdbuf_buffer *b; for (i = 1; i < fs_info->vol.fats; i++) { sc = rtems_bdbuf_get(fs_info->vol.dd, 2012b00: d2 06 20 78 ld [ %i0 + 0x78 ], %o1 2012b04: 94 07 bf fc add %fp, -4, %o2 2012b08: 92 02 00 09 add %o0, %o1, %o1 2012b0c: 7f ff f8 59 call 2010c70 2012b10: 90 10 00 1c mov %i4, %o0 fs_info->c.blk_num + fs_info->vol.fat_length * i, &b); if ( sc != RTEMS_SUCCESSFUL) 2012b14: 80 a2 20 00 cmp %o0, 0 2012b18: 02 bf ff e9 be 2012abc <== ALWAYS TAKEN 2012b1c: c2 07 bf fc ld [ %fp + -4 ], %g1 rtems_set_errno_and_return_minus_one(ENOMEM); memcpy(b->buffer, fs_info->sec_buf, fs_info->vol.bps); sc = rtems_bdbuf_release_modified(b); if ( sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(ENOMEM); 2012b20: 40 00 20 e5 call 201aeb4 <__errno> <== NOT EXECUTED 2012b24: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2012b28: 82 10 20 0c mov 0xc, %g1 <== NOT EXECUTED 2012b2c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2012b30: 81 c7 e0 08 ret <== NOT EXECUTED 2012b34: 81 e8 00 00 restore <== NOT EXECUTED if (fs_info->c.state == FAT_CACHE_EMPTY) { if (op_type == FAT_OP_TYPE_READ) sc = rtems_bdbuf_read(fs_info->vol.dd, blk, &fs_info->c.buf); 2012b38: 7f ff f8 8f call 2010d74 2012b3c: 01 00 00 00 nop else sc = rtems_bdbuf_get(fs_info->vol.dd, blk, &fs_info->c.buf); if (sc != RTEMS_SUCCESSFUL) 2012b40: 10 bf ff b8 b 2012a20 2012b44: 80 a2 20 00 cmp %o0, 0 if (sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(EIO); } if (op_type == FAT_OP_TYPE_READ) sc = rtems_bdbuf_read(fs_info->vol.dd, blk, &fs_info->c.buf); 2012b48: 7f ff f8 8b call 2010d74 2012b4c: 01 00 00 00 nop else sc = rtems_bdbuf_get(fs_info->vol.dd, blk, &fs_info->c.buf); if (sc != RTEMS_SUCCESSFUL) 2012b50: 10 bf ff a5 b 20129e4 2012b54: 80 a2 20 00 cmp %o0, 0 =============================================================================== 02012b58 : return RC_OK; } int fat_buf_release(fat_fs_info_t *fs_info) { 2012b58: 9d e3 bf 98 save %sp, -104, %sp rtems_status_code sc = RTEMS_SUCCESSFUL; uint8_t i; bool sec_of_fat; if (fs_info->c.state == FAT_CACHE_EMPTY) 2012b5c: c2 0e 20 7d ldub [ %i0 + 0x7d ], %g1 return RC_OK; } int fat_buf_release(fat_fs_info_t *fs_info) { 2012b60: ba 10 00 18 mov %i0, %i5 rtems_status_code sc = RTEMS_SUCCESSFUL; uint8_t i; bool sec_of_fat; if (fs_info->c.state == FAT_CACHE_EMPTY) 2012b64: 80 a0 60 00 cmp %g1, 0 2012b68: 02 80 00 3a be 2012c50 2012b6c: b0 10 20 00 clr %i0 return RC_OK; sec_of_fat = ((fs_info->c.blk_num >= fs_info->vol.fat_loc) && 2012b70: c2 07 60 78 ld [ %i5 + 0x78 ], %g1 2012b74: c4 17 60 14 lduh [ %i5 + 0x14 ], %g2 2012b78: 80 a0 40 02 cmp %g1, %g2 2012b7c: 3a 80 00 37 bcc,a 2012c58 <== ALWAYS TAKEN 2012b80: c4 07 60 1c ld [ %i5 + 0x1c ], %g2 (fs_info->c.blk_num < fs_info->vol.rdir_loc)); if (fs_info->c.modified) 2012b84: c2 0f 60 7c ldub [ %i5 + 0x7c ], %g1 <== NOT EXECUTED 2012b88: 80 a0 60 00 cmp %g1, 0 2012b8c: 02 80 00 46 be 2012ca4 <== NEVER TAKEN 2012b90: b8 10 20 00 clr %i4 { if (sec_of_fat && !fs_info->vol.mirror) memcpy(fs_info->sec_buf, fs_info->c.buf->buffer, fs_info->vol.bps); sc = rtems_bdbuf_release_modified(fs_info->c.buf); 2012b94: 7f ff f9 38 call 2011074 2012b98: d0 07 60 80 ld [ %i5 + 0x80 ], %o0 if (sc != RTEMS_SUCCESSFUL) 2012b9c: 80 a2 20 00 cmp %o0, 0 2012ba0: 12 80 00 46 bne 2012cb8 <== NEVER TAKEN 2012ba4: 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) 2012ba8: 02 80 00 3c be 2012c98 2012bac: c0 2f 60 7c clrb [ %i5 + 0x7c ] 2012bb0: c2 0f 60 48 ldub [ %i5 + 0x48 ], %g1 2012bb4: 80 a0 60 00 cmp %g1, 0 2012bb8: 32 80 00 39 bne,a 2012c9c <== NEVER TAKEN 2012bbc: c0 2f 60 7d clrb [ %i5 + 0x7d ] <== NOT EXECUTED { rtems_bdbuf_buffer *b; for (i = 1; i < fs_info->vol.fats; i++) 2012bc0: c4 0f 60 09 ldub [ %i5 + 9 ], %g2 2012bc4: b8 10 20 01 mov 1, %i4 2012bc8: 80 a0 a0 01 cmp %g2, 1 2012bcc: 18 80 00 12 bgu 2012c14 <== ALWAYS TAKEN 2012bd0: 90 10 20 01 mov 1, %o0 { sc = rtems_bdbuf_release(fs_info->c.buf); if (sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(EIO); } fs_info->c.state = FAT_CACHE_EMPTY; 2012bd4: 10 80 00 32 b 2012c9c <== NOT EXECUTED 2012bd8: c0 2f 60 7d clrb [ %i5 + 0x7d ] <== NOT EXECUTED fs_info->c.blk_num + fs_info->vol.fat_length * i, &b); if ( sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(ENOMEM); memcpy(b->buffer, fs_info->sec_buf, fs_info->vol.bps); 2012bdc: d2 07 60 84 ld [ %i5 + 0x84 ], %o1 2012be0: d4 17 40 00 lduh [ %i5 ], %o2 2012be4: d0 00 60 1c ld [ %g1 + 0x1c ], %o0 2012be8: 40 00 23 68 call 201b988 2012bec: b8 07 20 01 inc %i4 sc = rtems_bdbuf_release_modified(b); 2012bf0: 7f ff f9 21 call 2011074 2012bf4: d0 07 bf fc ld [ %fp + -4 ], %o0 if ( sc != RTEMS_SUCCESSFUL) 2012bf8: 80 a2 20 00 cmp %o0, 0 2012bfc: 12 80 00 11 bne 2012c40 <== NEVER TAKEN 2012c00: 90 0f 20 ff and %i4, 0xff, %o0 if (sec_of_fat && !fs_info->vol.mirror) { rtems_bdbuf_buffer *b; for (i = 1; i < fs_info->vol.fats; i++) 2012c04: c4 0f 60 09 ldub [ %i5 + 9 ], %g2 2012c08: 80 a2 00 02 cmp %o0, %g2 2012c0c: 3a 80 00 24 bcc,a 2012c9c <== ALWAYS TAKEN 2012c10: c0 2f 60 7d clrb [ %i5 + 0x7d ] { sc = rtems_bdbuf_get(fs_info->vol.dd, fs_info->c.blk_num + fs_info->vol.fat_length * i, 2012c14: d2 07 60 18 ld [ %i5 + 0x18 ], %o1 2012c18: 40 00 44 89 call 2023e3c <.umul> 2012c1c: f6 07 60 58 ld [ %i5 + 0x58 ], %i3 { rtems_bdbuf_buffer *b; for (i = 1; i < fs_info->vol.fats; i++) { sc = rtems_bdbuf_get(fs_info->vol.dd, 2012c20: d2 07 60 78 ld [ %i5 + 0x78 ], %o1 2012c24: 94 07 bf fc add %fp, -4, %o2 2012c28: 92 02 00 09 add %o0, %o1, %o1 2012c2c: 7f ff f8 11 call 2010c70 2012c30: 90 10 00 1b mov %i3, %o0 fs_info->c.blk_num + fs_info->vol.fat_length * i, &b); if ( sc != RTEMS_SUCCESSFUL) 2012c34: 80 a2 20 00 cmp %o0, 0 2012c38: 02 bf ff e9 be 2012bdc <== ALWAYS TAKEN 2012c3c: c2 07 bf fc ld [ %fp + -4 ], %g1 rtems_set_errno_and_return_minus_one(ENOMEM); memcpy(b->buffer, fs_info->sec_buf, fs_info->vol.bps); sc = rtems_bdbuf_release_modified(b); if ( sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(ENOMEM); 2012c40: 40 00 20 9d call 201aeb4 <__errno> <== NOT EXECUTED 2012c44: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2012c48: 82 10 20 0c mov 0xc, %g1 <== NOT EXECUTED 2012c4c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2012c50: 81 c7 e0 08 ret 2012c54: 81 e8 00 00 restore bool sec_of_fat; if (fs_info->c.state == FAT_CACHE_EMPTY) return RC_OK; sec_of_fat = ((fs_info->c.blk_num >= fs_info->vol.fat_loc) && 2012c58: 80 a0 40 02 cmp %g1, %g2 2012c5c: 1a bf ff cb bcc 2012b88 2012c60: c2 0f 60 7c ldub [ %i5 + 0x7c ], %g1 (fs_info->c.blk_num < fs_info->vol.rdir_loc)); if (fs_info->c.modified) 2012c64: 80 a0 60 00 cmp %g1, 0 2012c68: 02 80 00 0f be 2012ca4 2012c6c: 01 00 00 00 nop { if (sec_of_fat && !fs_info->vol.mirror) 2012c70: c2 0f 60 48 ldub [ %i5 + 0x48 ], %g1 2012c74: 80 a0 60 00 cmp %g1, 0 2012c78: 12 bf ff c7 bne 2012b94 <== NEVER TAKEN 2012c7c: b8 10 20 01 mov 1, %i4 memcpy(fs_info->sec_buf, fs_info->c.buf->buffer, fs_info->vol.bps); 2012c80: c2 07 60 80 ld [ %i5 + 0x80 ], %g1 2012c84: d0 07 60 84 ld [ %i5 + 0x84 ], %o0 2012c88: d2 00 60 1c ld [ %g1 + 0x1c ], %o1 2012c8c: 40 00 23 3f call 201b988 2012c90: d4 17 40 00 lduh [ %i5 ], %o2 2012c94: 30 bf ff c0 b,a 2012b94 { sc = rtems_bdbuf_release(fs_info->c.buf); if (sc != RTEMS_SUCCESSFUL) rtems_set_errno_and_return_minus_one(EIO); } fs_info->c.state = FAT_CACHE_EMPTY; 2012c98: c0 2f 60 7d clrb [ %i5 + 0x7d ] return RC_OK; 2012c9c: 81 c7 e0 08 ret 2012ca0: 91 e8 20 00 restore %g0, 0, %o0 } } } else { sc = rtems_bdbuf_release(fs_info->c.buf); 2012ca4: 7f ff f8 bb call 2010f90 2012ca8: d0 07 60 80 ld [ %i5 + 0x80 ], %o0 if (sc != RTEMS_SUCCESSFUL) 2012cac: 80 a2 20 00 cmp %o0, 0 2012cb0: 22 bf ff fb be,a 2012c9c <== ALWAYS TAKEN 2012cb4: c0 2f 60 7d clrb [ %i5 + 0x7d ] rtems_set_errno_and_return_minus_one(EIO); 2012cb8: 40 00 20 7f call 201aeb4 <__errno> <== NOT EXECUTED 2012cbc: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2012cc0: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 2012cc4: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2012cc8: 81 c7 e0 08 ret <== NOT EXECUTED 2012ccc: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02012ed8 : 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)) ) 2012ed8: 80 a2 60 00 cmp %o1, 0 <== NOT EXECUTED 2012edc: 12 80 00 06 bne 2012ef4 <== NOT EXECUTED 2012ee0: 98 10 00 0a mov %o2, %o4 <== NOT EXECUTED 2012ee4: c2 0a 20 0a ldub [ %o0 + 0xa ], %g1 <== NOT EXECUTED 2012ee8: 80 88 60 03 btst 3, %g1 <== NOT EXECUTED 2012eec: 32 80 00 0e bne,a 2012f24 <== NOT EXECUTED 2012ef0: d6 0a 20 04 ldub [ %o0 + 4 ], %o3 <== NOT EXECUTED return fs_info->vol.rdir_loc; return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 2012ef4: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 <== NOT EXECUTED 2012ef8: c4 0a 20 05 ldub [ %o0 + 5 ], %g2 <== NOT EXECUTED 2012efc: 92 02 7f fe add %o1, -2, %o1 <== NOT EXECUTED uint32_t fsec = 0; fsec = fat_cluster_num_to_sector_num(fs_info, cln); return _fat_block_read(fs_info, fsec, 0, fs_info->vol.spc << fs_info->vol.sec_log2, buff); 2012f00: d6 0a 20 04 ldub [ %o0 + 4 ], %o3 <== NOT EXECUTED 2012f04: 93 2a 40 02 sll %o1, %g2, %o1 <== NOT EXECUTED 2012f08: 92 02 40 01 add %o1, %g1, %o1 <== NOT EXECUTED 2012f0c: c2 0a 20 02 ldub [ %o0 + 2 ], %g1 <== NOT EXECUTED { uint32_t fsec = 0; fsec = fat_cluster_num_to_sector_num(fs_info, cln); return _fat_block_read(fs_info, fsec, 0, 2012f10: 94 10 20 00 clr %o2 <== NOT EXECUTED 2012f14: 97 2a c0 01 sll %o3, %g1, %o3 <== NOT EXECUTED 2012f18: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED 2012f1c: 7f ff ff 6d call 2012cd0 <_fat_block_read> <== NOT EXECUTED 2012f20: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED fs_info->vol.spc << fs_info->vol.sec_log2, buff); 2012f24: c2 0a 20 02 ldub [ %o0 + 2 ], %g1 <== NOT EXECUTED const fat_fs_info_t *fs_info, uint32_t cln ) { if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) return fs_info->vol.rdir_loc; 2012f28: d2 02 20 1c ld [ %o0 + 0x1c ], %o1 <== NOT EXECUTED { uint32_t fsec = 0; fsec = fat_cluster_num_to_sector_num(fs_info, cln); return _fat_block_read(fs_info, fsec, 0, 2012f2c: 94 10 20 00 clr %o2 <== NOT EXECUTED 2012f30: 97 2a c0 01 sll %o3, %g1, %o3 <== NOT EXECUTED 2012f34: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED 2012f38: 7f ff ff 66 call 2012cd0 <_fat_block_read> <== NOT EXECUTED 2012f3c: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED =============================================================================== 02012f40 : 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)) ) 2012f40: 80 a2 60 00 cmp %o1, 0 2012f44: 12 80 00 06 bne 2012f5c <== ALWAYS TAKEN 2012f48: 98 10 00 0a mov %o2, %o4 2012f4c: c2 0a 20 0a ldub [ %o0 + 0xa ], %g1 <== NOT EXECUTED 2012f50: 80 88 60 03 btst 3, %g1 <== NOT EXECUTED 2012f54: 32 80 00 0e bne,a 2012f8c <== NOT EXECUTED 2012f58: d6 0a 20 04 ldub [ %o0 + 4 ], %o3 <== NOT EXECUTED return fs_info->vol.rdir_loc; return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 2012f5c: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 2012f60: c4 0a 20 05 ldub [ %o0 + 5 ], %g2 2012f64: 92 02 7f fe add %o1, -2, %o1 uint32_t fsec = 0; fsec = fat_cluster_num_to_sector_num(fs_info, cln); return _fat_block_write(fs_info, fsec, 0, fs_info->vol.spc << fs_info->vol.sec_log2, buff); 2012f68: d6 0a 20 04 ldub [ %o0 + 4 ], %o3 2012f6c: 93 2a 40 02 sll %o1, %g2, %o1 2012f70: 92 02 40 01 add %o1, %g1, %o1 2012f74: c2 0a 20 02 ldub [ %o0 + 2 ], %g1 { uint32_t fsec = 0; fsec = fat_cluster_num_to_sector_num(fs_info, cln); return _fat_block_write(fs_info, fsec, 0, 2012f78: 94 10 20 00 clr %o2 2012f7c: 97 2a c0 01 sll %o3, %g1, %o3 2012f80: 82 13 c0 00 mov %o7, %g1 2012f84: 7f ff ff 75 call 2012d58 <_fat_block_write> 2012f88: 9e 10 40 00 mov %g1, %o7 fs_info->vol.spc << fs_info->vol.sec_log2, buff); 2012f8c: c2 0a 20 02 ldub [ %o0 + 2 ], %g1 <== NOT EXECUTED const fat_fs_info_t *fs_info, uint32_t cln ) { if ( (cln == 0) && (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16)) ) return fs_info->vol.rdir_loc; 2012f90: d2 02 20 1c ld [ %o0 + 0x1c ], %o1 <== NOT EXECUTED { uint32_t fsec = 0; fsec = fat_cluster_num_to_sector_num(fs_info, cln); return _fat_block_write(fs_info, fsec, 0, 2012f94: 94 10 20 00 clr %o2 <== NOT EXECUTED 2012f98: 97 2a c0 01 sll %o3, %g1, %o3 <== NOT EXECUTED 2012f9c: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED 2012fa0: 7f ff ff 6e call 2012d58 <_fat_block_write> <== NOT EXECUTED 2012fa4: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED =============================================================================== 02013194 : fat_fat32_update_fsinfo_sector( fat_fs_info_t *fs_info, uint32_t free_count, uint32_t next_free ) { 2013194: 9d e3 bf 98 save %sp, -104, %sp <== NOT EXECUTED uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 2013198: 83 36 60 18 srl %i1, 0x18, %g1 <== NOT EXECUTED byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201319c: 87 2e 60 18 sll %i1, 0x18, %g3 <== NOT EXECUTED 20131a0: 86 10 c0 01 or %g3, %g1, %g3 <== NOT EXECUTED ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 20131a4: 83 36 60 10 srl %i1, 0x10, %g1 <== NOT EXECUTED 20131a8: 82 08 60 ff and %g1, 0xff, %g1 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 20131ac: 83 28 60 08 sll %g1, 8, %g1 <== NOT EXECUTED uint32_t le_next_free = 0; le_free_count = CT_LE_L(free_count); le_next_free = CT_LE_L(next_free); ret1 = _fat_block_write(fs_info, 20131b0: d2 16 20 3c lduh [ %i0 + 0x3c ], %o1 <== NOT EXECUTED { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 20131b4: 85 36 60 08 srl %i1, 8, %g2 <== NOT EXECUTED 20131b8: 84 08 a0 ff and %g2, 0xff, %g2 <== NOT EXECUTED byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 20131bc: 85 28 a0 10 sll %g2, 0x10, %g2 <== NOT EXECUTED 20131c0: b2 10 c0 02 or %g3, %g2, %i1 <== NOT EXECUTED 20131c4: b2 16 40 01 or %i1, %g1, %i1 <== NOT EXECUTED uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 20131c8: 83 36 a0 18 srl %i2, 0x18, %g1 <== NOT EXECUTED byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 20131cc: 87 2e a0 18 sll %i2, 0x18, %g3 <== NOT EXECUTED { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 20131d0: 85 36 a0 08 srl %i2, 8, %g2 <== NOT EXECUTED byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 20131d4: 86 10 c0 01 or %g3, %g1, %g3 <== NOT EXECUTED { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 20131d8: 84 08 a0 ff and %g2, 0xff, %g2 <== NOT EXECUTED ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 20131dc: 83 36 a0 10 srl %i2, 0x10, %g1 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 20131e0: 85 28 a0 10 sll %g2, 0x10, %g2 <== NOT EXECUTED ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 20131e4: 82 08 60 ff and %g1, 0xff, %g1 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 20131e8: 83 28 60 08 sll %g1, 8, %g1 <== NOT EXECUTED 20131ec: b4 10 c0 02 or %g3, %g2, %i2 <== NOT EXECUTED 20131f0: 94 10 21 e8 mov 0x1e8, %o2 <== NOT EXECUTED 20131f4: b4 16 80 01 or %i2, %g1, %i2 <== NOT EXECUTED 20131f8: 96 10 20 04 mov 4, %o3 <== NOT EXECUTED 20131fc: 98 07 bf f8 add %fp, -8, %o4 <== NOT EXECUTED { ssize_t ret1 = 0, ret2 = 0; uint32_t le_free_count = 0; uint32_t le_next_free = 0; le_free_count = CT_LE_L(free_count); 2013200: f2 27 bf f8 st %i1, [ %fp + -8 ] <== NOT EXECUTED le_next_free = CT_LE_L(next_free); 2013204: f4 27 bf fc st %i2, [ %fp + -4 ] <== NOT EXECUTED ret1 = _fat_block_write(fs_info, 2013208: 7f ff fe d4 call 2012d58 <_fat_block_write> <== NOT EXECUTED 201320c: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED fs_info->vol.info_sec, FAT_FSINFO_FREE_CLUSTER_COUNT_OFFSET, 4, (char *)(&le_free_count)); ret2 = _fat_block_write(fs_info, 2013210: d2 16 20 3c lduh [ %i0 + 0x3c ], %o1 <== NOT EXECUTED uint32_t le_next_free = 0; le_free_count = CT_LE_L(free_count); le_next_free = CT_LE_L(next_free); ret1 = _fat_block_write(fs_info, 2013214: ba 10 00 08 mov %o0, %i5 <== NOT EXECUTED fs_info->vol.info_sec, FAT_FSINFO_FREE_CLUSTER_COUNT_OFFSET, 4, (char *)(&le_free_count)); ret2 = _fat_block_write(fs_info, 2013218: 94 10 21 ec mov 0x1ec, %o2 <== NOT EXECUTED 201321c: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 2013220: 96 10 20 04 mov 4, %o3 <== NOT EXECUTED 2013224: 7f ff fe cd call 2012d58 <_fat_block_write> <== NOT EXECUTED 2013228: 98 07 bf fc add %fp, -4, %o4 <== NOT EXECUTED fs_info->vol.info_sec, FAT_FSINFO_NEXT_FREE_CLUSTER_OFFSET, 4, (char *)(&le_next_free)); if ( (ret1 < 0) || (ret2 < 0) ) 201322c: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2013230: 06 80 00 06 bl 2013248 <== NOT EXECUTED 2013234: 80 a7 60 00 cmp %i5, 0 <== NOT EXECUTED 2013238: 06 80 00 04 bl 2013248 <== NOT EXECUTED 201323c: b0 10 20 00 clr %i0 <== NOT EXECUTED return -1; return RC_OK; } 2013240: 81 c7 e0 08 ret <== NOT EXECUTED 2013244: 81 e8 00 00 restore <== NOT EXECUTED 2013248: 81 c7 e0 08 ret <== NOT EXECUTED 201324c: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED =============================================================================== 0201213c : int fat_file_close( fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd ) { 201213c: 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) 2012140: c2 06 60 08 ld [ %i1 + 8 ], %g1 2012144: 80 a0 60 01 cmp %g1, 1 2012148: 08 80 00 06 bleu 2012160 201214c: 82 00 7f ff add %g1, -1, %g1 { fat_fd->links_num--; return rc; 2012150: 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--; 2012154: c2 26 60 08 st %g1, [ %i1 + 8 ] * flush any modified "cached" buffer back to disk */ rc = fat_buf_release(fs_info); return rc; } 2012158: 81 c7 e0 08 ret 201215c: 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) 2012160: c2 0e 60 30 ldub [ %i1 + 0x30 ], %g1 2012164: 80 88 60 01 btst 1, %g1 2012168: 22 80 00 15 be,a 20121bc 201216c: d2 06 60 0c ld [ %i1 + 0xc ], %o1 { rc = fat_file_truncate(fs_info, fat_fd, 0); 2012170: 90 10 00 18 mov %i0, %o0 2012174: 92 10 00 19 mov %i1, %o1 2012178: 7f ff ff b0 call 2012038 201217c: 94 10 20 00 clr %o2 if ( rc != RC_OK ) 2012180: 80 a2 20 00 cmp %o0, 0 2012184: 12 bf ff f5 bne 2012158 <== NEVER TAKEN 2012188: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 201218c: 40 00 0d 59 call 20156f0 <_Chain_Extract> 2012190: 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) ) 2012194: d2 06 60 0c ld [ %i1 + 0xc ], %o1 2012198: 40 00 03 fb call 2013184 201219c: 90 10 00 18 mov %i0, %o0 20121a0: 80 8a 20 ff btst 0xff, %o0 20121a4: 32 80 00 11 bne,a 20121e8 <== NEVER TAKEN 20121a8: 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); 20121ac: 7f ff c9 9e call 2004824 20121b0: 90 10 00 19 mov %i1, %o0 } } /* * flush any modified "cached" buffer back to disk */ rc = fat_buf_release(fs_info); 20121b4: 40 00 02 69 call 2012b58 20121b8: 81 e8 00 00 restore free(fat_fd); } else { if (fat_ino_is_unique(fs_info, fat_fd->ino)) 20121bc: 40 00 03 f2 call 2013184 20121c0: 90 10 00 18 mov %i0, %o0 20121c4: 80 8a 20 ff btst 0xff, %o0 20121c8: 02 80 00 05 be 20121dc <== ALWAYS TAKEN 20121cc: 01 00 00 00 nop { fat_fd->links_num = 0; 20121d0: c0 26 60 08 clr [ %i1 + 8 ] <== NOT EXECUTED } } /* * flush any modified "cached" buffer back to disk */ rc = fat_buf_release(fs_info); 20121d4: 40 00 02 61 call 2012b58 <== NOT EXECUTED 20121d8: 81 e8 00 00 restore <== NOT EXECUTED 20121dc: 40 00 0d 45 call 20156f0 <_Chain_Extract> 20121e0: 90 10 00 19 mov %i1, %o0 20121e4: 30 bf ff f2 b,a 20121ac 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); 20121e8: 40 00 03 dc call 2013158 <== NOT EXECUTED 20121ec: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 20121f0: 30 bf ff ef b,a 20121ac <== NOT EXECUTED =============================================================================== 020122c8 : fat_file_fd_t *fat_fd, bool zero_fill, uint32_t new_length, uint32_t *a_length ) { 20122c8: 9d e3 bf 90 save %sp, -112, %sp uint32_t old_last_cl; uint32_t last_cl = 0; uint32_t bytes_remain = 0; uint32_t cls_added; *a_length = new_length; 20122cc: f6 27 00 00 st %i3, [ %i4 ] if (new_length <= fat_fd->fat_file_size) 20122d0: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 uint32_t new_length, uint32_t *a_length ) { int rc = RC_OK; uint32_t chain = 0; 20122d4: 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; 20122d8: c0 27 bf f8 clr [ %fp + -8 ] uint32_t bytes_remain = 0; uint32_t cls_added; *a_length = new_length; if (new_length <= fat_fd->fat_file_size) 20122dc: 80 a6 c0 01 cmp %i3, %g1 20122e0: 08 80 00 16 bleu 2012338 20122e4: ba 10 00 18 mov %i0, %i5 return RC_OK; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 20122e8: c4 06 60 20 ld [ %i1 + 0x20 ], %g2 20122ec: 80 a0 a0 01 cmp %g2, 1 20122f0: 22 80 00 6e be,a 20124a8 <== NEVER TAKEN 20122f4: c4 06 60 24 ld [ %i1 + 0x24 ], %g2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) rtems_set_errno_and_return_minus_one( ENOSPC ); bytes_remain = (fs_info->vol.bpc - (fat_fd->fat_file_size & (fs_info->vol.bpc - 1))) & 20122f8: e0 17 60 06 lduh [ %i5 + 6 ], %l0 (fs_info->vol.bpc - 1); bytes2add = new_length - fat_fd->fat_file_size; 20122fc: 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))) & 2012300: 84 04 3f ff add %l0, -1, %g2 2012304: 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 - 2012308: a0 24 00 12 sub %l0, %l2, %l0 201230c: 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) 2012310: 80 a4 00 03 cmp %l0, %g3 2012314: 1a 80 00 03 bcc 2012320 2012318: a2 10 20 00 clr %l1 bytes2add -= bytes_remain; 201231c: a2 20 c0 10 sub %g3, %l0, %l1 else bytes2add = 0; if (zero_fill && bytes_remain > 0) { 2012320: 80 a4 20 00 cmp %l0, 0 2012324: 12 80 00 3c bne 2012414 2012328: 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) 201232c: 80 a4 60 00 cmp %l1, 0 2012330: 32 80 00 04 bne,a 2012340 2012334: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 uint32_t cls_added; *a_length = new_length; if (new_length <= fat_fd->fat_file_size) return RC_OK; 2012338: 81 c7 e0 08 ret 201233c: 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; 2012340: a4 04 7f ff add %l1, -1, %l2 rc = fat_scan_fat_for_free_clusters(fs_info, &chain, cls2add, 2012344: 90 10 00 1d mov %i5, %o0 * file ) - return */ if (bytes2add == 0) return RC_OK; cls2add = ((bytes2add - 1) >> fs_info->vol.bpc_log2) + 1; 2012348: a5 34 80 01 srl %l2, %g1, %l2 rc = fat_scan_fat_for_free_clusters(fs_info, &chain, cls2add, 201234c: 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; 2012350: a4 04 a0 01 inc %l2 rc = fat_scan_fat_for_free_clusters(fs_info, &chain, cls2add, 2012354: 96 07 bf fc add %fp, -4, %o3 2012358: 94 10 00 12 mov %l2, %o2 201235c: 98 07 bf f8 add %fp, -8, %o4 2012360: 40 00 1c e1 call 20196e4 2012364: 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) 2012368: b0 92 20 00 orcc %o0, 0, %i0 201236c: 12 80 00 28 bne 201240c <== NEVER TAKEN 2012370: 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)) 2012374: 80 94 00 01 orcc %l0, %g1, %g0 2012378: 02 80 00 53 be 20124c4 <== NEVER TAKEN 201237c: 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) 2012380: 02 80 00 09 be 20123a4 <== ALWAYS TAKEN 2012384: a4 24 80 01 sub %l2, %g1, %l2 { new_length -= bytes2add & (fs_info->vol.bpc - 1); 2012388: c6 17 60 06 lduh [ %i5 + 6 ], %g3 <== NOT EXECUTED new_length -= (cls2add - cls_added) << fs_info->vol.bpc_log2; 201238c: 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); 2012390: 86 00 ff ff add %g3, -1, %g3 <== NOT EXECUTED 2012394: a2 0c 40 03 and %l1, %g3, %l1 <== NOT EXECUTED new_length -= (cls2add - cls_added) << fs_info->vol.bpc_log2; 2012398: 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); 201239c: b6 26 c0 11 sub %i3, %l1, %i3 <== NOT EXECUTED new_length -= (cls2add - cls_added) << fs_info->vol.bpc_log2; 20123a0: 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 ) 20123a4: d6 06 60 18 ld [ %i1 + 0x18 ], %o3 20123a8: 80 a2 e0 00 cmp %o3, 0 20123ac: 32 80 00 50 bne,a 20124ec 20123b0: d2 06 60 3c ld [ %i1 + 0x3c ], %o1 { fat_fd->map.disk_cln = fat_fd->cln = chain; 20123b4: c4 07 bf f0 ld [ %fp + -16 ], %g2 fat_fd->map.file_cln = 0; 20123b8: 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; 20123bc: c4 26 60 1c st %g2, [ %i1 + 0x1c ] 20123c0: 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) 20123c4: 80 a0 60 00 cmp %g1, 0 20123c8: 22 80 00 46 be,a 20124e0 <== NEVER TAKEN 20123cc: f6 27 00 00 st %i3, [ %i4 ] <== NOT EXECUTED { fat_fd->map.last_cln = last_cl; 20123d0: c4 07 bf f8 ld [ %fp + -8 ], %g2 if (fat_fd->fat_file_type == FAT_DIRECTORY) 20123d4: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 20123d8: 80 a0 60 00 cmp %g1, 0 20123dc: 12 80 00 40 bne 20124dc 20123e0: c4 26 60 3c st %g2, [ %i1 + 0x3c ] { rc = fat_init_clusters_chain(fs_info, chain); 20123e4: d2 07 bf f0 ld [ %fp + -16 ], %o1 20123e8: 40 00 02 f0 call 2012fa8 20123ec: 90 10 00 1d mov %i5, %o0 if ( rc != RC_OK ) 20123f0: 82 92 20 00 orcc %o0, 0, %g1 20123f4: 22 80 00 3b be,a 20124e0 <== ALWAYS TAKEN 20123f8: f6 27 00 00 st %i3, [ %i4 ] { fat_free_fat_clusters_chain(fs_info, chain); 20123fc: d2 07 bf f0 ld [ %fp + -16 ], %o1 <== NOT EXECUTED 2012400: b0 10 00 01 mov %g1, %i0 <== NOT EXECUTED 2012404: 40 00 1c 80 call 2019604 <== NOT EXECUTED 2012408: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201240c: 81 c7 e0 08 ret <== NOT EXECUTED 2012410: 81 e8 00 00 restore <== NOT EXECUTED if (bytes2add > bytes_remain) bytes2add -= bytes_remain; else bytes2add = 0; if (zero_fill && bytes_remain > 0) { 2012414: 02 bf ff c7 be 2012330 2012418: 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; 201241c: d4 0f 60 08 ldub [ %i5 + 8 ], %o2 uint32_t ofs = start & (fs_info->vol.bpc - 1); uint32_t cur_cln; uint32_t sec; uint32_t byte; rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); 2012420: 90 10 00 1d mov %i5, %o0 2012424: 92 10 00 19 mov %i1, %o1 2012428: 95 30 40 0a srl %g1, %o2, %o2 201242c: 7f ff fd 9b call 2011a98 2012430: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 2012434: b0 92 60 00 orcc %o1, 0, %i0 2012438: 12 bf ff f5 bne 201240c <== NEVER TAKEN 201243c: c2 07 bf fc ld [ %fp + -4 ], %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)) ) 2012440: 80 a0 60 00 cmp %g1, 0 2012444: 32 80 00 07 bne,a 2012460 <== ALWAYS TAKEN 2012448: c6 0f 60 05 ldub [ %i5 + 5 ], %g3 201244c: c4 0f 60 0a ldub [ %i5 + 0xa ], %g2 <== NOT EXECUTED 2012450: 80 88 a0 03 btst 3, %g2 <== NOT EXECUTED 2012454: 32 80 00 07 bne,a 2012470 <== NOT EXECUTED 2012458: d2 07 60 1c ld [ %i5 + 0x1c ], %o1 <== NOT EXECUTED return fs_info->vol.rdir_loc; return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 201245c: c6 0f 60 05 ldub [ %i5 + 5 ], %g3 <== NOT EXECUTED 2012460: c4 07 60 30 ld [ %i5 + 0x30 ], %g2 2012464: 92 00 7f fe add %g1, -2, %o1 2012468: 93 2a 40 03 sll %o1, %g3, %o1 201246c: 92 02 40 02 add %o1, %g2, %o1 return rc; sec = fat_cluster_num_to_sector_num(fs_info, cur_cln); sec += ofs >> fs_info->vol.sec_log2; 2012470: c4 0f 60 02 ldub [ %i5 + 2 ], %g2 byte = ofs & (fs_info->vol.bps - 1); 2012474: d4 17 40 00 lduh [ %i5 ], %o2 rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; sec = fat_cluster_num_to_sector_num(fs_info, cur_cln); sec += ofs >> fs_info->vol.sec_log2; 2012478: 85 34 80 02 srl %l2, %g2, %g2 byte = ofs & (fs_info->vol.bps - 1); 201247c: 94 02 bf ff add %o2, -1, %o2 rc = _fat_block_zero(fs_info, sec, byte, bytes_remain); 2012480: 90 10 00 1d mov %i5, %o0 2012484: 92 02 40 02 add %o1, %g2, %o1 2012488: 94 0c 80 0a and %l2, %o2, %o2 201248c: 40 00 02 62 call 2012e14 <_fat_block_zero> 2012490: 96 10 00 10 mov %l0, %o3 if (rc != RC_OK) 2012494: b0 92 20 00 orcc %o0, 0, %i0 2012498: 02 bf ff a6 be 2012330 <== ALWAYS TAKEN 201249c: 80 a4 60 00 cmp %l1, 0 *a_length = new_length; fat_fd->fat_file_size = new_length; return RC_OK; } 20124a0: 81 c7 e0 08 ret <== NOT EXECUTED 20124a4: 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)) && 20124a8: 80 a0 a0 00 cmp %g2, 0 <== NOT EXECUTED 20124ac: 32 bf ff 94 bne,a 20122fc <== NOT EXECUTED 20124b0: e0 17 60 06 lduh [ %i5 + 6 ], %l0 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 20124b4: c4 0e 20 0a ldub [ %i0 + 0xa ], %g2 <== NOT EXECUTED *a_length = new_length; if (new_length <= fat_fd->fat_file_size) return RC_OK; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 20124b8: 80 88 a0 03 btst 3, %g2 <== NOT EXECUTED 20124bc: 22 bf ff 90 be,a 20122fc <== NOT EXECUTED 20124c0: 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); 20124c4: 40 00 22 7c call 201aeb4 <__errno> <== NOT EXECUTED 20124c8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20124cc: 82 10 20 1c mov 0x1c, %g1 <== NOT EXECUTED 20124d0: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 20124d4: 81 c7 e0 08 ret <== NOT EXECUTED 20124d8: 81 e8 00 00 restore <== NOT EXECUTED return rc; } } } *a_length = new_length; 20124dc: f6 27 00 00 st %i3, [ %i4 ] fat_fd->fat_file_size = new_length; 20124e0: f6 26 60 18 st %i3, [ %i1 + 0x18 ] return RC_OK; } 20124e4: 81 c7 e0 08 ret 20124e8: 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) 20124ec: 80 a2 7f ff cmp %o1, -1 20124f0: 22 80 00 0d be,a 2012524 <== NEVER TAKEN 20124f4: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED { old_last_cl = fat_fd->map.last_cln; 20124f8: 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); 20124fc: d4 07 bf f0 ld [ %fp + -16 ], %o2 2012500: 40 00 1b 81 call 2019304 2012504: 90 10 00 1d mov %i5, %o0 if ( rc != RC_OK ) 2012508: 82 92 20 00 orcc %o0, 0, %g1 201250c: 12 bf ff bd bne 2012400 <== NEVER TAKEN 2012510: d2 07 bf f0 ld [ %fp + -16 ], %o1 { fat_free_fat_clusters_chain(fs_info, chain); return rc; } fat_buf_release(fs_info); 2012514: 40 00 01 91 call 2012b58 2012518: 90 10 00 1d mov %i5, %o0 201251c: 10 bf ff aa b 20123c4 2012520: 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, 2012524: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2012528: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 201252c: 96 02 ff ff add %o3, -1, %o3 <== NOT EXECUTED 2012530: 7f ff ff 31 call 20121f4 <== NOT EXECUTED 2012534: 98 07 bf f4 add %fp, -12, %o4 <== NOT EXECUTED 2012538: d2 07 bf f4 ld [ %fp + -12 ], %o1 <== NOT EXECUTED (fat_fd->fat_file_size - 1), &old_last_cl); if ( rc != RC_OK ) 201253c: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2012540: 02 bf ff ef be 20124fc <== NOT EXECUTED 2012544: 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); 2012548: 10 bf ff ae b 2012400 <== NOT EXECUTED 201254c: d2 07 bf f0 ld [ %fp + -16 ], %o1 <== NOT EXECUTED =============================================================================== 020121f4 : fat_file_ioctl( fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd, int cmd, ...) { 20121f4: 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); 20121f8: 82 07 a0 50 add %fp, 0x50, %g1 20121fc: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 2012200: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2012204: 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; 2012208: c0 27 bf f8 clr [ %fp + -8 ] uint32_t *ret; va_list ap; va_start(ap, cmd); switch (cmd) 201220c: 80 a6 a0 01 cmp %i2, 1 2012210: 02 80 00 08 be 2012230 <== ALWAYS TAKEN 2012214: c2 27 bf fc st %g1, [ %fp + -4 ] *ret = cur_cln; break; default: errno = EINVAL; 2012218: 40 00 23 27 call 201aeb4 <__errno> <== NOT EXECUTED 201221c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2012220: 82 10 20 16 mov 0x16, %g1 <== NOT EXECUTED 2012224: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED rc = -1; break; } va_end(ap); return rc; } 2012228: 81 c7 e0 08 ret <== NOT EXECUTED 201222c: 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 ) { 2012230: 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 *); 2012234: 86 07 a0 58 add %fp, 0x58, %g3 2012238: c6 27 bf fc st %g3, [ %fp + -4 ] /* sanity check */ if ( pos >= fat_fd->fat_file_size ) { 201223c: 80 a6 c0 02 cmp %i3, %g2 2012240: 1a 80 00 1c bcc 20122b0 <== NEVER TAKEN 2012244: 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)) && 2012248: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 201224c: 80 a0 60 01 cmp %g1, 1 2012250: 22 80 00 0e be,a 2012288 2012254: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 *ret = 0; rc = RC_OK; break; } cl_start = pos >> fs_info->vol.bpc_log2; 2012258: d4 0e 20 08 ldub [ %i0 + 8 ], %o2 rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); 201225c: 90 10 00 18 mov %i0, %o0 2012260: 92 10 00 19 mov %i1, %o1 2012264: 95 36 c0 0a srl %i3, %o2, %o2 2012268: 7f ff fe 0c call 2011a98 201226c: 96 07 bf f8 add %fp, -8, %o3 if ( rc != RC_OK ) 2012270: b0 92 60 00 orcc %o1, 0, %i0 2012274: 12 bf ff ed bne 2012228 <== NEVER TAKEN 2012278: c2 07 bf f8 ld [ %fp + -8 ], %g1 break; *ret = cur_cln; 201227c: c2 27 40 00 st %g1, [ %i5 ] break; 2012280: 81 c7 e0 08 ret 2012284: 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)) && 2012288: 80 a0 60 00 cmp %g1, 0 201228c: 32 bf ff f4 bne,a 201225c <== NEVER TAKEN 2012290: d4 0e 20 08 ldub [ %i0 + 8 ], %o2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 2012294: c2 0e 20 0a ldub [ %i0 + 0xa ], %g1 if ( pos >= fat_fd->fat_file_size ) { va_end(ap); rtems_set_errno_and_return_minus_one( EIO ); } if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2012298: 80 88 60 03 btst 3, %g1 201229c: 22 bf ff f0 be,a 201225c <== NEVER TAKEN 20122a0: d4 0e 20 08 ldub [ %i0 + 8 ], %o2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) { /* cluster 0 (zero) reserved for root dir */ *ret = 0; 20122a4: c0 27 00 00 clr [ %i4 ] rc = RC_OK; break; 20122a8: 81 c7 e0 08 ret 20122ac: 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 ); 20122b0: 40 00 23 01 call 201aeb4 <__errno> <== NOT EXECUTED 20122b4: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20122b8: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 20122bc: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 20122c0: 81 c7 e0 08 ret <== NOT EXECUTED 20122c4: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02011a98 : fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd, uint32_t file_cln, uint32_t *disk_cln ) { 2011a98: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; if (file_cln == fat_fd->map.file_cln) 2011a9c: f8 06 60 34 ld [ %i1 + 0x34 ], %i4 2011aa0: 80 a7 00 1a cmp %i4, %i2 2011aa4: 22 80 00 26 be,a 2011b3c 2011aa8: 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) 2011aac: 2a 80 00 19 bcs,a 2011b10 2011ab0: 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; 2011ab4: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 2011ab8: b8 10 00 1a mov %i2, %i4 2011abc: c2 27 bf fc st %g1, [ %fp + -4 ] count = file_cln; } /* skip over the clusters */ for (i = 0; i < count; i++) 2011ac0: 80 a7 20 00 cmp %i4, 0 2011ac4: 12 80 00 07 bne 2011ae0 2011ac8: ba 10 20 00 clr %i5 return rc; } /* update cache */ fat_fd->map.file_cln = file_cln; fat_fd->map.disk_cln = cur_cln; 2011acc: 10 80 00 14 b 2011b1c 2011ad0: 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++) 2011ad4: 80 a7 40 1c cmp %i5, %i4 2011ad8: 02 80 00 11 be 2011b1c 2011adc: c2 07 bf fc ld [ %fp + -4 ], %g1 { rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 2011ae0: d2 07 bf fc ld [ %fp + -4 ], %o1 2011ae4: 90 10 00 18 mov %i0, %o0 2011ae8: 40 00 1d 7e call 20190e0 2011aec: 94 07 bf fc add %fp, -4, %o2 if ( rc != RC_OK ) 2011af0: 80 a2 20 00 cmp %o0, 0 2011af4: 22 bf ff f8 be,a 2011ad4 <== ALWAYS TAKEN 2011af8: ba 07 60 01 inc %i5 return rc; 2011afc: 86 10 00 08 mov %o0, %g3 <== NOT EXECUTED 2011b00: 85 3a 20 1f sra %o0, 0x1f, %g2 <== NOT EXECUTED fat_fd->map.disk_cln = cur_cln; *disk_cln = cur_cln; } return RC_OK; } 2011b04: b2 10 00 03 mov %g3, %i1 <== NOT EXECUTED 2011b08: 81 c7 e0 08 ret <== NOT EXECUTED 2011b0c: 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; 2011b10: 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; 2011b14: 10 bf ff eb b 2011ac0 2011b18: c2 27 bf fc st %g1, [ %fp + -4 ] if ( rc != RC_OK ) return rc; } /* update cache */ fat_fd->map.file_cln = file_cln; 2011b1c: f4 26 60 34 st %i2, [ %i1 + 0x34 ] fat_fd->map.disk_cln = cur_cln; 2011b20: c2 26 60 38 st %g1, [ %i1 + 0x38 ] *disk_cln = cur_cln; } return RC_OK; 2011b24: 84 10 20 00 clr %g2 2011b28: 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; 2011b2c: c2 26 c0 00 st %g1, [ %i3 ] } return RC_OK; } 2011b30: b0 10 00 02 mov %g2, %i0 2011b34: 81 c7 e0 08 ret 2011b38: 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; 2011b3c: 84 10 20 00 clr %g2 2011b40: 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; 2011b44: c2 26 c0 00 st %g1, [ %i3 ] fat_fd->map.disk_cln = cur_cln; *disk_cln = cur_cln; } return RC_OK; } 2011b48: b0 10 00 02 mov %g2, %i0 2011b4c: 81 c7 e0 08 ret 2011b50: 93 e8 00 03 restore %g0, %g3, %o1 =============================================================================== 020127c4 : void fat_file_mark_removed( fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd ) { 20127c4: 9d e3 bf a0 save %sp, -96, %sp 20127c8: 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) 20127cc: 80 a0 60 01 cmp %g1, 1 20127d0: 02 80 00 26 be 2012868 <== NEVER TAKEN 20127d4: 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)) ) 20127d8: 32 80 00 1f bne,a 2012854 <== NEVER TAKEN 20127dc: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 <== NOT EXECUTED 20127e0: c4 0e 20 0a ldub [ %i0 + 0xa ], %g2 20127e4: 80 88 a0 03 btst 3, %g2 20127e8: 22 80 00 1b be,a 2012854 <== NEVER TAKEN 20127ec: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 20127f0: fa 06 20 1c ld [ %i0 + 0x1c ], %i5 ) { if (cln == 1) return 1; return (fat_cluster_num_to_sector_num(fs_info, cln) << 20127f4: c4 0e 20 03 ldub [ %i0 + 3 ], %g2 20127f8: bb 2f 40 02 sll %i5, %g2, %i5 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 20127fc: c4 06 60 24 ld [ %i1 + 0x24 ], %g2 2012800: 90 10 00 19 mov %i1, %o0 2012804: 87 30 a0 09 srl %g2, 9, %g3 ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2012808: 85 30 a0 05 srl %g2, 5, %g2 201280c: 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) + 2012810: ba 07 40 03 add %i5, %g3, %i5 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2012814: bb 2f 60 04 sll %i5, 4, %i5 2012818: 40 00 0b b6 call 20156f0 <_Chain_Extract> 201281c: 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); 2012820: d0 06 20 64 ld [ %i0 + 0x64 ], %o0 2012824: 82 0f 60 01 and %i5, 1, %g1 2012828: 85 28 60 02 sll %g1, 2, %g2 201282c: 83 28 60 04 sll %g1, 4, %g1 2012830: 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 ); 2012834: 92 10 00 19 mov %i1, %o1 2012838: 7f ff dd 96 call 2009e90 <_Chain_Append> 201283c: 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; 2012840: c2 0e 60 30 ldub [ %i1 + 0x30 ], %g1 2012844: 82 10 60 01 or %g1, 1, %g1 2012848: c2 2e 60 30 stb %g1, [ %i1 + 0x30 ] 201284c: 81 c7 e0 08 ret 2012850: 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) + 2012854: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 <== NOT EXECUTED 2012858: ba 00 7f fe add %g1, -2, %i5 <== NOT EXECUTED 201285c: bb 2f 40 03 sll %i5, %g3, %i5 <== NOT EXECUTED 2012860: 10 bf ff e5 b 20127f4 <== NOT EXECUTED 2012864: 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; 2012868: 10 bf ff e5 b 20127fc <== NOT EXECUTED 201286c: ba 10 20 01 mov 1, %i5 <== NOT EXECUTED =============================================================================== 02011b54 : fat_file_open( fat_fs_info_t *fs_info, fat_dir_pos_t *dir_pos, fat_file_fd_t **fat_fd ) { 2011b54: 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) + 2011b58: 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) 2011b5c: 80 a0 60 01 cmp %g1, 1 2011b60: 02 80 00 9c be 2011dd0 2011b64: 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)) ) 2011b68: 32 80 00 7b bne,a 2011d54 2011b6c: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 2011b70: c4 0e 20 0a ldub [ %i0 + 0xa ], %g2 2011b74: 80 88 a0 03 btst 3, %g2 2011b78: 22 80 00 77 be,a 2011d54 <== NEVER TAKEN 2011b7c: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2011b80: fa 06 20 1c ld [ %i0 + 0x1c ], %i5 ) { if (cln == 1) return 1; return (fat_cluster_num_to_sector_num(fs_info, cln) << 2011b84: c4 0e 20 03 ldub [ %i0 + 3 ], %g2 2011b88: bb 2f 40 02 sll %i5, %g2, %i5 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2011b8c: 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); 2011b90: de 06 20 60 ld [ %i0 + 0x60 ], %o7 2011b94: 85 30 60 09 srl %g1, 9, %g2 ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2011b98: 83 30 60 05 srl %g1, 5, %g1 2011b9c: 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) + 2011ba0: ba 07 40 02 add %i5, %g2, %i5 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2011ba4: 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) + 2011ba8: 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; 2011bac: 82 0f 60 01 and %i5, 1, %g1 rtems_chain_node *the_node = rtems_chain_first(hash + mod); 2011bb0: 85 28 60 02 sll %g1, 2, %g2 2011bb4: b7 28 60 04 sll %g1, 4, %i3 2011bb8: 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; 2011bbc: c2 03 c0 1b ld [ %o7 + %i3 ], %g1 2011bc0: 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 )); 2011bc4: 9e 03 e0 04 add %o7, 4, %o7 for ( ; !rtems_chain_is_tail((hash) + mod, the_node) ; ) 2011bc8: 80 a0 40 0f cmp %g1, %o7 2011bcc: 22 80 00 1e be,a 2011c44 2011bd0: c4 06 20 64 ld [ %i0 + 0x64 ], %g2 2011bd4: 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) 2011bd8: 80 a0 a0 01 cmp %g2, 1 2011bdc: 02 80 00 6d be 2011d90 2011be0: 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)) ) 2011be4: 32 80 00 61 bne,a 2011d68 2011be8: c8 0e 20 05 ldub [ %i0 + 5 ], %g4 2011bec: c6 0e 20 0a ldub [ %i0 + 0xa ], %g3 2011bf0: 80 88 e0 03 btst 3, %g3 2011bf4: 22 80 00 5d be,a 2011d68 <== NEVER TAKEN 2011bf8: c8 0e 20 05 ldub [ %i0 + 5 ], %g4 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2011bfc: f8 06 20 1c ld [ %i0 + 0x1c ], %i4 ) { if (cln == 1) return 1; return (fat_cluster_num_to_sector_num(fs_info, cln) << 2011c00: c6 0e 20 03 ldub [ %i0 + 3 ], %g3 2011c04: b9 2f 00 03 sll %i4, %g3, %i4 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2011c08: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2011c0c: 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) + 2011c10: 89 30 e0 09 srl %g3, 9, %g4 ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2011c14: 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) + 2011c18: 86 07 00 04 add %i4, %g4, %g3 (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2011c1c: 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) + 2011c20: 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) 2011c24: 80 a7 40 03 cmp %i5, %g3 2011c28: 22 80 00 55 be,a 2011d7c 2011c2c: c4 00 60 08 ld [ %g1 + 8 ], %g2 { *ret = (void *)the_node; return 0; } } the_node = the_node->next; 2011c30: 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) ; ) 2011c34: 80 a3 c0 01 cmp %o7, %g1 2011c38: 32 bf ff e8 bne,a 2011bd8 2011c3c: 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); 2011c40: c4 06 20 64 ld [ %i0 + 0x64 ], %g2 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2011c44: c2 00 80 1b ld [ %g2 + %i3 ], %g1 2011c48: 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 )); 2011c4c: 9e 00 a0 04 add %g2, 4, %o7 for ( ; !rtems_chain_is_tail((hash) + mod, the_node) ; ) 2011c50: 80 a0 40 0f cmp %g1, %o7 2011c54: 02 80 00 1e be 2011ccc <== ALWAYS TAKEN 2011c58: a0 10 3f ff mov -1, %l0 2011c5c: 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) 2011c60: 80 a0 a0 01 cmp %g2, 1 <== NOT EXECUTED 2011c64: 02 80 00 59 be 2011dc8 <== NOT EXECUTED 2011c68: 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)) ) 2011c6c: 32 80 00 4b bne,a 2011d98 <== NOT EXECUTED 2011c70: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 <== NOT EXECUTED 2011c74: c6 0e 20 0a ldub [ %i0 + 0xa ], %g3 <== NOT EXECUTED 2011c78: 80 88 e0 03 btst 3, %g3 <== NOT EXECUTED 2011c7c: 22 80 00 47 be,a 2011d98 <== NOT EXECUTED 2011c80: c6 0e 20 05 ldub [ %i0 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2011c84: f8 06 20 1c ld [ %i0 + 0x1c ], %i4 <== NOT EXECUTED ) { if (cln == 1) return 1; return (fat_cluster_num_to_sector_num(fs_info, cln) << 2011c88: c8 0e 20 03 ldub [ %i0 + 3 ], %g4 <== NOT EXECUTED 2011c8c: b9 2f 00 04 sll %i4, %g4, %i4 <== NOT EXECUTED (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2011c90: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 <== NOT EXECUTED ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2011c94: 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) + 2011c98: 89 30 e0 09 srl %g3, 9, %g4 <== NOT EXECUTED ((pos->ofs >> 5) & (FAT_DIRENTRIES_PER_SEC512 - 1)) ); 2011c9c: 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) + 2011ca0: 86 07 00 04 add %i4, %g4, %g3 <== NOT EXECUTED (pos->ofs >> FAT_SECTOR512_BITS)) << 4) + 2011ca4: 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) + 2011ca8: 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) 2011cac: 80 a7 40 03 cmp %i5, %g3 <== NOT EXECUTED 2011cb0: 02 80 00 3f be 2011dac <== NOT EXECUTED 2011cb4: 80 a7 60 00 cmp %i5, 0 <== NOT EXECUTED { *ret = (void *)the_node; return 0; } } the_node = the_node->next; 2011cb8: 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) ; ) 2011cbc: 80 a0 40 0f cmp %g1, %o7 <== NOT EXECUTED 2011cc0: 32 bf ff e8 bne,a 2011c60 <== NOT EXECUTED 2011cc4: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 <== NOT EXECUTED return 0; } } the_node = the_node->next; } return -1; 2011cc8: 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)); 2011ccc: 7f ff cc 7c call 2004ebc 2011cd0: 90 10 20 44 mov 0x44, %o0 2011cd4: d0 26 80 00 st %o0, [ %i2 ] if ( lfat_fd == NULL ) 2011cd8: 80 a2 20 00 cmp %o0, 0 2011cdc: 02 80 00 46 be 2011df4 <== NEVER TAKEN 2011ce0: b8 10 00 08 mov %o0, %i4 rtems_set_errno_and_return_minus_one( ENOMEM ); memset(lfat_fd, 0, sizeof(fat_file_fd_t)); 2011ce4: 92 10 20 00 clr %o1 2011ce8: 40 00 27 65 call 201ba7c 2011cec: 94 10 20 44 mov 0x44, %o2 lfat_fd->links_num = 1; lfat_fd->flags &= ~FAT_FILE_REMOVED; 2011cf0: de 0f 20 30 ldub [ %i4 + 0x30 ], %o7 lfat_fd->map.last_cln = FAT_UNDEFINED_VALUE; lfat_fd->dir_pos = *dir_pos; 2011cf4: c8 06 40 00 ld [ %i1 ], %g4 2011cf8: c6 06 60 04 ld [ %i1 + 4 ], %g3 2011cfc: c4 06 60 08 ld [ %i1 + 8 ], %g2 2011d00: 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; 2011d04: b2 0b ff fe and %o7, -2, %i1 lfat_fd->map.last_cln = FAT_UNDEFINED_VALUE; lfat_fd->dir_pos = *dir_pos; 2011d08: 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; 2011d0c: 9e 10 20 01 mov 1, %o7 lfat_fd->flags &= ~FAT_FILE_REMOVED; 2011d10: 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; 2011d14: de 27 20 08 st %o7, [ %i4 + 8 ] lfat_fd->flags &= ~FAT_FILE_REMOVED; lfat_fd->map.last_cln = FAT_UNDEFINED_VALUE; 2011d18: b2 10 3f ff mov -1, %i1 lfat_fd->dir_pos = *dir_pos; 2011d1c: 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; 2011d20: f2 27 20 3c st %i1, [ %i4 + 0x3c ] lfat_fd->dir_pos = *dir_pos; 2011d24: c4 27 20 28 st %g2, [ %i4 + 0x28 ] if ( rc != RC_OK ) 2011d28: 80 a4 20 00 cmp %l0, 0 2011d2c: 02 80 00 2b be 2011dd8 <== NEVER TAKEN 2011d30: c2 27 20 2c st %g1, [ %i4 + 0x2c ] lfat_fd->ino = key; 2011d34: 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); 2011d38: d0 06 20 60 ld [ %i0 + 0x60 ], %o0 RTEMS_INLINE_ROUTINE void rtems_chain_append( rtems_chain_control *the_chain, rtems_chain_node *the_node ) { _Chain_Append( the_chain, the_node ); 2011d3c: 92 10 00 1c mov %i4, %o1 2011d40: 90 02 00 1b add %o0, %i3, %o0 2011d44: 7f ff e0 53 call 2009e90 <_Chain_Append> 2011d48: b0 10 20 00 clr %i0 2011d4c: 81 c7 e0 08 ret 2011d50: 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) + 2011d54: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 2011d58: ba 00 7f fe add %g1, -2, %i5 2011d5c: bb 2f 40 03 sll %i5, %g3, %i5 2011d60: 10 bf ff 89 b 2011b84 2011d64: ba 07 40 02 add %i5, %g2, %i5 2011d68: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 2011d6c: b8 00 bf fe add %g2, -2, %i4 2011d70: b9 2f 00 04 sll %i4, %g4, %i4 2011d74: 10 bf ff a3 b 2011c00 2011d78: 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; 2011d7c: c2 26 80 00 st %g1, [ %i2 ] lfat_fd->links_num++; 2011d80: 84 00 a0 01 inc %g2 2011d84: c4 20 60 08 st %g2, [ %g1 + 8 ] 2011d88: 81 c7 e0 08 ret 2011d8c: 91 e8 20 00 restore %g0, 0, %o0 const fat_fs_info_t *fs_info, uint32_t cln ) { if (cln == 1) return 1; 2011d90: 10 bf ff 9e b 2011c08 2011d94: 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) + 2011d98: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 <== NOT EXECUTED 2011d9c: b8 00 bf fe add %g2, -2, %i4 <== NOT EXECUTED 2011da0: b9 2f 00 03 sll %i4, %g3, %i4 <== NOT EXECUTED 2011da4: 10 bf ff b9 b 2011c88 <== NOT EXECUTED 2011da8: 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) ) 2011dac: 02 bf ff c8 be 2011ccc <== NOT EXECUTED 2011db0: a0 10 20 00 clr %l0 <== NOT EXECUTED 2011db4: c4 00 60 0c ld [ %g1 + 0xc ], %g2 <== NOT EXECUTED 2011db8: 80 a7 40 02 cmp %i5, %g2 <== NOT EXECUTED 2011dbc: 32 bf ff c0 bne,a 2011cbc <== NOT EXECUTED 2011dc0: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED 2011dc4: 30 bf ff c2 b,a 2011ccc <== NOT EXECUTED const fat_fs_info_t *fs_info, uint32_t cln ) { if (cln == 1) return 1; 2011dc8: 10 bf ff b2 b 2011c90 <== NOT EXECUTED 2011dcc: b8 10 20 01 mov 1, %i4 <== NOT EXECUTED 2011dd0: 10 bf ff 6f b 2011b8c 2011dd4: 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); 2011dd8: 40 00 04 a4 call 2013068 <== NOT EXECUTED 2011ddc: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED if ( lfat_fd->ino == 0 ) 2011de0: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2011de4: 12 bf ff d5 bne 2011d38 <== NOT EXECUTED 2011de8: d0 27 20 0c st %o0, [ %i4 + 0xc ] <== NOT EXECUTED { free((*fat_fd)); 2011dec: 7f ff ca 8e call 2004824 <== NOT EXECUTED 2011df0: 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 ); 2011df4: 40 00 24 30 call 201aeb4 <__errno> <== NOT EXECUTED 2011df8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2011dfc: 82 10 20 0c mov 0xc, %g1 <== NOT EXECUTED 2011e00: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2011e04: 81 c7 e0 08 ret <== NOT EXECUTED 2011e08: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02011e24 : fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, uint8_t *buf ) { 2011e24: 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; 2011e28: c0 27 bf fc clr [ %fp + -4 ] fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, uint8_t *buf ) { 2011e2c: 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) 2011e30: 80 a6 e0 00 cmp %i3, 0 2011e34: 02 80 00 7f be 2012030 <== NEVER TAKEN 2011e38: 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 ) 2011e3c: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 2011e40: 80 a0 40 1a cmp %g1, %i2 2011e44: 08 80 00 7b bleu 2012030 2011e48: 80 a6 c0 01 cmp %i3, %g1 return FAT_EOF; if ((count > fat_fd->fat_file_size) || 2011e4c: 08 80 00 4c bleu 2011f7c <== ALWAYS TAKEN 2011e50: 84 20 40 1b sub %g1, %i3, %g2 (start > fat_fd->fat_file_size - count)) count = fat_fd->fat_file_size - start; 2011e54: b6 20 40 1a sub %g1, %i2, %i3 <== NOT EXECUTED if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2011e58: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 2011e5c: 80 a0 60 01 cmp %g1, 1 2011e60: 22 80 00 4c be,a 2011f90 2011e64: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 return -1; return ret; } cl_start = start >> fs_info->vol.bpc_log2; 2011e68: e4 0f 60 08 ldub [ %i5 + 8 ], %l2 save_ofs = ofs = start & (fs_info->vol.bpc - 1); 2011e6c: e0 17 60 06 lduh [ %i5 + 6 ], %l0 return -1; return ret; } cl_start = start >> fs_info->vol.bpc_log2; 2011e70: 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); 2011e74: 90 10 00 1d mov %i5, %o0 2011e78: 92 10 00 19 mov %i1, %o1 2011e7c: 94 10 00 12 mov %l2, %o2 2011e80: 7f ff ff 06 call 2011a98 2011e84: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 2011e88: b0 92 60 00 orcc %o1, 0, %i0 2011e8c: 12 80 00 69 bne 2012030 <== NEVER TAKEN 2011e90: a1 2c 20 10 sll %l0, 0x10, %l0 return rc; while (count > 0) 2011e94: 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); 2011e98: 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) 2011e9c: 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); 2011ea0: 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) 2011ea4: 80 a6 e0 00 cmp %i3, 0 2011ea8: 02 80 00 5b be 2012014 <== NEVER TAKEN 2011eac: b4 0e 80 10 and %i2, %l0, %i2 2011eb0: c6 0f 60 02 ldub [ %i5 + 2 ], %g3 2011eb4: c8 17 40 00 lduh [ %i5 ], %g4 2011eb8: 10 80 00 20 b 2011f38 2011ebc: 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)) ) 2011ec0: 80 8e 20 03 btst 3, %i0 <== NOT EXECUTED 2011ec4: 22 80 00 27 be,a 2011f60 <== NOT EXECUTED 2011ec8: de 0f 60 05 ldub [ %i5 + 5 ], %o7 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2011ecc: d2 07 60 1c ld [ %i5 + 0x1c ], %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); 2011ed0: 87 32 80 03 srl %o2, %g3, %g3 byte = ofs & (fs_info->vol.bps - 1); 2011ed4: 85 29 20 10 sll %g4, 0x10, %g2 2011ed8: 85 30 a0 10 srl %g2, 0x10, %g2 2011edc: 84 00 bf ff add %g2, -1, %g2 ret = _fat_block_read(fs_info, sec, byte, c, buf + cmpltd); 2011ee0: 98 07 00 11 add %i4, %l1, %o4 2011ee4: 94 0a 80 02 and %o2, %g2, %o2 2011ee8: 92 02 40 03 add %o1, %g3, %o1 2011eec: 96 10 00 10 mov %l0, %o3 2011ef0: 40 00 03 78 call 2012cd0 <_fat_block_read> 2011ef4: 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); 2011ef8: 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 ) 2011efc: 80 a2 20 00 cmp %o0, 0 2011f00: 06 80 00 3d bl 2011ff4 <== NEVER TAKEN 2011f04: 90 10 00 1d mov %i5, %o0 return -1; count -= c; cmpltd += c; save_cln = cur_cln; 2011f08: 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; 2011f0c: 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); 2011f10: 92 10 00 13 mov %l3, %o1 2011f14: 40 00 1c 73 call 20190e0 2011f18: a2 04 40 10 add %l1, %l0, %l1 if ( rc != RC_OK ) 2011f1c: 80 a2 20 00 cmp %o0, 0 2011f20: 12 80 00 15 bne 2011f74 <== NEVER TAKEN 2011f24: 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) 2011f28: 02 80 00 3a be 2012010 2011f2c: 94 10 20 00 clr %o2 2011f30: c6 0f 60 02 ldub [ %i5 + 2 ], %g3 2011f34: c8 17 40 00 lduh [ %i5 ], %g4 { c = MIN(count, (fs_info->vol.bpc - ofs)); 2011f38: e0 17 60 06 lduh [ %i5 + 6 ], %l0 2011f3c: a0 24 00 0a sub %l0, %o2, %l0 2011f40: 80 a4 00 1b cmp %l0, %i3 2011f44: 08 80 00 03 bleu 2011f50 2011f48: c4 07 bf fc ld [ %fp + -4 ], %g2 2011f4c: 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)) ) 2011f50: 80 a0 a0 00 cmp %g2, 0 2011f54: 22 bf ff db be,a 2011ec0 <== NEVER TAKEN 2011f58: f0 0f 60 0a ldub [ %i5 + 0xa ], %i0 <== NOT EXECUTED return fs_info->vol.rdir_loc; return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 2011f5c: de 0f 60 05 ldub [ %i5 + 5 ], %o7 2011f60: f0 07 60 30 ld [ %i5 + 0x30 ], %i0 2011f64: 92 00 bf fe add %g2, -2, %o1 2011f68: 93 2a 40 0f sll %o1, %o7, %o1 2011f6c: 10 bf ff d9 b 2011ed0 2011f70: 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; } 2011f74: 81 c7 e0 08 ret <== NOT EXECUTED 2011f78: 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) || 2011f7c: 80 a6 80 02 cmp %i2, %g2 2011f80: 28 bf ff b7 bleu,a 2011e5c 2011f84: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 (start > fat_fd->fat_file_size - count)) count = fat_fd->fat_file_size - start; 2011f88: 10 bf ff b4 b 2011e58 2011f8c: b6 20 40 1a sub %g1, %i2, %i3 if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2011f90: 80 a0 60 00 cmp %g1, 0 2011f94: 32 bf ff b6 bne,a 2011e6c <== NEVER TAKEN 2011f98: e4 0f 60 08 ldub [ %i5 + 8 ], %l2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 2011f9c: c2 0f 60 0a ldub [ %i5 + 0xa ], %g1 if ((count > fat_fd->fat_file_size) || (start > fat_fd->fat_file_size - count)) count = fat_fd->fat_file_size - start; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 2011fa0: 80 88 60 03 btst 3, %g1 2011fa4: 22 bf ff b2 be,a 2011e6c <== NEVER TAKEN 2011fa8: e4 0f 60 08 ldub [ %i5 + 8 ], %l2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) { sec = fat_cluster_num_to_sector_num(fs_info, fat_fd->cln); 2011fac: 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)) ) 2011fb0: 80 a0 60 00 cmp %g1, 0 2011fb4: 32 80 00 12 bne,a 2011ffc <== NEVER TAKEN 2011fb8: c6 0f 60 05 ldub [ %i5 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2011fbc: d2 07 60 1c ld [ %i5 + 0x1c ], %o1 sec += (start >> fs_info->vol.sec_log2); 2011fc0: c2 0f 60 02 ldub [ %i5 + 2 ], %g1 byte = start & (fs_info->vol.bps - 1); 2011fc4: 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); 2011fc8: 83 36 80 01 srl %i2, %g1, %g1 byte = start & (fs_info->vol.bps - 1); 2011fcc: 94 02 bf ff add %o2, -1, %o2 ret = _fat_block_read(fs_info, sec, byte, count, buf); 2011fd0: 90 10 00 1d mov %i5, %o0 2011fd4: 92 02 40 01 add %o1, %g1, %o1 2011fd8: 94 0e 80 0a and %i2, %o2, %o2 2011fdc: 96 10 00 1b mov %i3, %o3 2011fe0: 40 00 03 3c call 2012cd0 <_fat_block_read> 2011fe4: 98 10 00 1c mov %i4, %o4 if ( ret < 0 ) 2011fe8: b0 92 20 00 orcc %o0, 0, %i0 2011fec: 16 80 00 11 bge 2012030 <== ALWAYS TAKEN 2011ff0: 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; 2011ff4: 81 c7 e0 08 ret <== NOT EXECUTED 2011ff8: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 2011ffc: c4 07 60 30 ld [ %i5 + 0x30 ], %g2 <== NOT EXECUTED 2012000: 92 00 7f fe add %g1, -2, %o1 <== NOT EXECUTED 2012004: 93 2a 40 03 sll %o1, %g3, %o1 <== NOT EXECUTED 2012008: 10 bf ff ee b 2011fc0 <== NOT EXECUTED 201200c: 92 02 40 02 add %o1, %g2, %o1 <== NOT EXECUTED 2012010: 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); 2012014: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 2012018: b4 06 bf ff add %i2, -1, %i2 fat_fd->map.disk_cln = save_cln; 201201c: 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); 2012020: a2 06 80 11 add %i2, %l1, %l1 2012024: 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 + 2012028: a4 04 40 12 add %l1, %l2, %l2 201202c: e4 26 60 34 st %l2, [ %i1 + 0x34 ] 2012030: 81 c7 e0 08 ret 2012034: 81 e8 00 00 restore =============================================================================== 02012870 : int fat_file_size( fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd ) { 2012870: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; uint32_t cur_cln = fat_fd->cln; 2012874: 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)) && 2012878: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 201287c: 80 a0 60 01 cmp %g1, 1 2012880: 02 80 00 21 be 2012904 <== NEVER TAKEN 2012884: 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) 2012888: c4 06 20 0c ld [ %i0 + 0xc ], %g2 201288c: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 2012890: 84 0f 00 02 and %i4, %g2, %g2 2012894: 80 a0 80 01 cmp %g2, %g1 2012898: 0a 80 00 0e bcs 20128d0 <== ALWAYS TAKEN 201289c: 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; 20128a0: 10 80 00 15 b 20128f4 <== NOT EXECUTED 20128a4: 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; 20128a8: 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) 20128ac: c6 06 20 0c ld [ %i0 + 0xc ], %g3 20128b0: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 20128b4: 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; 20128b8: 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) 20128bc: 86 08 40 03 and %g1, %g3, %g3 20128c0: 80 a0 c0 02 cmp %g3, %g2 20128c4: 1a 80 00 0c bcc 20128f4 <== ALWAYS TAKEN 20128c8: c8 26 60 18 st %g4, [ %i1 + 0x18 ] 20128cc: b8 10 00 01 mov %g1, %i4 <== NOT EXECUTED { save_cln = cur_cln; rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 20128d0: 92 10 00 1c mov %i4, %o1 20128d4: 90 10 00 18 mov %i0, %o0 20128d8: 40 00 1a 02 call 20190e0 20128dc: 94 07 bf fc add %fp, -4, %o2 if ( rc != RC_OK ) 20128e0: 80 a2 20 00 cmp %o0, 0 20128e4: 22 bf ff f1 be,a 20128a8 <== ALWAYS TAKEN 20128e8: 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; } 20128ec: 81 c7 e0 08 ret <== NOT EXECUTED 20128f0: 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; 20128f4: 90 10 20 00 clr %o0 20128f8: f8 26 60 3c st %i4, [ %i1 + 0x3c ] return rc; } 20128fc: 81 c7 e0 08 ret 2012900: 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)) && 2012904: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 <== NOT EXECUTED 2012908: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 201290c: 32 bf ff e0 bne,a 201288c <== NOT EXECUTED 2012910: c4 06 20 0c ld [ %i0 + 0xc ], %g2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 2012914: c2 0e 20 0a ldub [ %i0 + 0xa ], %g1 <== NOT EXECUTED 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)) && 2012918: 80 88 60 03 btst 3, %g1 <== NOT EXECUTED 201291c: 22 bf ff dc be,a 201288c <== NOT EXECUTED 2012920: c4 06 20 0c ld [ %i0 + 0xc ], %g2 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) { fat_fd->fat_file_size = fs_info->vol.rdir_size; 2012924: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 <== NOT EXECUTED return rc; 2012928: 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; 201292c: 10 bf ff f0 b 20128ec <== NOT EXECUTED 2012930: c2 26 60 18 st %g1, [ %i1 + 0x18 ] <== NOT EXECUTED =============================================================================== 02012038 : fat_file_truncate( fat_fs_info_t *fs_info, fat_file_fd_t *fat_fd, uint32_t new_length ) { 2012038: 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 ) 201203c: 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; 2012040: 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; 2012044: 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 ) 2012048: 80 a0 40 1a cmp %g1, %i2 201204c: 08 80 00 26 bleu 20120e4 2012050: c4 27 bf fc st %g2, [ %fp + -4 ] return rc; assert(fat_fd->fat_file_size); 2012054: 80 a0 60 00 cmp %g1, 0 2012058: 02 80 00 31 be 201211c <== NEVER TAKEN 201205c: 11 00 80 9a sethi %hi(0x2026800), %o0 cl_start = (new_length + fs_info->vol.bpc - 1) >> fs_info->vol.bpc_log2; 2012060: c4 0e 20 08 ldub [ %i0 + 8 ], %g2 2012064: c6 16 20 06 lduh [ %i0 + 6 ], %g3 2012068: 86 00 ff ff add %g3, -1, %g3 201206c: b4 00 c0 1a add %g3, %i2, %i2 2012070: b5 36 80 02 srl %i2, %g2, %i2 if ((cl_start << fs_info->vol.bpc_log2) >= fat_fd->fat_file_size) 2012074: 85 2e 80 02 sll %i2, %g2, %g2 2012078: 80 a0 40 02 cmp %g1, %g2 201207c: 08 80 00 1a bleu 20120e4 2012080: 80 a6 a0 00 cmp %i2, 0 return RC_OK; if (cl_start != 0) 2012084: 02 80 00 09 be 20120a8 2012088: 90 10 00 18 mov %i0, %o0 { rc = fat_file_lseek(fs_info, fat_fd, cl_start - 1, &new_last_cln); 201208c: 92 10 00 19 mov %i1, %o1 2012090: 94 06 bf ff add %i2, -1, %o2 2012094: 7f ff fe 81 call 2011a98 2012098: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 201209c: 80 a2 60 00 cmp %o1, 0 20120a0: 12 80 00 12 bne 20120e8 <== NEVER TAKEN 20120a4: 90 10 00 18 mov %i0, %o0 return rc; } rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); 20120a8: 92 10 00 19 mov %i1, %o1 20120ac: 94 10 00 1a mov %i2, %o2 20120b0: 7f ff fe 7a call 2011a98 20120b4: 96 07 bf f8 add %fp, -8, %o3 if (rc != RC_OK) 20120b8: 80 a2 60 00 cmp %o1, 0 20120bc: 12 80 00 0b bne 20120e8 <== NEVER TAKEN 20120c0: 01 00 00 00 nop return rc; rc = fat_free_fat_clusters_chain(fs_info, cur_cln); 20120c4: d2 07 bf f8 ld [ %fp + -8 ], %o1 20120c8: 40 00 1d 4f call 2019604 20120cc: 90 10 00 18 mov %i0, %o0 if (rc != RC_OK) 20120d0: 92 92 20 00 orcc %o0, 0, %o1 20120d4: 12 80 00 05 bne 20120e8 <== NEVER TAKEN 20120d8: 80 a6 a0 00 cmp %i2, 0 return rc; if (cl_start != 0) 20120dc: 12 80 00 05 bne 20120f0 20120e0: 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; 20120e4: 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; } 20120e8: 81 c7 e0 08 ret 20120ec: 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); 20120f0: 90 10 00 18 mov %i0, %o0 20120f4: 40 00 1c 84 call 2019304 20120f8: 94 10 3f ff mov -1, %o2 if ( rc != RC_OK ) 20120fc: 92 92 20 00 orcc %o0, 0, %o1 2012100: 12 bf ff fa bne 20120e8 <== NEVER TAKEN 2012104: c2 07 bf fc ld [ %fp + -4 ], %g1 return rc; fat_fd->map.file_cln = cl_start - 1; 2012108: b4 06 bf ff add %i2, -1, %i2 fat_fd->map.disk_cln = new_last_cln; 201210c: 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; 2012110: f4 26 60 34 st %i2, [ %i1 + 0x34 ] fat_fd->map.disk_cln = new_last_cln; fat_fd->map.last_cln = new_last_cln; 2012114: 10 bf ff f5 b 20120e8 2012118: c2 26 60 3c st %g1, [ %i1 + 0x3c ] if ( new_length >= fat_fd->fat_file_size ) return rc; assert(fat_fd->fat_file_size); 201211c: 15 00 80 9a sethi %hi(0x2026800), %o2 <== NOT EXECUTED 2012120: 17 00 80 9a sethi %hi(0x2026800), %o3 <== NOT EXECUTED 2012124: 90 12 22 d0 or %o0, 0x2d0, %o0 <== NOT EXECUTED 2012128: 92 10 22 7d mov 0x27d, %o1 <== NOT EXECUTED 201212c: 94 12 a3 30 or %o2, 0x330, %o2 <== NOT EXECUTED 2012130: 40 00 08 6a call 20142d8 <__assert_func> <== NOT EXECUTED 2012134: 96 12 e3 18 or %o3, 0x318, %o3 <== NOT EXECUTED =============================================================================== 02012550 : fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, const uint8_t *buf ) { 2012550: 9d e3 bf 98 save %sp, -104, %sp int rc = 0; ssize_t ret = 0; uint32_t cmpltd = 0; uint32_t cur_cln = 0; 2012554: c0 27 bf f8 clr [ %fp + -8 ] uint32_t cl_start = 0; uint32_t ofs = 0; uint32_t save_ofs; uint32_t sec = 0; uint32_t byte = 0; uint32_t c = 0; 2012558: c0 27 bf fc clr [ %fp + -4 ] fat_file_fd_t *fat_fd, uint32_t start, uint32_t count, const uint8_t *buf ) { 201255c: ba 10 00 18 mov %i0, %i5 uint32_t ofs = 0; uint32_t save_ofs; uint32_t sec = 0; uint32_t byte = 0; uint32_t c = 0; bool zero_fill = start > fat_fd->fat_file_size; 2012560: c2 06 60 18 ld [ %i1 + 0x18 ], %g1 if ( count == 0 ) 2012564: 80 a6 e0 00 cmp %i3, 0 2012568: 02 80 00 8f be 20127a4 <== NEVER TAKEN 201256c: b0 10 20 00 clr %i0 return cmpltd; if (start >= fat_fd->size_limit) 2012570: e0 06 60 14 ld [ %i1 + 0x14 ], %l0 2012574: 80 a6 80 10 cmp %i2, %l0 2012578: 1a 80 00 8d bcc 20127ac <== NEVER TAKEN 201257c: a0 24 00 1a sub %l0, %i2, %l0 2012580: 80 a4 00 1b cmp %l0, %i3 uint32_t ofs = 0; uint32_t save_ofs; uint32_t sec = 0; uint32_t byte = 0; uint32_t c = 0; bool zero_fill = start > fat_fd->fat_file_size; 2012584: 18 80 00 6f bgu 2012740 <== ALWAYS TAKEN 2012588: 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); 201258c: b6 04 00 1a add %l0, %i2, %i3 <== NOT EXECUTED 2012590: 94 40 20 00 addx %g0, 0, %o2 <== NOT EXECUTED 2012594: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2012598: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED 201259c: 96 10 00 1b mov %i3, %o3 <== NOT EXECUTED 20125a0: 7f ff ff 4a call 20122c8 <== NOT EXECUTED 20125a4: 98 07 bf fc add %fp, -4, %o4 <== NOT EXECUTED if (rc != RC_OK) 20125a8: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 20125ac: 12 80 00 7e bne 20127a4 <== NOT EXECUTED 20125b0: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED /* * check whether there was enough room on device to locate * file of 'start + count' bytes */ if (c != (start + count)) 20125b4: 80 a6 c0 01 cmp %i3, %g1 20125b8: 32 80 00 02 bne,a 20125c0 <== NEVER TAKEN 20125bc: a0 20 40 1a sub %g1, %i2, %l0 <== NOT EXECUTED count = c - start; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 20125c0: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 20125c4: 80 a0 60 01 cmp %g1, 1 20125c8: 22 80 00 43 be,a 20126d4 20125cc: c2 06 60 24 ld [ %i1 + 0x24 ], %g1 return -1; return ret; } cl_start = start >> fs_info->vol.bpc_log2; 20125d0: e2 0f 60 08 ldub [ %i5 + 8 ], %l1 save_ofs = ofs = start & (fs_info->vol.bpc - 1); 20125d4: f6 17 60 06 lduh [ %i5 + 6 ], %i3 return -1; return ret; } cl_start = start >> fs_info->vol.bpc_log2; 20125d8: a3 36 80 11 srl %i2, %l1, %l1 save_ofs = ofs = start & (fs_info->vol.bpc - 1); rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); 20125dc: 90 10 00 1d mov %i5, %o0 20125e0: 92 10 00 19 mov %i1, %o1 20125e4: 94 10 00 11 mov %l1, %o2 20125e8: 7f ff fd 2c call 2011a98 20125ec: 96 07 bf f8 add %fp, -8, %o3 if (rc != RC_OK) 20125f0: b0 92 60 00 orcc %o1, 0, %i0 20125f4: 12 80 00 6c bne 20127a4 <== NEVER TAKEN 20125f8: 83 2e e0 10 sll %i3, 0x10, %g1 return rc; while (count > 0) 20125fc: a4 10 20 00 clr %l2 return ret; } cl_start = start >> fs_info->vol.bpc_log2; save_ofs = ofs = start & (fs_info->vol.bpc - 1); 2012600: 83 30 60 10 srl %g1, 0x10, %g1 rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; while (count > 0) 2012604: b6 10 20 00 clr %i3 return ret; } cl_start = start >> fs_info->vol.bpc_log2; save_ofs = ofs = start & (fs_info->vol.bpc - 1); 2012608: 82 00 7f ff add %g1, -1, %g1 rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; while (count > 0) 201260c: 80 a4 20 00 cmp %l0, 0 return ret; } cl_start = start >> fs_info->vol.bpc_log2; save_ofs = ofs = start & (fs_info->vol.bpc - 1); 2012610: b4 0e 80 01 and %i2, %g1, %i2 rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; while (count > 0) 2012614: 12 80 00 21 bne 2012698 <== ALWAYS TAKEN 2012618: 94 10 00 1a mov %i2, %o2 } /* 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); 201261c: 10 80 00 5c b 201278c <== NOT EXECUTED 2012620: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 <== 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)) ) 2012624: c6 0f 60 0a ldub [ %i5 + 0xa ], %g3 <== NOT EXECUTED 2012628: 80 88 e0 03 btst 3, %g3 <== NOT EXECUTED 201262c: 22 80 00 25 be,a 20126c0 <== NOT EXECUTED 2012630: c8 0f 60 05 ldub [ %i5 + 5 ], %g4 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2012634: d2 07 60 1c ld [ %i5 + 0x1c ], %o1 <== NOT EXECUTED while (count > 0) { 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); 2012638: c8 0f 60 02 ldub [ %i5 + 2 ], %g4 byte = ofs & (fs_info->vol.bps - 1); 201263c: c6 17 40 00 lduh [ %i5 ], %g3 while (count > 0) { 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); 2012640: 89 32 80 04 srl %o2, %g4, %g4 byte = ofs & (fs_info->vol.bps - 1); 2012644: 86 00 ff ff add %g3, -1, %g3 ret = _fat_block_write(fs_info, sec, byte, c, buf + cmpltd); 2012648: 98 07 00 1b add %i4, %i3, %o4 201264c: 94 0a 80 03 and %o2, %g3, %o2 2012650: 92 02 40 04 add %o1, %g4, %o1 2012654: 40 00 01 c1 call 2012d58 <_fat_block_write> 2012658: 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); 201265c: 94 07 bf f8 add %fp, -8, %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_write(fs_info, sec, byte, c, buf + cmpltd); if ( ret < 0 ) 2012660: 80 a2 20 00 cmp %o0, 0 2012664: 06 80 00 35 bl 2012738 <== NEVER TAKEN 2012668: 90 10 00 1d mov %i5, %o0 return -1; count -= c; 201266c: c2 07 bf fc ld [ %fp + -4 ], %g1 cmpltd += c; save_cln = cur_cln; 2012670: e4 07 bf f8 ld [ %fp + -8 ], %l2 ret = _fat_block_write(fs_info, sec, byte, c, buf + cmpltd); if ( ret < 0 ) return -1; count -= c; 2012674: a0 24 00 01 sub %l0, %g1, %l0 cmpltd += c; 2012678: b6 06 c0 01 add %i3, %g1, %i3 save_cln = cur_cln; rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 201267c: 40 00 1a 99 call 20190e0 2012680: 92 10 00 12 mov %l2, %o1 if ( rc != RC_OK ) 2012684: b0 92 20 00 orcc %o0, 0, %i0 2012688: 12 80 00 47 bne 20127a4 <== NEVER TAKEN 201268c: 80 a4 20 00 cmp %l0, 0 rc = fat_file_lseek(fs_info, fat_fd, cl_start, &cur_cln); if (rc != RC_OK) return rc; while (count > 0) 2012690: 02 80 00 3d be 2012784 2012694: 94 10 20 00 clr %o2 { c = MIN(count, (fs_info->vol.bpc - ofs)); 2012698: d6 17 60 06 lduh [ %i5 + 6 ], %o3 201269c: 96 22 c0 0a sub %o3, %o2, %o3 20126a0: 80 a2 c0 10 cmp %o3, %l0 20126a4: 08 80 00 03 bleu 20126b0 20126a8: c4 07 bf f8 ld [ %fp + -8 ], %g2 20126ac: 96 10 00 10 mov %l0, %o3 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)) ) 20126b0: 80 a0 a0 00 cmp %g2, 0 20126b4: 02 bf ff dc be 2012624 <== NEVER TAKEN 20126b8: d6 27 bf fc st %o3, [ %fp + -4 ] return fs_info->vol.rdir_loc; return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 20126bc: c8 0f 60 05 ldub [ %i5 + 5 ], %g4 20126c0: c6 07 60 30 ld [ %i5 + 0x30 ], %g3 20126c4: 92 00 bf fe add %g2, -2, %o1 20126c8: 93 2a 40 04 sll %o1, %g4, %o1 20126cc: 10 bf ff db b 2012638 20126d0: 92 02 40 03 add %o1, %g3, %o1 * file of 'start + count' bytes */ if (c != (start + count)) count = c - start; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 20126d4: 80 a0 60 00 cmp %g1, 0 20126d8: 32 bf ff bf bne,a 20125d4 <== NEVER TAKEN 20126dc: e2 0f 60 08 ldub [ %i5 + 8 ], %l1 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) 20126e0: c2 0f 60 0a ldub [ %i5 + 0xa ], %g1 * file of 'start + count' bytes */ if (c != (start + count)) count = c - start; if ((FAT_FD_OF_ROOT_DIR(fat_fd)) && 20126e4: 80 88 60 03 btst 3, %g1 20126e8: 22 bf ff bb be,a 20125d4 <== NEVER TAKEN 20126ec: e2 0f 60 08 ldub [ %i5 + 8 ], %l1 <== NOT EXECUTED (fs_info->vol.type & (FAT_FAT12 | FAT_FAT16))) { sec = fat_cluster_num_to_sector_num(fs_info, fat_fd->cln); 20126f0: 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)) ) 20126f4: 80 a0 60 00 cmp %g1, 0 20126f8: 32 80 00 1e bne,a 2012770 <== NEVER TAKEN 20126fc: c6 0f 60 05 ldub [ %i5 + 5 ], %g3 <== NOT EXECUTED return fs_info->vol.rdir_loc; 2012700: d2 07 60 1c ld [ %i5 + 0x1c ], %o1 sec += (start >> fs_info->vol.sec_log2); 2012704: c2 0f 60 02 ldub [ %i5 + 2 ], %g1 byte = start & (fs_info->vol.bps - 1); 2012708: 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); 201270c: 83 36 80 01 srl %i2, %g1, %g1 byte = start & (fs_info->vol.bps - 1); 2012710: 94 02 bf ff add %o2, -1, %o2 ret = _fat_block_write(fs_info, sec, byte, count, buf); 2012714: 90 10 00 1d mov %i5, %o0 2012718: 92 02 40 01 add %o1, %g1, %o1 201271c: 94 0e 80 0a and %i2, %o2, %o2 2012720: 96 10 00 10 mov %l0, %o3 2012724: 40 00 01 8d call 2012d58 <_fat_block_write> 2012728: 98 10 00 1c mov %i4, %o4 if ( ret < 0 ) 201272c: b0 92 20 00 orcc %o0, 0, %i0 2012730: 16 80 00 23 bge 20127bc <== ALWAYS TAKEN 2012734: 01 00 00 00 nop 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; } 2012738: 81 c7 e0 08 ret <== NOT EXECUTED 201273c: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED 2012740: a0 10 00 1b mov %i3, %l0 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); 2012744: 94 40 20 00 addx %g0, 0, %o2 2012748: b6 04 00 1a add %l0, %i2, %i3 201274c: 90 10 00 1d mov %i5, %o0 2012750: 92 10 00 19 mov %i1, %o1 2012754: 96 10 00 1b mov %i3, %o3 2012758: 7f ff fe dc call 20122c8 201275c: 98 07 bf fc add %fp, -4, %o4 if (rc != RC_OK) 2012760: b0 92 20 00 orcc %o0, 0, %i0 2012764: 02 bf ff 94 be 20125b4 <== ALWAYS TAKEN 2012768: c2 07 bf fc ld [ %fp + -4 ], %g1 201276c: 30 80 00 14 b,a 20127bc <== NOT EXECUTED return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 2012770: c4 07 60 30 ld [ %i5 + 0x30 ], %g2 <== NOT EXECUTED 2012774: 92 00 7f fe add %g1, -2, %o1 <== NOT EXECUTED 2012778: 93 2a 40 03 sll %o1, %g3, %o1 <== NOT EXECUTED 201277c: 10 bf ff e2 b 2012704 <== NOT EXECUTED 2012780: 92 02 40 02 add %o1, %g2, %o1 <== NOT EXECUTED 2012784: b0 10 00 1b mov %i3, %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); 2012788: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 201278c: b4 06 bf ff add %i2, -1, %i2 fat_fd->map.disk_cln = save_cln; 2012790: e4 26 60 38 st %l2, [ %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); 2012794: b6 06 80 1b add %i2, %i3, %i3 2012798: b7 36 c0 01 srl %i3, %g1, %i3 ofs = 0; } /* update cache */ /* XXX: check this - I'm not sure :( */ fat_fd->map.file_cln = cl_start + 201279c: a2 06 c0 11 add %i3, %l1, %l1 20127a0: e2 26 60 34 st %l1, [ %i1 + 0x34 ] 20127a4: 81 c7 e0 08 ret 20127a8: 81 e8 00 00 restore if ( count == 0 ) return cmpltd; if (start >= fat_fd->size_limit) rtems_set_errno_and_return_minus_one(EFBIG); 20127ac: 40 00 21 c2 call 201aeb4 <__errno> <== NOT EXECUTED 20127b0: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20127b4: 82 10 20 1b mov 0x1b, %g1 <== NOT EXECUTED 20127b8: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 20127bc: 81 c7 e0 08 ret 20127c0: 81 e8 00 00 restore =============================================================================== 02019604 : int fat_free_fat_clusters_chain( fat_fs_info_t *fs_info, uint32_t chain ) { 2019604: 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) 2019608: c4 06 20 0c ld [ %i0 + 0xc ], %g2 201960c: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 uint32_t chain ) { int rc = RC_OK, rc1 = RC_OK; uint32_t cur_cln = chain; uint32_t next_cln = 0; 2019610: 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) 2019614: 84 0e 40 02 and %i1, %g2, %g2 2019618: 80 a0 80 01 cmp %g2, %g1 201961c: 1a 80 00 25 bcc 20196b0 <== NEVER TAKEN 2019620: ba 10 00 18 mov %i0, %i5 2019624: b8 10 00 19 mov %i1, %i4 2019628: b6 10 20 00 clr %i3 201962c: 10 80 00 0e b 2019664 2019630: 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); 2019634: 7f ff ff 34 call 2019304 2019638: 01 00 00 00 nop if ( rc != RC_OK ) 201963c: 80 a2 20 00 cmp %o0, 0 2019640: 02 80 00 03 be 201964c <== ALWAYS TAKEN 2019644: f8 07 bf fc ld [ %fp + -4 ], %i4 2019648: 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) 201964c: c4 07 60 0c ld [ %i5 + 0xc ], %g2 2019650: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2019654: 84 0f 00 02 and %i4, %g2, %g2 2019658: 80 a0 80 01 cmp %g2, %g1 201965c: 1a 80 00 17 bcc 20196b8 2019660: b6 06 e0 01 inc %i3 { rc = fat_get_fat_cluster(fs_info, cur_cln, &next_cln); 2019664: 92 10 00 1c mov %i4, %o1 2019668: 94 07 bf fc add %fp, -4, %o2 201966c: 7f ff fe 9d call 20190e0 2019670: 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); 2019674: 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); 2019678: 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); 201967c: 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 ) 2019680: 80 a6 20 00 cmp %i0, 0 2019684: 02 bf ff ec be 2019634 <== ALWAYS TAKEN 2019688: 90 10 00 1d mov %i5, %o0 { if(fs_info->vol.free_cls != FAT_UNDEFINED_VALUE) 201968c: c2 07 60 40 ld [ %i5 + 0x40 ], %g1 <== NOT EXECUTED 2019690: 80 a0 7f ff cmp %g1, -1 <== NOT EXECUTED 2019694: 02 80 00 03 be 20196a0 <== NOT EXECUTED 2019698: 82 06 c0 01 add %i3, %g1, %g1 <== NOT EXECUTED fs_info->vol.free_cls += freed_cls_cnt; 201969c: c2 27 60 40 st %g1, [ %i5 + 0x40 ] <== NOT EXECUTED fat_buf_release(fs_info); 20196a0: 7f ff e5 2e call 2012b58 <== NOT EXECUTED 20196a4: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 20196a8: 81 c7 e0 08 ret <== NOT EXECUTED 20196ac: 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; 20196b0: 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; 20196b4: 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) 20196b8: c2 07 60 40 ld [ %i5 + 0x40 ], %g1 20196bc: 80 a0 7f ff cmp %g1, -1 20196c0: 02 80 00 04 be 20196d0 <== ALWAYS TAKEN 20196c4: f2 27 60 44 st %i1, [ %i5 + 0x44 ] fs_info->vol.free_cls += freed_cls_cnt; 20196c8: 82 06 c0 01 add %i3, %g1, %g1 <== NOT EXECUTED 20196cc: c2 27 60 40 st %g1, [ %i5 + 0x40 ] <== NOT EXECUTED fat_buf_release(fs_info); 20196d0: b0 10 00 1a mov %i2, %i0 20196d4: 7f ff e5 21 call 2012b58 20196d8: 90 10 00 1d mov %i5, %o0 if (rc1 != RC_OK) return rc1; return RC_OK; } 20196dc: 81 c7 e0 08 ret 20196e0: 81 e8 00 00 restore =============================================================================== 02013158 : 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); 2013158: c4 02 20 74 ld [ %o0 + 0x74 ], %g2 <== NOT EXECUTED 201315c: c2 02 20 68 ld [ %o0 + 0x68 ], %g1 <== NOT EXECUTED 2013160: 92 22 40 02 sub %o1, %g2, %o1 <== NOT EXECUTED 2013164: 85 32 60 03 srl %o1, 3, %g2 <== NOT EXECUTED 2013168: c6 08 40 02 ldub [ %g1 + %g2 ], %g3 <== NOT EXECUTED 201316c: 92 0a 60 07 and %o1, 7, %o1 <== NOT EXECUTED 2013170: 88 10 20 01 mov 1, %g4 <== NOT EXECUTED 2013174: 93 29 00 09 sll %g4, %o1, %o1 <== NOT EXECUTED 2013178: 92 28 c0 09 andn %g3, %o1, %o1 <== NOT EXECUTED 201317c: 81 c3 e0 08 retl <== NOT EXECUTED 2013180: d2 28 40 02 stb %o1, [ %g1 + %g2 ] <== NOT EXECUTED =============================================================================== 020190e0 : fat_get_fat_cluster( fat_fs_info_t *fs_info, uint32_t cln, uint32_t *ret_val ) { 20190e0: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; rtems_bdbuf_buffer *block0 = NULL; 20190e4: c0 27 bf fc clr [ %fp + -4 ] uint32_t sec = 0; uint32_t ofs = 0; /* sanity check */ if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) 20190e8: 80 a6 60 01 cmp %i1, 1 20190ec: 08 80 00 27 bleu 2019188 <== NEVER TAKEN 20190f0: ba 10 00 18 mov %i0, %i5 20190f4: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 20190f8: 82 00 60 01 inc %g1 20190fc: 80 a6 40 01 cmp %i1, %g1 2019100: 18 80 00 22 bgu 2019188 <== NEVER TAKEN 2019104: 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) + 2019108: c2 0e 20 0a ldub [ %i0 + 0xa ], %g1 201910c: 80 88 60 01 btst 1, %g1 2019110: 12 80 00 24 bne 20191a0 <== ALWAYS TAKEN 2019114: f6 0e 20 02 ldub [ %i0 + 2 ], %i3 2019118: 82 08 60 02 and %g1, 2, %g1 <== NOT EXECUTED 201911c: 80 88 60 ff btst 0xff, %g1 <== NOT EXECUTED 2019120: 02 80 00 30 be 20191e0 <== NOT EXECUTED 2019124: c2 06 20 4c ld [ %i0 + 0x4c ], %g1 <== NOT EXECUTED 2019128: b9 2e 60 01 sll %i1, 1, %i4 <== NOT EXECUTED 201912c: b7 37 00 1b srl %i4, %i3, %i3 <== NOT EXECUTED 2019130: b6 06 c0 01 add %i3, %g1, %i3 <== NOT EXECUTED fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); 2019134: e0 17 40 00 lduh [ %i5 ], %l0 <== NOT EXECUTED rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); 2019138: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 201913c: 92 10 00 1b mov %i3, %o1 <== NOT EXECUTED 2019140: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 2019144: 7f ff e5 fc call 2012934 <== NOT EXECUTED 2019148: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED if (rc != RC_OK) 201914c: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 2019150: 12 80 00 5a bne 20192b8 <== NOT EXECUTED 2019154: 01 00 00 00 nop <== NOT EXECUTED return rc; switch ( fs_info->vol.type ) 2019158: c2 0f 60 0a ldub [ %i5 + 0xa ], %g1 <== NOT EXECUTED if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) rtems_set_errno_and_return_minus_one(EIO); sec = (FAT_FAT_OFFSET(fs_info->vol.type, cln) >> fs_info->vol.sec_log2) + fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); 201915c: a1 2c 20 10 sll %l0, 0x10, %l0 rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); if (rc != RC_OK) return rc; switch ( fs_info->vol.type ) 2019160: 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); 2019164: a1 34 20 10 srl %l0, 0x10, %l0 2019168: a0 04 3f ff add %l0, -1, %l0 rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); if (rc != RC_OK) return rc; switch ( fs_info->vol.type ) 201916c: 02 80 00 21 be 20191f0 <== NEVER TAKEN 2019170: b8 0f 00 10 and %i4, %l0, %i4 2019174: 80 a0 60 04 cmp %g1, 4 2019178: 02 80 00 3e be 2019270 <== NEVER TAKEN 201917c: 80 a0 60 01 cmp %g1, 1 2019180: 02 80 00 29 be 2019224 <== ALWAYS TAKEN 2019184: c2 07 bf fc ld [ %fp + -4 ], %g1 *ret_val = *((uint32_t *)(block0->buffer + ofs)); *ret_val = CF_LE_L(*ret_val); break; default: rtems_set_errno_and_return_minus_one(EIO); 2019188: 40 00 07 4b call 201aeb4 <__errno> <== NOT EXECUTED 201918c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2019190: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 2019194: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2019198: 81 c7 e0 08 ret <== NOT EXECUTED 201919c: 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) + 20191a0: c2 06 20 4c ld [ %i0 + 0x4c ], %g1 20191a4: 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); 20191a8: 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) + 20191ac: b8 07 00 19 add %i4, %i1, %i4 fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); 20191b0: 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) + 20191b4: b7 37 00 1b srl %i4, %i3, %i3 fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); 20191b8: 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) + 20191bc: b6 06 c0 01 add %i3, %g1, %i3 fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); 20191c0: 96 07 bf fc add %fp, -4, %o3 20191c4: 7f ff e5 dc call 2012934 20191c8: 92 10 00 1b mov %i3, %o1 if (rc != RC_OK) 20191cc: b0 92 20 00 orcc %o0, 0, %i0 20191d0: 22 bf ff e3 be,a 201915c <== ALWAYS TAKEN 20191d4: c2 0f 60 0a ldub [ %i5 + 0xa ], %g1 rtems_set_errno_and_return_minus_one(EIO); break; } return RC_OK; } 20191d8: 81 c7 e0 08 ret <== NOT EXECUTED 20191dc: 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) + 20191e0: b9 2e 60 02 sll %i1, 2, %i4 <== NOT EXECUTED 20191e4: b7 37 00 1b srl %i4, %i3, %i3 <== NOT EXECUTED 20191e8: 10 bf ff d3 b 2019134 <== NOT EXECUTED 20191ec: b6 06 c0 01 add %i3, %g1, %i3 <== NOT EXECUTED else *ret_val = (*ret_val) & FAT_FAT12_MASK; break; case FAT_FAT16: *ret_val = *((uint16_t *)(block0->buffer + ofs)); 20191f0: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED *ret_val = CF_LE_W(*ret_val); 20191f4: 07 00 00 3f sethi %hi(0xfc00), %g3 <== NOT EXECUTED else *ret_val = (*ret_val) & FAT_FAT12_MASK; break; case FAT_FAT16: *ret_val = *((uint16_t *)(block0->buffer + ofs)); 20191f8: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 <== NOT EXECUTED *ret_val = CF_LE_W(*ret_val); 20191fc: 86 10 e3 ff or %g3, 0x3ff, %g3 <== NOT EXECUTED else *ret_val = (*ret_val) & FAT_FAT12_MASK; break; case FAT_FAT16: *ret_val = *((uint16_t *)(block0->buffer + ofs)); 2019200: c2 10 40 1c lduh [ %g1 + %i4 ], %g1 <== NOT EXECUTED *ret_val = CF_LE_W(*ret_val); 2019204: 83 28 60 10 sll %g1, 0x10, %g1 <== NOT EXECUTED 2019208: 85 30 60 18 srl %g1, 0x18, %g2 <== NOT EXECUTED 201920c: 83 30 60 08 srl %g1, 8, %g1 <== NOT EXECUTED 2019210: 82 08 40 03 and %g1, %g3, %g1 <== NOT EXECUTED 2019214: 82 10 80 01 or %g2, %g1, %g1 <== NOT EXECUTED 2019218: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED break; 201921c: 81 c7 e0 08 ret <== NOT EXECUTED 2019220: 81 e8 00 00 restore <== NOT EXECUTED /* * we are enforced in complex computations for FAT12 to escape CPU * align problems for some architectures */ *ret_val = (*((uint8_t *)(block0->buffer + ofs))); if ( ofs == (fs_info->vol.bps - 1) ) 2019224: c6 17 40 00 lduh [ %i5 ], %g3 case FAT_FAT12: /* * we are enforced in complex computations for FAT12 to escape CPU * align problems for some architectures */ *ret_val = (*((uint8_t *)(block0->buffer + ofs))); 2019228: c4 00 60 1c ld [ %g1 + 0x1c ], %g2 if ( ofs == (fs_info->vol.bps - 1) ) 201922c: 86 00 ff ff add %g3, -1, %g3 case FAT_FAT12: /* * we are enforced in complex computations for FAT12 to escape CPU * align problems for some architectures */ *ret_val = (*((uint8_t *)(block0->buffer + ofs))); 2019230: c2 08 80 1c ldub [ %g2 + %i4 ], %g1 if ( ofs == (fs_info->vol.bps - 1) ) 2019234: 80 a0 c0 1c cmp %g3, %i4 2019238: 02 80 00 22 be 20192c0 <== NEVER TAKEN 201923c: c2 26 80 00 st %g1, [ %i2 ] *ret_val |= (*((uint8_t *)(block0->buffer)))<<8; } else { *ret_val |= (*((uint8_t *)(block0->buffer + ofs + 1)))<<8; 2019240: b8 00 80 1c add %g2, %i4, %i4 2019244: c4 0f 20 01 ldub [ %i4 + 1 ], %g2 2019248: 85 28 a0 08 sll %g2, 8, %g2 201924c: 82 10 80 01 or %g2, %g1, %g1 2019250: c2 26 80 00 st %g1, [ %i2 ] } if ( FAT_CLUSTER_IS_ODD(cln) ) 2019254: 80 8e 60 01 btst 1, %i1 2019258: 22 80 00 17 be,a 20192b4 201925c: 82 08 6f ff and %g1, 0xfff, %g1 *ret_val = (*ret_val) >> FAT12_SHIFT; 2019260: 83 30 60 04 srl %g1, 4, %g1 2019264: c2 26 80 00 st %g1, [ %i2 ] 2019268: 81 c7 e0 08 ret 201926c: 81 e8 00 00 restore *ret_val = *((uint16_t *)(block0->buffer + ofs)); *ret_val = CF_LE_W(*ret_val); break; case FAT_FAT32: *ret_val = *((uint32_t *)(block0->buffer + ofs)); 2019270: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED 2019274: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 <== NOT EXECUTED 2019278: c2 00 40 1c ld [ %g1 + %i4 ], %g1 <== NOT EXECUTED 201927c: 89 28 60 18 sll %g1, 0x18, %g4 <== NOT EXECUTED uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 2019280: 85 30 60 18 srl %g1, 0x18, %g2 <== NOT EXECUTED byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 2019284: 87 30 60 08 srl %g1, 8, %g3 <== NOT EXECUTED byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2019288: 84 11 00 02 or %g4, %g2, %g2 <== NOT EXECUTED { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 201928c: 86 08 e0 ff and %g3, 0xff, %g3 <== NOT EXECUTED ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2019290: 83 30 60 10 srl %g1, 0x10, %g1 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 2019294: 87 28 e0 10 sll %g3, 0x10, %g3 <== NOT EXECUTED ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 2019298: 82 08 60 ff and %g1, 0xff, %g1 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 201929c: 84 10 80 03 or %g2, %g3, %g2 <== NOT EXECUTED 20192a0: 83 28 60 08 sll %g1, 8, %g1 <== NOT EXECUTED 20192a4: 82 10 80 01 or %g2, %g1, %g1 <== NOT EXECUTED *ret_val = CF_LE_L(*ret_val); 20192a8: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED break; 20192ac: 81 c7 e0 08 ret <== NOT EXECUTED 20192b0: 81 e8 00 00 restore <== NOT EXECUTED } if ( FAT_CLUSTER_IS_ODD(cln) ) *ret_val = (*ret_val) >> FAT12_SHIFT; else *ret_val = (*ret_val) & FAT_FAT12_MASK; 20192b4: c2 26 80 00 st %g1, [ %i2 ] 20192b8: 81 c7 e0 08 ret 20192bc: 81 e8 00 00 restore * align problems for some architectures */ *ret_val = (*((uint8_t *)(block0->buffer + ofs))); if ( ofs == (fs_info->vol.bps - 1) ) { rc = fat_buf_access(fs_info, sec + 1, FAT_OP_TYPE_READ, 20192c0: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 20192c4: 92 06 e0 01 add %i3, 1, %o1 <== NOT EXECUTED 20192c8: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 20192cc: 7f ff e5 9a call 2012934 <== NOT EXECUTED 20192d0: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED &block0); if (rc != RC_OK) 20192d4: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 20192d8: 12 80 00 09 bne 20192fc <== NOT EXECUTED 20192dc: c4 07 bf fc ld [ %fp + -4 ], %g2 <== NOT EXECUTED return rc; *ret_val |= (*((uint8_t *)(block0->buffer)))<<8; 20192e0: c2 06 80 00 ld [ %i2 ], %g1 <== NOT EXECUTED 20192e4: c4 00 a0 1c ld [ %g2 + 0x1c ], %g2 <== NOT EXECUTED 20192e8: c4 08 80 00 ldub [ %g2 ], %g2 <== NOT EXECUTED 20192ec: 85 28 a0 08 sll %g2, 8, %g2 <== NOT EXECUTED 20192f0: 82 10 80 01 or %g2, %g1, %g1 <== NOT EXECUTED 20192f4: 10 bf ff d8 b 2019254 <== NOT EXECUTED 20192f8: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED rtems_set_errno_and_return_minus_one(EIO); break; } return RC_OK; } 20192fc: 81 c7 e0 08 ret <== NOT EXECUTED 2019300: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED =============================================================================== 02013068 : * 0 means FAILED !!! * */ uint32_t fat_get_unique_ino(fat_fs_info_t *fs_info) { 2013068: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED 201306c: fa 06 20 70 ld [ %i0 + 0x70 ], %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)) 2013070: 33 03 ff ff sethi %hi(0xffffc00), %i1 <== NOT EXECUTED 2013074: 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++) 2013078: 80 a7 60 00 cmp %i5, 0 <== NOT EXECUTED 201307c: 22 80 00 20 be,a 20130fc <== NOT EXECUTED 2013080: c2 06 20 74 ld [ %i0 + 0x74 ], %g1 <== NOT EXECUTED { if (!FAT_UNIQ_INO_IS_BUSY(fs_info->index, fs_info->uino)) 2013084: c6 06 20 68 ld [ %i0 + 0x68 ], %g3 <== NOT EXECUTED 2013088: c2 06 20 6c ld [ %i0 + 0x6c ], %g1 <== NOT EXECUTED 201308c: 85 30 60 03 srl %g1, 3, %g2 <== NOT EXECUTED 2013090: c8 48 c0 02 ldsb [ %g3 + %g2 ], %g4 <== NOT EXECUTED 2013094: b8 08 60 07 and %g1, 7, %i4 <== NOT EXECUTED 2013098: b4 00 c0 02 add %g3, %g2, %i2 <== NOT EXECUTED 201309c: 89 39 00 1c sra %g4, %i4, %g4 <== NOT EXECUTED 20130a0: 80 89 20 01 btst 1, %g4 <== NOT EXECUTED 20130a4: 02 80 00 1d be 2013118 <== NOT EXECUTED 20130a8: c4 08 c0 02 ldub [ %g3 + %g2 ], %g2 <== NOT EXECUTED 20130ac: 10 80 00 0a b 20130d4 <== NOT EXECUTED 20130b0: 88 10 20 00 clr %g4 <== NOT EXECUTED 20130b4: 85 30 60 03 srl %g1, 3, %g2 <== NOT EXECUTED 20130b8: f6 48 c0 02 ldsb [ %g3 + %g2 ], %i3 <== NOT EXECUTED 20130bc: b8 08 60 07 and %g1, 7, %i4 <== NOT EXECUTED 20130c0: b4 00 c0 02 add %g3, %g2, %i2 <== NOT EXECUTED 20130c4: b7 3e c0 1c sra %i3, %i4, %i3 <== NOT EXECUTED 20130c8: 80 8e e0 01 btst 1, %i3 <== NOT EXECUTED 20130cc: 02 80 00 13 be 2013118 <== NOT EXECUTED 20130d0: 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++; 20130d4: 82 00 60 01 inc %g1 <== NOT EXECUTED if (fs_info->index >= fs_info->uino_pool_size) 20130d8: 80 a0 40 1d cmp %g1, %i5 <== NOT EXECUTED 20130dc: 0a 80 00 03 bcs 20130e8 <== NOT EXECUTED 20130e0: c2 26 20 6c st %g1, [ %i0 + 0x6c ] <== NOT EXECUTED fs_info->index = 0; 20130e4: c0 26 20 6c clr [ %i0 + 0x6c ] <== NOT EXECUTED uint32_t j = 0; bool resrc_unsuff = false; while (!resrc_unsuff) { for (j = 0; j < fs_info->uino_pool_size; j++) 20130e8: 88 01 20 01 inc %g4 <== NOT EXECUTED 20130ec: 80 a1 00 1d cmp %g4, %i5 <== NOT EXECUTED 20130f0: 32 bf ff f1 bne,a 20130b4 <== NOT EXECUTED 20130f4: c2 06 20 6c ld [ %i0 + 0x6c ], %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)) 20130f8: c2 06 20 74 ld [ %i0 + 0x74 ], %g1 <== NOT EXECUTED 20130fc: 93 2f 60 01 sll %i5, 1, %o1 <== NOT EXECUTED 2013100: 82 26 40 01 sub %i1, %g1, %g1 <== NOT EXECUTED 2013104: 80 a2 40 01 cmp %o1, %g1 <== NOT EXECUTED 2013108: 2a 80 00 0c bcs,a 2013138 <== NOT EXECUTED 201310c: d0 06 20 68 ld [ %i0 + 0x68 ], %o0 <== NOT EXECUTED } else resrc_unsuff = true; } return 0; } 2013110: 81 c7 e0 08 ret <== NOT EXECUTED 2013114: 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); 2013118: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED 201311c: b9 28 40 1c sll %g1, %i4, %i4 <== NOT EXECUTED 2013120: 84 17 00 02 or %i4, %g2, %g2 <== NOT EXECUTED 2013124: c4 2e 80 00 stb %g2, [ %i2 ] <== NOT EXECUTED return (fs_info->uino_base + fs_info->index); 2013128: c4 06 20 6c ld [ %i0 + 0x6c ], %g2 <== NOT EXECUTED 201312c: c2 06 20 74 ld [ %i0 + 0x74 ], %g1 <== NOT EXECUTED 2013130: 81 c7 e0 08 ret <== NOT EXECUTED 2013134: 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); 2013138: 7f ff ca 3e call 2005a30 <== NOT EXECUTED 201313c: d2 26 20 70 st %o1, [ %i0 + 0x70 ] <== NOT EXECUTED if (fs_info->uino != NULL) 2013140: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2013144: 02 bf ff f3 be 2013110 <== NOT EXECUTED 2013148: d0 26 20 68 st %o0, [ %i0 + 0x68 ] <== NOT EXECUTED fs_info->index = fs_info->uino_pool_size; 201314c: fa 06 20 70 ld [ %i0 + 0x70 ], %i5 <== NOT EXECUTED 2013150: 10 bf ff ca b 2013078 <== NOT EXECUTED 2013154: fa 26 20 6c st %i5, [ %i0 + 0x6c ] <== NOT EXECUTED =============================================================================== 02012fa8 : int fat_init_clusters_chain( fat_fs_info_t *fs_info, uint32_t start_cln ) { 2012fa8: 9d e3 bf 98 save %sp, -104, %sp int rc = RC_OK; ssize_t ret = 0; uint32_t cur_cln = start_cln; char *buf; buf = calloc(fs_info->vol.bpc, sizeof(char)); 2012fac: d0 16 20 06 lduh [ %i0 + 6 ], %o0 2012fb0: 92 10 20 01 mov 1, %o1 uint32_t start_cln ) { int rc = RC_OK; ssize_t ret = 0; uint32_t cur_cln = start_cln; 2012fb4: f2 27 bf fc st %i1, [ %fp + -4 ] char *buf; buf = calloc(fs_info->vol.bpc, sizeof(char)); 2012fb8: 7f ff c5 49 call 20044dc 2012fbc: ba 10 00 18 mov %i0, %i5 if ( buf == NULL ) 2012fc0: b8 92 20 00 orcc %o0, 0, %i4 2012fc4: 32 80 00 04 bne,a 2012fd4 <== ALWAYS TAKEN 2012fc8: c4 07 60 0c ld [ %i5 + 0xc ], %g2 2012fcc: 30 80 00 21 b,a 2013050 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EIO ); while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) 2012fd0: c4 07 60 0c ld [ %i5 + 0xc ], %g2 2012fd4: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2012fd8: 84 0e 40 02 and %i1, %g2, %g2 2012fdc: 80 a0 80 01 cmp %g2, %g1 2012fe0: 1a 80 00 12 bcc 2013028 2012fe4: 94 10 00 1c mov %i4, %o2 { ret = fat_cluster_write(fs_info, cur_cln, buf); 2012fe8: 92 10 00 19 mov %i1, %o1 2012fec: 7f ff ff d5 call 2012f40 2012ff0: 90 10 00 1d mov %i5, %o0 { free(buf); return -1; } rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 2012ff4: 94 07 bf fc add %fp, -4, %o2 rtems_set_errno_and_return_minus_one( EIO ); while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) { ret = fat_cluster_write(fs_info, cur_cln, buf); if ( ret == -1 ) 2012ff8: 80 a2 3f ff cmp %o0, -1 2012ffc: 02 80 00 10 be 201303c <== NEVER TAKEN 2013000: 90 10 00 1d mov %i5, %o0 { free(buf); return -1; } rc = fat_get_fat_cluster(fs_info, cur_cln, &cur_cln); 2013004: 40 00 18 37 call 20190e0 2013008: d2 07 bf fc ld [ %fp + -4 ], %o1 if ( rc != RC_OK ) 201300c: b0 92 20 00 orcc %o0, 0, %i0 2013010: 22 bf ff f0 be,a 2012fd0 <== ALWAYS TAKEN 2013014: f2 07 bf fc ld [ %fp + -4 ], %i1 { free(buf); 2013018: 7f ff c6 03 call 2004824 <== NOT EXECUTED 201301c: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED 2013020: 81 c7 e0 08 ret <== NOT EXECUTED 2013024: 81 e8 00 00 restore <== NOT EXECUTED return rc; } } free(buf); 2013028: b0 10 20 00 clr %i0 201302c: 7f ff c5 fe call 2004824 2013030: 90 10 00 1c mov %i4, %o0 return rc; } 2013034: 81 c7 e0 08 ret 2013038: 81 e8 00 00 restore { ret = fat_cluster_write(fs_info, cur_cln, buf); if ( ret == -1 ) { free(buf); return -1; 201303c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED while ((cur_cln & fs_info->vol.mask) < fs_info->vol.eoc_val) { ret = fat_cluster_write(fs_info, cur_cln, buf); if ( ret == -1 ) { free(buf); 2013040: 7f ff c5 f9 call 2004824 <== NOT EXECUTED 2013044: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED 2013048: 81 c7 e0 08 ret <== NOT EXECUTED 201304c: 81 e8 00 00 restore <== NOT EXECUTED uint32_t cur_cln = start_cln; char *buf; buf = calloc(fs_info->vol.bpc, sizeof(char)); if ( buf == NULL ) rtems_set_errno_and_return_minus_one( EIO ); 2013050: 40 00 1f 99 call 201aeb4 <__errno> <== NOT EXECUTED 2013054: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013058: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 201305c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013060: 81 c7 e0 08 ret <== NOT EXECUTED 2013064: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0201337c : * 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) { 201337c: 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); 2013380: 92 10 20 02 mov 2, %o1 * 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) { 2013384: a2 10 00 18 mov %i0, %l1 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; 2013388: c0 27 bf a4 clr [ %fp + -92 ] vol->fd = open(device, O_RDWR); 201338c: 7f ff c9 0c call 20057bc 2013390: 90 10 00 19 mov %i1, %o0 if (vol->fd < 0) 2013394: 80 a2 20 00 cmp %o0, 0 2013398: 06 80 01 bf bl 2013a94 <== NEVER TAKEN 201339c: d0 24 60 54 st %o0, [ %l1 + 0x54 ] { rtems_set_errno_and_return_minus_one(ENXIO); } rc = fstat(vol->fd, &stat_buf); 20133a0: 40 00 04 77 call 201457c 20133a4: 92 07 bf b8 add %fp, -72, %o1 if (rc != 0) 20133a8: 80 a2 20 00 cmp %o0, 0 20133ac: 12 80 01 a4 bne 2013a3c <== NEVER TAKEN 20133b0: 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)) 20133b4: 05 00 00 3c sethi %hi(0xf000), %g2 20133b8: 86 08 c0 02 and %g3, %g2, %g3 20133bc: 05 00 00 18 sethi %hi(0x6000), %g2 20133c0: 80 a0 c0 02 cmp %g3, %g2 20133c4: 12 80 01 9f bne 2013a40 <== NEVER TAKEN 20133c8: d0 06 20 54 ld [ %i0 + 0x54 ], %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); 20133cc: 94 06 20 58 add %i0, 0x58, %o2 20133d0: 13 10 01 10 sethi %hi(0x40044000), %o1 20133d4: 7f ff c5 87 call 20049f0 20133d8: 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) { 20133dc: b0 92 20 00 orcc %o0, 0, %i0 20133e0: 12 80 01 97 bne 2013a3c <== NEVER TAKEN 20133e4: 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); 20133e8: d0 04 60 58 ld [ %l1 + 0x58 ], %o0 20133ec: 7f ff f6 62 call 2010d74 20133f0: 94 07 bf a4 add %fp, -92, %o2 if (sc != RTEMS_SUCCESSFUL) 20133f4: 80 a2 20 00 cmp %o0, 0 20133f8: 12 80 01 9e bne 2013a70 <== NEVER TAKEN 20133fc: 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); 2013400: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 2013404: c2 08 a0 20 ldub [ %g2 + 0x20 ], %g1 2013408: f8 08 a0 0b ldub [ %g2 + 0xb ], %i4 201340c: c2 2f bf 92 stb %g1, [ %fp + -110 ] 2013410: c2 08 a0 21 ldub [ %g2 + 0x21 ], %g1 2013414: f6 08 a0 0c ldub [ %g2 + 0xc ], %i3 2013418: c2 2f bf 97 stb %g1, [ %fp + -105 ] 201341c: c2 08 a0 22 ldub [ %g2 + 0x22 ], %g1 2013420: ec 08 a0 0d ldub [ %g2 + 0xd ], %l6 2013424: c2 2f bf 96 stb %g1, [ %fp + -106 ] 2013428: c2 08 a0 23 ldub [ %g2 + 0x23 ], %g1 201342c: e6 08 a0 0e ldub [ %g2 + 0xe ], %l3 2013430: c2 2f bf 8f stb %g1, [ %fp + -113 ] 2013434: c2 08 a0 24 ldub [ %g2 + 0x24 ], %g1 2013438: e8 08 a0 0f ldub [ %g2 + 0xf ], %l4 201343c: c2 2f bf 95 stb %g1, [ %fp + -107 ] 2013440: c2 08 a0 25 ldub [ %g2 + 0x25 ], %g1 2013444: fa 08 a0 10 ldub [ %g2 + 0x10 ], %i5 2013448: c2 2f bf 94 stb %g1, [ %fp + -108 ] 201344c: c2 08 a0 26 ldub [ %g2 + 0x26 ], %g1 2013450: ea 08 a0 11 ldub [ %g2 + 0x11 ], %l5 2013454: c2 2f bf 93 stb %g1, [ %fp + -109 ] 2013458: c2 08 a0 27 ldub [ %g2 + 0x27 ], %g1 201345c: f2 08 a0 12 ldub [ %g2 + 0x12 ], %i1 2013460: c2 2f bf 9f stb %g1, [ %fp + -97 ] 2013464: c2 08 a0 28 ldub [ %g2 + 0x28 ], %g1 2013468: e0 08 a0 13 ldub [ %g2 + 0x13 ], %l0 201346c: c2 2f bf 87 stb %g1, [ %fp + -121 ] 2013470: c2 08 a0 2c ldub [ %g2 + 0x2c ], %g1 2013474: ee 08 a0 14 ldub [ %g2 + 0x14 ], %l7 2013478: e4 08 a0 16 ldub [ %g2 + 0x16 ], %l2 201347c: f4 08 a0 17 ldub [ %g2 + 0x17 ], %i2 2013480: c2 2f bf 7f stb %g1, [ %fp + -129 ] 2013484: c2 08 a0 2d ldub [ %g2 + 0x2d ], %g1 2013488: c2 2f bf 7e stb %g1, [ %fp + -130 ] 201348c: c2 08 a0 2e ldub [ %g2 + 0x2e ], %g1 2013490: c2 2f bf 7d stb %g1, [ %fp + -131 ] 2013494: c2 08 a0 2f ldub [ %g2 + 0x2f ], %g1 2013498: c2 2f bf 77 stb %g1, [ %fp + -137 ] 201349c: c2 08 a0 30 ldub [ %g2 + 0x30 ], %g1 20134a0: c4 08 a0 31 ldub [ %g2 + 0x31 ], %g2 20134a4: c2 2f bf 91 stb %g1, [ %fp + -111 ] sc = rtems_bdbuf_release( block); 20134a8: 7f ff f6 ba call 2010f90 20134ac: c4 2f bf 90 stb %g2, [ %fp + -112 ] if (sc != RTEMS_SUCCESSFUL) 20134b0: 80 a2 20 00 cmp %o0, 0 20134b4: 12 80 01 6f bne 2013a70 <== NEVER TAKEN 20134b8: 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); 20134bc: b8 0f 20 ff and %i4, 0xff, %i4 20134c0: b7 2e e0 08 sll %i3, 8, %i3 20134c4: b8 16 c0 1c or %i3, %i4, %i4 if ( (vol->bps != 512) && 20134c8: 93 2f 20 10 sll %i4, 0x10, %o1 20134cc: 85 32 60 10 srl %o1, 0x10, %g2 20134d0: 80 a0 a4 00 cmp %g2, 0x400 20134d4: 12 80 00 bc bne 20137c4 <== ALWAYS TAKEN 20134d8: f8 34 40 00 sth %i4, [ %l1 ] { 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; 20134dc: 85 32 60 19 srl %o1, 0x19, %g2 <== NOT EXECUTED 20134e0: 80 88 a0 01 btst 1, %g2 20134e4: 12 80 00 0a bne 201350c <== ALWAYS TAKEN 20134e8: c0 2c 60 03 clrb [ %l1 + 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) { 20134ec: 10 80 00 03 b 20134f8 <== NOT EXECUTED 20134f0: 86 10 20 01 mov 1, %g3 <== NOT EXECUTED { 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; 20134f4: 86 10 00 04 mov %g4, %g3 <== NOT EXECUTED i >>= 1, vol->sec_mul++); 20134f8: 85 38 a0 01 sra %g2, 1, %g2 <== NOT EXECUTED { 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; 20134fc: 80 88 a0 01 btst 1, %g2 <== NOT EXECUTED 2013500: 02 bf ff fd be 20134f4 <== NOT EXECUTED 2013504: 88 00 e0 01 add %g3, 1, %g4 <== NOT EXECUTED 2013508: c6 2c 60 03 stb %g3, [ %l1 + 3 ] <== NOT EXECUTED i >>= 1, vol->sec_mul++); for (vol->sec_log2 = 0, i = vol->bps; (i & 1) == 0; 201350c: c0 2c 60 02 clrb [ %l1 + 2 ] 2013510: 93 32 60 10 srl %o1, 0x10, %o1 2013514: 86 10 20 00 clr %g3 2013518: 80 8f 20 01 btst 1, %i4 201351c: 12 80 00 08 bne 201353c <== NEVER TAKEN 2013520: 84 10 00 09 mov %o1, %g2 i >>= 1, vol->sec_log2++); 2013524: 85 38 a0 01 sra %g2, 1, %g2 2013528: 88 00 e0 01 add %g3, 1, %g4 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; 201352c: 80 88 a0 01 btst 1, %g2 2013530: 02 bf ff fd be 2013524 2013534: 86 10 00 04 mov %g4, %g3 2013538: c8 2c 60 02 stb %g4, [ %l1 + 2 ] 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) 201353c: b8 8d a0 ff andcc %l6, 0xff, %i4 2013540: 02 80 01 36 be 2013a18 <== NEVER TAKEN 2013544: ec 2c 60 04 stb %l6, [ %l1 + 4 ] { close(vol->fd); rtems_set_errno_and_return_minus_one(EINVAL); } for (vol->spc_log2 = 0, i = vol->spc; (i & 1) == 0; 2013548: c0 2c 60 05 clrb [ %l1 + 5 ] 201354c: 80 8d a0 01 btst 1, %l6 2013550: 12 80 01 46 bne 2013a68 <== NEVER TAKEN 2013554: 84 10 00 1c mov %i4, %g2 2013558: 10 80 00 03 b 2013564 201355c: 86 10 20 01 mov 1, %g3 2013560: 86 10 00 04 mov %g4, %g3 <== NOT EXECUTED i >>= 1, vol->spc_log2++); 2013564: 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; 2013568: 80 88 a0 01 btst 1, %g2 201356c: 02 bf ff fd be 2013560 <== NEVER TAKEN 2013570: 88 00 e0 01 add %g3, 1, %g4 2013574: c6 2c 60 05 stb %g3, [ %l1 + 5 ] 2013578: 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) 201357c: 87 2a 40 03 sll %o1, %g3, %g3 2013580: 89 28 e0 10 sll %g3, 0x10, %g4 2013584: 05 20 00 00 sethi %hi(0x80000000), %g2 2013588: 80 a1 00 02 cmp %g4, %g2 201358c: 18 80 01 23 bgu 2013a18 <== NEVER TAKEN 2013590: c6 34 60 06 sth %g3, [ %l1 + 6 ] { close(vol->fd); rtems_set_errno_and_return_minus_one(EINVAL); } for (vol->bpc_log2 = 0, i = vol->bpc; (i & 1) == 0; 2013594: c0 2c 60 08 clrb [ %l1 + 8 ] 2013598: 05 00 00 3f sethi %hi(0xfc00), %g2 201359c: 88 10 20 01 mov 1, %g4 20135a0: 84 10 a3 ff or %g2, 0x3ff, %g2 20135a4: 80 88 e0 01 btst 1, %g3 20135a8: 02 80 00 05 be 20135bc <== ALWAYS TAKEN 20135ac: 84 08 c0 02 and %g3, %g2, %g2 vol->fat_loc = FAT_GET_BR_RESERVED_SECTORS_NUM(boot_rec); vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); /* calculate the count of sectors occupied by the root directory */ vol->rdir_secs = ((vol->rdir_entrs * FAT_DIRENTRY_SIZE) + (vol->bps - 1)) / 20135b0: 10 80 00 09 b 20135d4 <== NOT EXECUTED 20135b4: 84 02 7f ff add %o1, -1, %g2 <== NOT EXECUTED { close(vol->fd); rtems_set_errno_and_return_minus_one(EINVAL); } for (vol->bpc_log2 = 0, i = vol->bpc; (i & 1) == 0; 20135b8: 88 10 00 03 mov %g3, %g4 i >>= 1, vol->bpc_log2++); 20135bc: 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; 20135c0: 80 88 a0 01 btst 1, %g2 20135c4: 02 bf ff fd be 20135b8 20135c8: 86 01 20 01 add %g4, 1, %g3 20135cc: c8 2c 60 08 stb %g4, [ %l1 + 8 ] 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)) / 20135d0: 84 02 7f ff add %o1, -1, %g2 } for (vol->bpc_log2 = 0, i = vol->bpc; (i & 1) == 0; i >>= 1, vol->bpc_log2++); vol->fats = FAT_GET_BR_FAT_NUM(boot_rec); 20135d4: fa 2c 60 09 stb %i5, [ %l1 + 9 ] vol->fat_loc = FAT_GET_BR_RESERVED_SECTORS_NUM(boot_rec); 20135d8: a8 0d 20 ff and %l4, 0xff, %l4 20135dc: a6 0c e0 ff and %l3, 0xff, %l3 20135e0: a9 2d 20 08 sll %l4, 8, %l4 vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); 20135e4: b2 0e 60 ff and %i1, 0xff, %i1 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); 20135e8: a6 15 00 13 or %l4, %l3, %l3 vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); 20135ec: b3 2e 60 08 sll %i1, 8, %i1 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); 20135f0: e6 34 60 14 sth %l3, [ %l1 + 0x14 ] vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); 20135f4: aa 0d 60 ff and %l5, 0xff, %l5 20135f8: aa 16 40 15 or %i1, %l5, %l5 /* calculate the count of sectors occupied by the root directory */ vol->rdir_secs = ((vol->rdir_entrs * FAT_DIRENTRY_SIZE) + (vol->bps - 1)) / 20135fc: 91 2d 60 10 sll %l5, 0x10, %o0 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); 2013600: ea 34 60 20 sth %l5, [ %l1 + 0x20 ] /* calculate the count of sectors occupied by the root directory */ vol->rdir_secs = ((vol->rdir_entrs * FAT_DIRENTRY_SIZE) + (vol->bps - 1)) / 2013604: 91 32 20 0b srl %o0, 0xb, %o0 2013608: 40 00 42 49 call 2023f2c <.div> 201360c: 90 02 00 02 add %o0, %g2, %o0 vol->bps; vol->rdir_size = vol->rdir_secs << vol->sec_log2; 2013610: c4 0c 60 02 ldub [ %l1 + 2 ], %g2 vol->fat_loc = FAT_GET_BR_RESERVED_SECTORS_NUM(boot_rec); vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); /* calculate the count of sectors occupied by the root directory */ vol->rdir_secs = ((vol->rdir_entrs * FAT_DIRENTRY_SIZE) + (vol->bps - 1)) / 2013614: d0 24 60 24 st %o0, [ %l1 + 0x24 ] vol->bps; vol->rdir_size = vol->rdir_secs << vol->sec_log2; 2013618: 85 2a 00 02 sll %o0, %g2, %g2 vol->fat_loc = FAT_GET_BR_RESERVED_SECTORS_NUM(boot_rec); vol->rdir_entrs = FAT_GET_BR_FILES_PER_ROOT_DIR(boot_rec); /* calculate the count of sectors occupied by the root directory */ vol->rdir_secs = ((vol->rdir_entrs * FAT_DIRENTRY_SIZE) + (vol->bps - 1)) / 201361c: b6 10 00 08 mov %o0, %i3 vol->bps; vol->rdir_size = vol->rdir_secs << vol->sec_log2; if ( (FAT_GET_BR_SECTORS_PER_FAT(boot_rec)) != 0) 2013620: a4 0c a0 ff and %l2, 0xff, %l2 2013624: 90 0e a0 ff and %i2, 0xff, %o0 2013628: 91 2a 20 08 sll %o0, 8, %o0 201362c: 90 12 00 12 or %o0, %l2, %o0 2013630: 91 2a 20 10 sll %o0, 0x10, %o0 2013634: 80 a2 20 00 cmp %o0, 0 2013638: 02 80 00 e4 be 20139c8 <== NEVER TAKEN 201363c: c4 24 60 28 st %g2, [ %l1 + 0x28 ] vol->fat_length = FAT_GET_BR_SECTORS_PER_FAT(boot_rec); 2013640: 91 32 20 10 srl %o0, 0x10, %o0 2013644: d0 24 60 18 st %o0, [ %l1 + 0x18 ] else vol->fat_length = FAT_GET_BR_SECTORS_PER_FAT32(boot_rec); vol->data_fsec = vol->fat_loc + vol->fats * vol->fat_length + 2013648: 92 0f 60 ff and %i5, 0xff, %o1 201364c: 40 00 41 fc call 2023e3c <.umul> 2013650: a7 2c e0 10 sll %l3, 0x10, %l3 2013654: a7 34 e0 10 srl %l3, 0x10, %l3 2013658: 90 02 00 13 add %o0, %l3, %o0 201365c: b6 02 00 1b add %o0, %i3, %i3 vol->rdir_secs; /* for FAT12/16 root dir starts at(sector) */ vol->rdir_loc = vol->fat_loc + vol->fats * vol->fat_length; 2013660: d0 24 60 1c st %o0, [ %l1 + 0x1c ] if ( (FAT_GET_BR_TOTAL_SECTORS_NUM16(boot_rec)) != 0) 2013664: 90 0d e0 ff and %l7, 0xff, %o0 2013668: a0 0c 20 ff and %l0, 0xff, %l0 201366c: 91 2a 20 08 sll %o0, 8, %o0 2013670: 90 12 00 10 or %o0, %l0, %o0 2013674: 91 2a 20 10 sll %o0, 0x10, %o0 2013678: 80 a2 20 00 cmp %o0, 0 201367c: 02 80 00 c7 be 2013998 <== NEVER TAKEN 2013680: f6 24 60 30 st %i3, [ %l1 + 0x30 ] vol->tot_secs = FAT_GET_BR_TOTAL_SECTORS_NUM16(boot_rec); 2013684: 91 32 20 10 srl %o0, 0x10, %o0 2013688: d0 24 60 2c st %o0, [ %l1 + 0x2c ] else vol->tot_secs = FAT_GET_BR_TOTAL_SECTORS_NUM32(boot_rec); data_secs = vol->tot_secs - vol->data_fsec; vol->data_cls = data_secs / vol->spc; 201368c: 90 22 00 1b sub %o0, %i3, %o0 2013690: 40 00 42 25 call 2023f24 <.udiv> 2013694: 92 10 00 1c mov %i4, %o1 /* determine FAT type at least */ if ( vol->data_cls < FAT_FAT12_MAX_CLN) 2013698: 80 a2 2f f4 cmp %o0, 0xff4 201369c: 18 80 00 56 bgu 20137f4 <== NEVER TAKEN 20136a0: d0 24 60 34 st %o0, [ %l1 + 0x34 ] { vol->type = FAT_FAT12; 20136a4: 84 10 20 01 mov 1, %g2 20136a8: c4 2c 60 0a stb %g2, [ %l1 + 0xa ] vol->mask = FAT_FAT12_MASK; 20136ac: 84 10 2f ff mov 0xfff, %g2 20136b0: c4 24 60 0c st %g2, [ %l1 + 0xc ] vol->eoc_val = FAT_FAT12_EOC; 20136b4: 84 10 2f f8 mov 0xff8, %g2 20136b8: c4 24 60 10 st %g2, [ %l1 + 0x10 ] else { vol->rdir_cl = 0; vol->mirror = 0; vol->afat = 0; vol->free_cls = 0xFFFFFFFF; 20136bc: 82 10 3f ff mov -1, %g1 } } } else { vol->rdir_cl = 0; 20136c0: c0 24 60 38 clr [ %l1 + 0x38 ] vol->mirror = 0; 20136c4: c0 2c 60 48 clrb [ %l1 + 0x48 ] vol->afat = 0; 20136c8: c0 2c 60 50 clrb [ %l1 + 0x50 ] vol->free_cls = 0xFFFFFFFF; 20136cc: c2 24 60 40 st %g1, [ %l1 + 0x40 ] vol->next_cl = 0xFFFFFFFF; 20136d0: c2 24 60 44 st %g1, [ %l1 + 0x44 ] } _fat_block_release(fs_info); 20136d4: 7f ff fd fe call 2012ecc <_fat_block_release> 20136d8: 90 10 00 11 mov %l1, %o0 vol->afat_loc = vol->fat_loc + vol->fat_length * vol->afat; 20136dc: d2 04 60 18 ld [ %l1 + 0x18 ], %o1 20136e0: 40 00 41 d7 call 2023e3c <.umul> 20136e4: d0 0c 60 50 ldub [ %l1 + 0x50 ], %o0 20136e8: c4 14 60 14 lduh [ %l1 + 0x14 ], %g2 /* set up collection of fat-files fd */ fs_info->vhash = calloc(FAT_HASH_SIZE, sizeof(rtems_chain_control)); 20136ec: 92 10 20 0c mov 0xc, %o1 vol->next_cl = 0xFFFFFFFF; } _fat_block_release(fs_info); vol->afat_loc = vol->fat_loc + vol->fat_length * vol->afat; 20136f0: 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)); 20136f4: 90 10 20 02 mov 2, %o0 20136f8: 7f ff c3 79 call 20044dc 20136fc: c4 24 60 4c st %g2, [ %l1 + 0x4c ] if ( fs_info->vhash == NULL ) 2013700: 80 a2 20 00 cmp %o0, 0 2013704: 02 80 01 0d be 2013b38 <== NEVER TAKEN 2013708: d0 24 60 60 st %o0, [ %l1 + 0x60 ] 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 ); 201370c: 88 02 20 04 add %o0, 4, %g4 2013710: 84 02 20 0c add %o0, 0xc, %g2 2013714: 86 02 20 10 add %o0, 0x10, %g3 head->next = tail; 2013718: c8 22 00 00 st %g4, [ %o0 ] head->previous = NULL; 201371c: c0 22 20 04 clr [ %o0 + 4 ] tail->previous = head; 2013720: 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; 2013724: c6 22 20 0c st %g3, [ %o0 + 0xc ] head->previous = NULL; 2013728: c0 22 20 10 clr [ %o0 + 0x10 ] tail->previous = head; 201372c: 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)); 2013730: 92 10 20 0c mov 0xc, %o1 2013734: 7f ff c3 6a call 20044dc 2013738: 90 10 20 02 mov 2, %o0 if ( fs_info->rhash == NULL ) 201373c: 80 a2 20 00 cmp %o0, 0 2013740: 02 80 01 07 be 2013b5c <== NEVER TAKEN 2013744: d0 24 60 64 st %o0, [ %l1 + 0x64 ] } 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; 2013748: c4 0c 60 03 ldub [ %l1 + 3 ], %g2 201374c: f8 04 60 2c ld [ %l1 + 0x2c ], %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 ); 2013750: 86 02 20 0c add %o0, 0xc, %g3 head->next = tail; head->previous = NULL; 2013754: c0 22 20 04 clr [ %o0 + 4 ] tail->previous = head; 2013758: 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; 201375c: c0 22 20 10 clr [ %o0 + 0x10 ] tail->previous = head; 2013760: 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 ); 2013764: 88 02 20 10 add %o0, 0x10, %g4 2013768: ba 02 20 04 add %o0, 4, %i5 head->next = tail; 201376c: c8 22 20 0c st %g4, [ %o0 + 0xc ] 2013770: fa 22 00 00 st %i5, [ %o0 ] 2013774: 85 2f 00 02 sll %i4, %g2, %g2 2013778: 85 28 a0 04 sll %g2, 4, %g2 201377c: c4 24 60 74 st %g2, [ %l1 + 0x74 ] 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; 2013780: 84 10 21 00 mov 0x100, %g2 fs_info->uino_base = (vol->tot_secs << vol->sec_mul) << 4; fs_info->index = 0; 2013784: c0 24 60 6c clr [ %l1 + 0x6c ] 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; 2013788: c4 24 60 70 st %g2, [ %l1 + 0x70 ] 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)); 201378c: 90 10 21 00 mov 0x100, %o0 2013790: 7f ff c3 53 call 20044dc 2013794: 92 10 20 01 mov 1, %o1 if ( fs_info->uino == NULL ) 2013798: 80 a2 20 00 cmp %o0, 0 201379c: 02 80 00 c4 be 2013aac <== NEVER TAKEN 20137a0: d0 24 60 68 st %o0, [ %l1 + 0x68 ] 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)); 20137a4: d0 14 40 00 lduh [ %l1 ], %o0 20137a8: 7f ff c3 4d call 20044dc 20137ac: 92 10 20 01 mov 1, %o1 if (fs_info->sec_buf == NULL) 20137b0: 80 a2 20 00 cmp %o0, 0 20137b4: 02 80 00 d2 be 2013afc <== NEVER TAKEN 20137b8: d0 24 60 84 st %o0, [ %l1 + 0x84 ] free(fs_info->uino); rtems_set_errno_and_return_minus_one( ENOMEM ); } return RC_OK; } 20137bc: 81 c7 e0 08 ret 20137c0: 81 e8 00 00 restore } /* Evaluate boot record */ vol->bps = FAT_GET_BR_BYTES_PER_SECTOR(boot_rec); if ( (vol->bps != 512) && 20137c4: 80 a0 a2 00 cmp %g2, 0x200 20137c8: 22 bf ff 46 be,a 20134e0 <== ALWAYS TAKEN 20137cc: 85 32 60 19 srl %o1, 0x19, %g2 (vol->bps != 1024) && 20137d0: 80 a0 a8 00 cmp %g2, 0x800 <== NOT EXECUTED 20137d4: 22 bf ff 46 be,a 20134ec <== NOT EXECUTED 20137d8: 85 32 60 19 srl %o1, 0x19, %g2 <== NOT EXECUTED (vol->bps != 2048) && 20137dc: 07 00 00 04 sethi %hi(0x1000), %g3 <== NOT EXECUTED 20137e0: 80 a0 80 03 cmp %g2, %g3 <== NOT EXECUTED 20137e4: 12 80 00 8d bne 2013a18 <== NOT EXECUTED 20137e8: 85 32 60 19 srl %o1, 0x19, %g2 <== NOT EXECUTED 20137ec: 10 bf ff 43 b 20134f8 <== NOT EXECUTED 20137f0: 86 10 20 01 mov 1, %g3 <== NOT EXECUTED vol->mask = FAT_FAT12_MASK; vol->eoc_val = FAT_FAT12_EOC; } else { if ( vol->data_cls < FAT_FAT16_MAX_CLN) 20137f4: 05 00 00 3f sethi %hi(0xfc00), %g2 <== NOT EXECUTED 20137f8: 86 10 a3 f4 or %g2, 0x3f4, %g3 ! fff4 <== NOT EXECUTED 20137fc: 80 a2 00 03 cmp %o0, %g3 <== NOT EXECUTED 2013800: 08 80 00 7e bleu 20139f8 <== NOT EXECUTED 2013804: 86 10 a3 ff or %g2, 0x3ff, %g3 <== NOT EXECUTED if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); vol->mirror = FAT_GET_BR_EXT_FLAGS(boot_rec) & FAT_BR_EXT_FLAGS_MIRROR; 2013808: c2 0f bf 87 ldub [ %fp + -121 ], %g1 <== NOT EXECUTED } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 201380c: f8 0f bf 7e ldub [ %fp + -130 ], %i4 <== NOT EXECUTED vol->mirror = FAT_GET_BR_EXT_FLAGS(boot_rec) & FAT_BR_EXT_FLAGS_MIRROR; 2013810: 84 08 7f 80 and %g1, -128, %g2 <== NOT EXECUTED } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 2013814: f6 0f bf 7f ldub [ %fp + -129 ], %i3 <== NOT EXECUTED 2013818: c8 0f bf 7d ldub [ %fp + -131 ], %g4 <== NOT EXECUTED 201381c: c2 0f bf 77 ldub [ %fp + -137 ], %g1 <== NOT EXECUTED 2013820: b9 2f 20 08 sll %i4, 8, %i4 <== NOT EXECUTED vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; vol->mask = FAT_FAT32_MASK; 2013824: 07 03 ff ff sethi %hi(0xffffc00), %g3 <== NOT EXECUTED } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 2013828: 89 29 20 10 sll %g4, 0x10, %g4 <== NOT EXECUTED vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; vol->mask = FAT_FAT32_MASK; 201382c: ba 10 e3 ff or %g3, 0x3ff, %i5 <== NOT EXECUTED } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 2013830: 88 17 00 04 or %i4, %g4, %g4 <== NOT EXECUTED } else { vol->type = FAT_FAT32; vol->mask = FAT_FAT32_MASK; vol->eoc_val = FAT_FAT32_EOC; 2013834: 86 10 e3 f8 or %g3, 0x3f8, %g3 <== NOT EXECUTED } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 2013838: 88 11 00 1b or %g4, %i3, %g4 <== NOT EXECUTED 201383c: b9 28 60 18 sll %g1, 0x18, %i4 <== NOT EXECUTED vol->mask = FAT_FAT16_MASK; vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; 2013840: b6 10 20 04 mov 4, %i3 <== NOT EXECUTED } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 2013844: 88 11 00 1c or %g4, %i4, %g4 <== NOT EXECUTED vol->mask = FAT_FAT16_MASK; vol->eoc_val = FAT_FAT16_EOC; } else { vol->type = FAT_FAT32; 2013848: f6 2c 60 0a stb %i3, [ %l1 + 0xa ] <== NOT EXECUTED vol->mask = FAT_FAT32_MASK; 201384c: fa 24 60 0c st %i5, [ %l1 + 0xc ] <== NOT EXECUTED vol->eoc_val = FAT_FAT32_EOC; 2013850: c6 24 60 10 st %g3, [ %l1 + 0x10 ] <== NOT EXECUTED } } if (vol->type == FAT_FAT32) { vol->rdir_cl = FAT_GET_BR_FAT32_ROOT_CLUSTER(boot_rec); 2013854: c8 24 60 38 st %g4, [ %l1 + 0x38 ] <== NOT EXECUTED vol->mirror = FAT_GET_BR_EXT_FLAGS(boot_rec) & FAT_BR_EXT_FLAGS_MIRROR; if (vol->mirror) 2013858: 80 88 a0 80 btst 0x80, %g2 <== NOT EXECUTED 201385c: 02 80 00 81 be 2013a60 <== NOT EXECUTED 2013860: c4 2c 60 48 stb %g2, [ %l1 + 0x48 ] <== NOT EXECUTED vol->afat = FAT_GET_BR_EXT_FLAGS(boot_rec) & FAT_BR_EXT_FLAGS_FAT_NUM; 2013864: c2 0f bf 87 ldub [ %fp + -121 ], %g1 <== NOT EXECUTED 2013868: 84 08 60 0f and %g1, 0xf, %g2 <== NOT EXECUTED 201386c: c4 2c 60 50 stb %g2, [ %l1 + 0x50 ] <== NOT EXECUTED else vol->afat = 0; vol->info_sec = FAT_GET_BR_FAT32_FS_INFO_SECTOR(boot_rec); 2013870: c4 0f bf 90 ldub [ %fp + -112 ], %g2 <== NOT EXECUTED 2013874: c6 0f bf 91 ldub [ %fp + -111 ], %g3 <== NOT EXECUTED 2013878: 85 28 a0 08 sll %g2, 8, %g2 <== NOT EXECUTED 201387c: 84 10 80 03 or %g2, %g3, %g2 <== NOT EXECUTED 2013880: c4 34 60 3c sth %g2, [ %l1 + 0x3c ] <== NOT EXECUTED if( vol->info_sec == 0 ) 2013884: 85 28 a0 10 sll %g2, 0x10, %g2 <== NOT EXECUTED 2013888: 93 30 a0 10 srl %g2, 0x10, %o1 <== NOT EXECUTED 201388c: 80 a2 60 00 cmp %o1, 0 <== NOT EXECUTED 2013890: 02 80 00 62 be 2013a18 <== NOT EXECUTED 2013894: 90 10 00 11 mov %l1, %o0 <== NOT EXECUTED close(vol->fd); rtems_set_errno_and_return_minus_one( EINVAL ); } else { ret = _fat_block_read(fs_info, vol->info_sec , 0, 2013898: 94 10 20 00 clr %o2 <== NOT EXECUTED 201389c: 96 10 20 04 mov 4, %o3 <== NOT EXECUTED 20138a0: 7f ff fd 0c call 2012cd0 <_fat_block_read> <== NOT EXECUTED 20138a4: 98 07 bf a8 add %fp, -88, %o4 <== NOT EXECUTED FAT_FSI_LEADSIG_SIZE, fs_info_sector); if ( ret < 0 ) 20138a8: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 20138ac: 06 80 00 8f bl 2013ae8 <== NOT EXECUTED 20138b0: c4 0f bf ab ldub [ %fp + -85 ], %g2 <== NOT EXECUTED { close(vol->fd); return -1; } if (FAT_GET_FSINFO_LEAD_SIGNATURE(fs_info_sector) != 20138b4: c6 0f bf a9 ldub [ %fp + -87 ], %g3 <== NOT EXECUTED 20138b8: fa 0f bf aa ldub [ %fp + -86 ], %i5 <== NOT EXECUTED 20138bc: c8 0f bf a8 ldub [ %fp + -88 ], %g4 <== NOT EXECUTED 20138c0: 85 28 a0 18 sll %g2, 0x18, %g2 <== NOT EXECUTED 20138c4: 87 28 e0 08 sll %g3, 8, %g3 <== NOT EXECUTED 20138c8: bb 2f 60 10 sll %i5, 0x10, %i5 <== NOT EXECUTED 20138cc: 86 10 c0 1d or %g3, %i5, %g3 <== NOT EXECUTED 20138d0: 86 10 c0 04 or %g3, %g4, %g3 <== NOT EXECUTED 20138d4: 86 10 c0 02 or %g3, %g2, %g3 <== NOT EXECUTED 20138d8: 05 10 58 54 sethi %hi(0x41615000), %g2 <== NOT EXECUTED 20138dc: 84 10 a2 52 or %g2, 0x252, %g2 ! 41615252 <== NOT EXECUTED 20138e0: 80 a0 c0 02 cmp %g3, %g2 <== NOT EXECUTED 20138e4: 12 80 00 4b bne 2013a10 <== NOT EXECUTED 20138e8: 90 10 00 11 mov %l1, %o0 <== NOT EXECUTED close(vol->fd); rtems_set_errno_and_return_minus_one( EINVAL ); } else { ret = _fat_block_read(fs_info, vol->info_sec , FAT_FSI_INFO, 20138ec: d2 14 60 3c lduh [ %l1 + 0x3c ], %o1 <== NOT EXECUTED 20138f0: 94 10 21 e4 mov 0x1e4, %o2 <== NOT EXECUTED 20138f4: 96 10 20 0c mov 0xc, %o3 <== NOT EXECUTED 20138f8: 7f ff fc f6 call 2012cd0 <_fat_block_read> <== NOT EXECUTED 20138fc: 98 07 bf a8 add %fp, -88, %o4 <== NOT EXECUTED FAT_USEFUL_INFO_SIZE, fs_info_sector); if ( ret < 0 ) 2013900: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2013904: 06 80 00 77 bl 2013ae0 <== NOT EXECUTED 2013908: fa 0f bf b0 ldub [ %fp + -80 ], %i5 <== NOT EXECUTED _fat_block_release(fs_info); close(vol->fd); return -1; } vol->free_cls = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 201390c: c8 0f bf ad ldub [ %fp + -83 ], %g4 <== NOT EXECUTED 2013910: f2 0f bf ae ldub [ %fp + -82 ], %i1 <== NOT EXECUTED 2013914: f4 0f bf ac ldub [ %fp + -84 ], %i2 <== NOT EXECUTED 2013918: f6 0f bf af ldub [ %fp + -81 ], %i3 <== NOT EXECUTED vol->next_cl = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 201391c: f8 0f bf b1 ldub [ %fp + -79 ], %i4 <== NOT EXECUTED 2013920: c4 0f bf b2 ldub [ %fp + -78 ], %g2 <== NOT EXECUTED 2013924: c6 0f bf b3 ldub [ %fp + -77 ], %g3 <== NOT EXECUTED _fat_block_release(fs_info); close(vol->fd); return -1; } vol->free_cls = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 2013928: 89 29 20 08 sll %g4, 8, %g4 <== NOT EXECUTED vol->next_cl = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 201392c: 87 28 e0 18 sll %g3, 0x18, %g3 <== NOT EXECUTED _fat_block_release(fs_info); close(vol->fd); return -1; } vol->free_cls = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 2013930: b3 2e 60 10 sll %i1, 0x10, %i1 <== NOT EXECUTED 2013934: b7 2e e0 18 sll %i3, 0x18, %i3 <== NOT EXECUTED 2013938: 88 11 00 19 or %g4, %i1, %g4 <== NOT EXECUTED vol->next_cl = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 201393c: b9 2f 20 08 sll %i4, 8, %i4 <== NOT EXECUTED _fat_block_release(fs_info); close(vol->fd); return -1; } vol->free_cls = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 2013940: 88 11 00 1a or %g4, %i2, %g4 <== NOT EXECUTED vol->next_cl = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 2013944: 85 28 a0 10 sll %g2, 0x10, %g2 <== NOT EXECUTED _fat_block_release(fs_info); close(vol->fd); return -1; } vol->free_cls = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 2013948: 88 11 00 1b or %g4, %i3, %g4 <== NOT EXECUTED vol->next_cl = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 201394c: 84 17 00 02 or %i4, %g2, %g2 <== NOT EXECUTED 2013950: 84 10 80 1d or %g2, %i5, %g2 <== NOT EXECUTED 2013954: 84 10 80 03 or %g2, %g3, %g2 <== NOT EXECUTED _fat_block_release(fs_info); close(vol->fd); return -1; } vol->free_cls = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); 2013958: c8 24 60 40 st %g4, [ %l1 + 0x40 ] <== NOT EXECUTED vol->next_cl = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); rc = fat_fat32_update_fsinfo_sector(fs_info, 0xFFFFFFFF, 201395c: 90 10 00 11 mov %l1, %o0 <== NOT EXECUTED close(vol->fd); return -1; } vol->free_cls = FAT_GET_FSINFO_FREE_CLUSTER_COUNT(fs_info_sector); vol->next_cl = FAT_GET_FSINFO_NEXT_FREE_CLUSTER(fs_info_sector); 2013960: c4 24 60 44 st %g2, [ %l1 + 0x44 ] <== NOT EXECUTED rc = fat_fat32_update_fsinfo_sector(fs_info, 0xFFFFFFFF, 2013964: 92 10 3f ff mov -1, %o1 <== NOT EXECUTED 2013968: 7f ff fe 0b call 2013194 <== NOT EXECUTED 201396c: 94 10 3f ff mov -1, %o2 <== NOT EXECUTED 0xFFFFFFFF); if ( rc != RC_OK ) 2013970: ba 92 20 00 orcc %o0, 0, %i5 <== NOT EXECUTED 2013974: 02 bf ff 58 be 20136d4 <== NOT EXECUTED 2013978: 01 00 00 00 nop <== NOT EXECUTED { _fat_block_release(fs_info); 201397c: 7f ff fd 54 call 2012ecc <_fat_block_release> <== NOT EXECUTED 2013980: 90 10 00 11 mov %l1, %o0 <== NOT EXECUTED close(vol->fd); 2013984: d0 04 60 54 ld [ %l1 + 0x54 ], %o0 <== NOT EXECUTED 2013988: 7f ff c2 ea call 2004530 <== NOT EXECUTED 201398c: b0 10 00 1d mov %i5, %i0 <== NOT EXECUTED 2013990: 81 c7 e0 08 ret <== NOT EXECUTED 2013994: 81 e8 00 00 restore <== NOT EXECUTED vol->rdir_loc = vol->fat_loc + vol->fats * vol->fat_length; if ( (FAT_GET_BR_TOTAL_SECTORS_NUM16(boot_rec)) != 0) vol->tot_secs = FAT_GET_BR_TOTAL_SECTORS_NUM16(boot_rec); else vol->tot_secs = FAT_GET_BR_TOTAL_SECTORS_NUM32(boot_rec); 2013998: c4 0f bf 96 ldub [ %fp + -106 ], %g2 <== NOT EXECUTED 201399c: d0 0f bf 97 ldub [ %fp + -105 ], %o0 <== NOT EXECUTED 20139a0: ee 0f bf 92 ldub [ %fp + -110 ], %l7 <== NOT EXECUTED 20139a4: c2 0f bf 8f ldub [ %fp + -113 ], %g1 <== NOT EXECUTED 20139a8: 85 28 a0 10 sll %g2, 0x10, %g2 <== NOT EXECUTED 20139ac: 91 2a 20 08 sll %o0, 8, %o0 <== NOT EXECUTED 20139b0: 90 12 00 02 or %o0, %g2, %o0 <== NOT EXECUTED 20139b4: 85 28 60 18 sll %g1, 0x18, %g2 <== NOT EXECUTED 20139b8: 90 12 00 17 or %o0, %l7, %o0 <== NOT EXECUTED 20139bc: 90 12 00 02 or %o0, %g2, %o0 <== NOT EXECUTED 20139c0: 10 bf ff 33 b 201368c <== NOT EXECUTED 20139c4: d0 24 60 2c st %o0, [ %l1 + 0x2c ] <== NOT EXECUTED vol->rdir_size = vol->rdir_secs << vol->sec_log2; if ( (FAT_GET_BR_SECTORS_PER_FAT(boot_rec)) != 0) vol->fat_length = FAT_GET_BR_SECTORS_PER_FAT(boot_rec); else vol->fat_length = FAT_GET_BR_SECTORS_PER_FAT32(boot_rec); 20139c8: d0 0f bf 94 ldub [ %fp + -108 ], %o0 <== NOT EXECUTED 20139cc: ec 0f bf 93 ldub [ %fp + -109 ], %l6 <== NOT EXECUTED 20139d0: c6 0f bf 95 ldub [ %fp + -107 ], %g3 <== NOT EXECUTED 20139d4: c2 0f bf 9f ldub [ %fp + -97 ], %g1 <== NOT EXECUTED 20139d8: 91 2a 20 08 sll %o0, 8, %o0 <== NOT EXECUTED 20139dc: ad 2d a0 10 sll %l6, 0x10, %l6 <== NOT EXECUTED 20139e0: 85 28 60 18 sll %g1, 0x18, %g2 <== NOT EXECUTED 20139e4: 90 12 00 16 or %o0, %l6, %o0 <== NOT EXECUTED 20139e8: 90 12 00 03 or %o0, %g3, %o0 <== NOT EXECUTED 20139ec: 90 12 00 02 or %o0, %g2, %o0 <== NOT EXECUTED 20139f0: 10 bf ff 16 b 2013648 <== NOT EXECUTED 20139f4: d0 24 60 18 st %o0, [ %l1 + 0x18 ] <== NOT EXECUTED } else { if ( vol->data_cls < FAT_FAT16_MAX_CLN) { vol->type = FAT_FAT16; 20139f8: 88 10 20 02 mov 2, %g4 <== NOT EXECUTED vol->mask = FAT_FAT16_MASK; vol->eoc_val = FAT_FAT16_EOC; 20139fc: 84 10 a3 f8 or %g2, 0x3f8, %g2 <== NOT EXECUTED } else { if ( vol->data_cls < FAT_FAT16_MAX_CLN) { vol->type = FAT_FAT16; 2013a00: c8 2c 60 0a stb %g4, [ %l1 + 0xa ] <== NOT EXECUTED vol->mask = FAT_FAT16_MASK; 2013a04: c6 24 60 0c st %g3, [ %l1 + 0xc ] <== NOT EXECUTED vol->eoc_val = FAT_FAT16_EOC; 2013a08: 10 bf ff 2d b 20136bc <== NOT EXECUTED 2013a0c: c4 24 60 10 st %g2, [ %l1 + 0x10 ] <== NOT EXECUTED } if (FAT_GET_FSINFO_LEAD_SIGNATURE(fs_info_sector) != FAT_FSINFO_LEAD_SIGNATURE_VALUE) { _fat_block_release(fs_info); 2013a10: 7f ff fd 2f call 2012ecc <_fat_block_release> <== NOT EXECUTED 2013a14: 90 10 00 11 mov %l1, %o0 <== NOT EXECUTED close(vol->fd); 2013a18: d0 04 60 54 ld [ %l1 + 0x54 ], %o0 <== NOT EXECUTED 2013a1c: 7f ff c2 c5 call 2004530 <== NOT EXECUTED 2013a20: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EINVAL ); 2013a24: 40 00 1d 24 call 201aeb4 <__errno> <== NOT EXECUTED 2013a28: 01 00 00 00 nop <== NOT EXECUTED 2013a2c: 82 10 20 16 mov 0x16, %g1 ! 16 <== NOT EXECUTED 2013a30: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013a34: 81 c7 e0 08 ret <== NOT EXECUTED 2013a38: 81 e8 00 00 restore <== NOT EXECUTED } /* 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) { close(vol->fd); 2013a3c: d0 04 60 54 ld [ %l1 + 0x54 ], %o0 <== NOT EXECUTED 2013a40: 7f ff c2 bc call 2004530 <== NOT EXECUTED 2013a44: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one(ENXIO); 2013a48: 40 00 1d 1b call 201aeb4 <__errno> <== NOT EXECUTED 2013a4c: 01 00 00 00 nop <== NOT EXECUTED 2013a50: 82 10 20 06 mov 6, %g1 ! 6 <== NOT EXECUTED 2013a54: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013a58: 81 c7 e0 08 ret <== NOT EXECUTED 2013a5c: 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; 2013a60: 10 bf ff 84 b 2013870 <== NOT EXECUTED 2013a64: c0 2c 60 50 clrb [ %l1 + 0x50 ] <== NOT EXECUTED { close(vol->fd); rtems_set_errno_and_return_minus_one(EINVAL); } for (vol->spc_log2 = 0, i = vol->spc; (i & 1) == 0; 2013a68: 10 bf fe c5 b 201357c <== NOT EXECUTED 2013a6c: 86 10 20 00 clr %g3 <== NOT EXECUTED memcpy( boot_rec, block->buffer, FAT_MAX_BPB_SIZE); sc = rtems_bdbuf_release( block); if (sc != RTEMS_SUCCESSFUL) { close(vol->fd); 2013a70: d0 04 60 54 ld [ %l1 + 0x54 ], %o0 <== NOT EXECUTED 2013a74: 7f ff c2 af call 2004530 <== NOT EXECUTED 2013a78: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( EIO ); 2013a7c: 40 00 1d 0e call 201aeb4 <__errno> <== NOT EXECUTED 2013a80: 01 00 00 00 nop <== NOT EXECUTED 2013a84: 82 10 20 05 mov 5, %g1 ! 5 <== NOT EXECUTED 2013a88: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013a8c: 81 c7 e0 08 ret <== NOT EXECUTED 2013a90: 81 e8 00 00 restore <== NOT EXECUTED rtems_bdbuf_buffer *block = NULL; vol->fd = open(device, O_RDWR); if (vol->fd < 0) { rtems_set_errno_and_return_minus_one(ENXIO); 2013a94: 40 00 1d 08 call 201aeb4 <__errno> <== NOT EXECUTED 2013a98: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013a9c: 82 10 20 06 mov 6, %g1 <== NOT EXECUTED 2013aa0: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013aa4: 81 c7 e0 08 ret <== NOT EXECUTED 2013aa8: 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); 2013aac: d0 04 60 54 ld [ %l1 + 0x54 ], %o0 <== NOT EXECUTED 2013ab0: 7f ff c2 a0 call 2004530 <== NOT EXECUTED 2013ab4: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED free(fs_info->vhash); 2013ab8: 7f ff c3 5b call 2004824 <== NOT EXECUTED 2013abc: d0 04 60 60 ld [ %l1 + 0x60 ], %o0 <== NOT EXECUTED free(fs_info->rhash); 2013ac0: 7f ff c3 59 call 2004824 <== NOT EXECUTED 2013ac4: d0 04 60 64 ld [ %l1 + 0x64 ], %o0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 2013ac8: 40 00 1c fb call 201aeb4 <__errno> <== NOT EXECUTED 2013acc: 01 00 00 00 nop <== NOT EXECUTED 2013ad0: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED 2013ad4: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013ad8: 81 c7 e0 08 ret <== NOT EXECUTED 2013adc: 81 e8 00 00 restore <== 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); 2013ae0: 7f ff fc fb call 2012ecc <_fat_block_release> <== NOT EXECUTED 2013ae4: 90 10 00 11 mov %l1, %o0 <== NOT EXECUTED close(vol->fd); 2013ae8: d0 04 60 54 ld [ %l1 + 0x54 ], %o0 <== NOT EXECUTED 2013aec: 7f ff c2 91 call 2004530 <== NOT EXECUTED 2013af0: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013af4: 81 c7 e0 08 ret <== NOT EXECUTED 2013af8: 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); 2013afc: d0 04 60 54 ld [ %l1 + 0x54 ], %o0 <== NOT EXECUTED 2013b00: 7f ff c2 8c call 2004530 <== NOT EXECUTED 2013b04: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED free(fs_info->vhash); 2013b08: 7f ff c3 47 call 2004824 <== NOT EXECUTED 2013b0c: d0 04 60 60 ld [ %l1 + 0x60 ], %o0 <== NOT EXECUTED free(fs_info->rhash); 2013b10: 7f ff c3 45 call 2004824 <== NOT EXECUTED 2013b14: d0 04 60 64 ld [ %l1 + 0x64 ], %o0 <== NOT EXECUTED free(fs_info->uino); 2013b18: 7f ff c3 43 call 2004824 <== NOT EXECUTED 2013b1c: d0 04 60 68 ld [ %l1 + 0x68 ], %o0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 2013b20: 40 00 1c e5 call 201aeb4 <__errno> <== NOT EXECUTED 2013b24: 01 00 00 00 nop <== NOT EXECUTED 2013b28: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED 2013b2c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013b30: 81 c7 e0 08 ret <== NOT EXECUTED 2013b34: 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); 2013b38: d0 04 60 54 ld [ %l1 + 0x54 ], %o0 <== NOT EXECUTED 2013b3c: 7f ff c2 7d call 2004530 <== NOT EXECUTED 2013b40: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 2013b44: 40 00 1c dc call 201aeb4 <__errno> <== NOT EXECUTED 2013b48: 01 00 00 00 nop <== NOT EXECUTED 2013b4c: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED 2013b50: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013b54: 81 c7 e0 08 ret <== NOT EXECUTED 2013b58: 81 e8 00 00 restore <== NOT EXECUTED rtems_chain_initialize_empty(fs_info->vhash + i); fs_info->rhash = calloc(FAT_HASH_SIZE, sizeof(rtems_chain_control)); if ( fs_info->rhash == NULL ) { close(vol->fd); 2013b5c: d0 04 60 54 ld [ %l1 + 0x54 ], %o0 <== NOT EXECUTED 2013b60: 7f ff c2 74 call 2004530 <== NOT EXECUTED 2013b64: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED free(fs_info->vhash); 2013b68: 7f ff c3 2f call 2004824 <== NOT EXECUTED 2013b6c: d0 04 60 60 ld [ %l1 + 0x60 ], %o0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 2013b70: 40 00 1c d1 call 201aeb4 <__errno> <== NOT EXECUTED 2013b74: 01 00 00 00 nop <== NOT EXECUTED 2013b78: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED 2013b7c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2013b80: 81 c7 e0 08 ret <== NOT EXECUTED 2013b84: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 020196e4 : uint32_t count, uint32_t *cls_added, uint32_t *last_cl, bool zero_fill ) { 20196e4: 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; 20196e8: e6 06 20 34 ld [ %i0 + 0x34 ], %l3 bool zero_fill ) { int rc = RC_OK; uint32_t cl4find = 2; uint32_t next_cln = 0; 20196ec: 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; *cls_added = 0; 20196f0: c0 26 c0 00 clr [ %i3 ] if (count == 0) 20196f4: 80 a6 a0 00 cmp %i2, 0 20196f8: 02 80 00 58 be 2019858 <== NEVER TAKEN 20196fc: a4 10 20 00 clr %l2 return rc; if (fs_info->vol.next_cl != FAT_UNDEFINED_VALUE) 2019700: e0 06 20 44 ld [ %i0 + 0x44 ], %l0 2019704: 80 a4 3f ff cmp %l0, -1 2019708: 22 80 00 02 be,a 2019710 201970c: 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; 2019710: 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) 2019714: 80 a4 e0 02 cmp %l3, 2 2019718: 08 80 00 57 bleu 2019874 <== NEVER TAKEN 201971c: a2 10 20 02 mov 2, %l1 2019720: 10 80 00 29 b 20197c4 2019724: 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); 2019728: 90 10 00 18 mov %i0, %o0 201972c: 92 10 00 10 mov %l0, %o1 2019730: 7f ff fe f5 call 2019304 2019734: 94 10 3f ff mov -1, %o2 if ( rc != RC_OK ) 2019738: 80 a2 20 00 cmp %o0, 0 201973c: 32 80 00 47 bne,a 2019858 <== NEVER TAKEN 2019740: 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) { 2019744: 80 a7 60 00 cmp %i5, 0 2019748: 22 80 00 12 be,a 2019790 201974c: c2 06 c0 00 ld [ %i3 ], %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)) ) 2019750: 80 a4 20 00 cmp %l0, 0 2019754: 32 80 00 43 bne,a 2019860 <== ALWAYS TAKEN 2019758: c4 0e 20 05 ldub [ %i0 + 5 ], %g2 201975c: c2 0e 20 0a ldub [ %i0 + 0xa ], %g1 <== NOT EXECUTED 2019760: 80 88 60 03 btst 3, %g1 <== NOT EXECUTED 2019764: 22 80 00 3f be,a 2019860 <== NOT EXECUTED 2019768: c4 0e 20 05 ldub [ %i0 + 5 ], %g2 <== NOT EXECUTED return fs_info->vol.rdir_loc; 201976c: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 <== NOT EXECUTED uint32_t sec = fat_cluster_num_to_sector_num(fs_info, cl4find); rc = _fat_block_zero(fs_info, sec, 0, fs_info->vol.bpc); 2019770: d6 16 20 06 lduh [ %i0 + 6 ], %o3 2019774: 90 10 00 18 mov %i0, %o0 2019778: 7f ff e5 a7 call 2012e14 <_fat_block_zero> 201977c: 94 10 20 00 clr %o2 if ( rc != RC_OK ) 2019780: 80 a2 20 00 cmp %o0, 0 2019784: 32 80 00 2c bne,a 2019834 <== NEVER TAKEN 2019788: d2 06 40 00 ld [ %i1 ], %o1 <== NOT EXECUTED goto cleanup; } save_cln = cl4find; (*cls_added)++; 201978c: c2 06 c0 00 ld [ %i3 ], %g1 2019790: 82 00 60 01 inc %g1 /* have we satisfied request ? */ if (*cls_added == count) 2019794: 80 a6 80 01 cmp %i2, %g1 2019798: 02 80 00 4d be 20198cc 201979c: c2 26 c0 00 st %g1, [ %i3 ] 20197a0: a8 10 00 10 mov %l0, %l4 fat_buf_release(fs_info); return rc; } } i++; cl4find++; 20197a4: a0 04 20 01 inc %l0 if (cl4find >= data_cls_val) 20197a8: 80 a4 c0 10 cmp %l3, %l0 20197ac: 18 80 00 03 bgu 20197b8 <== ALWAYS TAKEN 20197b0: a2 04 60 01 inc %l1 cl4find = 2; 20197b4: 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) 20197b8: 80 a4 c0 11 cmp %l3, %l1 20197bc: 22 80 00 30 be,a 201987c <== NEVER TAKEN 20197c0: c2 06 20 40 ld [ %i0 + 0x40 ], %g1 <== NOT EXECUTED { rc = fat_get_fat_cluster(fs_info, cl4find, &next_cln); 20197c4: 90 10 00 18 mov %i0, %o0 20197c8: 92 10 00 10 mov %l0, %o1 20197cc: 7f ff fe 45 call 20190e0 20197d0: 94 07 bf fc add %fp, -4, %o2 if ( rc != RC_OK ) 20197d4: a4 92 20 00 orcc %o0, 0, %l2 20197d8: 12 80 00 35 bne 20198ac <== NEVER TAKEN 20197dc: 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) 20197e0: 80 a0 60 00 cmp %g1, 0 20197e4: 32 bf ff f1 bne,a 20197a8 20197e8: 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) 20197ec: c2 06 c0 00 ld [ %i3 ], %g1 20197f0: 80 a0 60 00 cmp %g1, 0 20197f4: 22 bf ff cd be,a 2019728 20197f8: 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); 20197fc: 90 10 00 18 mov %i0, %o0 2019800: 92 10 00 10 mov %l0, %o1 2019804: 7f ff fe c0 call 2019304 2019808: 94 10 3f ff mov -1, %o2 if ( rc != RC_OK ) 201980c: 82 92 20 00 orcc %o0, 0, %g1 2019810: 12 80 00 3a bne 20198f8 <== NEVER TAKEN 2019814: 90 10 00 18 mov %i0, %o0 /* cleanup activity */ fat_free_fat_clusters_chain(fs_info, (*chain)); return rc; } rc = fat_set_fat_cluster(fs_info, save_cln, cl4find); 2019818: 92 10 00 14 mov %l4, %o1 201981c: 7f ff fe ba call 2019304 2019820: 94 10 00 10 mov %l0, %o2 if ( rc != RC_OK ) 2019824: 80 a2 20 00 cmp %o0, 0 2019828: 02 bf ff c8 be 2019748 <== ALWAYS TAKEN 201982c: 80 a7 60 00 cmp %i5, 0 return RC_OK; cleanup: /* cleanup activity */ fat_free_fat_clusters_chain(fs_info, (*chain)); 2019830: d2 06 40 00 ld [ %i1 ], %o1 <== NOT EXECUTED if (zero_fill) { uint32_t sec = fat_cluster_num_to_sector_num(fs_info, cl4find); rc = _fat_block_zero(fs_info, sec, 0, fs_info->vol.bpc); 2019834: a4 10 00 08 mov %o0, %l2 <== NOT EXECUTED return RC_OK; cleanup: /* cleanup activity */ fat_free_fat_clusters_chain(fs_info, (*chain)); 2019838: 7f ff ff 73 call 2019604 <== NOT EXECUTED 201983c: 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); 2019840: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 2019844: 92 10 00 10 mov %l0, %o1 <== NOT EXECUTED 2019848: 7f ff fe af call 2019304 <== NOT EXECUTED 201984c: 94 10 20 00 clr %o2 <== NOT EXECUTED fat_buf_release(fs_info); 2019850: 7f ff e4 c2 call 2012b58 <== NOT EXECUTED 2019854: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED return rc; } 2019858: 81 c7 e0 08 ret 201985c: 91 e8 00 12 restore %g0, %l2, %o0 return (((cln - FAT_RSRVD_CLN) << fs_info->vol.spc_log2) + 2019860: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 2019864: 92 04 3f fe add %l0, -2, %o1 2019868: 93 2a 40 02 sll %o1, %g2, %o1 201986c: 10 bf ff c1 b 2019770 2019870: 92 02 40 01 add %o1, %g1, %o1 /* * 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) 2019874: a8 10 20 00 clr %l4 <== NOT EXECUTED if (cl4find >= data_cls_val) cl4find = 2; } fs_info->vol.next_cl = save_cln; if (fs_info->vol.free_cls != 0xFFFFFFFF) 2019878: c2 06 20 40 ld [ %i0 + 0x40 ], %g1 <== NOT EXECUTED 201987c: 80 a0 7f ff cmp %g1, -1 <== NOT EXECUTED 2019880: 02 80 00 05 be 2019894 <== NOT EXECUTED 2019884: e8 26 20 44 st %l4, [ %i0 + 0x44 ] <== NOT EXECUTED fs_info->vol.free_cls -= (*cls_added); 2019888: c4 06 c0 00 ld [ %i3 ], %g2 <== NOT EXECUTED 201988c: 82 20 40 02 sub %g1, %g2, %g1 <== NOT EXECUTED 2019890: c2 26 20 40 st %g1, [ %i0 + 0x40 ] <== NOT EXECUTED *last_cl = save_cln; 2019894: e8 27 00 00 st %l4, [ %i4 ] <== NOT EXECUTED fat_buf_release(fs_info); 2019898: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 201989c: 7f ff e4 af call 2012b58 <== NOT EXECUTED 20198a0: 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; } 20198a4: 81 c7 e0 08 ret <== NOT EXECUTED 20198a8: 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) 20198ac: c2 06 c0 00 ld [ %i3 ], %g1 <== NOT EXECUTED 20198b0: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 20198b4: 02 bf ff e9 be 2019858 <== NOT EXECUTED 20198b8: 01 00 00 00 nop <== NOT EXECUTED fat_free_fat_clusters_chain(fs_info, (*chain)); 20198bc: d2 06 40 00 ld [ %i1 ], %o1 <== NOT EXECUTED 20198c0: 7f ff ff 51 call 2019604 <== NOT EXECUTED 20198c4: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 20198c8: 30 bf ff e4 b,a 2019858 <== NOT EXECUTED /* have we satisfied request ? */ if (*cls_added == count) { fs_info->vol.next_cl = save_cln; if (fs_info->vol.free_cls != 0xFFFFFFFF) 20198cc: c2 06 20 40 ld [ %i0 + 0x40 ], %g1 20198d0: 80 a0 7f ff cmp %g1, -1 20198d4: 02 80 00 05 be 20198e8 <== ALWAYS TAKEN 20198d8: e0 26 20 44 st %l0, [ %i0 + 0x44 ] fs_info->vol.free_cls -= (*cls_added); 20198dc: c4 06 c0 00 ld [ %i3 ], %g2 <== NOT EXECUTED 20198e0: 82 20 40 02 sub %g1, %g2, %g1 <== NOT EXECUTED 20198e4: c2 26 20 40 st %g1, [ %i0 + 0x40 ] <== NOT EXECUTED *last_cl = save_cln; 20198e8: e0 27 00 00 st %l0, [ %i4 ] fat_buf_release(fs_info); 20198ec: 7f ff e4 9b call 2012b58 20198f0: 90 10 00 18 mov %i0, %o0 20198f4: 30 bf ff d9 b,a 2019858 /* 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)); 20198f8: d2 06 40 00 ld [ %i1 ], %o1 <== NOT EXECUTED 20198fc: 7f ff ff 42 call 2019604 <== NOT EXECUTED 2019900: a4 10 00 01 mov %g1, %l2 <== NOT EXECUTED 2019904: 30 bf ff d5 b,a 2019858 <== NOT EXECUTED =============================================================================== 02019304 : fat_set_fat_cluster( fat_fs_info_t *fs_info, uint32_t cln, uint32_t in_val ) { 2019304: 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; rtems_bdbuf_buffer *block0 = NULL; 2019308: c0 27 bf fc clr [ %fp + -4 ] /* sanity check */ if ( (cln < 2) || (cln > (fs_info->vol.data_cls + 1)) ) 201930c: 80 a6 60 01 cmp %i1, 1 2019310: 08 80 00 26 bleu 20193a8 <== NEVER TAKEN 2019314: ba 10 00 18 mov %i0, %i5 2019318: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 201931c: 82 00 60 01 inc %g1 2019320: 80 a6 40 01 cmp %i1, %g1 2019324: 18 80 00 21 bgu 20193a8 <== NEVER TAKEN 2019328: 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) + 201932c: c2 0e 20 0a ldub [ %i0 + 0xa ], %g1 2019330: 80 88 60 01 btst 1, %g1 2019334: 12 80 00 23 bne 20193c0 <== ALWAYS TAKEN 2019338: e0 0e 20 02 ldub [ %i0 + 2 ], %l0 201933c: 82 08 60 02 and %g1, 2, %g1 <== NOT EXECUTED 2019340: 80 88 60 ff btst 0xff, %g1 <== NOT EXECUTED 2019344: 02 80 00 25 be 20193d8 <== NOT EXECUTED 2019348: c2 06 20 4c ld [ %i0 + 0x4c ], %g1 <== NOT EXECUTED 201934c: b9 2e 60 01 sll %i1, 1, %i4 <== NOT EXECUTED 2019350: a1 37 00 10 srl %i4, %l0, %l0 <== NOT EXECUTED 2019354: a0 04 00 01 add %l0, %g1, %l0 <== NOT EXECUTED fs_info->vol.afat_loc; ofs = FAT_FAT_OFFSET(fs_info->vol.type, cln) & (fs_info->vol.bps - 1); 2019358: e2 17 40 00 lduh [ %i5 ], %l1 rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); 201935c: 90 10 00 1d mov %i5, %o0 2019360: 92 10 00 10 mov %l0, %o1 2019364: 94 10 20 01 mov 1, %o2 2019368: 7f ff e5 73 call 2012934 201936c: 96 07 bf fc add %fp, -4, %o3 if (rc != RC_OK) 2019370: b0 92 20 00 orcc %o0, 0, %i0 2019374: 12 80 00 11 bne 20193b8 <== NEVER TAKEN 2019378: a3 2c 60 10 sll %l1, 0x10, %l1 return rc; switch ( fs_info->vol.type ) 201937c: f6 0f 60 0a ldub [ %i5 + 0xa ], %i3 2019380: 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); 2019384: a3 34 60 10 srl %l1, 0x10, %l1 2019388: a2 04 7f ff add %l1, -1, %l1 rc = fat_buf_access(fs_info, sec, FAT_OP_TYPE_READ, &block0); if (rc != RC_OK) return rc; switch ( fs_info->vol.type ) 201938c: 02 80 00 17 be 20193e8 <== NEVER TAKEN 2019390: b8 0f 00 11 and %i4, %l1, %i4 2019394: 80 a6 e0 04 cmp %i3, 4 2019398: 02 80 00 40 be 2019498 <== NEVER TAKEN 201939c: 80 a6 e0 01 cmp %i3, 1 20193a0: 02 80 00 20 be 2019420 <== ALWAYS TAKEN 20193a4: 80 8e 60 01 btst 1, %i1 fat_buf_mark_modified(fs_info); break; default: rtems_set_errno_and_return_minus_one(EIO); 20193a8: 40 00 06 c3 call 201aeb4 <__errno> <== NOT EXECUTED 20193ac: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20193b0: 82 10 20 05 mov 5, %g1 <== NOT EXECUTED 20193b4: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED break; } return RC_OK; } 20193b8: 81 c7 e0 08 ret <== NOT EXECUTED 20193bc: 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) + 20193c0: c2 06 20 4c ld [ %i0 + 0x4c ], %g1 20193c4: b9 36 60 01 srl %i1, 1, %i4 20193c8: b8 07 00 19 add %i4, %i1, %i4 20193cc: a1 37 00 10 srl %i4, %l0, %l0 20193d0: 10 bf ff e2 b 2019358 20193d4: a0 04 00 01 add %l0, %g1, %l0 20193d8: b9 2e 60 02 sll %i1, 2, %i4 <== NOT EXECUTED 20193dc: a1 37 00 10 srl %i4, %l0, %l0 <== NOT EXECUTED 20193e0: 10 bf ff de b 2019358 <== NOT EXECUTED 20193e4: a0 04 00 01 add %l0, %g1, %l0 <== NOT EXECUTED } } break; case FAT_FAT16: *((uint16_t *)(block0->buffer + ofs)) = 20193e8: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED (uint16_t )(CT_LE_W(in_val)); 20193ec: 85 2e a0 10 sll %i2, 0x10, %g2 <== NOT EXECUTED } } break; case FAT_FAT16: *((uint16_t *)(block0->buffer + ofs)) = 20193f0: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 <== NOT EXECUTED (uint16_t )(CT_LE_W(in_val)); 20193f4: 85 30 a0 18 srl %g2, 0x18, %g2 <== NOT EXECUTED break; } return RC_OK; } 20193f8: 07 00 00 3f sethi %hi(0xfc00), %g3 <== NOT EXECUTED 20193fc: 86 10 e3 ff or %g3, 0x3ff, %g3 ! ffff <== NOT EXECUTED 2019400: b4 0e 80 03 and %i2, %g3, %i2 <== NOT EXECUTED } break; case FAT_FAT16: *((uint16_t *)(block0->buffer + ofs)) = (uint16_t )(CT_LE_W(in_val)); 2019404: b5 2e a0 08 sll %i2, 8, %i2 <== NOT EXECUTED 2019408: b4 16 80 02 or %i2, %g2, %i2 <== NOT EXECUTED } } break; case FAT_FAT16: *((uint16_t *)(block0->buffer + ofs)) = 201940c: f4 30 40 1c sth %i2, [ %g1 + %i4 ] <== NOT EXECUTED } static inline void fat_buf_mark_modified(fat_fs_info_t *fs_info) { fs_info->c.modified = true; 2019410: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED 2019414: c2 2f 60 7c stb %g1, [ %i5 + 0x7c ] <== NOT EXECUTED 2019418: 81 c7 e0 08 ret <== NOT EXECUTED 201941c: 81 e8 00 00 restore <== NOT EXECUTED return rc; switch ( fs_info->vol.type ) { case FAT_FAT12: if ( FAT_CLUSTER_IS_ODD(cln) ) 2019420: 02 80 00 35 be 20194f4 2019424: c2 07 bf fc ld [ %fp + -4 ], %g1 { fat16_clv = ((uint16_t )in_val) << FAT_FAT12_SHIFT; *((uint8_t *)(block0->buffer + ofs)) = (*((uint8_t *)(block0->buffer + ofs))) & 0x0F; *((uint8_t *)(block0->buffer + ofs)) = 2019428: 85 2e a0 04 sll %i2, 4, %g2 case FAT_FAT12: if ( FAT_CLUSTER_IS_ODD(cln) ) { fat16_clv = ((uint16_t )in_val) << FAT_FAT12_SHIFT; *((uint8_t *)(block0->buffer + ofs)) = (*((uint8_t *)(block0->buffer + ofs))) & 0x0F; 201942c: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 { case FAT_FAT12: if ( FAT_CLUSTER_IS_ODD(cln) ) { fat16_clv = ((uint16_t )in_val) << FAT_FAT12_SHIFT; *((uint8_t *)(block0->buffer + ofs)) = 2019430: c6 08 40 1c ldub [ %g1 + %i4 ], %g3 2019434: 86 08 e0 0f and %g3, 0xf, %g3 2019438: c6 28 40 1c stb %g3, [ %g1 + %i4 ] (*((uint8_t *)(block0->buffer + ofs))) & 0x0F; *((uint8_t *)(block0->buffer + ofs)) = (*((uint8_t *)(block0->buffer + ofs))) | 201943c: c2 07 bf fc ld [ %fp + -4 ], %g1 2019440: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 { fat16_clv = ((uint16_t )in_val) << FAT_FAT12_SHIFT; *((uint8_t *)(block0->buffer + ofs)) = (*((uint8_t *)(block0->buffer + ofs))) & 0x0F; *((uint8_t *)(block0->buffer + ofs)) = 2019444: c6 08 40 1c ldub [ %g1 + %i4 ], %g3 2019448: 84 10 c0 02 or %g3, %g2, %g2 201944c: c4 28 40 1c stb %g2, [ %g1 + %i4 ] (*((uint8_t *)(block0->buffer + ofs))) | (uint8_t )(fat16_clv & 0x00FF); fat_buf_mark_modified(fs_info); if ( ofs == (fs_info->vol.bps - 1) ) 2019450: c2 17 40 00 lduh [ %i5 ], %g1 2019454: 82 00 7f ff add %g1, -1, %g1 2019458: 80 a0 40 1c cmp %g1, %i4 201945c: 02 80 00 41 be 2019560 <== NEVER TAKEN 2019460: f6 2f 60 7c stb %i3, [ %i5 + 0x7c ] fat_buf_mark_modified(fs_info); } else { *((uint8_t *)(block0->buffer + ofs + 1)) &= 0x00; 2019464: c2 07 bf fc ld [ %fp + -4 ], %g1 2019468: b8 07 20 01 inc %i4 201946c: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 *((uint8_t *)(block0->buffer + ofs + 1)) = (*((uint8_t *)(block0->buffer + ofs + 1))) | (uint8_t )((fat16_clv & 0xFF00)>>8); 2019470: b5 2e a0 14 sll %i2, 0x14, %i2 fat_buf_mark_modified(fs_info); } else { *((uint8_t *)(block0->buffer + ofs + 1)) &= 0x00; 2019474: c0 28 40 1c clrb [ %g1 + %i4 ] *((uint8_t *)(block0->buffer + ofs + 1)) = (*((uint8_t *)(block0->buffer + ofs + 1))) | 2019478: c2 07 bf fc ld [ %fp + -4 ], %g1 (uint8_t )((fat16_clv & 0xFF00)>>8); 201947c: b5 36 a0 18 srl %i2, 0x18, %i2 else { *((uint8_t *)(block0->buffer + ofs + 1)) &= 0x00; *((uint8_t *)(block0->buffer + ofs + 1)) = (*((uint8_t *)(block0->buffer + ofs + 1))) | 2019480: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 } else { *((uint8_t *)(block0->buffer + ofs + 1)) &= 0x00; *((uint8_t *)(block0->buffer + ofs + 1)) = 2019484: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 2019488: 84 10 80 1a or %g2, %i2, %g2 201948c: c4 28 40 1c stb %g2, [ %g1 + %i4 ] 2019490: 81 c7 e0 08 ret 2019494: 81 e8 00 00 restore case FAT_FAT32: fat32_clv = CT_LE_L((in_val & FAT_FAT32_MASK)); *((uint32_t *)(block0->buffer + ofs)) = (*((uint32_t *)(block0->buffer + ofs))) & (CT_LE_L(0xF0000000)); 2019498: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED 201949c: c4 00 60 1c ld [ %g1 + 0x1c ], %g2 <== NOT EXECUTED (uint16_t )(CT_LE_W(in_val)); fat_buf_mark_modified(fs_info); break; case FAT_FAT32: fat32_clv = CT_LE_L((in_val & FAT_FAT32_MASK)); 20194a0: 03 3c 00 00 sethi %hi(0xf0000000), %g1 <== NOT EXECUTED *((uint32_t *)(block0->buffer + ofs)) = (*((uint32_t *)(block0->buffer + ofs))) & (CT_LE_L(0xF0000000)); 20194a4: c6 00 80 1c ld [ %g2 + %i4 ], %g3 <== NOT EXECUTED (uint16_t )(CT_LE_W(in_val)); fat_buf_mark_modified(fs_info); break; case FAT_FAT32: fat32_clv = CT_LE_L((in_val & FAT_FAT32_MASK)); 20194a8: 82 2e 80 01 andn %i2, %g1, %g1 <== NOT EXECUTED uint32_t value ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; 20194ac: 89 30 60 18 srl %g1, 0x18, %g4 <== NOT EXECUTED byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 20194b0: b7 30 60 08 srl %g1, 8, %i3 <== NOT EXECUTED *((uint32_t *)(block0->buffer + ofs)) = (*((uint32_t *)(block0->buffer + ofs))) & (CT_LE_L(0xF0000000)); 20194b4: 86 08 e0 f0 and %g3, 0xf0, %g3 <== NOT EXECUTED byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 20194b8: b5 2e a0 18 sll %i2, 0x18, %i2 <== NOT EXECUTED { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; byte2 = (value >> 8) & 0xff; 20194bc: b6 0e e0 ff and %i3, 0xff, %i3 <== NOT EXECUTED byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 20194c0: b4 16 80 04 or %i2, %g4, %i2 <== NOT EXECUTED 20194c4: b7 2e e0 10 sll %i3, 0x10, %i3 <== NOT EXECUTED ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 20194c8: 89 30 60 10 srl %g1, 0x10, %g4 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 20194cc: 82 16 80 1b or %i2, %i3, %g1 <== NOT EXECUTED ) { uint32_t byte1, byte2, byte3, byte4, swapped; byte4 = (value >> 24) & 0xff; byte3 = (value >> 16) & 0xff; 20194d0: 88 09 20 ff and %g4, 0xff, %g4 <== NOT EXECUTED byte2 = (value >> 8) & 0xff; byte1 = value & 0xff; swapped = (byte1 << 24) | (byte2 << 16) | (byte3 << 8) | byte4; 20194d4: 89 29 20 08 sll %g4, 8, %g4 <== NOT EXECUTED 20194d8: 82 10 40 04 or %g1, %g4, %g1 <== NOT EXECUTED *((uint32_t *)(block0->buffer + ofs)) = fat32_clv | (*((uint32_t *)(block0->buffer + ofs))); 20194dc: 82 10 40 03 or %g1, %g3, %g1 <== NOT EXECUTED fat32_clv = CT_LE_L((in_val & FAT_FAT32_MASK)); *((uint32_t *)(block0->buffer + ofs)) = (*((uint32_t *)(block0->buffer + ofs))) & (CT_LE_L(0xF0000000)); *((uint32_t *)(block0->buffer + ofs)) = 20194e0: c2 20 80 1c st %g1, [ %g2 + %i4 ] <== NOT EXECUTED 20194e4: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED 20194e8: c2 2f 60 7c stb %g1, [ %i5 + 0x7c ] <== NOT EXECUTED 20194ec: 81 c7 e0 08 ret <== NOT EXECUTED 20194f0: 81 e8 00 00 restore <== NOT EXECUTED (uint8_t )((fat16_clv & 0xFF00)>>8); } } else { fat16_clv = ((uint16_t )in_val) & FAT_FAT12_MASK; 20194f4: b4 0e af ff and %i2, 0xfff, %i2 *((uint8_t *)(block0->buffer + ofs)) &= 0x00; 20194f8: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 20194fc: c0 28 40 1c clrb [ %g1 + %i4 ] *((uint8_t *)(block0->buffer + ofs)) = (*((uint8_t *)(block0->buffer + ofs))) | 2019500: c2 07 bf fc ld [ %fp + -4 ], %g1 2019504: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 else { fat16_clv = ((uint16_t )in_val) & FAT_FAT12_MASK; *((uint8_t *)(block0->buffer + ofs)) &= 0x00; *((uint8_t *)(block0->buffer + ofs)) = 2019508: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 201950c: 84 10 80 1a or %g2, %i2, %g2 2019510: c4 28 40 1c stb %g2, [ %g1 + %i4 ] (*((uint8_t *)(block0->buffer + ofs))) | (uint8_t )(fat16_clv & 0x00FF); fat_buf_mark_modified(fs_info); if ( ofs == (fs_info->vol.bps - 1) ) 2019514: c2 17 40 00 lduh [ %i5 ], %g1 2019518: 82 00 7f ff add %g1, -1, %g1 201951c: 80 a0 40 1c cmp %g1, %i4 2019520: 02 80 00 24 be 20195b0 <== NEVER TAKEN 2019524: f6 2f 60 7c stb %i3, [ %i5 + 0x7c ] fat_buf_mark_modified(fs_info); } else { *((uint8_t *)(block0->buffer + ofs + 1)) = (*((uint8_t *)(block0->buffer + ofs + 1))) & 0xF0; 2019528: c2 07 bf fc ld [ %fp + -4 ], %g1 201952c: b8 07 20 01 inc %i4 2019530: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 *((uint8_t *)(block0->buffer + ofs+1)) = (*((uint8_t *)(block0->buffer + ofs+1))) | (uint8_t )((fat16_clv & 0xFF00)>>8); 2019534: b5 36 a0 08 srl %i2, 8, %i2 fat_buf_mark_modified(fs_info); } else { *((uint8_t *)(block0->buffer + ofs + 1)) = 2019538: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 201953c: 84 08 bf f0 and %g2, -16, %g2 2019540: c4 28 40 1c stb %g2, [ %g1 + %i4 ] (*((uint8_t *)(block0->buffer + ofs + 1))) & 0xF0; *((uint8_t *)(block0->buffer + ofs+1)) = (*((uint8_t *)(block0->buffer + ofs+1))) | 2019544: c2 07 bf fc ld [ %fp + -4 ], %g1 2019548: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 else { *((uint8_t *)(block0->buffer + ofs + 1)) = (*((uint8_t *)(block0->buffer + ofs + 1))) & 0xF0; *((uint8_t *)(block0->buffer + ofs+1)) = 201954c: c4 08 40 1c ldub [ %g1 + %i4 ], %g2 2019550: b4 10 80 1a or %g2, %i2, %i2 2019554: f4 28 40 1c stb %i2, [ %g1 + %i4 ] 2019558: 81 c7 e0 08 ret 201955c: 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, 2019560: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2019564: 92 04 20 01 add %l0, 1, %o1 <== NOT EXECUTED 2019568: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 201956c: 7f ff e4 f2 call 2012934 <== NOT EXECUTED 2019570: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED &block0); if (rc != RC_OK) 2019574: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 2019578: 12 bf ff 90 bne 20193b8 <== NOT EXECUTED 201957c: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED *((uint8_t *)(block0->buffer)) &= 0x00; *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) | (uint8_t )((fat16_clv & 0xFF00)>>8); 2019580: 87 2e a0 14 sll %i2, 0x14, %g3 <== NOT EXECUTED rc = fat_buf_access(fs_info, sec + 1, FAT_OP_TYPE_READ, &block0); if (rc != RC_OK) return rc; *((uint8_t *)(block0->buffer)) &= 0x00; 2019584: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 <== NOT EXECUTED *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) | (uint8_t )((fat16_clv & 0xFF00)>>8); 2019588: 87 30 e0 18 srl %g3, 0x18, %g3 <== NOT EXECUTED rc = fat_buf_access(fs_info, sec + 1, FAT_OP_TYPE_READ, &block0); if (rc != RC_OK) return rc; *((uint8_t *)(block0->buffer)) &= 0x00; 201958c: c0 28 40 00 clrb [ %g1 ] <== NOT EXECUTED *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) | 2019590: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED 2019594: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 <== NOT EXECUTED if (rc != RC_OK) return rc; *((uint8_t *)(block0->buffer)) &= 0x00; *((uint8_t *)(block0->buffer)) = 2019598: c4 08 40 00 ldub [ %g1 ], %g2 <== NOT EXECUTED 201959c: 84 10 c0 02 or %g3, %g2, %g2 <== NOT EXECUTED 20195a0: c4 28 40 00 stb %g2, [ %g1 ] <== NOT EXECUTED 20195a4: f6 2f 60 7c stb %i3, [ %i5 + 0x7c ] <== NOT EXECUTED 20195a8: 81 c7 e0 08 ret <== NOT EXECUTED 20195ac: 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, 20195b0: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 20195b4: 92 04 20 01 add %l0, 1, %o1 <== NOT EXECUTED 20195b8: 94 10 20 01 mov 1, %o2 <== NOT EXECUTED 20195bc: 7f ff e4 de call 2012934 <== NOT EXECUTED 20195c0: 96 07 bf fc add %fp, -4, %o3 <== NOT EXECUTED &block0); if (rc != RC_OK) 20195c4: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 20195c8: 12 bf ff 7c bne 20193b8 <== NOT EXECUTED 20195cc: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) & 0xF0; *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) | (uint8_t )((fat16_clv & 0xFF00)>>8); 20195d0: b5 36 a0 08 srl %i2, 8, %i2 <== NOT EXECUTED &block0); if (rc != RC_OK) return rc; *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) & 0xF0; 20195d4: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 <== NOT EXECUTED rc = fat_buf_access(fs_info, sec + 1, FAT_OP_TYPE_READ, &block0); if (rc != RC_OK) return rc; *((uint8_t *)(block0->buffer)) = 20195d8: c4 08 40 00 ldub [ %g1 ], %g2 <== NOT EXECUTED 20195dc: 84 08 bf f0 and %g2, -16, %g2 <== NOT EXECUTED 20195e0: c4 28 40 00 stb %g2, [ %g1 ] <== NOT EXECUTED (*((uint8_t *)(block0->buffer))) & 0xF0; *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) | 20195e4: c2 07 bf fc ld [ %fp + -4 ], %g1 <== NOT EXECUTED 20195e8: c2 00 60 1c ld [ %g1 + 0x1c ], %g1 <== NOT EXECUTED return rc; *((uint8_t *)(block0->buffer)) = (*((uint8_t *)(block0->buffer))) & 0xF0; *((uint8_t *)(block0->buffer)) = 20195ec: c4 08 40 00 ldub [ %g1 ], %g2 <== NOT EXECUTED 20195f0: 84 16 80 02 or %i2, %g2, %g2 <== NOT EXECUTED 20195f4: c4 28 40 00 stb %g2, [ %g1 ] <== NOT EXECUTED 20195f8: f6 2f 60 7c stb %i3, [ %i5 + 0x7c ] <== NOT EXECUTED 20195fc: 81 c7 e0 08 ret <== NOT EXECUTED 2019600: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02013250 : * RC_OK on success, or -1 if error occured * and errno set appropriately */ int fat_shutdown_drive(fat_fs_info_t *fs_info) { 2013250: 9d e3 bf a0 save %sp, -96, %sp int rc = RC_OK; int i = 0; if (fs_info->vol.type & FAT_FAT32) 2013254: c2 0e 20 0a ldub [ %i0 + 0xa ], %g1 * RC_OK on success, or -1 if error occured * and errno set appropriately */ int fat_shutdown_drive(fat_fs_info_t *fs_info) { 2013258: b8 10 00 18 mov %i0, %i4 int rc = RC_OK; int i = 0; if (fs_info->vol.type & FAT_FAT32) 201325c: 82 08 60 04 and %g1, 4, %g1 2013260: 80 88 60 ff btst 0xff, %g1 2013264: 12 80 00 3c bne 2013354 <== NEVER TAKEN 2013268: b0 10 20 00 clr %i0 fs_info->vol.next_cl); if ( rc != RC_OK ) rc = -1; } fat_buf_release(fs_info); 201326c: 7f ff fe 3b call 2012b58 2013270: 90 10 00 1c mov %i4, %o0 if (rtems_bdbuf_syncdev(fs_info->vol.dd) != RTEMS_SUCCESSFUL) 2013274: 7f ff f7 f6 call 201124c 2013278: d0 07 20 58 ld [ %i4 + 0x58 ], %o0 201327c: 80 a2 20 00 cmp %o0, 0 2013280: 32 80 00 3d bne,a 2013374 <== NEVER TAKEN 2013284: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rc = -1; 2013288: 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; 201328c: fa 07 20 60 ld [ %i4 + 0x60 ], %i5 while ( (node = rtems_chain_get(the_chain)) != NULL ) 2013290: 10 80 00 04 b 20132a0 2013294: ba 07 40 1b add %i5, %i3, %i5 free(node); 2013298: 7f ff c5 63 call 2004824 <== NOT EXECUTED 201329c: 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 ); 20132a0: 7f ff db 07 call 2009ebc <_Chain_Get> 20132a4: 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 ) 20132a8: 80 a2 20 00 cmp %o0, 0 20132ac: 12 bf ff fb bne 2013298 <== NEVER TAKEN 20132b0: 01 00 00 00 nop 20132b4: b6 06 e0 0c add %i3, 0xc, %i3 fat_buf_release(fs_info); if (rtems_bdbuf_syncdev(fs_info->vol.dd) != RTEMS_SUCCESSFUL) rc = -1; for (i = 0; i < FAT_HASH_SIZE; i++) 20132b8: 80 a6 e0 18 cmp %i3, 0x18 20132bc: 32 bf ff f5 bne,a 2013290 20132c0: fa 07 20 60 ld [ %i4 + 0x60 ], %i5 20132c4: 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; 20132c8: fa 07 20 64 ld [ %i4 + 0x64 ], %i5 while ( (node = rtems_chain_get(the_chain)) != NULL ) 20132cc: 10 80 00 04 b 20132dc 20132d0: ba 07 40 1b add %i5, %i3, %i5 free(node); 20132d4: 7f ff c5 54 call 2004824 <== NOT EXECUTED 20132d8: 01 00 00 00 nop <== NOT EXECUTED 20132dc: 7f ff da f8 call 2009ebc <_Chain_Get> 20132e0: 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 ) 20132e4: 80 a2 20 00 cmp %o0, 0 20132e8: 12 bf ff fb bne 20132d4 <== NEVER TAKEN 20132ec: 01 00 00 00 nop 20132f0: 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++) 20132f4: 80 a6 e0 18 cmp %i3, 0x18 20132f8: 32 bf ff f5 bne,a 20132cc 20132fc: fa 07 20 64 ld [ %i4 + 0x64 ], %i5 while ( (node = rtems_chain_get(the_chain)) != NULL ) free(node); } free(fs_info->vhash); 2013300: 7f ff c5 49 call 2004824 2013304: d0 07 20 60 ld [ %i4 + 0x60 ], %o0 free(fs_info->rhash); 2013308: 7f ff c5 47 call 2004824 201330c: d0 07 20 64 ld [ %i4 + 0x64 ], %o0 free(fs_info->uino); 2013310: 7f ff c5 45 call 2004824 2013314: d0 07 20 68 ld [ %i4 + 0x68 ], %o0 free(fs_info->sec_buf); 2013318: 7f ff c5 43 call 2004824 201331c: d0 07 20 84 ld [ %i4 + 0x84 ], %o0 close(fs_info->vol.fd); 2013320: 7f ff c4 84 call 2004530 2013324: d0 07 20 54 ld [ %i4 + 0x54 ], %o0 if (rc) 2013328: 80 a6 20 00 cmp %i0, 0 201332c: 12 80 00 04 bne 201333c <== NEVER TAKEN 2013330: 01 00 00 00 nop errno = EIO; return rc; } 2013334: 81 c7 e0 08 ret 2013338: 81 e8 00 00 restore free(fs_info->uino); free(fs_info->sec_buf); close(fs_info->vol.fd); if (rc) errno = EIO; 201333c: 40 00 1e de call 201aeb4 <__errno> <== NOT EXECUTED 2013340: 01 00 00 00 nop <== NOT EXECUTED 2013344: 82 10 20 05 mov 5, %g1 ! 5 <== NOT EXECUTED 2013348: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED return rc; } 201334c: 81 c7 e0 08 ret <== NOT EXECUTED 2013350: 81 e8 00 00 restore <== NOT EXECUTED int rc = RC_OK; int i = 0; if (fs_info->vol.type & FAT_FAT32) { rc = fat_fat32_update_fsinfo_sector(fs_info, fs_info->vol.free_cls, 2013354: d2 07 20 40 ld [ %i4 + 0x40 ], %o1 <== NOT EXECUTED 2013358: d4 07 20 44 ld [ %i4 + 0x44 ], %o2 <== NOT EXECUTED 201335c: 7f ff ff 8e call 2013194 <== NOT EXECUTED 2013360: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED fs_info->vol.next_cl); if ( rc != RC_OK ) 2013364: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 2013368: 32 bf ff c1 bne,a 201326c <== NOT EXECUTED 201336c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2013370: 30 bf ff bf b,a 201326c <== NOT EXECUTED } fat_buf_release(fs_info); if (rtems_bdbuf_syncdev(fs_info->vol.dd) != RTEMS_SUCCESSFUL) rc = -1; 2013374: 10 bf ff c6 b 201328c <== NOT EXECUTED 2013378: b6 10 20 00 clr %i3 <== NOT EXECUTED =============================================================================== 020367a4 : #include #include int fchdir( int fd ) { 20367a4: 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 ); 20367a8: 03 00 81 85 sethi %hi(0x2061400), %g1 20367ac: c2 00 63 3c ld [ %g1 + 0x33c ], %g1 ! 206173c int rv = 0; rtems_libio_t *iop; struct stat st; rtems_filesystem_location_info_t loc; st.st_mode = 0; 20367b0: c0 27 bf c4 clr [ %fp + -60 ] st.st_uid = 0; 20367b4: c0 37 bf ca clrh [ %fp + -54 ] st.st_gid = 0; rtems_libio_check_fd( fd ); 20367b8: 80 a6 00 01 cmp %i0, %g1 20367bc: 1a 80 00 3d bcc 20368b0 20367c0: c0 37 bf cc clrh [ %fp + -52 ] iop = rtems_libio_iop( fd ); 20367c4: 03 00 81 96 sethi %hi(0x2065800), %g1 20367c8: fa 00 61 28 ld [ %g1 + 0x128 ], %i5 ! 2065928 20367cc: 83 2e 20 03 sll %i0, 3, %g1 20367d0: b1 2e 20 06 sll %i0, 6, %i0 20367d4: b0 26 00 01 sub %i0, %g1, %i0 20367d8: ba 07 40 18 add %i5, %i0, %i5 rtems_libio_check_is_open( iop ); 20367dc: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 20367e0: 80 88 61 00 btst 0x100, %g1 20367e4: 02 80 00 33 be 20368b0 20367e8: 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; 20367ec: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->lock_h)( mt_entry ); 20367f0: c2 02 20 0c ld [ %o0 + 0xc ], %g1 20367f4: c2 00 40 00 ld [ %g1 ], %g1 20367f8: 9f c0 40 00 call %g1 20367fc: b8 07 60 14 add %i5, 0x14, %i4 rtems_filesystem_instance_lock( &iop->pathinfo ); rv = (*iop->pathinfo.handlers->fstat_h)( &iop->pathinfo, &st ); 2036800: c2 07 60 24 ld [ %i5 + 0x24 ], %g1 2036804: 90 10 00 1c mov %i4, %o0 2036808: c2 00 60 18 ld [ %g1 + 0x18 ], %g1 203680c: 9f c0 40 00 call %g1 2036810: 92 07 bf b8 add %fp, -72, %o1 if ( rv == 0 ) { 2036814: b0 92 20 00 orcc %o0, 0, %i0 2036818: 02 80 00 09 be 203683c <== ALWAYS TAKEN 203681c: 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; 2036820: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 <== NOT EXECUTED (*mt_entry->ops->unlock_h)( mt_entry ); 2036824: c2 02 20 0c ld [ %o0 + 0xc ], %g1 <== NOT EXECUTED 2036828: c2 00 60 04 ld [ %g1 + 4 ], %g1 <== NOT EXECUTED 203682c: 9f c0 40 00 call %g1 <== NOT EXECUTED 2036830: 01 00 00 00 nop <== NOT EXECUTED if ( rv == 0 ) { rv = rtems_filesystem_chdir( &loc ); } return rv; } 2036834: 81 c7 e0 08 ret <== NOT EXECUTED 2036838: 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( 203683c: d4 17 bf ca lduh [ %fp + -54 ], %o2 2036840: d6 17 bf cc lduh [ %fp + -52 ], %o3 2036844: 7f ff 62 29 call 200f0e8 2036848: 90 10 20 01 mov 1, %o0 st.st_mode, st.st_uid, st.st_gid ); if ( access_ok ) { 203684c: 80 8a 20 ff btst 0xff, %o0 2036850: 02 80 00 0d be 2036884 2036854: 92 10 00 1c mov %i4, %o1 rtems_filesystem_location_clone( &loc, &iop->pathinfo ); 2036858: 7f ff 60 e1 call 200ebdc 203685c: 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; 2036860: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 2036864: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2036868: c2 00 60 04 ld [ %g1 + 4 ], %g1 203686c: 9f c0 40 00 call %g1 2036870: 01 00 00 00 nop } } rtems_filesystem_instance_unlock( &iop->pathinfo ); if ( rv == 0 ) { rv = rtems_filesystem_chdir( &loc ); 2036874: 7f ff bf 5c call 20265e4 2036878: 90 07 bf a0 add %fp, -96, %o0 203687c: 81 c7 e0 08 ret 2036880: 91 e8 00 08 restore %g0, %o0, %o0 ); if ( access_ok ) { rtems_filesystem_location_clone( &loc, &iop->pathinfo ); } else { errno = EACCES; 2036884: 40 00 11 06 call 203ac9c <__errno> 2036888: b0 10 3f ff mov -1, %i0 203688c: 82 10 20 0d mov 0xd, %g1 2036890: 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; 2036894: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 2036898: c2 02 20 0c ld [ %o0 + 0xc ], %g1 203689c: c2 00 60 04 ld [ %g1 + 4 ], %g1 20368a0: 9f c0 40 00 call %g1 20368a4: 01 00 00 00 nop if ( rv == 0 ) { rv = rtems_filesystem_chdir( &loc ); } return rv; } 20368a8: 81 c7 e0 08 ret 20368ac: 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 ); 20368b0: 40 00 10 fb call 203ac9c <__errno> 20368b4: b0 10 3f ff mov -1, %i0 20368b8: 82 10 20 09 mov 9, %g1 20368bc: c2 22 00 00 st %g1, [ %o0 ] 20368c0: 81 c7 e0 08 ret 20368c4: 81 e8 00 00 restore =============================================================================== 020268c4 : #include #include int fchmod( int fd, mode_t mode ) { 20268c4: 9d e3 bf a0 save %sp, -96, %sp int rv; rtems_libio_t *iop; rtems_libio_check_fd( fd ); 20268c8: 03 00 81 85 sethi %hi(0x2061400), %g1 20268cc: c2 00 63 3c ld [ %g1 + 0x33c ], %g1 ! 206173c 20268d0: 80 a6 00 01 cmp %i0, %g1 20268d4: 1a 80 00 28 bcc 2026974 20268d8: 03 00 81 96 sethi %hi(0x2065800), %g1 iop = rtems_libio_iop( fd ); 20268dc: fa 00 61 28 ld [ %g1 + 0x128 ], %i5 ! 2065928 20268e0: 83 2e 20 03 sll %i0, 3, %g1 20268e4: b1 2e 20 06 sll %i0, 6, %i0 20268e8: b0 26 00 01 sub %i0, %g1, %i0 20268ec: ba 07 40 18 add %i5, %i0, %i5 rtems_libio_check_is_open(iop); 20268f0: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 20268f4: 80 88 61 00 btst 0x100, %g1 20268f8: 02 80 00 1f be 2026974 20268fc: 01 00 00 00 nop if (iop->pathinfo.mt_entry->writeable) { 2026900: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 2026904: c2 0a 20 29 ldub [ %o0 + 0x29 ], %g1 2026908: 80 a0 60 00 cmp %g1, 0 202690c: 02 80 00 14 be 202695c <== NEVER TAKEN 2026910: 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 ); 2026914: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2026918: c2 00 40 00 ld [ %g1 ], %g1 202691c: 9f c0 40 00 call %g1 2026920: 01 00 00 00 nop rtems_filesystem_instance_lock( &iop->pathinfo ); rv = (*iop->pathinfo.mt_entry->ops->fchmod_h)( &iop->pathinfo, mode ); 2026924: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2026928: 90 07 60 14 add %i5, 0x14, %o0 202692c: c2 00 60 0c ld [ %g1 + 0xc ], %g1 2026930: c2 00 60 20 ld [ %g1 + 0x20 ], %g1 2026934: 9f c0 40 00 call %g1 2026938: 92 10 00 19 mov %i1, %o1 202693c: 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; 2026940: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 2026944: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2026948: c2 00 60 04 ld [ %g1 + 4 ], %g1 202694c: 9f c0 40 00 call %g1 2026950: 01 00 00 00 nop 2026954: 81 c7 e0 08 ret 2026958: 81 e8 00 00 restore rtems_filesystem_instance_unlock( &iop->pathinfo ); } else { errno = EROFS; 202695c: 40 00 50 d0 call 203ac9c <__errno> <== NOT EXECUTED 2026960: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2026964: 82 10 20 1e mov 0x1e, %g1 <== NOT EXECUTED 2026968: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED rv = -1; } return rv; } 202696c: 81 c7 e0 08 ret <== NOT EXECUTED 2026970: 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); 2026974: 40 00 50 ca call 203ac9c <__errno> 2026978: b0 10 3f ff mov -1, %i0 202697c: 82 10 20 09 mov 9, %g1 2026980: c2 22 00 00 st %g1, [ %o0 ] 2026984: 81 c7 e0 08 ret 2026988: 81 e8 00 00 restore =============================================================================== 0202698c : #include #include int fchown( int fd, uid_t owner, gid_t group ) { 202698c: 9d e3 bf a0 save %sp, -96, %sp int rv = 0; rtems_libio_t *iop; rtems_libio_check_fd( fd ); 2026990: 03 00 81 85 sethi %hi(0x2061400), %g1 2026994: c2 00 63 3c ld [ %g1 + 0x33c ], %g1 ! 206173c 2026998: 80 a6 00 01 cmp %i0, %g1 202699c: 1a 80 00 29 bcc 2026a40 20269a0: 03 00 81 96 sethi %hi(0x2065800), %g1 iop = rtems_libio_iop( fd ); 20269a4: fa 00 61 28 ld [ %g1 + 0x128 ], %i5 ! 2065928 20269a8: 83 2e 20 03 sll %i0, 3, %g1 20269ac: b1 2e 20 06 sll %i0, 6, %i0 20269b0: b0 26 00 01 sub %i0, %g1, %i0 20269b4: ba 07 40 18 add %i5, %i0, %i5 rtems_libio_check_is_open(iop); 20269b8: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 20269bc: 80 88 61 00 btst 0x100, %g1 20269c0: 02 80 00 20 be 2026a40 20269c4: 01 00 00 00 nop if (iop->pathinfo.mt_entry->writeable) { 20269c8: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 20269cc: c2 0a 20 29 ldub [ %o0 + 0x29 ], %g1 20269d0: 80 a0 60 00 cmp %g1, 0 20269d4: 02 80 00 15 be 2026a28 <== NEVER TAKEN 20269d8: 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 ); 20269dc: c2 02 20 0c ld [ %o0 + 0xc ], %g1 20269e0: c2 00 40 00 ld [ %g1 ], %g1 20269e4: 9f c0 40 00 call %g1 20269e8: 01 00 00 00 nop rtems_filesystem_instance_lock( &iop->pathinfo ); rv = (*iop->pathinfo.mt_entry->ops->chown_h)( 20269ec: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 20269f0: 90 07 60 14 add %i5, 0x14, %o0 20269f4: c2 00 60 0c ld [ %g1 + 0xc ], %g1 20269f8: 92 10 00 19 mov %i1, %o1 20269fc: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 2026a00: 9f c0 40 00 call %g1 2026a04: 94 10 00 1a mov %i2, %o2 2026a08: 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; 2026a0c: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 2026a10: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2026a14: c2 00 60 04 ld [ %g1 + 4 ], %g1 2026a18: 9f c0 40 00 call %g1 2026a1c: 01 00 00 00 nop 2026a20: 81 c7 e0 08 ret 2026a24: 81 e8 00 00 restore owner, group ); rtems_filesystem_instance_unlock( &iop->pathinfo ); } else { errno = EROFS; 2026a28: 40 00 50 9d call 203ac9c <__errno> <== NOT EXECUTED 2026a2c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2026a30: 82 10 20 1e mov 0x1e, %g1 <== NOT EXECUTED 2026a34: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED rv = -1; } return rv; } 2026a38: 81 c7 e0 08 ret <== NOT EXECUTED 2026a3c: 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); 2026a40: 40 00 50 97 call 203ac9c <__errno> 2026a44: b0 10 3f ff mov -1, %i0 2026a48: 82 10 20 09 mov 9, %g1 2026a4c: c2 22 00 00 st %g1, [ %o0 ] 2026a50: 81 c7 e0 08 ret 2026a54: 81 e8 00 00 restore =============================================================================== 02031298 : int fcntl( int fd, int cmd, ... ) { 2031298: 9d e3 bf 98 save %sp, -104, %sp int fd2; int flags; int mask; int ret = 0; rtems_libio_check_fd( fd ); 203129c: 03 00 80 dc sethi %hi(0x2037000), %g1 20312a0: c4 00 61 08 ld [ %g1 + 0x108 ], %g2 ! 2037108 ... ) { int ret; va_list ap; va_start( ap, cmd ); 20312a4: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 20312a8: 82 07 a0 4c add %fp, 0x4c, %g1 20312ac: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 20312b0: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 20312b4: fa 27 a0 58 st %i5, [ %fp + 0x58 ] int fd2; int flags; int mask; int ret = 0; rtems_libio_check_fd( fd ); 20312b8: 80 a6 00 02 cmp %i0, %g2 20312bc: 1a 80 00 7c bcc 20314ac 20312c0: c2 27 bf fc st %g1, [ %fp + -4 ] iop = rtems_libio_iop( fd ); 20312c4: 39 00 81 1f sethi %hi(0x2047c00), %i4 20312c8: fa 07 20 fc ld [ %i4 + 0xfc ], %i5 ! 2047cfc 20312cc: 85 2e 20 03 sll %i0, 3, %g2 20312d0: b1 2e 20 06 sll %i0, 6, %i0 20312d4: b0 26 00 02 sub %i0, %g2, %i0 20312d8: ba 07 40 18 add %i5, %i0, %i5 rtems_libio_check_is_open(iop); 20312dc: d0 07 60 10 ld [ %i5 + 0x10 ], %o0 20312e0: 80 8a 21 00 btst 0x100, %o0 20312e4: 02 80 00 72 be 20314ac 20312e8: 80 a6 60 09 cmp %i1, 9 /* * This switch should contain all the cases from POSIX. */ switch ( cmd ) { 20312ec: 08 80 00 08 bleu 203130c 20312f0: 85 2e 60 02 sll %i1, 2, %g2 errno = ENOTSUP; ret = -1; break; default: errno = EINVAL; 20312f4: 7f ff c4 92 call 202253c <__errno> 20312f8: b0 10 3f ff mov -1, %i0 20312fc: 82 10 20 16 mov 0x16, %g1 2031300: c2 22 00 00 st %g1, [ %o0 ] va_list ap; va_start( ap, cmd ); ret = vfcntl(fd,cmd,ap); va_end(ap); return ret; } 2031304: 81 c7 e0 08 ret 2031308: 81 e8 00 00 restore /* * This switch should contain all the cases from POSIX. */ switch ( cmd ) { 203130c: 07 00 80 c4 sethi %hi(0x2031000), %g3 2031310: 86 10 e2 70 or %g3, 0x270, %g3 ! 2031270 <_calloc_r+0x14> 2031314: c4 00 c0 02 ld [ %g3 + %g2 ], %g2 2031318: 81 c0 80 00 jmp %g2 203131c: 01 00 00 00 nop errno = ENOTSUP; ret = -1; break; case F_GETOWN: /* for sockets. */ errno = ENOTSUP; 2031320: 7f ff c4 87 call 202253c <__errno> 2031324: b0 10 3f ff mov -1, %i0 ! ffffffff 2031328: 82 10 20 86 mov 0x86, %g1 203132c: c2 22 00 00 st %g1, [ %o0 ] 2031330: 81 c7 e0 08 ret 2031334: 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 ) ); 2031338: d0 00 40 00 ld [ %g1 ], %o0 203133c: 7f ff 5e ab call 2008de8 2031340: 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); 2031344: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2031348: 90 0a 22 01 and %o0, 0x201, %o0 203134c: 82 08 7d fe and %g1, -514, %g1 2031350: 82 12 00 01 or %o0, %g1, %g1 2031354: 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 ); 2031358: c2 07 60 24 ld [ %i5 + 0x24 ], %g1 203135c: 90 10 00 1d mov %i5, %o0 2031360: c2 00 60 28 ld [ %g1 + 0x28 ], %g1 2031364: 9f c0 40 00 call %g1 2031368: 92 10 00 19 mov %i1, %o1 if (err) { 203136c: ba 92 20 00 orcc %o0, 0, %i5 2031370: 02 80 00 53 be 20314bc <== ALWAYS TAKEN 2031374: 01 00 00 00 nop errno = err; 2031378: 7f ff c4 71 call 202253c <__errno> <== NOT EXECUTED 203137c: b0 10 3f ff mov -1, %i0 ! ffffffff <== NOT EXECUTED 2031380: fa 22 00 00 st %i5, [ %o0 ] <== NOT EXECUTED 2031384: 81 c7 e0 08 ret <== NOT EXECUTED 2031388: 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 ); 203138c: 7f ff 5e a4 call 2008e1c 2031390: 01 00 00 00 nop 2031394: 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) { 2031398: 80 a6 20 00 cmp %i0, 0 203139c: 36 bf ff f0 bge,a 203135c <== ALWAYS TAKEN 20313a0: 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; } 20313a4: 81 c7 e0 08 ret <== NOT EXECUTED 20313a8: 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 ) ) 20313ac: c2 00 40 00 ld [ %g1 ], %g1 20313b0: 80 a0 60 00 cmp %g1, 0 20313b4: 22 80 00 3b be,a 20314a0 20313b8: 90 0a 37 ff and %o0, -2049, %o0 iop->flags |= LIBIO_FLAGS_CLOSE_ON_EXEC; 20313bc: 90 12 28 00 or %o0, 0x800, %o0 { rtems_libio_t *iop; int fd2; int flags; int mask; int ret = 0; 20313c0: 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; 20313c4: 10 bf ff e5 b 2031358 20313c8: 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); 20313cc: b1 32 20 0b srl %o0, 0xb, %i0 20313d0: 10 bf ff e2 b 2031358 20313d4: 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(); 20313d8: 7f ff 5e a8 call 2008e78 20313dc: 01 00 00 00 nop if (diop != NULL) { 20313e0: b6 92 20 00 orcc %o0, 0, %i3 20313e4: 02 bf ff c8 be 2031304 20313e8: b0 10 3f ff mov -1, %i0 int oflag = rtems_libio_to_fcntl_flags( iop->flags ); 20313ec: 7f ff 5e 8c call 2008e1c 20313f0: d0 07 60 10 ld [ %i5 + 0x10 ], %o0 oflag &= ~O_CREAT; diop->flags |= rtems_libio_fcntl_flags( oflag ); 20313f4: 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; 20313f8: b4 0a 3d ff and %o0, -513, %i2 diop->flags |= rtems_libio_fcntl_flags( oflag ); 20313fc: 7f ff 5e 7b call 2008de8 2031400: 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; 2031404: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2031408: b0 12 00 18 or %o0, %i0, %i0 (*mt_entry->ops->lock_h)( mt_entry ); 203140c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2031410: 90 10 00 01 mov %g1, %o0 2031414: c2 00 80 00 ld [ %g2 ], %g1 2031418: 9f c0 40 00 call %g1 203141c: f0 26 e0 10 st %i0, [ %i3 + 0x10 ] rtems_filesystem_instance_lock( &iop->pathinfo ); rtems_filesystem_location_clone( &diop->pathinfo, &iop->pathinfo ); 2031420: 92 07 60 14 add %i5, 0x14, %o1 2031424: 7f ff 9b d3 call 2018370 2031428: 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; 203142c: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 2031430: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2031434: c2 00 60 04 ld [ %g1 + 4 ], %g1 2031438: 9f c0 40 00 call %g1 203143c: 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 ); 2031440: c2 06 e0 24 ld [ %i3 + 0x24 ], %g1 2031444: 90 10 00 1b mov %i3, %o0 2031448: c2 00 40 00 ld [ %g1 ], %g1 203144c: 92 10 20 00 clr %o1 2031450: 94 10 00 1a mov %i2, %o2 2031454: 9f c0 40 00 call %g1 2031458: 96 10 20 00 clr %o3 if ( rv == 0 ) { 203145c: b0 92 20 00 orcc %o0, 0, %i0 2031460: 12 80 00 19 bne 20314c4 <== NEVER TAKEN 2031464: c2 07 20 fc ld [ %i4 + 0xfc ], %g1 rv = diop - rtems_libio_iops; 2031468: b6 26 c0 01 sub %i3, %g1, %i3 203146c: b7 3e e0 03 sra %i3, 3, %i3 2031470: 85 2e e0 03 sll %i3, 3, %g2 2031474: 83 2e e0 06 sll %i3, 6, %g1 2031478: 82 00 80 01 add %g2, %g1, %g1 203147c: 85 28 60 06 sll %g1, 6, %g2 2031480: 82 00 40 02 add %g1, %g2, %g1 2031484: 82 00 40 1b add %g1, %i3, %g1 2031488: 85 28 60 0f sll %g1, 0xf, %g2 203148c: 82 00 40 02 add %g1, %g2, %g1 2031490: 83 28 60 03 sll %g1, 3, %g1 2031494: b6 00 40 1b add %g1, %i3, %i3 2031498: 10 bf ff c0 b 2031398 203149c: b0 20 00 1b neg %i3, %i0 { rtems_libio_t *iop; int fd2; int flags; int mask; int ret = 0; 20314a0: 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; 20314a4: 10 bf ff ad b 2031358 20314a8: 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); 20314ac: 7f ff c4 24 call 202253c <__errno> 20314b0: b0 10 3f ff mov -1, %i0 20314b4: 82 10 20 09 mov 9, %g1 20314b8: c2 22 00 00 st %g1, [ %o0 ] 20314bc: 81 c7 e0 08 ret 20314c0: 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 ); 20314c4: 7f ff 5e 83 call 2008ed0 <== NOT EXECUTED 20314c8: 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) { 20314cc: 10 bf ff b4 b 203139c <== NOT EXECUTED 20314d0: 80 a6 20 00 cmp %i0, 0 <== NOT EXECUTED =============================================================================== 0200e7b0 : */ int fifo_open( pipe_control_t **pipep, rtems_libio_t *iop ) { 200e7b0: 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) { 200e7b4: 3b 00 80 8b sethi %hi(0x2022c00), %i5 200e7b8: d0 07 61 c8 ld [ %i5 + 0x1c8 ], %o0 ! 2022dc8 */ int fifo_open( pipe_control_t **pipep, rtems_libio_t *iop ) { 200e7bc: b6 10 00 18 mov %i0, %i3 static int pipe_lock(void) { rtems_status_code sc = RTEMS_SUCCESSFUL; if (pipe_semaphore == RTEMS_ID_NONE) { 200e7c0: 80 a2 20 00 cmp %o0, 0 200e7c4: 02 80 00 18 be 200e824 200e7c8: b8 17 61 c8 or %i5, 0x1c8, %i4 rtems_libio_unlock(); } if (sc == RTEMS_SUCCESSFUL) { sc = rtems_semaphore_obtain(pipe_semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT); 200e7cc: 92 10 20 00 clr %o1 200e7d0: 7f ff eb a9 call 2009674 200e7d4: 94 10 20 00 clr %o2 } if (sc == RTEMS_SUCCESSFUL) { 200e7d8: 80 a2 20 00 cmp %o0, 0 200e7dc: 12 80 00 68 bne 200e97c <== NEVER TAKEN 200e7e0: 01 00 00 00 nop err = pipe_lock(); if (err) return err; pipe = *pipep; 200e7e4: f8 06 c0 00 ld [ %i3 ], %i4 if (pipe == NULL) { 200e7e8: 80 a7 20 00 cmp %i4, 0 200e7ec: 02 80 00 1b be 200e858 200e7f0: 01 00 00 00 nop err = pipe_alloc(&pipe); if (err) goto out; } if (! PIPE_LOCK(pipe)) 200e7f4: d0 07 20 28 ld [ %i4 + 0x28 ], %o0 200e7f8: 92 10 20 00 clr %o1 200e7fc: 7f ff eb 9e call 2009674 200e800: 94 10 20 00 clr %o2 200e804: 80 a2 20 00 cmp %o0, 0 200e808: 02 80 00 7a be 200e9f0 <== ALWAYS TAKEN 200e80c: c2 06 c0 00 ld [ %i3 ], %g1 err = -EINTR; if (*pipep == NULL) { 200e810: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 200e814: 22 80 00 5c be,a 200e984 <== NOT EXECUTED 200e818: d0 07 20 2c ld [ %i4 + 0x2c ], %o0 <== NOT EXECUTED if (err) goto out; } if (! PIPE_LOCK(pipe)) err = -EINTR; 200e81c: 10 80 00 64 b 200e9ac <== NOT EXECUTED 200e820: 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 ); 200e824: 35 00 80 8c sethi %hi(0x2023000), %i2 200e828: d0 06 a0 34 ld [ %i2 + 0x34 ], %o0 ! 2023034 200e82c: 92 10 20 00 clr %o1 200e830: 7f ff eb 91 call 2009674 200e834: 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) { 200e838: c2 07 61 c8 ld [ %i5 + 0x1c8 ], %g1 200e83c: 80 a0 60 00 cmp %g1, 0 200e840: 02 80 00 43 be 200e94c <== ALWAYS TAKEN 200e844: 98 10 00 1c mov %i4, %o4 } static inline void rtems_libio_unlock( void ) { rtems_semaphore_release( rtems_libio_semaphore ); 200e848: 7f ff eb db call 20097b4 <== NOT EXECUTED 200e84c: d0 06 a0 34 ld [ %i2 + 0x34 ], %o0 <== NOT EXECUTED 200e850: 10 bf ff df b 200e7cc <== NOT EXECUTED 200e854: d0 07 61 c8 ld [ %i5 + 0x1c8 ], %o0 <== NOT EXECUTED { static char c = 'a'; pipe_control_t *pipe; int err = -ENOMEM; pipe = malloc(sizeof(pipe_control_t)); 200e858: 7f ff d9 d3 call 2004fa4 200e85c: 90 10 20 34 mov 0x34, %o0 if (pipe == NULL) 200e860: b8 92 20 00 orcc %o0, 0, %i4 200e864: 02 80 00 61 be 200e9e8 <== NEVER TAKEN 200e868: 82 10 22 00 mov 0x200, %g1 return err; memset(pipe, 0, sizeof(pipe_control_t)); 200e86c: c0 27 00 00 clr [ %i4 ] 200e870: c0 27 20 08 clr [ %i4 + 8 ] 200e874: c0 27 20 0c clr [ %i4 + 0xc ] 200e878: c0 27 20 10 clr [ %i4 + 0x10 ] 200e87c: c0 27 20 14 clr [ %i4 + 0x14 ] 200e880: c0 27 20 18 clr [ %i4 + 0x18 ] 200e884: c0 27 20 1c clr [ %i4 + 0x1c ] 200e888: c0 27 20 20 clr [ %i4 + 0x20 ] 200e88c: c0 27 20 24 clr [ %i4 + 0x24 ] 200e890: c0 27 20 28 clr [ %i4 + 0x28 ] 200e894: c0 27 20 2c clr [ %i4 + 0x2c ] 200e898: c0 27 20 30 clr [ %i4 + 0x30 ] pipe->Size = PIPE_BUF; pipe->Buffer = malloc(pipe->Size); 200e89c: 90 10 22 00 mov 0x200, %o0 200e8a0: 7f ff d9 c1 call 2004fa4 200e8a4: c2 27 20 04 st %g1, [ %i4 + 4 ] if (! pipe->Buffer) 200e8a8: 80 a2 20 00 cmp %o0, 0 200e8ac: 02 80 00 4d be 200e9e0 <== NEVER TAKEN 200e8b0: d0 27 00 00 st %o0, [ %i4 ] goto err_buf; err = -ENOMEM; if (rtems_barrier_create( rtems_build_name ('P', 'I', 'r', c), 200e8b4: 35 00 80 89 sethi %hi(0x2022400), %i2 200e8b8: d0 4e a3 00 ldsb [ %i2 + 0x300 ], %o0 ! 2022700 if (! pipe->Buffer) goto err_buf; err = -ENOMEM; if (rtems_barrier_create( 200e8bc: 31 14 12 5c sethi %hi(0x50497000), %i0 200e8c0: 82 16 22 00 or %i0, 0x200, %g1 ! 50497200 200e8c4: 92 10 20 00 clr %o1 200e8c8: 94 10 20 00 clr %o2 200e8cc: 90 12 00 01 or %o0, %g1, %o0 200e8d0: 40 00 04 48 call 200f9f0 200e8d4: 96 07 20 2c add %i4, 0x2c, %o3 200e8d8: 80 a2 20 00 cmp %o0, 0 200e8dc: 12 80 00 3f bne 200e9d8 200e8e0: d0 4e a3 00 ldsb [ %i2 + 0x300 ], %o0 rtems_build_name ('P', 'I', 'r', c), RTEMS_BARRIER_MANUAL_RELEASE, 0, &pipe->readBarrier) != RTEMS_SUCCESSFUL) goto err_rbar; if (rtems_barrier_create( 200e8e4: 03 14 12 5d sethi %hi(0x50497400), %g1 200e8e8: 82 10 63 00 or %g1, 0x300, %g1 ! 50497700 200e8ec: 92 10 20 00 clr %o1 200e8f0: 94 10 20 00 clr %o2 200e8f4: 90 12 00 01 or %o0, %g1, %o0 200e8f8: 40 00 04 3e call 200f9f0 200e8fc: 96 07 20 30 add %i4, 0x30, %o3 200e900: 80 a2 20 00 cmp %o0, 0 200e904: 12 80 00 33 bne 200e9d0 200e908: d0 4e a3 00 ldsb [ %i2 + 0x300 ], %o0 rtems_build_name ('P', 'I', 'w', c), RTEMS_BARRIER_MANUAL_RELEASE, 0, &pipe->writeBarrier) != RTEMS_SUCCESSFUL) goto err_wbar; if (rtems_semaphore_create( 200e90c: b0 16 23 00 or %i0, 0x300, %i0 200e910: 92 10 20 01 mov 1, %o1 200e914: 90 12 00 18 or %o0, %i0, %o0 200e918: 94 10 20 10 mov 0x10, %o2 200e91c: 96 10 20 00 clr %o3 200e920: 7f ff ea ac call 20093d0 200e924: 98 07 20 28 add %i4, 0x28, %o4 200e928: 80 a2 20 00 cmp %o0, 0 200e92c: 12 80 00 27 bne 200e9c8 200e930: c2 4e a3 00 ldsb [ %i2 + 0x300 ], %g1 #ifdef RTEMS_POSIX_API pipe_interruptible(pipe); #endif *pipep = pipe; if (c ++ == 'z') 200e934: 80 a0 60 7a cmp %g1, 0x7a 200e938: 02 80 00 21 be 200e9bc 200e93c: c4 0e a3 00 ldub [ %i2 + 0x300 ], %g2 200e940: 84 00 a0 01 inc %g2 200e944: 10 bf ff ac b 200e7f4 200e948: c4 2e a3 00 stb %g2, [ %i2 + 0x300 ] if (pipe_semaphore == RTEMS_ID_NONE) { rtems_libio_lock(); if (pipe_semaphore == RTEMS_ID_NONE) { sc = rtems_semaphore_create( 200e94c: 92 10 20 01 mov 1, %o1 200e950: 94 10 20 54 mov 0x54, %o2 200e954: 96 10 20 00 clr %o3 200e958: 11 14 12 54 sethi %hi(0x50495000), %o0 200e95c: 7f ff ea 9d call 20093d0 200e960: 90 12 20 45 or %o0, 0x45, %o0 ! 50495045 200e964: b8 10 00 08 mov %o0, %i4 200e968: 7f ff eb 93 call 20097b4 200e96c: d0 06 a0 34 ld [ %i2 + 0x34 ], %o0 } rtems_libio_unlock(); } if (sc == RTEMS_SUCCESSFUL) { 200e970: 80 a7 20 00 cmp %i4, 0 200e974: 02 bf ff 96 be 200e7cc 200e978: d0 07 61 c8 ld [ %i5 + 0x1c8 ], %o0 if (pipe->Writers ++ == 0) PIPE_WAKEUPREADERS(pipe); if (pipe->Readers == 0 && LIBIO_NODELAY(iop)) { PIPE_UNLOCK(pipe); err = -ENXIO; 200e97c: 81 c7 e0 08 ret 200e980: 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); 200e984: 40 00 04 4d call 200fab8 <== NOT EXECUTED 200e988: b0 10 3f fc mov -4, %i0 <== NOT EXECUTED rtems_barrier_delete(pipe->writeBarrier); 200e98c: 40 00 04 4b call 200fab8 <== NOT EXECUTED 200e990: d0 07 20 30 ld [ %i4 + 0x30 ], %o0 <== NOT EXECUTED rtems_semaphore_delete(pipe->Semaphore); 200e994: 7f ff eb 01 call 2009598 <== NOT EXECUTED 200e998: d0 07 20 28 ld [ %i4 + 0x28 ], %o0 <== NOT EXECUTED free(pipe->Buffer); 200e99c: 7f ff d8 51 call 2004ae0 <== NOT EXECUTED 200e9a0: d0 07 00 00 ld [ %i4 ], %o0 <== NOT EXECUTED free(pipe); 200e9a4: 7f ff d8 4f call 2004ae0 <== NOT EXECUTED 200e9a8: 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); 200e9ac: 7f ff eb 82 call 20097b4 200e9b0: d0 07 61 c8 ld [ %i5 + 0x1c8 ], %o0 return 0; out_error: pipe_release(pipep, iop); return err; } 200e9b4: 81 c7 e0 08 ret 200e9b8: 81 e8 00 00 restore pipe_interruptible(pipe); #endif *pipep = pipe; if (c ++ == 'z') c = 'a'; 200e9bc: 82 10 20 61 mov 0x61, %g1 200e9c0: 10 bf ff 8d b 200e7f4 200e9c4: c2 2e a3 00 stb %g1, [ %i2 + 0x300 ] return 0; err_sem: rtems_barrier_delete(pipe->writeBarrier); 200e9c8: 40 00 04 3c call 200fab8 200e9cc: d0 07 20 30 ld [ %i4 + 0x30 ], %o0 err_wbar: rtems_barrier_delete(pipe->readBarrier); 200e9d0: 40 00 04 3a call 200fab8 200e9d4: d0 07 20 2c ld [ %i4 + 0x2c ], %o0 err_rbar: free(pipe->Buffer); 200e9d8: 7f ff d8 42 call 2004ae0 200e9dc: d0 07 00 00 ld [ %i4 ], %o0 err_buf: free(pipe); 200e9e0: 7f ff d8 40 call 2004ae0 200e9e4: 90 10 00 1c mov %i4, %o0 if (err) goto out; } if (! PIPE_LOCK(pipe)) err = -EINTR; 200e9e8: 10 bf ff f1 b 200e9ac 200e9ec: b0 10 3f f4 mov -12, %i0 if (*pipep == NULL) { 200e9f0: 80 a0 60 00 cmp %g1, 0 200e9f4: 22 80 00 02 be,a 200e9fc 200e9f8: f8 26 c0 00 st %i4, [ %i3 ] #ifdef RTEMS_DEBUG rtems_status_code sc = RTEMS_SUCCESSFUL; sc = #endif rtems_semaphore_release(pipe_semaphore); 200e9fc: 7f ff eb 6e call 20097b4 200ea00: d0 07 61 c8 ld [ %i5 + 0x1c8 ], %o0 err = pipe_new(pipep); if (err) return err; pipe = *pipep; switch (LIBIO_ACCMODE(iop)) { 200ea04: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200ea08: 82 08 60 06 and %g1, 6, %g1 200ea0c: 80 a0 60 04 cmp %g1, 4 200ea10: 02 80 00 0c be 200ea40 200ea14: fa 06 c0 00 ld [ %i3 ], %i5 200ea18: 80 a0 60 06 cmp %g1, 6 200ea1c: 02 80 00 58 be 200eb7c 200ea20: 80 a0 60 02 cmp %g1, 2 200ea24: 22 80 00 31 be,a 200eae8 <== ALWAYS TAKEN 200ea28: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 if (pipe->Writers ++ == 0) PIPE_WAKEUPREADERS(pipe); break; } PIPE_UNLOCK(pipe); 200ea2c: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 <== NOT EXECUTED 200ea30: 7f ff eb 61 call 20097b4 200ea34: b0 10 20 00 clr %i0 return 0; 200ea38: 81 c7 e0 08 ret 200ea3c: 81 e8 00 00 restore break; case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; if (pipe->Writers ++ == 0) 200ea40: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 } while (prevCounter == pipe->writerCounter); } break; case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; 200ea44: c4 07 60 24 ld [ %i5 + 0x24 ], %g2 if (pipe->Writers ++ == 0) 200ea48: 86 00 60 01 add %g1, 1, %g3 } while (prevCounter == pipe->writerCounter); } break; case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; 200ea4c: 84 00 a0 01 inc %g2 if (pipe->Writers ++ == 0) 200ea50: c6 27 60 14 st %g3, [ %i5 + 0x14 ] 200ea54: 80 a0 60 00 cmp %g1, 0 200ea58: 02 80 00 68 be 200ebf8 <== ALWAYS TAKEN 200ea5c: c4 27 60 24 st %g2, [ %i5 + 0x24 ] PIPE_WAKEUPREADERS(pipe); if (pipe->Readers == 0 && LIBIO_NODELAY(iop)) { 200ea60: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 <== NOT EXECUTED 200ea64: 80 a0 60 00 cmp %g1, 0 200ea68: 32 bf ff f2 bne,a 200ea30 200ea6c: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 200ea70: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200ea74: 80 88 60 01 btst 1, %g1 200ea78: 32 80 00 65 bne,a 200ec0c 200ea7c: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 err = -ENXIO; goto out_error; } if (pipe->Readers == 0) { prevCounter = pipe->readerCounter; 200ea80: 10 80 00 0c b 200eab0 200ea84: 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)) 200ea88: 92 10 20 00 clr %o1 200ea8c: 7f ff ea fa call 2009674 200ea90: 94 10 20 00 clr %o2 200ea94: 80 a2 20 00 cmp %o0, 0 200ea98: 12 80 00 0f bne 200ead4 <== NEVER TAKEN 200ea9c: b0 10 3f fc mov -4, %i0 goto out_error; } while (prevCounter == pipe->readerCounter); 200eaa0: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200eaa4: 80 a0 40 1c cmp %g1, %i4 200eaa8: 32 bf ff e2 bne,a 200ea30 <== ALWAYS TAKEN 200eaac: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 if (pipe->Readers == 0) { prevCounter = pipe->readerCounter; err = -EINTR; do { PIPE_UNLOCK(pipe); 200eab0: 7f ff eb 41 call 20097b4 200eab4: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 if (! PIPE_WRITEWAIT(pipe)) 200eab8: d0 07 60 30 ld [ %i5 + 0x30 ], %o0 200eabc: 40 00 04 40 call 200fbbc 200eac0: 92 10 20 00 clr %o1 200eac4: 80 a2 20 00 cmp %o0, 0 200eac8: 22 bf ff f0 be,a 200ea88 <== ALWAYS TAKEN 200eacc: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 /* Not an error */ if (LIBIO_NODELAY(iop)) break; prevCounter = pipe->writerCounter; err = -EINTR; 200ead0: b0 10 3f fc mov -4, %i0 <== NOT EXECUTED PIPE_UNLOCK(pipe); return 0; out_error: pipe_release(pipep, iop); 200ead4: 90 10 00 1b mov %i3, %o0 <== NOT EXECUTED 200ead8: 7f ff fe f7 call 200e6b4 200eadc: 92 10 00 19 mov %i1, %o1 return err; 200eae0: 81 c7 e0 08 ret 200eae4: 81 e8 00 00 restore return err; pipe = *pipep; switch (LIBIO_ACCMODE(iop)) { case LIBIO_FLAGS_READ: pipe->readerCounter ++; 200eae8: c4 07 60 20 ld [ %i5 + 0x20 ], %g2 if (pipe->Readers ++ == 0) 200eaec: 86 00 60 01 add %g1, 1, %g3 return err; pipe = *pipep; switch (LIBIO_ACCMODE(iop)) { case LIBIO_FLAGS_READ: pipe->readerCounter ++; 200eaf0: 84 00 a0 01 inc %g2 if (pipe->Readers ++ == 0) 200eaf4: c6 27 60 10 st %g3, [ %i5 + 0x10 ] 200eaf8: 80 a0 60 00 cmp %g1, 0 200eafc: 02 80 00 35 be 200ebd0 <== ALWAYS TAKEN 200eb00: c4 27 60 20 st %g2, [ %i5 + 0x20 ] PIPE_WAKEUPWRITERS(pipe); if (pipe->Writers == 0) { 200eb04: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 <== NOT EXECUTED 200eb08: 80 a0 60 00 cmp %g1, 0 200eb0c: 32 bf ff c9 bne,a 200ea30 200eb10: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 /* Not an error */ if (LIBIO_NODELAY(iop)) 200eb14: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200eb18: 80 88 60 01 btst 1, %g1 200eb1c: 32 bf ff c5 bne,a 200ea30 200eb20: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 break; prevCounter = pipe->writerCounter; 200eb24: 10 80 00 0c b 200eb54 200eb28: 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)) 200eb2c: 92 10 20 00 clr %o1 200eb30: 7f ff ea d1 call 2009674 200eb34: 94 10 20 00 clr %o2 200eb38: 80 a2 20 00 cmp %o0, 0 200eb3c: 12 bf ff e6 bne 200ead4 <== NEVER TAKEN 200eb40: b0 10 3f fc mov -4, %i0 goto out_error; } while (prevCounter == pipe->writerCounter); 200eb44: c2 07 60 24 ld [ %i5 + 0x24 ], %g1 200eb48: 80 a0 40 1c cmp %g1, %i4 200eb4c: 32 bf ff b9 bne,a 200ea30 <== ALWAYS TAKEN 200eb50: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 prevCounter = pipe->writerCounter; err = -EINTR; /* Wait until a writer opens the pipe */ do { PIPE_UNLOCK(pipe); 200eb54: 7f ff eb 18 call 20097b4 200eb58: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 if (! PIPE_READWAIT(pipe)) 200eb5c: d0 07 60 2c ld [ %i5 + 0x2c ], %o0 200eb60: 40 00 04 17 call 200fbbc 200eb64: 92 10 20 00 clr %o1 200eb68: 80 a2 20 00 cmp %o0, 0 200eb6c: 22 bf ff f0 be,a 200eb2c <== ALWAYS TAKEN 200eb70: d0 07 60 28 ld [ %i5 + 0x28 ], %o0 /* Not an error */ if (LIBIO_NODELAY(iop)) break; prevCounter = pipe->writerCounter; err = -EINTR; 200eb74: 10 bf ff d8 b 200ead4 <== NOT EXECUTED 200eb78: b0 10 3f fc mov -4, %i0 <== NOT EXECUTED } break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; if (pipe->Readers ++ == 0) 200eb7c: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 } while (prevCounter == pipe->readerCounter); } break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; 200eb80: c4 07 60 20 ld [ %i5 + 0x20 ], %g2 if (pipe->Readers ++ == 0) 200eb84: 86 00 60 01 add %g1, 1, %g3 } while (prevCounter == pipe->readerCounter); } break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; 200eb88: 84 00 a0 01 inc %g2 if (pipe->Readers ++ == 0) 200eb8c: c6 27 60 10 st %g3, [ %i5 + 0x10 ] 200eb90: 80 a0 60 00 cmp %g1, 0 200eb94: 02 80 00 14 be 200ebe4 <== ALWAYS TAKEN 200eb98: c4 27 60 20 st %g2, [ %i5 + 0x20 ] PIPE_WAKEUPWRITERS(pipe); pipe->writerCounter ++; if (pipe->Writers ++ == 0) 200eb9c: 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 ++; 200eba0: c4 07 60 24 ld [ %i5 + 0x24 ], %g2 if (pipe->Writers ++ == 0) 200eba4: 86 00 60 01 add %g1, 1, %g3 case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; if (pipe->Readers ++ == 0) PIPE_WAKEUPWRITERS(pipe); pipe->writerCounter ++; 200eba8: 84 00 a0 01 inc %g2 if (pipe->Writers ++ == 0) 200ebac: c6 27 60 14 st %g3, [ %i5 + 0x14 ] 200ebb0: 80 a0 60 00 cmp %g1, 0 200ebb4: 12 bf ff 9e bne 200ea2c <== NEVER TAKEN 200ebb8: c4 27 60 24 st %g2, [ %i5 + 0x24 ] PIPE_WAKEUPREADERS(pipe); 200ebbc: d0 07 60 2c ld [ %i5 + 0x2c ], %o0 200ebc0: 40 00 03 e7 call 200fb5c 200ebc4: 92 07 bf fc add %fp, -4, %o1 break; } PIPE_UNLOCK(pipe); 200ebc8: 10 bf ff 9a b 200ea30 200ebcc: 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); 200ebd0: d0 07 60 30 ld [ %i5 + 0x30 ], %o0 200ebd4: 40 00 03 e2 call 200fb5c 200ebd8: 92 07 bf fc add %fp, -4, %o1 if (pipe->Writers == 0) { 200ebdc: 10 bf ff cb b 200eb08 200ebe0: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 break; case LIBIO_FLAGS_READ_WRITE: pipe->readerCounter ++; if (pipe->Readers ++ == 0) PIPE_WAKEUPWRITERS(pipe); 200ebe4: d0 07 60 30 ld [ %i5 + 0x30 ], %o0 200ebe8: 40 00 03 dd call 200fb5c 200ebec: 92 07 bf fc add %fp, -4, %o1 pipe->writerCounter ++; if (pipe->Writers ++ == 0) 200ebf0: 10 bf ff ec b 200eba0 200ebf4: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 case LIBIO_FLAGS_WRITE: pipe->writerCounter ++; if (pipe->Writers ++ == 0) PIPE_WAKEUPREADERS(pipe); 200ebf8: d0 07 60 2c ld [ %i5 + 0x2c ], %o0 200ebfc: 40 00 03 d8 call 200fb5c 200ec00: 92 07 bf fc add %fp, -4, %o1 if (pipe->Readers == 0 && LIBIO_NODELAY(iop)) { 200ec04: 10 bf ff 98 b 200ea64 200ec08: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 PIPE_UNLOCK(pipe); 200ec0c: 7f ff ea ea call 20097b4 200ec10: b0 10 3f fa mov -6, %i0 err = -ENXIO; goto out_error; 200ec14: 10 bf ff b1 b 200ead8 200ec18: 90 10 00 1b mov %i3, %o0 =============================================================================== 0200a034 : long fpathconf( int fd, int name ) { 200a034: 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); 200a038: 03 00 80 48 sethi %hi(0x2012000), %g1 200a03c: c2 00 60 b4 ld [ %g1 + 0xb4 ], %g1 ! 20120b4 200a040: 80 a6 00 01 cmp %i0, %g1 200a044: 1a 80 00 3e bcc 200a13c <== ALWAYS TAKEN 200a048: 03 00 80 4a sethi %hi(0x2012800), %g1 iop = rtems_libio_iop(fd); 200a04c: c2 00 61 24 ld [ %g1 + 0x124 ], %g1 ! 2012924 <== NOT EXECUTED 200a050: 85 2e 20 03 sll %i0, 3, %g2 <== NOT EXECUTED 200a054: b1 2e 20 06 sll %i0, 6, %i0 <== NOT EXECUTED 200a058: b0 26 00 02 sub %i0, %g2, %i0 <== NOT EXECUTED 200a05c: b0 00 40 18 add %g1, %i0, %i0 <== NOT EXECUTED rtems_libio_check_is_open(iop); 200a060: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 <== NOT EXECUTED 200a064: 80 88 61 00 btst 0x100, %g1 <== NOT EXECUTED 200a068: 02 80 00 35 be 200a13c <== NOT EXECUTED 200a06c: 80 a6 60 0b cmp %i1, 0xb <== NOT EXECUTED /* * Now process the information request. */ the_limits = iop->pathinfo.mt_entry->pathconf_limits_and_options; 200a070: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 <== NOT EXECUTED switch ( name ) { 200a074: 08 80 00 08 bleu 200a094 <== NOT EXECUTED 200a078: c2 00 60 2c ld [ %g1 + 0x2c ], %g1 <== NOT EXECUTED break; case _PC_SYNC_IO: return_value = the_limits->posix_sync_io; break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 200a07c: 40 00 06 27 call 200b918 <__errno> <== NOT EXECUTED 200a080: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 200a084: 82 10 20 16 mov 0x16, %g1 <== NOT EXECUTED 200a088: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED break; } return return_value; } 200a08c: 81 c7 e0 08 ret <== NOT EXECUTED 200a090: 81 e8 00 00 restore <== NOT EXECUTED * Now process the information request. */ the_limits = iop->pathinfo.mt_entry->pathconf_limits_and_options; switch ( name ) { 200a094: b3 2e 60 02 sll %i1, 2, %i1 <== NOT EXECUTED 200a098: 05 00 80 28 sethi %hi(0x200a000), %g2 <== NOT EXECUTED 200a09c: 84 10 a0 04 or %g2, 4, %g2 ! 200a004 <_close_r+0x10> <== NOT EXECUTED 200a0a0: c4 00 80 19 ld [ %g2 + %i1 ], %g2 <== NOT EXECUTED 200a0a4: 81 c0 80 00 jmp %g2 <== NOT EXECUTED 200a0a8: 01 00 00 00 nop <== NOT EXECUTED break; case _PC_ASYNC_IO: return_value = the_limits->posix_async_io; break; case _PC_PRIO_IO: return_value = the_limits->posix_prio_io; 200a0ac: f0 00 60 24 ld [ %g1 + 0x24 ], %i0 <== NOT EXECUTED break; 200a0b0: 81 c7 e0 08 ret <== NOT EXECUTED 200a0b4: 81 e8 00 00 restore <== NOT EXECUTED break; case _PC_VDISABLE: return_value = the_limits->posix_vdisable; break; case _PC_ASYNC_IO: return_value = the_limits->posix_async_io; 200a0b8: f0 00 60 18 ld [ %g1 + 0x18 ], %i0 <== NOT EXECUTED break; 200a0bc: 81 c7 e0 08 ret <== NOT EXECUTED 200a0c0: 81 e8 00 00 restore <== NOT EXECUTED break; case _PC_NO_TRUNC: return_value = the_limits->posix_no_trunc; break; case _PC_VDISABLE: return_value = the_limits->posix_vdisable; 200a0c4: f0 00 60 2c ld [ %g1 + 0x2c ], %i0 <== NOT EXECUTED break; 200a0c8: 81 c7 e0 08 ret <== NOT EXECUTED 200a0cc: 81 e8 00 00 restore <== NOT EXECUTED break; case _PC_CHOWN_RESTRICTED: return_value = the_limits->posix_chown_restrictions; break; case _PC_NO_TRUNC: return_value = the_limits->posix_no_trunc; 200a0d0: f0 00 60 20 ld [ %g1 + 0x20 ], %i0 <== NOT EXECUTED break; 200a0d4: 81 c7 e0 08 ret <== NOT EXECUTED 200a0d8: 81 e8 00 00 restore <== NOT EXECUTED break; case _PC_PIPE_BUF: return_value = the_limits->pipe_buf; break; case _PC_CHOWN_RESTRICTED: return_value = the_limits->posix_chown_restrictions; 200a0dc: f0 00 60 1c ld [ %g1 + 0x1c ], %i0 <== NOT EXECUTED break; 200a0e0: 81 c7 e0 08 ret <== NOT EXECUTED 200a0e4: 81 e8 00 00 restore <== NOT EXECUTED break; case _PC_PATH_MAX: return_value = the_limits->path_max; break; case _PC_PIPE_BUF: return_value = the_limits->pipe_buf; 200a0e8: f0 00 60 14 ld [ %g1 + 0x14 ], %i0 <== NOT EXECUTED break; 200a0ec: 81 c7 e0 08 ret <== NOT EXECUTED 200a0f0: 81 e8 00 00 restore <== NOT EXECUTED break; case _PC_NAME_MAX: return_value = the_limits->name_max; break; case _PC_PATH_MAX: return_value = the_limits->path_max; 200a0f4: f0 00 60 10 ld [ %g1 + 0x10 ], %i0 <== NOT EXECUTED break; 200a0f8: 81 c7 e0 08 ret <== NOT EXECUTED 200a0fc: 81 e8 00 00 restore <== NOT EXECUTED break; case _PC_MAX_INPUT: return_value = the_limits->max_input; break; case _PC_NAME_MAX: return_value = the_limits->name_max; 200a100: f0 00 60 0c ld [ %g1 + 0xc ], %i0 <== NOT EXECUTED break; 200a104: 81 c7 e0 08 ret <== NOT EXECUTED 200a108: 81 e8 00 00 restore <== NOT EXECUTED break; case _PC_MAX_CANON: return_value = the_limits->max_canon; break; case _PC_MAX_INPUT: return_value = the_limits->max_input; 200a10c: f0 00 60 08 ld [ %g1 + 8 ], %i0 <== NOT EXECUTED break; 200a110: 81 c7 e0 08 ret <== NOT EXECUTED 200a114: 81 e8 00 00 restore <== NOT EXECUTED switch ( name ) { case _PC_LINK_MAX: return_value = the_limits->link_max; break; case _PC_MAX_CANON: return_value = the_limits->max_canon; 200a118: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED break; 200a11c: 81 c7 e0 08 ret <== NOT EXECUTED 200a120: 81 e8 00 00 restore <== NOT EXECUTED the_limits = iop->pathinfo.mt_entry->pathconf_limits_and_options; switch ( name ) { case _PC_LINK_MAX: return_value = the_limits->link_max; 200a124: f0 00 40 00 ld [ %g1 ], %i0 <== NOT EXECUTED break; 200a128: 81 c7 e0 08 ret <== NOT EXECUTED 200a12c: 81 e8 00 00 restore <== NOT EXECUTED break; case _PC_PRIO_IO: return_value = the_limits->posix_prio_io; break; case _PC_SYNC_IO: return_value = the_limits->posix_sync_io; 200a130: f0 00 60 28 ld [ %g1 + 0x28 ], %i0 <== NOT EXECUTED break; 200a134: 81 c7 e0 08 ret <== NOT EXECUTED 200a138: 81 e8 00 00 restore <== NOT EXECUTED 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); 200a13c: 40 00 05 f7 call 200b918 <__errno> 200a140: b0 10 3f ff mov -1, %i0 200a144: 82 10 20 09 mov 9, %g1 200a148: c2 22 00 00 st %g1, [ %o0 ] 200a14c: 81 c7 e0 08 ret 200a150: 81 e8 00 00 restore =============================================================================== 020038e4 : #include void free( void *ptr ) { 20038e4: 9d e3 bf a0 save %sp, -96, %sp MSBUMP(free_calls, 1); 20038e8: 03 00 80 74 sethi %hi(0x201d000), %g1 20038ec: 82 10 60 b0 or %g1, 0xb0, %g1 ! 201d0b0 20038f0: c4 00 60 0c ld [ %g1 + 0xc ], %g2 #include void free( void *ptr ) { 20038f4: b2 10 00 18 mov %i0, %i1 MSBUMP(free_calls, 1); 20038f8: 84 00 a0 01 inc %g2 if ( !ptr ) 20038fc: 80 a6 20 00 cmp %i0, 0 2003900: 02 80 00 15 be 2003954 2003904: 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()) && 2003908: 03 00 80 74 sethi %hi(0x201d000), %g1 200390c: c2 00 63 70 ld [ %g1 + 0x370 ], %g1 ! 201d370 <_System_state_Current> 2003910: 80 a0 60 03 cmp %g1, 3 2003914: 02 80 00 17 be 2003970 <== ALWAYS TAKEN 2003918: 03 00 80 73 sethi %hi(0x201cc00), %g1 } /* * If configured, update the statistics */ if ( rtems_malloc_statistics_helpers ) 200391c: c2 00 60 f8 ld [ %g1 + 0xf8 ], %g1 ! 201ccf8 2003920: 80 a0 60 00 cmp %g1, 0 2003924: 02 80 00 06 be 200393c 2003928: 3b 00 80 71 sethi %hi(0x201c400), %i5 (*rtems_malloc_statistics_helpers->at_free)(ptr); 200392c: c2 00 60 08 ld [ %g1 + 8 ], %g1 2003930: 9f c0 40 00 call %g1 2003934: 90 10 00 19 mov %i1, %o0 if ( !_Protected_heap_Free( RTEMS_Malloc_Heap, ptr ) ) { 2003938: 3b 00 80 71 sethi %hi(0x201c400), %i5 200393c: d0 07 61 bc ld [ %i5 + 0x1bc ], %o0 ! 201c5bc 2003940: 40 00 18 a3 call 2009bcc <_Protected_heap_Free> 2003944: 92 10 00 19 mov %i1, %o1 2003948: 80 8a 20 ff btst 0xff, %o0 200394c: 02 80 00 04 be 200395c 2003950: c2 07 61 bc ld [ %i5 + 0x1bc ], %g1 2003954: 81 c7 e0 08 ret 2003958: 81 e8 00 00 restore printk( "Program heap: free of bad pointer %p -- range %p - %p \n", 200395c: 31 00 80 6c sethi %hi(0x201b000), %i0 2003960: f4 00 60 18 ld [ %g1 + 0x18 ], %i2 2003964: f6 00 60 1c ld [ %g1 + 0x1c ], %i3 2003968: 40 00 03 91 call 20047ac 200396c: 91 ee 20 70 restore %i0, 0x70, %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() ) { 2003970: 40 00 00 6b call 2003b1c 2003974: 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()) && 2003978: 80 8a 20 ff btst 0xff, %o0 200397c: 12 bf ff e8 bne 200391c 2003980: 03 00 80 73 sethi %hi(0x201cc00), %g1 !malloc_is_system_state_OK() ) { malloc_deferred_free(ptr); 2003984: 40 00 00 87 call 2003ba0 2003988: 81 e8 00 00 restore =============================================================================== 02019f04 : int fstat( int fd, struct stat *sbuf ) { 2019f04: 9d e3 bf a0 save %sp, -96, %sp rtems_libio_t *iop; /* * Check to see if we were passed a valid pointer. */ if ( !sbuf ) 2019f08: 80 a6 60 00 cmp %i1, 0 2019f0c: 02 80 00 1f be 2019f88 <== NEVER TAKEN 2019f10: 03 00 80 71 sethi %hi(0x201c400), %g1 rtems_set_errno_and_return_minus_one( EFAULT ); /* * Now process the stat() request. */ iop = rtems_libio_iop( fd ); 2019f14: c2 00 62 00 ld [ %g1 + 0x200 ], %g1 ! 201c600 2019f18: 80 a6 00 01 cmp %i0, %g1 2019f1c: 1a 80 00 15 bcc 2019f70 2019f20: 03 00 80 74 sethi %hi(0x201d000), %g1 2019f24: c2 00 60 98 ld [ %g1 + 0x98 ], %g1 ! 201d098 2019f28: 85 2e 20 03 sll %i0, 3, %g2 2019f2c: b1 2e 20 06 sll %i0, 6, %i0 2019f30: b0 26 00 02 sub %i0, %g2, %i0 2019f34: b0 00 40 18 add %g1, %i0, %i0 rtems_libio_check_fd( fd ); rtems_libio_check_is_open(iop); 2019f38: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 2019f3c: 80 88 61 00 btst 0x100, %g1 2019f40: 02 80 00 0c be 2019f70 2019f44: 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) ); 2019f48: 92 10 20 00 clr %o1 2019f4c: 7f ff d9 0a call 2010374 2019f50: 90 10 00 19 mov %i1, %o0 return (*iop->pathinfo.handlers->fstat_h)( &iop->pathinfo, sbuf ); 2019f54: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 2019f58: 90 06 20 14 add %i0, 0x14, %o0 2019f5c: c2 00 60 18 ld [ %g1 + 0x18 ], %g1 2019f60: 9f c0 40 00 call %g1 2019f64: 92 10 00 19 mov %i1, %o1 } 2019f68: 81 c7 e0 08 ret 2019f6c: 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); 2019f70: 7f ff d6 7d call 200f964 <__errno> 2019f74: b0 10 3f ff mov -1, %i0 2019f78: 82 10 20 09 mov 9, %g1 2019f7c: c2 22 00 00 st %g1, [ %o0 ] 2019f80: 81 c7 e0 08 ret 2019f84: 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 ); 2019f88: 7f ff d6 77 call 200f964 <__errno> <== NOT EXECUTED 2019f8c: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2019f90: 82 10 20 0e mov 0xe, %g1 <== NOT EXECUTED 2019f94: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2019f98: 81 c7 e0 08 ret <== NOT EXECUTED 2019f9c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02003674 : 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) { 2003674: 03 00 80 84 sethi %hi(0x2021000), %g1 2003678: c2 00 62 08 ld [ %g1 + 0x208 ], %g1 ! 2021208 200367c: 80 a0 40 08 cmp %g1, %o0 2003680: 08 80 00 20 bleu 2003700 <== NEVER TAKEN 2003684: 03 00 80 84 sethi %hi(0x2021000), %g1 2003688: c2 00 62 0c ld [ %g1 + 0x20c ], %g1 ! 202120c 200368c: 80 a0 60 00 cmp %g1, 0 2003690: 02 80 00 1c be 2003700 <== NEVER TAKEN 2003694: 01 00 00 00 nop rtems_disk_device_table *dtab = disktab + major; 2003698: 91 2a 20 03 sll %o0, 3, %o0 200369c: 84 00 40 08 add %g1, %o0, %g2 if (minor < dtab->size && dtab->minor != NULL) { 20036a0: c4 00 a0 04 ld [ %g2 + 4 ], %g2 20036a4: 80 a0 80 09 cmp %g2, %o1 20036a8: 08 80 00 16 bleu 2003700 <== NEVER TAKEN 20036ac: 01 00 00 00 nop 20036b0: c2 00 40 08 ld [ %g1 + %o0 ], %g1 20036b4: 80 a0 60 00 cmp %g1, 0 20036b8: 02 80 00 12 be 2003700 <== NEVER TAKEN 20036bc: 93 2a 60 02 sll %o1, 2, %o1 rtems_disk_device *dd = dtab->minor [minor]; if (dd != NULL && !lookup_only) { 20036c0: 80 a2 a0 01 cmp %o2, 1 20036c4: 12 80 00 04 bne 20036d4 20036c8: d0 00 40 09 ld [ %g1 + %o1 ], %o0 return dd; } } return NULL; } 20036cc: 81 c3 e0 08 retl 20036d0: 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) { 20036d4: 80 a2 20 00 cmp %o0, 0 20036d8: 02 bf ff fd be 20036cc <== NEVER TAKEN 20036dc: 01 00 00 00 nop if (!dd->deleted) { 20036e0: c2 0a 20 40 ldub [ %o0 + 0x40 ], %g1 20036e4: 80 a0 60 00 cmp %g1, 0 20036e8: 12 80 00 06 bne 2003700 20036ec: 01 00 00 00 nop ++dd->uses; 20036f0: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 20036f4: 82 00 60 01 inc %g1 20036f8: 81 c3 e0 08 retl 20036fc: c2 22 20 14 st %g1, [ %o0 + 0x14 ] return dd; } } return NULL; } 2003700: 81 c3 e0 08 retl 2003704: 90 10 20 00 clr %o0 =============================================================================== 02004de0 : * 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, 2004de0: 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); 2004de4: 40 00 05 e5 call 2006578 2004de8: 90 10 22 04 mov 0x204, %o0 if (s == NULL) { return RTEMS_NO_MEMORY; 2004dec: 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) 2004df0: 80 a2 20 00 cmp %o0, 0 2004df4: 02 80 00 0c be 2004e24 <== NEVER TAKEN 2004df8: ba 10 00 08 mov %o0, %i5 { return RTEMS_NO_MEMORY; } n = read(fd, s->data, RTEMS_IDE_SECTOR_SIZE); 2004dfc: 90 10 00 18 mov %i0, %o0 2004e00: 92 07 60 04 add %i5, 4, %o1 2004e04: 40 00 08 a7 call 20070a0 2004e08: 94 10 22 00 mov 0x200, %o2 if (n != RTEMS_IDE_SECTOR_SIZE) 2004e0c: 80 a2 22 00 cmp %o0, 0x200 2004e10: 02 80 00 07 be 2004e2c <== ALWAYS TAKEN 2004e14: 82 10 20 00 clr %g1 { free(s); 2004e18: 40 00 04 21 call 2005e9c <== NOT EXECUTED 2004e1c: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED return RTEMS_IO_ERROR; 2004e20: 82 10 20 1b mov 0x1b, %g1 <== NOT EXECUTED s->sector_num = sector_num; *sector = s; return RTEMS_SUCCESSFUL; } 2004e24: 81 c7 e0 08 ret <== NOT EXECUTED 2004e28: 91 e8 00 01 restore %g0, %g1, %o0 <== NOT EXECUTED { free(s); return RTEMS_IO_ERROR; } s->sector_num = sector_num; 2004e2c: f2 27 40 00 st %i1, [ %i5 ] *sector = s; 2004e30: fa 26 80 00 st %i5, [ %i2 ] return RTEMS_SUCCESSFUL; } 2004e34: 81 c7 e0 08 ret 2004e38: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 020314fc : int getdents( int dd_fd, char *dd_buf, int dd_len ) { 20314fc: 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 ); 2031500: 03 00 80 dc sethi %hi(0x2037000), %g1 2031504: c2 00 61 08 ld [ %g1 + 0x108 ], %g1 ! 2037108 2031508: 80 a6 00 01 cmp %i0, %g1 203150c: 1a 80 00 08 bcc 203152c <== NEVER TAKEN 2031510: ba 10 20 00 clr %i5 2031514: 03 00 81 1f sethi %hi(0x2047c00), %g1 2031518: fa 00 60 fc ld [ %g1 + 0xfc ], %i5 ! 2047cfc 203151c: 83 2e 20 03 sll %i0, 3, %g1 2031520: b1 2e 20 06 sll %i0, 6, %i0 2031524: b0 26 00 01 sub %i0, %g1, %i0 2031528: ba 07 40 18 add %i5, %i0, %i5 /* * Make sure we are working on a directory */ type = rtems_filesystem_node_type( &iop->pathinfo ); 203152c: 7f ff 65 8f call 200ab68 2031530: 90 07 60 14 add %i5, 0x14, %o0 if ( type != RTEMS_FILESYSTEM_DIRECTORY ) 2031534: 80 a2 20 00 cmp %o0, 0 2031538: 12 80 00 09 bne 203155c 203153c: 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 ); 2031540: c2 07 60 24 ld [ %i5 + 0x24 ], %g1 2031544: c2 00 60 08 ld [ %g1 + 8 ], %g1 2031548: 92 10 00 19 mov %i1, %o1 203154c: 9f c0 40 00 call %g1 2031550: 94 10 00 1a mov %i2, %o2 } 2031554: 81 c7 e0 08 ret 2031558: 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 ); 203155c: 7f ff c3 f8 call 202253c <__errno> 2031560: b0 10 3f ff mov -1, %i0 2031564: 82 10 20 14 mov 0x14, %g1 2031568: c2 22 00 00 st %g1, [ %o0 ] 203156c: 81 c7 e0 08 ret 2031570: 81 e8 00 00 restore =============================================================================== 0200398c : */ int gettimeofday( struct timeval *tp, void * __tz __attribute__((unused)) ) { 200398c: 9d e3 bf 98 save %sp, -104, %sp /* struct timezone* tzp = (struct timezone*) __tz; */ if ( !tp ) 2003990: b6 96 20 00 orcc %i0, 0, %i3 2003994: 02 80 00 1e be 2003a0c <== NEVER TAKEN 2003998: 01 00 00 00 nop { ISR_Level level; struct timespec now; suseconds_t useconds; _ISR_Disable(level); 200399c: 7f ff fb 72 call 2002764 20039a0: 01 00 00 00 nop 20039a4: b4 10 00 08 mov %o0, %i2 struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 20039a8: 40 00 14 f0 call 2008d68 <_TOD_Get_as_timestamp> 20039ac: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 20039b0: f8 1f bf f8 ldd [ %fp + -8 ], %i4 _TOD_Get( &now ); _ISR_Enable(level); 20039b4: 7f ff fb 70 call 2002774 20039b8: 90 10 00 1a mov %i2, %o0 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 20039bc: 90 10 00 1c mov %i4, %o0 20039c0: 92 10 00 1d mov %i5, %o1 20039c4: 94 10 20 00 clr %o2 20039c8: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 20039cc: 40 00 54 bc call 2018cbc <__divdi3> 20039d0: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 20039d4: 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); 20039d8: d2 26 c0 00 st %o1, [ %i3 ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 20039dc: 90 10 00 1c mov %i4, %o0 20039e0: 92 10 00 1d mov %i5, %o1 20039e4: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 20039e8: 40 00 55 a0 call 2019068 <__moddi3> 20039ec: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 * Timezone information ignored by the OS proper. Per email * with Eric Norum, this is how GNU/Linux, Solaris, and MacOS X * do it. This puts us in good company. */ return 0; 20039f0: b0 10 20 00 clr %i0 useconds = (suseconds_t)now.tv_nsec; useconds /= (suseconds_t)TOD_NANOSECONDS_PER_MICROSECOND; 20039f4: 90 10 00 09 mov %o1, %o0 20039f8: 40 00 53 5b call 2018764 <.div> 20039fc: 92 10 23 e8 mov 0x3e8, %o1 time->tv_sec = now.tv_sec; time->tv_usec = useconds; 2003a00: d0 26 e0 04 st %o0, [ %i3 + 4 ] } 2003a04: 81 c7 e0 08 ret 2003a08: 81 e8 00 00 restore void * __tz __attribute__((unused)) ) { /* struct timezone* tzp = (struct timezone*) __tz; */ if ( !tp ) rtems_set_errno_and_return_minus_one( EFAULT ); 2003a0c: 40 00 2f d6 call 200f964 <__errno> <== NOT EXECUTED 2003a10: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 2003a14: 82 10 20 0e mov 0xe, %g1 <== NOT EXECUTED 2003a18: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 2003a1c: 81 c7 e0 08 ret <== NOT EXECUTED 2003a20: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200effc : ssize_t imfs_dir_read( rtems_libio_t *iop, void *buffer, size_t count ) { 200effc: 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; 200f000: d0 06 20 28 ld [ %i0 + 0x28 ], %o0 (*mt_entry->ops->lock_h)( mt_entry ); 200f004: c4 02 20 0c ld [ %o0 + 0xc ], %g2 200f008: c2 00 80 00 ld [ %g2 ], %g1 200f00c: 9f c0 40 00 call %g1 200f010: 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; 200f014: e0 06 20 1c ld [ %i0 + 0x1c ], %l0 the_chain = &the_jnode->info.directory.Entries; /* Move to the first of the desired directory entries */ bytes_transferred = 0; first_entry = iop->offset; 200f018: f6 06 20 0c ld [ %i0 + 0xc ], %i3 /* 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 ); 200f01c: 90 10 00 1a mov %i2, %o0 200f020: 40 00 25 cf call 201875c <.udiv> 200f024: 92 10 21 18 mov 0x118, %o1 200f028: 83 2a 20 03 sll %o0, 3, %g1 200f02c: 91 2a 20 05 sll %o0, 5, %o0 200f030: 82 00 40 08 add %g1, %o0, %g1 200f034: b5 28 60 03 sll %g1, 3, %i2 200f038: b4 26 80 01 sub %i2, %g1, %i2 200f03c: b4 06 80 1b add %i2, %i3, %i2 /* The directory was not empty so try to move to the desired entry in chain*/ for ( 200f040: 80 a6 a0 00 cmp %i2, 0 200f044: 04 80 00 34 ble 200f114 <== NEVER TAKEN 200f048: f8 04 20 50 ld [ %l0 + 0x50 ], %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 )); 200f04c: a0 04 20 54 add %l0, 0x54, %l0 current_entry = 0, the_node = rtems_chain_first( the_chain ); current_entry < last_entry && !rtems_chain_is_tail( the_chain, the_node ); 200f050: 80 a7 00 10 cmp %i4, %l0 200f054: 02 80 00 29 be 200f0f8 200f058: a2 10 20 00 clr %l1 200f05c: ba 10 20 00 clr %i5 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 ); 200f060: 10 80 00 08 b 200f080 200f064: a6 10 21 18 mov 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 ( 200f068: 80 a6 80 1d cmp %i2, %i5 200f06c: 04 80 00 23 ble 200f0f8 <== NEVER TAKEN 200f070: f8 07 00 00 ld [ %i4 ], %i4 current_entry = 0, the_node = rtems_chain_first( the_chain ); current_entry < last_entry && !rtems_chain_is_tail( the_chain, the_node ); 200f074: 80 a7 00 10 cmp %i4, %l0 200f078: 22 80 00 21 be,a 200f0fc 200f07c: 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 ) { 200f080: 80 a6 c0 1d cmp %i3, %i5 200f084: 34 bf ff f9 bg,a 200f068 200f088: ba 07 61 18 add %i5, 0x118, %i5 /* 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; 200f08c: c2 07 20 38 ld [ %i4 + 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; 200f090: 85 3f 60 1f sra %i5, 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 ); 200f094: a4 07 20 0c add %i4, 0xc, %l2 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; 200f098: 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; 200f09c: 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; 200f0a0: fa 27 be f4 st %i5, [ %fp + -268 ] tmp_dirent.d_reclen = sizeof( struct dirent ); 200f0a4: e6 37 be f8 sth %l3, [ %fp + -264 ] the_jnode = (IMFS_jnode_t *) the_node; tmp_dirent.d_ino = the_jnode->st_ino; tmp_dirent.d_namlen = strlen( the_jnode->name ); 200f0a8: 40 00 07 8a call 2010ed0 200f0ac: 90 10 00 12 mov %l2, %o0 strcpy( tmp_dirent.d_name, the_jnode->name ); 200f0b0: 92 10 00 12 mov %l2, %o1 200f0b4: 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 ); 200f0b8: d0 37 be fa sth %o0, [ %fp + -262 ] strcpy( tmp_dirent.d_name, the_jnode->name ); 200f0bc: 40 00 04 71 call 2010280 200f0c0: 90 07 be fc add %fp, -260, %o0 memcpy( 200f0c4: 90 06 40 11 add %i1, %l1, %o0 200f0c8: 92 07 be e8 add %fp, -280, %o1 200f0cc: 40 00 04 6d call 2010280 200f0d0: 94 10 21 18 mov 0x118, %o2 buffer + bytes_transferred, (void *)&tmp_dirent, sizeof( struct dirent ) ); iop->offset += sizeof( struct dirent ); 200f0d4: c4 1e 20 08 ldd [ %i0 + 8 ], %g2 * to the end of the exisiting file, the remaining entries will be placed in * the buffer and the returned value will be equal to -m actual- times the * size of a directory entry. */ ssize_t imfs_dir_read( 200f0d8: ba 07 61 18 add %i5, 0x118, %i5 memcpy( buffer + bytes_transferred, (void *)&tmp_dirent, sizeof( struct dirent ) ); iop->offset += sizeof( struct dirent ); 200f0dc: 86 80 e1 18 addcc %g3, 0x118, %g3 200f0e0: 84 40 a0 00 addx %g2, 0, %g2 200f0e4: c4 3e 20 08 std %g2, [ %i0 + 8 ] bytes_transferred += sizeof( struct dirent ); 200f0e8: a2 04 61 18 add %l1, 0x118, %l1 /* -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 ( 200f0ec: 80 a6 80 1d cmp %i2, %i5 200f0f0: 14 bf ff e1 bg 200f074 <== NEVER TAKEN 200f0f4: f8 07 00 00 ld [ %i4 ], %i4 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; 200f0f8: d0 06 20 28 ld [ %i0 + 0x28 ], %o0 (*mt_entry->ops->unlock_h)( mt_entry ); 200f0fc: c2 02 20 0c ld [ %o0 + 0xc ], %g1 200f100: c2 00 60 04 ld [ %g1 + 4 ], %g1 200f104: 9f c0 40 00 call %g1 200f108: b0 10 00 11 mov %l1, %i0 } rtems_filesystem_instance_unlock( &iop->pathinfo ); return bytes_transferred; } 200f10c: 81 c7 e0 08 ret 200f110: 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; 200f114: 10 bf ff f9 b 200f0f8 <== NOT EXECUTED 200f118: a2 10 20 00 clr %l1 <== NOT EXECUTED =============================================================================== 02027048 : /* * Initialize useable but dummy databases */ void init_etc_passwd_group(void) { 2027048: 9d e3 bf a0 save %sp, -96, %sp FILE *fp; static char etc_passwd_initted = 0; if (etc_passwd_initted) 202704c: 03 00 81 94 sethi %hi(0x2065000), %g1 2027050: c4 48 62 48 ldsb [ %g1 + 0x248 ], %g2 ! 2065248 2027054: 80 a0 a0 00 cmp %g2, 0 2027058: 02 80 00 04 be 2027068 202705c: 84 10 20 01 mov 1, %g2 2027060: 81 c7 e0 08 ret 2027064: 81 e8 00 00 restore return; etc_passwd_initted = 1; mkdir("/etc", 0777); 2027068: 92 10 21 ff mov 0x1ff, %o1 FILE *fp; static char etc_passwd_initted = 0; if (etc_passwd_initted) return; etc_passwd_initted = 1; 202706c: c4 28 62 48 stb %g2, [ %g1 + 0x248 ] mkdir("/etc", 0777); 2027070: 11 00 81 71 sethi %hi(0x205c400), %o0 2027074: 7f ff 72 c6 call 2003b8c 2027078: 90 12 22 68 or %o0, 0x268, %o0 ! 205c668 /* * Initialize /etc/passwd */ if ((fp = fopen("/etc/passwd", "r")) != NULL) { 202707c: 39 00 81 71 sethi %hi(0x205c400), %i4 2027080: 3b 00 81 83 sethi %hi(0x2060c00), %i5 2027084: 90 17 22 70 or %i4, 0x270, %o0 2027088: 40 00 51 ab call 203b734 202708c: 92 17 62 f8 or %i5, 0x2f8, %o1 2027090: 80 a2 20 00 cmp %o0, 0 2027094: 22 80 00 0d be,a 20270c8 2027098: 90 17 22 70 or %i4, 0x270, %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); 202709c: 40 00 4f 52 call 203ade4 20270a0: 01 00 00 00 nop } /* * Initialize /etc/group */ if ((fp = fopen("/etc/group", "r")) != NULL) { 20270a4: 39 00 81 71 sethi %hi(0x205c400), %i4 20270a8: 92 17 62 f8 or %i5, 0x2f8, %o1 20270ac: 40 00 51 a2 call 203b734 20270b0: 90 17 22 e8 or %i4, 0x2e8, %o0 20270b4: 80 a2 20 00 cmp %o0, 0 20270b8: 22 80 00 11 be,a 20270fc 20270bc: 90 17 22 e8 or %i4, 0x2e8, %o0 fclose(fp); 20270c0: 40 00 4f 49 call 203ade4 20270c4: 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) { 20270c8: 13 00 81 69 sethi %hi(0x205a400), %o1 20270cc: 40 00 51 9a call 203b734 20270d0: 92 12 62 50 or %o1, 0x250, %o1 ! 205a650 20270d4: b8 92 20 00 orcc %o0, 0, %i4 20270d8: 02 bf ff f3 be 20270a4 <== NEVER TAKEN 20270dc: 92 10 20 01 mov 1, %o1 fprintf(fp, "root:*:0:0:root::/:/bin/sh\n" 20270e0: 94 10 20 66 mov 0x66, %o2 20270e4: 96 10 00 1c mov %i4, %o3 20270e8: 11 00 81 71 sethi %hi(0x205c400), %o0 20270ec: 40 00 56 5b call 203ca58 20270f0: 90 12 22 80 or %o0, 0x280, %o0 ! 205c680 "rtems:*:1:1:RTEMS Application::/:/bin/sh\n" "tty:!:2:2:tty owner::/:/bin/false\n" ); fclose(fp); 20270f4: 10 bf ff ea b 202709c 20270f8: 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) { 20270fc: 13 00 81 69 sethi %hi(0x205a400), %o1 2027100: 40 00 51 8d call 203b734 2027104: 92 12 62 50 or %o1, 0x250, %o1 ! 205a650 2027108: b0 92 20 00 orcc %o0, 0, %i0 202710c: 02 bf ff d5 be 2027060 <== NEVER TAKEN 2027110: 92 10 20 01 mov 1, %o1 fprintf( fp, "root:x:0:root\n" 2027114: 11 00 81 71 sethi %hi(0x205c400), %o0 2027118: 94 10 20 2a mov 0x2a, %o2 202711c: 96 10 00 18 mov %i0, %o3 2027120: 40 00 56 4e call 203ca58 2027124: 90 12 22 f8 or %o0, 0x2f8, %o0 "rtems:x:1:rtems\n" "tty:x:2:tty\n" ); fclose(fp); 2027128: 40 00 4f 2f call 203ade4 202712c: 81 e8 00 00 restore =============================================================================== 020065f4 : /* * Process a single input character */ static int iproc (unsigned char c, struct rtems_termios_tty *tty) { 20065f4: 9d e3 bf a0 save %sp, -96, %sp if (tty->termios.c_iflag & ISTRIP) 20065f8: c2 06 60 30 ld [ %i1 + 0x30 ], %g1 20065fc: 80 88 60 20 btst 0x20, %g1 2006600: 32 80 00 02 bne,a 2006608 <== NEVER TAKEN 2006604: b0 0e 20 7f and %i0, 0x7f, %i0 <== NOT EXECUTED c &= 0x7f; if (tty->termios.c_iflag & IUCLC) 2006608: 80 88 62 00 btst 0x200, %g1 200660c: 02 80 00 0d be 2006640 2006610: 80 a6 20 0d cmp %i0, 0xd c = tolower (c); 2006614: 05 00 80 71 sethi %hi(0x201c400), %g2 2006618: c6 00 a3 f8 ld [ %g2 + 0x3f8 ], %g3 ! 201c7f8 <__ctype_ptr__> 200661c: 84 10 00 18 mov %i0, %g2 2006620: b0 00 c0 18 add %g3, %i0, %i0 2006624: c6 0e 20 01 ldub [ %i0 + 1 ], %g3 2006628: 86 08 e0 03 and %g3, 3, %g3 200662c: 80 a0 e0 01 cmp %g3, 1 2006630: 22 80 00 02 be,a 2006638 2006634: 84 00 a0 20 add %g2, 0x20, %g2 2006638: b0 08 a0 ff and %g2, 0xff, %i0 if (c == '\r') { 200663c: 80 a6 20 0d cmp %i0, 0xd 2006640: 02 80 00 1d be 20066b4 2006644: 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)) { 2006648: 02 80 00 44 be 2006758 200664c: 80 a6 20 00 cmp %i0, 0 c = '\r'; } if ((c != '\0') && (tty->termios.c_lflag & ICANON)) { 2006650: 32 80 00 1f bne,a 20066cc <== ALWAYS TAKEN 2006654: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 } /* * FIXME: Should do IMAXBEL handling somehow */ if (tty->ccount < (CBUFSIZE-1)) { 2006658: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 <== NOT EXECUTED 200665c: 05 00 80 71 sethi %hi(0x201c400), %g2 2006660: c4 00 a2 e0 ld [ %g2 + 0x2e0 ], %g2 ! 201c6e0 2006664: 84 00 bf ff add %g2, -1, %g2 2006668: 80 a0 40 02 cmp %g1, %g2 200666c: 1a 80 00 10 bcc 20066ac <== NEVER TAKEN 2006670: 01 00 00 00 nop if (tty->termios.c_lflag & ECHO) 2006674: c4 06 60 3c ld [ %i1 + 0x3c ], %g2 2006678: 80 88 a0 08 btst 8, %g2 200667c: 12 80 00 3c bne 200676c <== ALWAYS TAKEN 2006680: 84 00 60 01 add %g1, 1, %g2 echo (c, tty); tty->cbuf[tty->ccount++] = c; 2006684: c6 06 60 1c ld [ %i1 + 0x1c ], %g3 <== NOT EXECUTED 2006688: f0 28 c0 01 stb %i0, [ %g3 + %g1 ] <== NOT EXECUTED 200668c: c4 26 60 20 st %g2, [ %i1 + 0x20 ] <== NOT EXECUTED } return 0; 2006690: 81 c7 e0 08 ret <== NOT EXECUTED 2006694: 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) 2006698: 80 a0 60 00 cmp %g1, 0 200669c: 02 80 00 04 be 20066ac 20066a0: 90 10 00 19 mov %i1, %o0 20066a4: 7f ff ff 5f call 2006420 20066a8: 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; 20066ac: 81 c7 e0 08 ret 20066b0: 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) 20066b4: 80 88 60 80 btst 0x80, %g1 20066b8: 12 bf ff fd bne 20066ac <== NEVER TAKEN 20066bc: 80 88 61 00 btst 0x100, %g1 return 0; if (tty->termios.c_iflag & ICRNL) 20066c0: 32 80 00 02 bne,a 20066c8 <== ALWAYS TAKEN 20066c4: 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)) { 20066c8: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 20066cc: 80 88 60 02 btst 2, %g1 20066d0: 22 bf ff e3 be,a 200665c 20066d4: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 if (c == tty->termios.c_cc[VERASE]) { 20066d8: c4 0e 60 43 ldub [ %i1 + 0x43 ], %g2 20066dc: 80 a0 80 18 cmp %g2, %i0 20066e0: 22 bf ff ee be,a 2006698 20066e4: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 erase (tty, 0); return 0; } else if (c == tty->termios.c_cc[VKILL]) { 20066e8: c4 0e 60 44 ldub [ %i1 + 0x44 ], %g2 20066ec: 80 a0 80 18 cmp %g2, %i0 20066f0: 22 80 00 2d be,a 20067a4 20066f4: c4 06 60 20 ld [ %i1 + 0x20 ], %g2 erase (tty, 1); return 0; } else if (c == tty->termios.c_cc[VEOF]) { 20066f8: c4 0e 60 45 ldub [ %i1 + 0x45 ], %g2 20066fc: 80 a0 80 18 cmp %g2, %i0 2006700: 02 80 00 42 be 2006808 <== NEVER TAKEN 2006704: 80 a6 20 0a cmp %i0, 0xa return 1; } else if (c == '\n') { 2006708: 02 80 00 33 be 20067d4 200670c: 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]) || 2006710: c4 0e 60 4c ldub [ %i1 + 0x4c ], %g2 2006714: 80 a0 80 18 cmp %g2, %i0 2006718: 02 80 00 07 be 2006734 <== NEVER TAKEN 200671c: 80 88 60 08 btst 8, %g1 2006720: c4 0e 60 51 ldub [ %i1 + 0x51 ], %g2 2006724: 80 a0 80 18 cmp %g2, %i0 2006728: 32 bf ff cd bne,a 200665c <== ALWAYS TAKEN 200672c: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 (c == tty->termios.c_cc[VEOL2])) { if (tty->termios.c_lflag & ECHO) 2006730: 80 88 60 08 btst 8, %g1 <== NOT EXECUTED 2006734: 12 80 00 18 bne 2006794 <== NOT EXECUTED 2006738: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED echo (c, tty); tty->cbuf[tty->ccount++] = c; 200673c: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 <== NOT EXECUTED 2006740: c6 06 60 1c ld [ %i1 + 0x1c ], %g3 <== NOT EXECUTED 2006744: 84 00 60 01 add %g1, 1, %g2 <== NOT EXECUTED 2006748: f0 28 c0 01 stb %i0, [ %g3 + %g1 ] <== NOT EXECUTED 200674c: c4 26 60 20 st %g2, [ %i1 + 0x20 ] <== NOT EXECUTED return 1; 2006750: 81 c7 e0 08 ret <== NOT EXECUTED 2006754: 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)) { 2006758: 80 88 60 40 btst 0x40, %g1 200675c: 32 bf ff db bne,a 20066c8 <== NEVER TAKEN 2006760: b0 10 20 0d mov 0xd, %i0 <== NOT EXECUTED c = '\r'; } if ((c != '\0') && (tty->termios.c_lflag & ICANON)) { 2006764: 10 bf ff da b 20066cc 2006768: 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); 200676c: 90 10 00 18 mov %i0, %o0 2006770: 7f ff ff 0b call 200639c 2006774: 92 10 00 19 mov %i1, %o1 2006778: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 tty->cbuf[tty->ccount++] = c; 200677c: c6 06 60 1c ld [ %i1 + 0x1c ], %g3 2006780: 84 00 60 01 add %g1, 1, %g2 2006784: f0 28 c0 01 stb %i0, [ %g3 + %g1 ] 2006788: c4 26 60 20 st %g2, [ %i1 + 0x20 ] } return 0; 200678c: 81 c7 e0 08 ret 2006790: 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); 2006794: 7f ff ff 02 call 200639c <== NOT EXECUTED 2006798: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED tty->cbuf[tty->ccount++] = c; 200679c: 10 bf ff e9 b 2006740 <== NOT EXECUTED 20067a0: 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) 20067a4: 80 a0 a0 00 cmp %g2, 0 20067a8: 02 bf ff c1 be 20066ac <== NEVER TAKEN 20067ac: 80 88 60 08 btst 8, %g1 return; if (lineFlag) { if (!(tty->termios.c_lflag & ECHO)) { 20067b0: 02 80 00 18 be 2006810 <== NEVER TAKEN 20067b4: 80 88 60 10 btst 0x10, %g1 tty->ccount = 0; return; } if (!(tty->termios.c_lflag & ECHOE)) { 20067b8: 02 80 00 19 be 200681c <== NEVER TAKEN 20067bc: 90 10 00 19 mov %i1, %o0 20067c0: 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; 20067c4: 7f ff ff 17 call 2006420 20067c8: b0 10 20 00 clr %i0 20067cc: 81 c7 e0 08 ret 20067d0: 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)) 20067d4: 22 80 00 06 be,a 20067ec <== NEVER TAKEN 20067d8: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 <== NOT EXECUTED echo (c, tty); 20067dc: 90 10 20 0a mov 0xa, %o0 20067e0: 7f ff fe ef call 200639c 20067e4: 92 10 00 19 mov %i1, %o1 tty->cbuf[tty->ccount++] = c; 20067e8: c2 06 60 20 ld [ %i1 + 0x20 ], %g1 20067ec: c4 06 60 1c ld [ %i1 + 0x1c ], %g2 20067f0: 86 10 20 0a mov 0xa, %g3 20067f4: c6 28 80 01 stb %g3, [ %g2 + %g1 ] 20067f8: 82 00 60 01 inc %g1 20067fc: c2 26 60 20 st %g1, [ %i1 + 0x20 ] return 1; 2006800: 81 c7 e0 08 ret 2006804: 91 e8 20 01 restore %g0, 1, %o0 if (tty->termios.c_lflag & ECHO) echo (c, tty); tty->cbuf[tty->ccount++] = c; } return 0; } 2006808: 81 c7 e0 08 ret <== NOT EXECUTED 200680c: 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; 2006810: 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; 2006814: 81 c7 e0 08 ret <== NOT EXECUTED 2006818: 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; 200681c: c0 26 60 20 clr [ %i1 + 0x20 ] <== NOT EXECUTED echo (tty->termios.c_cc[VKILL], tty); 2006820: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED 2006824: 7f ff fe de call 200639c <== NOT EXECUTED 2006828: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED if (tty->termios.c_lflag & ECHOK) 200682c: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 <== NOT EXECUTED 2006830: 80 88 60 20 btst 0x20, %g1 <== NOT EXECUTED 2006834: 02 bf ff 9e be 20066ac <== NOT EXECUTED 2006838: 90 10 20 0a mov 0xa, %o0 <== NOT EXECUTED echo ('\n', tty); 200683c: 92 10 00 19 mov %i1, %o1 <== NOT EXECUTED 2006840: 7f ff fe d7 call 200639c <== NOT EXECUTED 2006844: b0 10 20 00 clr %i0 <== NOT EXECUTED 2006848: 81 c7 e0 08 ret <== NOT EXECUTED 200684c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02019fd4 : #if !defined(RTEMS_POSIX_API) int kill( pid_t pid, int sig ) { return 0; } 2019fd4: 81 c3 e0 08 retl <== NOT EXECUTED 2019fd8: 90 10 20 00 clr %o0 <== NOT EXECUTED =============================================================================== 020041f0 : extern void _wrapup_reent(struct _reent *); extern void _reclaim_reent(struct _reent *); void libc_wrapup(void) { 20041f0: 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())) 20041f4: 03 00 80 74 sethi %hi(0x201d000), %g1 20041f8: c2 00 63 70 ld [ %g1 + 0x370 ], %g1 ! 201d370 <_System_state_Current> 20041fc: 80 a0 60 03 cmp %g1, 3 2004200: 02 80 00 04 be 2004210 <== ALWAYS TAKEN 2004204: 3b 00 80 72 sethi %hi(0x201c800), %i5 2004208: 81 c7 e0 08 ret <== NOT EXECUTED 200420c: 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) { 2004210: 05 00 80 6e sethi %hi(0x201b800), %g2 2004214: c2 07 60 00 ld [ %i5 ], %g1 2004218: f8 00 a2 48 ld [ %g2 + 0x248 ], %i4 200421c: 80 a0 40 1c cmp %g1, %i4 2004220: 02 80 00 05 be 2004234 2004224: 01 00 00 00 nop _wrapup_reent(_global_impure_ptr); 2004228: 40 00 30 f4 call 20105f8 <_wrapup_reent> 200422c: 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; 2004230: f8 27 60 00 st %i4, [ %i5 ] * * Should this be changed to do *all* file streams? * _fwalk (_REENT, fclose); */ fclose (stdin); 2004234: 40 00 2e 1e call 200faac 2004238: d0 07 20 04 ld [ %i4 + 4 ], %o0 fclose (stdout); 200423c: c2 07 60 00 ld [ %i5 ], %g1 2004240: 40 00 2e 1b call 200faac 2004244: d0 00 60 08 ld [ %g1 + 8 ], %o0 fclose (stderr); 2004248: c2 07 60 00 ld [ %i5 ], %g1 200424c: f0 00 60 0c ld [ %g1 + 0xc ], %i0 2004250: 40 00 2e 17 call 200faac 2004254: 81 e8 00 00 restore =============================================================================== 02003cb4 : #include "malloc_p.h" void *malloc( size_t size ) { 2003cb4: 9d e3 bf a0 save %sp, -96, %sp void *return_this; MSBUMP(malloc_calls, 1); 2003cb8: 03 00 80 74 sethi %hi(0x201d000), %g1 2003cbc: 82 10 60 b0 or %g1, 0xb0, %g1 ! 201d0b0 2003cc0: c4 00 60 04 ld [ %g1 + 4 ], %g2 2003cc4: 84 00 a0 01 inc %g2 /* * If some free's have been deferred, then do them now. */ malloc_deferred_frees_process(); 2003cc8: 7f ff ff a9 call 2003b6c 2003ccc: c4 20 60 04 st %g2, [ %g1 + 4 ] /* * Validate the parameters */ if ( !size ) 2003cd0: 80 a6 20 00 cmp %i0, 0 2003cd4: 02 80 00 25 be 2003d68 2003cd8: 03 00 80 74 sethi %hi(0x201d000), %g1 return (void *) 0; /* * Do not attempt to allocate memory if not in correct system state. */ if ( _System_state_Is_up(_System_state_Get()) && 2003cdc: c2 00 63 70 ld [ %g1 + 0x370 ], %g1 ! 201d370 <_System_state_Current> 2003ce0: 80 a0 60 03 cmp %g1, 3 2003ce4: 02 80 00 1c be 2003d54 2003ce8: 03 00 80 71 sethi %hi(0x201c400), %g1 RTEMS_INLINE_ROUTINE void *_Protected_heap_Allocate( Heap_Control *heap, uintptr_t size ) { return _Protected_heap_Allocate_aligned_with_boundary( heap, size, 0, 0 ); 2003cec: d0 00 61 bc ld [ %g1 + 0x1bc ], %o0 ! 201c5bc 2003cf0: 92 10 00 18 mov %i0, %o1 2003cf4: 94 10 20 00 clr %o2 2003cf8: 40 00 17 a7 call 2009b94 <_Protected_heap_Allocate_aligned_with_boundary> 2003cfc: 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 ) { 2003d00: ba 92 20 00 orcc %o0, 0, %i5 2003d04: 02 80 00 1c be 2003d74 2003d08: 03 00 80 73 sethi %hi(0x201cc00), %g1 } /* * If the user wants us to dirty the allocated memory, then do it. */ if ( rtems_malloc_dirty_helper ) 2003d0c: 03 00 80 73 sethi %hi(0x201cc00), %g1 2003d10: c2 00 60 f0 ld [ %g1 + 0xf0 ], %g1 ! 201ccf0 2003d14: 80 a0 60 00 cmp %g1, 0 2003d18: 02 80 00 04 be 2003d28 2003d1c: 90 10 00 1d mov %i5, %o0 (*rtems_malloc_dirty_helper)( return_this, size ); 2003d20: 9f c0 40 00 call %g1 2003d24: 92 10 00 18 mov %i0, %o1 /* * If configured, update the statistics */ if ( rtems_malloc_statistics_helpers ) 2003d28: 03 00 80 73 sethi %hi(0x201cc00), %g1 2003d2c: c2 00 60 f8 ld [ %g1 + 0xf8 ], %g1 ! 201ccf8 2003d30: 80 a0 60 00 cmp %g1, 0 2003d34: 22 80 00 06 be,a 2003d4c 2003d38: b0 10 00 1d mov %i5, %i0 (*rtems_malloc_statistics_helpers->at_malloc)(return_this); 2003d3c: c2 00 60 04 ld [ %g1 + 4 ], %g1 2003d40: 9f c0 40 00 call %g1 2003d44: 90 10 00 1d mov %i5, %o0 return return_this; } 2003d48: b0 10 00 1d mov %i5, %i0 2003d4c: 81 c7 e0 08 ret 2003d50: 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() ) 2003d54: 7f ff ff 72 call 2003b1c 2003d58: 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()) && 2003d5c: 80 8a 20 ff btst 0xff, %o0 2003d60: 12 bf ff e3 bne 2003cec <== ALWAYS TAKEN 2003d64: 03 00 80 71 sethi %hi(0x201c400), %g1 /* * Validate the parameters */ if ( !size ) return (void *) 0; 2003d68: ba 10 20 00 clr %i5 */ if ( rtems_malloc_statistics_helpers ) (*rtems_malloc_statistics_helpers->at_malloc)(return_this); return return_this; } 2003d6c: 81 c7 e0 08 ret 2003d70: 91 e8 00 1d restore %g0, %i5, %o0 */ return_this = _Protected_heap_Allocate( RTEMS_Malloc_Heap, size ); if ( !return_this ) { if (rtems_malloc_sbrk_helpers) 2003d74: c2 00 60 f4 ld [ %g1 + 0xf4 ], %g1 2003d78: 80 a0 60 00 cmp %g1, 0 2003d7c: 02 80 00 0a be 2003da4 2003d80: 01 00 00 00 nop return_this = (*rtems_malloc_sbrk_helpers->extend)( size ); 2003d84: c2 00 60 04 ld [ %g1 + 4 ], %g1 2003d88: 9f c0 40 00 call %g1 2003d8c: 90 10 00 18 mov %i0, %o0 if ( !return_this ) { 2003d90: 80 a2 20 00 cmp %o0, 0 2003d94: 02 80 00 04 be 2003da4 2003d98: 01 00 00 00 nop 2003d9c: 10 bf ff dc b 2003d0c 2003da0: ba 10 00 08 mov %o0, %i5 errno = ENOMEM; 2003da4: 40 00 2e f0 call 200f964 <__errno> 2003da8: b0 10 00 1d mov %i5, %i0 2003dac: 82 10 20 0c mov 0xc, %g1 2003db0: c2 22 00 00 st %g1, [ %o0 ] 2003db4: 81 c7 e0 08 ret 2003db8: 81 e8 00 00 restore =============================================================================== 02003d8c : } static void *malloc_sbrk_extend_and_allocate( size_t size ) { 2003d8c: 9d e3 bf a0 save %sp, -96, %sp * Round to the "requested sbrk amount" so hopefully we won't have * to grow again for a while. This effectively does sbrk() calls * in "page" amounts. */ sbrk_amount = RTEMS_Malloc_Sbrk_amount; 2003d90: 03 00 80 75 sethi %hi(0x201d400), %g1 2003d94: fa 00 60 a8 ld [ %g1 + 0xa8 ], %i5 ! 201d4a8 if ( sbrk_amount == 0 ) 2003d98: 80 a7 60 00 cmp %i5, 0 2003d9c: 02 80 00 20 be 2003e1c <== NEVER TAKEN 2003da0: b2 10 00 18 mov %i0, %i1 return (void *) 0; the_size = ((size + sbrk_amount) / sbrk_amount * sbrk_amount); 2003da4: 92 10 00 1d mov %i5, %o1 2003da8: 40 00 53 32 call 2018a70 <.udiv> 2003dac: 90 06 00 1d add %i0, %i5, %o0 2003db0: 40 00 52 f6 call 2018988 <.umul> 2003db4: 92 10 00 1d mov %i5, %o1 starting_address = (void *) sbrk(the_size); 2003db8: 7f ff f5 c3 call 20014c4 2003dbc: ba 10 00 08 mov %o0, %i5 if ( starting_address == (void*) -1 ) 2003dc0: 80 a2 3f ff cmp %o0, -1 2003dc4: 02 80 00 16 be 2003e1c 2003dc8: 92 10 00 08 mov %o0, %o1 return (void *) 0; if ( !_Protected_heap_Extend( 2003dcc: 39 00 80 72 sethi %hi(0x201c800), %i4 2003dd0: d0 07 20 2c ld [ %i4 + 0x2c ], %o0 ! 201c82c 2003dd4: 40 00 17 6b call 2009b80 <_Protected_heap_Extend> 2003dd8: 94 10 00 1d mov %i5, %o2 2003ddc: 80 8a 20 ff btst 0xff, %o0 2003de0: 02 80 00 09 be 2003e04 2003de4: 03 00 80 75 sethi %hi(0x201d400), %g1 2003de8: f0 07 20 2c ld [ %i4 + 0x2c ], %i0 sbrk(-the_size); errno = ENOMEM; return (void *) 0; } MSBUMP(space_available, the_size); 2003dec: c4 00 60 78 ld [ %g1 + 0x78 ], %g2 2003df0: b4 10 20 00 clr %i2 2003df4: ba 07 40 02 add %i5, %g2, %i5 2003df8: fa 20 60 78 st %i5, [ %g1 + 0x78 ] 2003dfc: 40 00 17 53 call 2009b48 <_Protected_heap_Allocate_aligned_with_boundary> 2003e00: 97 e8 20 00 restore %g0, 0, %o3 if ( starting_address == (void*) -1 ) return (void *) 0; if ( !_Protected_heap_Extend( RTEMS_Malloc_Heap, starting_address, the_size) ) { sbrk(-the_size); 2003e04: 7f ff f5 b0 call 20014c4 2003e08: 90 20 00 1d neg %i5, %o0 errno = ENOMEM; 2003e0c: 40 00 2f 9b call 200fc78 <__errno> 2003e10: 01 00 00 00 nop 2003e14: 82 10 20 0c mov 0xc, %g1 ! c 2003e18: c2 22 00 00 st %g1, [ %o0 ] MSBUMP(space_available, the_size); return_this = _Protected_heap_Allocate( RTEMS_Malloc_Heap, size ); return return_this; } 2003e1c: 81 c7 e0 08 ret 2003e20: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 02003e24 : static void *malloc_sbrk_initialize( void *starting_address, size_t length ) { 2003e24: 9d e3 bf a0 save %sp, -96, %sp uintptr_t old_address; uintptr_t uaddress; RTEMS_Malloc_Sbrk_amount = length; 2003e28: 03 00 80 75 sethi %hi(0x201d400), %g1 * If the starting address is 0 then we are to attempt to * get length worth of memory using sbrk. Make sure we * align the address that we get back. */ if (!starting_address) { 2003e2c: 80 a6 20 00 cmp %i0, 0 2003e30: 02 80 00 04 be 2003e40 2003e34: f2 20 60 a8 st %i1, [ %g1 + 0xa8 ] } starting_address = (void *)uaddress; } return starting_address; } 2003e38: 81 c7 e0 08 ret 2003e3c: 81 e8 00 00 restore * get length worth of memory using sbrk. Make sure we * align the address that we get back. */ if (!starting_address) { uaddress = (uintptr_t)sbrk(length); 2003e40: 7f ff f5 a1 call 20014c4 2003e44: 90 10 00 19 mov %i1, %o0 if (uaddress == (uintptr_t) -1) { 2003e48: 80 a2 3f ff cmp %o0, -1 2003e4c: 02 80 00 08 be 2003e6c <== ALWAYS TAKEN 2003e50: 80 8a 20 07 btst 7, %o0 rtems_fatal_error_occurred( RTEMS_NO_MEMORY ); /* DOES NOT RETURN!!! */ } if (uaddress & (CPU_HEAP_ALIGNMENT-1)) { 2003e54: 02 80 00 04 be 2003e64 <== NOT EXECUTED 2003e58: 01 00 00 00 nop <== NOT EXECUTED old_address = uaddress; uaddress = (uaddress + CPU_HEAP_ALIGNMENT) & ~(CPU_HEAP_ALIGNMENT-1); 2003e5c: 90 02 20 08 add %o0, 8, %o0 <== NOT EXECUTED 2003e60: 90 0a 3f f8 and %o0, -8, %o0 <== NOT EXECUTED } starting_address = (void *)uaddress; } return starting_address; } 2003e64: 81 c7 e0 08 ret <== NOT EXECUTED 2003e68: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED if (!starting_address) { uaddress = (uintptr_t)sbrk(length); if (uaddress == (uintptr_t) -1) { rtems_fatal_error_occurred( RTEMS_NO_MEMORY ); 2003e6c: 40 00 11 c2 call 2008574 2003e70: 90 10 20 1a mov 0x1a, %o0 =============================================================================== 0200e0dc : * Allocate a block for an in-memory file. */ int memfile_blocks_allocated = 0; void *memfile_alloc_block(void) { 200e0dc: 9d e3 bf a0 save %sp, -96, %sp void *memory; memory = (void *)calloc(1, IMFS_MEMFILE_BYTES_PER_BLOCK); 200e0e0: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e0e4: d2 00 61 20 ld [ %g1 + 0x120 ], %o1 ! 201cd20 200e0e8: 7f ff d5 4f call 2003624 200e0ec: 90 10 20 01 mov 1, %o0 if ( memory ) 200e0f0: b0 92 20 00 orcc %o0, 0, %i0 200e0f4: 02 80 00 05 be 200e108 <== NEVER TAKEN 200e0f8: 03 00 80 73 sethi %hi(0x201cc00), %g1 memfile_blocks_allocated++; 200e0fc: c4 00 62 34 ld [ %g1 + 0x234 ], %g2 ! 201ce34 200e100: 84 00 a0 01 inc %g2 200e104: c4 20 62 34 st %g2, [ %g1 + 0x234 ] return memory; } 200e108: 81 c7 e0 08 ret 200e10c: 81 e8 00 00 restore =============================================================================== 0200e690 : */ static void memfile_free_blocks_in_table( block_p **block_table, int entries ) { 200e690: 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 200e69c: d0 06 00 00 ld [ %i0 ], %o0 200e6a0: ba 10 00 08 mov %o0, %i5 200e6a4: b8 10 20 00 clr %i4 if ( b[i] ) { 200e6a8: d0 07 40 00 ld [ %i5 ], %o0 200e6ac: 80 a2 20 00 cmp %o0, 0 200e6b0: 02 80 00 05 be 200e6c4 200e6b4: b8 07 20 01 inc %i4 memfile_free_block( b[i] ); 200e6b8: 7f ff ff ed call 200e66c 200e6bc: 01 00 00 00 nop b[i] = 0; 200e6c0: 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 200e6cc: ba 07 60 04 add %i5, 4, %i5 200e6d0: 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 ); 200e6d4: 7f ff ff e6 call 200e66c 200e6d8: 01 00 00 00 nop *block_table = 0; 200e6dc: c0 26 00 00 clr [ %i0 ] 200e6e0: 81 c7 e0 08 ret 200e6e4: 81 e8 00 00 restore =============================================================================== 0200ed28 : */ int memfile_ftruncate( rtems_libio_t *iop, off_t length ) { 200ed28: 9d e3 bf 98 save %sp, -104, %sp IMFS_jnode_t *the_jnode; the_jnode = iop->pathinfo.node_access; 200ed2c: 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 ) 200ed30: c2 07 60 50 ld [ %i5 + 0x50 ], %g1 200ed34: 80 a0 40 19 cmp %g1, %i1 200ed38: 06 80 00 11 bl 200ed7c <== NEVER TAKEN 200ed3c: 90 10 00 1d mov %i5, %o0 200ed40: 22 80 00 0b be,a 200ed6c <== ALWAYS TAKEN 200ed44: 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; 200ed48: f2 27 60 50 st %i1, [ %i5 + 0x50 ] <== NOT EXECUTED 200ed4c: f4 27 60 54 st %i2, [ %i5 + 0x54 ] IMFS_update_atime( the_jnode ); 200ed50: 90 07 bf f8 add %fp, -8, %o0 200ed54: 7f ff d3 0e call 200398c 200ed58: 92 10 20 00 clr %o1 200ed5c: c2 07 bf f8 ld [ %fp + -8 ], %g1 200ed60: c2 27 60 40 st %g1, [ %i5 + 0x40 ] return 0; } 200ed64: 81 c7 e0 08 ret 200ed68: 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 ) 200ed6c: 80 a0 40 1a cmp %g1, %i2 200ed70: 3a bf ff f7 bcc,a 200ed4c 200ed74: f2 27 60 50 st %i1, [ %i5 + 0x50 ] return IMFS_memfile_extend( the_jnode, true, length ); 200ed78: 90 10 00 1d mov %i5, %o0 200ed7c: 92 10 20 01 mov 1, %o1 200ed80: 94 10 00 19 mov %i1, %o2 200ed84: 7f ff fe c3 call 200e890 200ed88: 96 10 00 1a mov %i2, %o3 200ed8c: 81 c7 e0 08 ret 200ed90: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200ecac : rtems_libio_t *iop, const char *pathname, int oflag, mode_t mode ) { 200ecac: 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) 200ecb0: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 200ecb4: 80 88 60 04 btst 4, %g1 200ecb8: 02 80 00 07 be 200ecd4 200ecbc: d0 06 20 1c ld [ %i0 + 0x1c ], %o0 200ecc0: c2 02 20 4c ld [ %o0 + 0x4c ], %g1 && (IMFS_type( the_jnode ) == IMFS_LINEAR_FILE)) { 200ecc4: c2 00 40 00 ld [ %g1 ], %g1 200ecc8: 80 a0 60 05 cmp %g1, 5 200eccc: 22 80 00 04 be,a 200ecdc <== NEVER TAKEN 200ecd0: 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; 200ecd4: 81 c7 e0 08 ret 200ecd8: 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; 200ecdc: d6 02 20 58 ld [ %o0 + 0x58 ], %o3 <== NOT EXECUTED the_jnode->control = &IMFS_node_control_memfile; 200ece0: 03 00 80 6d sethi %hi(0x201b400), %g1 <== NOT EXECUTED the_jnode->info.file.size = 0; 200ece4: 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; 200ece8: 82 10 60 94 or %g1, 0x94, %g1 <== NOT EXECUTED the_jnode->info.file.size = 0; 200ecec: c0 22 20 54 clr [ %o0 + 0x54 ] <== NOT EXECUTED the_jnode->info.file.indirect = 0; 200ecf0: 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; 200ecf4: 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; 200ecf8: c0 22 20 5c clr [ %o0 + 0x5c ] <== NOT EXECUTED the_jnode->info.file.triply_indirect = 0; if ((count != 0) 200ecfc: 80 a3 20 00 cmp %o4, 0 <== NOT EXECUTED 200ed00: 02 bf ff f5 be 200ecd4 <== NOT EXECUTED 200ed04: c0 22 20 60 clr [ %o0 + 0x60 ] <== NOT EXECUTED && (IMFS_memfile_write(the_jnode, 0, buffer, count) == -1)) 200ed08: 92 10 20 00 clr %o1 <== NOT EXECUTED 200ed0c: 7f ff ff 52 call 200ea54 <== NOT EXECUTED 200ed10: 94 10 20 00 clr %o2 <== NOT EXECUTED return -1; 200ed14: 90 38 00 08 xnor %g0, %o0, %o0 <== NOT EXECUTED 200ed18: 80 a0 00 08 cmp %g0, %o0 <== NOT EXECUTED 200ed1c: b0 40 3f ff addx %g0, -1, %i0 <== NOT EXECUTED } return 0; } 200ed20: 81 c7 e0 08 ret <== NOT EXECUTED 200ed24: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02003ee0 : const char *target, const char *filesystemtype, rtems_filesystem_options_t options, const void *data ) { 2003ee0: 9d e3 bf 50 save %sp, -176, %sp int rv = 0; if ( 2003ee4: 80 a6 e0 01 cmp %i3, 1 2003ee8: 18 80 00 8b bgu 2004114 2003eec: 01 00 00 00 nop options == RTEMS_FILESYSTEM_READ_ONLY || options == RTEMS_FILESYSTEM_READ_WRITE ) { rtems_filesystem_fsmount_me_t fsmount_me_h = 2003ef0: 40 00 22 f1 call 200cab4 2003ef4: 90 10 00 1a mov %i2, %o0 rtems_filesystem_get_mount_handler( filesystemtype ); if ( fsmount_me_h != NULL ) { 2003ef8: a4 92 20 00 orcc %o0, 0, %l2 2003efc: 02 80 00 86 be 2004114 2003f00: 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 : "/"; 2003f04: 02 80 00 80 be 2004104 2003f08: 90 10 00 19 mov %i1, %o0 } return rv; } int mount( 2003f0c: 40 00 33 f1 call 2010ed0 2003f10: aa 10 00 19 mov %i1, %l5 2003f14: 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; 2003f18: 40 00 33 ee call 2010ed0 2003f1c: 90 10 00 1a mov %i2, %o0 size_t source_size = source_or_null != NULL ? strlen( source_or_null ) + 1 : 0; 2003f20: 80 a6 20 00 cmp %i0, 0 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; 2003f24: ba 10 00 08 mov %o0, %i5 size_t source_size = source_or_null != NULL ? strlen( source_or_null ) + 1 : 0; 2003f28: 02 80 00 75 be 20040fc 2003f2c: a8 02 20 01 add %o0, 1, %l4 2003f30: 40 00 33 e8 call 2010ed0 2003f34: 90 10 00 18 mov %i0, %o0 2003f38: a0 02 20 01 add %o0, 1, %l0 size_t target_size = strlen( target ) + 1; size_t size = sizeof( rtems_filesystem_mount_table_entry_t ) + filesystemtype_size + source_size + target_size 2003f3c: ba 07 40 13 add %i5, %l3, %i5 + sizeof( rtems_filesystem_global_location_t ); rtems_filesystem_mount_table_entry_t *mt_entry = calloc( 1, size ); 2003f40: 90 10 20 01 mov 1, %o0 size_t filesystemtype_size = strlen( filesystemtype ) + 1; size_t source_size = source_or_null != NULL ? strlen( source_or_null ) + 1 : 0; size_t target_size = strlen( target ) + 1; size_t size = sizeof( rtems_filesystem_mount_table_entry_t ) + filesystemtype_size + source_size + target_size 2003f44: 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 ); 2003f48: 7f ff fd b7 call 2003624 2003f4c: 92 02 40 10 add %o1, %l0, %o1 if ( mt_entry != NULL ) { 2003f50: ba 92 20 00 orcc %o0, 0, %i5 2003f54: 02 80 00 64 be 20040e4 <== NEVER TAKEN 2003f58: a2 07 60 64 add %i5, 0x64, %l1 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 ); 2003f5c: 92 10 00 1a mov %i2, %o1 2003f60: 94 10 00 14 mov %l4, %o2 2003f64: 40 00 30 c7 call 2010280 2003f68: 90 10 00 11 mov %l1, %o0 mt_entry->type = str; str += filesystemtype_size; 2003f6c: b4 04 40 14 add %l1, %l4, %i2 memcpy( str, source_or_null, source_size ); 2003f70: 92 10 00 18 mov %i0, %o1 2003f74: 94 10 00 10 mov %l0, %o2 (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 ); mt_entry->type = str; 2003f78: e2 27 60 34 st %l1, [ %i5 + 0x34 ] str += filesystemtype_size; memcpy( str, source_or_null, source_size ); 2003f7c: 40 00 30 c1 call 2010280 2003f80: 90 10 00 1a mov %i2, %o0 mt_entry->dev = str; str += source_size; 2003f84: a0 06 80 10 add %i2, %l0, %l0 memcpy( str, target, target_size ); 2003f88: 92 10 00 15 mov %l5, %o1 2003f8c: 94 10 00 13 mov %l3, %o2 memcpy( str, filesystemtype, filesystemtype_size ); mt_entry->type = str; str += filesystemtype_size; memcpy( str, source_or_null, source_size ); mt_entry->dev = str; 2003f90: f4 27 60 38 st %i2, [ %i5 + 0x38 ] str += source_size; memcpy( str, target, target_size ); 2003f94: 40 00 30 bb call 2010280 2003f98: 90 10 00 10 mov %l0, %o0 + 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 = 2003f9c: 82 07 60 40 add %i5, 0x40, %g1 void *starting_address, size_t number_nodes, size_t node_size ) { _Chain_Initialize( the_chain, starting_address, number_nodes, node_size ); 2003fa0: 92 10 00 01 mov %g1, %o1 memcpy( str, target, target_size ); mt_entry->target = str; str += target_size; mt_entry->mounted = true; mt_entry->mt_fs_root = mt_fs_root; 2003fa4: c2 27 60 24 st %g1, [ %i5 + 0x24 ] memcpy( str, target, target_size ); mt_entry->target = str; str += target_size; mt_entry->mounted = true; 2003fa8: 82 10 20 01 mov 1, %g1 2003fac: 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; 2003fb0: 03 00 80 6c sethi %hi(0x201b000), %g1 2003fb4: 82 10 60 ac or %g1, 0xac, %g1 ! 201b0ac 2003fb8: c2 27 60 2c st %g1, [ %i5 + 0x2c ] mt_fs_root->location.mt_entry = mt_entry; mt_fs_root->reference_count = 1; 2003fbc: 82 10 20 01 mov 1, %g1 2003fc0: 90 07 60 14 add %i5, 0x14, %o0 2003fc4: 94 10 20 01 mov 1, %o2 2003fc8: 96 10 20 24 mov 0x24, %o3 2003fcc: c2 27 60 58 st %g1, [ %i5 + 0x58 ] memcpy( str, source_or_null, source_size ); mt_entry->dev = str; str += source_size; memcpy( str, target, target_size ); mt_entry->target = str; 2003fd0: e0 27 60 30 st %l0, [ %i5 + 0x30 ] 2003fd4: 40 00 12 3c call 20088c4 <_Chain_Initialize> 2003fd8: 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 ); 2003fdc: 90 10 00 1d mov %i5, %o0 filesystemtype, &target_length ); if ( mt_entry != NULL ) { mt_entry->writeable = options == RTEMS_FILESYSTEM_READ_WRITE; 2003fe0: b6 0e e0 01 and %i3, 1, %i3 rv = (*fsmount_me_h)( mt_entry, data ); 2003fe4: 92 10 00 1c mov %i4, %o1 2003fe8: 9f c4 80 00 call %l2 2003fec: f6 2f 60 29 stb %i3, [ %i5 + 0x29 ] if ( rv == 0 ) { 2003ff0: b0 92 20 00 orcc %o0, 0, %i0 2003ff4: 12 80 00 29 bne 2004098 2003ff8: 80 a6 60 00 cmp %i1, 0 if ( target != NULL ) { 2003ffc: 02 80 00 4c be 200412c 2004000: 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 = 2004004: 94 10 20 1f mov 0x1f, %o2 2004008: 40 00 03 2d call 2004cbc 200400c: 90 07 bf c8 add %fp, -56, %o0 static inline bool rtems_filesystem_location_is_root( const rtems_filesystem_location_info_t *loc ) { const rtems_filesystem_mount_table_entry_t *mt_entry = loc->mt_entry; 2004010: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 return (*mt_entry->ops->are_nodes_equal_h)( 2004014: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2004018: d2 00 60 24 ld [ %g1 + 0x24 ], %o1 200401c: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 2004020: 9f c0 40 00 call %g1 2004024: 01 00 00 00 nop rtems_filesystem_eval_path_start( &ctx, target, eval_flags ); if ( !rtems_filesystem_location_is_root( currentloc ) ) { 2004028: 80 8a 20 ff btst 0xff, %o0 200402c: 12 80 00 64 bne 20041bc 2004030: 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( 2004034: 40 00 04 1b call 20050a0 2004038: 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 ); 200403c: 40 00 04 aa call 20052e4 2004040: 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 ); 2004044: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( !rtems_filesystem_location_is_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 ); 2004048: 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 ); 200404c: 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; 2004050: d0 27 60 20 st %o0, [ %i5 + 0x20 ] rv = (*mt_point_node->location.mt_entry->ops->mount_h)( mt_entry ); 2004054: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 2004058: 9f c0 40 00 call %g1 200405c: 90 10 00 1d mov %i5, %o0 if ( rv == 0 ) { 2004060: b0 92 20 00 orcc %o0, 0, %i0 2004064: 22 80 00 11 be,a 20040a8 2004068: 39 00 80 74 sethi %hi(0x201d000), %i4 &rtems_filesystem_mount_table, &mt_entry->mt_node ); rtems_filesystem_mt_unlock(); } else { rtems_filesystem_global_location_release( mt_point_node ); 200406c: 40 00 04 42 call 2005174 2004070: 90 10 00 1c mov %i4, %o0 } else { rtems_filesystem_eval_path_error( &ctx, EBUSY ); rv = -1; } rtems_filesystem_eval_path_cleanup( &ctx ); 2004074: 40 00 03 52 call 2004dbc 2004078: 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 ) { 200407c: 80 a6 20 00 cmp %i0, 0 2004080: 02 80 00 4d be 20041b4 2004084: 01 00 00 00 nop (*mt_entry->ops->fsunmount_me_h)( mt_entry ); 2004088: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200408c: c2 00 60 3c ld [ %g1 + 0x3c ], %g1 2004090: 9f c0 40 00 call %g1 2004094: 90 10 00 1d mov %i5, %o0 } } if ( rv != 0 ) { free( mt_entry ); 2004098: 7f ff fe 13 call 20038e4 200409c: 90 10 00 1d mov %i5, %o0 errno = EINVAL; rv = -1; } return rv; } 20040a0: 81 c7 e0 08 ret 20040a4: 81 e8 00 00 restore */ #include static inline void rtems_libio_lock( void ) { rtems_semaphore_obtain( rtems_libio_semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT ); 20040a8: d0 07 20 a0 ld [ %i4 + 0xa0 ], %o0 20040ac: 92 10 20 00 clr %o1 20040b0: 40 00 0f 4d call 2007de4 20040b4: 94 10 20 00 clr %o2 } static inline void rtems_libio_unlock( void ) { rtems_semaphore_release( rtems_libio_semaphore ); 20040b8: d0 07 20 a0 ld [ %i4 + 0xa0 ], %o0 Chain_Control *the_chain, Chain_Node *the_node ) { Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *old_last = tail->previous; 20040bc: 03 00 80 71 sethi %hi(0x201c400), %g1 20040c0: 82 10 62 c8 or %g1, 0x2c8, %g1 ! 201c6c8 20040c4: c4 00 60 08 ld [ %g1 + 8 ], %g2 the_node->next = tail; 20040c8: 86 00 60 04 add %g1, 4, %g3 20040cc: c6 27 40 00 st %g3, [ %i5 ] tail->previous = the_node; 20040d0: fa 20 60 08 st %i5, [ %g1 + 8 ] old_last->next = the_node; 20040d4: fa 20 80 00 st %i5, [ %g2 ] 20040d8: 40 00 0f 93 call 2007f24 20040dc: c4 27 60 04 st %g2, [ %i5 + 4 ] 20040e0: 30 bf ff e5 b,a 2004074 if ( rv != 0 ) { free( mt_entry ); } } else { errno = ENOMEM; 20040e4: 40 00 2e 20 call 200f964 <__errno> <== NOT EXECUTED 20040e8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20040ec: 82 10 20 0c mov 0xc, %g1 <== NOT EXECUTED 20040f0: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 20040f4: 81 c7 e0 08 ret <== NOT EXECUTED 20040f8: 81 e8 00 00 restore <== NOT EXECUTED ) { 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; 20040fc: 10 bf ff 90 b 2003f3c 2004100: a0 10 20 00 clr %l0 const char *target_or_null, const char *filesystemtype, size_t *target_length_ptr ) { const char *target = target_or_null != NULL ? target_or_null : "/"; 2004104: 2b 00 80 6c sethi %hi(0x201b000), %l5 2004108: a6 10 20 02 mov 2, %l3 200410c: 10 bf ff 83 b 2003f18 2004110: aa 15 60 a8 or %l5, 0xa8, %l5 } else { errno = EINVAL; rv = -1; } } else { errno = EINVAL; 2004114: 40 00 2e 14 call 200f964 <__errno> 2004118: b0 10 3f ff mov -1, %i0 200411c: 82 10 20 16 mov 0x16, %g1 2004120: c2 22 00 00 st %g1, [ %o0 ] 2004124: 81 c7 e0 08 ret 2004128: 81 e8 00 00 restore */ #include static inline void rtems_libio_lock( void ) { rtems_semaphore_obtain( rtems_libio_semaphore, RTEMS_WAIT, RTEMS_NO_TIMEOUT ); 200412c: 39 00 80 74 sethi %hi(0x201d000), %i4 2004130: d0 07 20 a0 ld [ %i4 + 0xa0 ], %o0 ! 201d0a0 2004134: 92 10 20 00 clr %o1 2004138: 40 00 0f 2b call 2007de4 200413c: 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; 2004140: 03 00 80 71 sethi %hi(0x201c400), %g1 ) { int rv = 0; rtems_filesystem_mt_lock(); if ( rtems_chain_is_empty( &rtems_filesystem_mount_table ) ) { 2004144: c4 00 62 c8 ld [ %g1 + 0x2c8 ], %g2 ! 201c6c8 2004148: 82 10 62 c8 or %g1, 0x2c8, %g1 200414c: 86 00 60 04 add %g1, 4, %g3 2004150: 80 a0 80 03 cmp %g2, %g3 2004154: 12 80 00 1f bne 20041d0 <== NEVER TAKEN 2004158: 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; 200415c: c6 00 60 08 ld [ %g1 + 8 ], %g3 } static inline void rtems_libio_unlock( void ) { rtems_semaphore_release( rtems_libio_semaphore ); 2004160: d0 07 20 a0 ld [ %i4 + 0xa0 ], %o0 the_node->next = tail; 2004164: c4 27 40 00 st %g2, [ %i5 ] tail->previous = the_node; 2004168: fa 20 60 08 st %i5, [ %g1 + 8 ] old_last->next = the_node; 200416c: fa 20 c0 00 st %i5, [ %g3 ] 2004170: 40 00 0f 6d call 2007f24 2004174: 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 ); 2004178: 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 = 200417c: 40 00 04 1e call 20051f4 2004180: 90 10 00 1d mov %i5, %o0 2004184: 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 = 2004188: 40 00 04 1b call 20051f4 200418c: 90 10 00 1d mov %i5, %o0 rtems_filesystem_global_location_obtain( &mt_entry->mt_fs_root ); rtems_filesystem_global_location_assign( 2004190: 39 00 80 71 sethi %hi(0x201c400), %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 = 2004194: ba 10 00 08 mov %o0, %i5 rtems_filesystem_global_location_obtain( &mt_entry->mt_fs_root ); rtems_filesystem_global_location_assign( 2004198: d0 07 22 e8 ld [ %i4 + 0x2e8 ], %o0 200419c: 92 10 00 1b mov %i3, %o1 20041a0: 40 00 04 0b call 20051cc 20041a4: 90 02 20 04 add %o0, 4, %o0 &rtems_filesystem_root, new_fs_root ); rtems_filesystem_global_location_assign( 20041a8: d0 07 22 e8 ld [ %i4 + 0x2e8 ], %o0 20041ac: 40 00 04 08 call 20051cc 20041b0: 92 10 00 1d mov %i5, %o1 20041b4: 81 c7 e0 08 ret 20041b8: 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 ); 20041bc: 90 07 bf c8 add %fp, -56, %o0 20041c0: 92 10 20 10 mov 0x10, %o1 20041c4: 40 00 02 02 call 20049cc 20041c8: b0 10 3f ff mov -1, %i0 20041cc: 30 bf ff aa b,a 2004074 rtems_chain_append_unprotected( &rtems_filesystem_mount_table, &mt_entry->mt_node ); } else { errno = EINVAL; 20041d0: 40 00 2d e5 call 200f964 <__errno> <== NOT EXECUTED 20041d4: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20041d8: 82 10 20 16 mov 0x16, %g1 <== NOT EXECUTED 20041dc: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 20041e0: 40 00 0f 51 call 2007f24 <== NOT EXECUTED 20041e4: d0 07 20 a0 ld [ %i4 + 0xa0 ], %o0 <== NOT EXECUTED } else { rv = register_root_file_system( mt_entry ); } if ( rv != 0 ) { (*mt_entry->ops->fsunmount_me_h)( mt_entry ); 20041e8: 10 bf ff a9 b 200408c <== NOT EXECUTED 20041ec: c2 07 60 0c ld [ %i5 + 0xc ], %g1 <== NOT EXECUTED =============================================================================== 02009384 : const char *target, const char *filesystemtype, rtems_filesystem_options_t options, const void *data ) { 2009384: 9d e3 bf a0 save %sp, -96, %sp int rv = -1; if (target != NULL) { 2009388: 90 96 60 00 orcc %i1, 0, %o0 200938c: 02 80 00 0b be 20093b8 2009390: 01 00 00 00 nop rv = rtems_mkdir(target, S_IRWXU | S_IRWXG | S_IRWXO); 2009394: 40 00 02 ed call 2009f48 2009398: 92 10 21 ff mov 0x1ff, %o1 ! 1ff if (rv == 0) { 200939c: 82 92 20 00 orcc %o0, 0, %g1 20093a0: 02 80 00 04 be 20093b0 <== ALWAYS TAKEN 20093a4: 01 00 00 00 nop } else { errno = EINVAL; } return rv; } 20093a8: 81 c7 e0 08 ret 20093ac: 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( 20093b0: 40 00 00 08 call 20093d0 20093b4: 81 e8 00 00 restore options, data ); } } else { errno = EINVAL; 20093b8: 40 00 64 61 call 202253c <__errno> 20093bc: 01 00 00 00 nop 20093c0: 84 10 20 16 mov 0x16, %g2 ! 16 const char *filesystemtype, rtems_filesystem_options_t options, const void *data ) { int rv = -1; 20093c4: 82 10 3f ff mov -1, %g1 options, data ); } } else { errno = EINVAL; 20093c8: 10 bf ff f8 b 20093a8 20093cc: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 02016ea0 : msdos_node_type_t type, const char *name, int name_len, mode_t mode, const fat_file_fd_t *link_fd) { 2016ea0: 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; 2016ea4: 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); 2016ea8: 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; 2016eac: 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; 2016eb0: 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; 2016eb4: 82 10 3f ff mov -1, %g1 time_t time_ret = 0; uint16_t time_val = 0; 2016eb8: c0 37 bf 68 clrh [ %fp + -152 ] uint16_t date = 0; 2016ebc: 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; 2016ec0: c0 27 bf 70 clr [ %fp + -144 ] dir_pos->sname.ofs = 0; 2016ec4: c0 27 bf 74 clr [ %fp + -140 ] dir_pos->lname.cln = FAT_FILE_SHORT_NAME; 2016ec8: c2 27 bf 78 st %g1, [ %fp + -136 ] dir_pos->lname.ofs = FAT_FILE_SHORT_NAME; 2016ecc: 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); 2016ed0: c0 27 bf 80 clr [ %fp + -128 ] 2016ed4: c0 27 bf 84 clr [ %fp + -124 ] 2016ed8: c0 27 20 08 clr [ %i4 + 8 ] 2016edc: c0 27 20 0c clr [ %i4 + 0xc ] 2016ee0: c0 27 20 10 clr [ %i4 + 0x10 ] 2016ee4: c0 27 20 14 clr [ %i4 + 0x14 ] 2016ee8: c0 27 20 18 clr [ %i4 + 0x18 ] 2016eec: c0 27 20 1c clr [ %i4 + 0x1c ] memset(dot_dotdot, 0, MSDOS_DIRECTORY_ENTRY_STRUCT_SIZE * 2); 2016ef0: c0 27 bf c0 clr [ %fp + -64 ] 2016ef4: c0 27 bf c4 clr [ %fp + -60 ] 2016ef8: c0 27 bf c8 clr [ %fp + -56 ] 2016efc: c0 27 bf cc clr [ %fp + -52 ] 2016f00: c0 27 bf d0 clr [ %fp + -48 ] 2016f04: c0 27 bf d4 clr [ %fp + -44 ] 2016f08: c0 27 bf d8 clr [ %fp + -40 ] 2016f0c: c0 27 bf dc clr [ %fp + -36 ] 2016f10: c0 27 bf e0 clr [ %fp + -32 ] 2016f14: c0 27 bf e4 clr [ %fp + -28 ] 2016f18: c0 27 bf e8 clr [ %fp + -24 ] 2016f1c: c0 27 bf ec clr [ %fp + -20 ] 2016f20: c0 27 bf f0 clr [ %fp + -16 ] 2016f24: c0 27 bf f4 clr [ %fp + -12 ] 2016f28: c0 27 bf f8 clr [ %fp + -8 ] 2016f2c: c0 27 bf fc clr [ %fp + -4 ] if (name_len > MSDOS_NAME_MAX_LFN_WITH_DOT) { 2016f30: 80 a6 e1 04 cmp %i3, 0x104 2016f34: 14 80 00 e3 bg 20172c0 <== NEVER TAKEN 2016f38: e4 06 20 08 ld [ %i0 + 8 ], %l2 rtems_set_errno_and_return_minus_one(ENAMETOOLONG); } name_type = msdos_long_to_short (name, name_len, 2016f3c: 90 10 00 1a mov %i2, %o0 2016f40: 92 10 00 1b mov %i3, %o1 2016f44: 94 10 00 1c mov %i4, %o2 2016f48: 40 00 01 37 call 2017424 2016f4c: 96 10 20 0b mov 0xb, %o3 MSDOS_DIR_NAME(short_node), MSDOS_NAME_MAX); if (name_type == MSDOS_NAME_INVALID) { 2016f50: a2 92 20 00 orcc %o0, 0, %l1 2016f54: 02 80 00 e0 be 20172d4 <== NEVER TAKEN 2016f58: 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; 2016f5c: c0 2f bf 8c clrb [ %fp + -116 ] /* set up last write date and time */ time_ret = time(NULL); 2016f60: 40 00 16 9a call 201c9c8