LIST 80

============================================================================

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

FILE *fp;
int ni[1000], m[15000], p[300][10];
char n[300][60];

static void access_flag_printf(int para);
static void byte_code_printf(long address);
static void display_information(int mode, int id);

int main(int argc,char **argv){
        int d, i, j, k, ct;
        unsigned int p0, p00, p1, p2, p3;
        int pp=0, count=0, p4, p5;
        unsigned char ss, st[20], d0, d1, d2, d3;
        st[16]=0;
        if( argc != 2 ){ printf("... target file name missing (;_;) ...\n\n"); exit(1); }
        else if( (fp=fopen( argv[1], "rb" ))==NULL ){ printf("... target file [ %s ] is not found (;_;) ...\n\n", argv[1]); exit(1); }
        printf("Target Java File Name = %s\n", argv[1]);
        while( (d = fgetc(fp)) >= 0 ){
		m[count++] = d & 0xff; 
        }
        fclose(fp);
        printf("\nTotal File Length = %d bytes.", count);
        p0 = m[pp+3]+256*m[pp+2];
        p00 = m[pp+1]+256*m[pp];
        printf("\n\n\t%06X  Magic Code [CAFEBABE] = %04X%04X",pp,p00,p0); pp += 4;
        if(( p00 != 0xcafe )||( p0 != 0xbabe )){
		printf("\n\n... target file is not Java (;_;) ...\n\n"); exit(1);
        }
        else printf("  ---  OK (^_^)");
        printf("\n\n\t%06X  Version : major version %d , minor version %d", pp, m[pp+3]+256*m[pp+2], m[pp+1]+256*m[pp] ); pp += 4;
        p1 = m[pp+1]+256*m[pp]; printf("\n\n\t%06X  Constant Pool : total number = %d\n", pp, p1 ); pp += 2;
        for(i=1;i<p1;i++){
                printf("\n\t\t%06X   constant_pool[%03d][%02X] = ", pp, i, i);
                d0 = m[pp++]; printf("<%X> ",d0);
                switch(d0){
                        case 7: p2 = m[pp+1]+256*m[pp]; pp += 2; ni[i] = p2;
                                printf("CONSTANT_Class , name_index = %d", p2);
				p[i][2] = p2;
                                break;
                        case 9: p2 = m[pp+1]+256*m[pp]; pp += 2;
                                p3 = m[pp+1]+256*m[pp]; pp += 2;
                                printf("CONSTANT_Fieldref , class_index = %d", p2);
                                printf(" , name_and_type_index = %d", p3);
				p[i][3] = p3;
                                break;
                        case 10: p2 = m[pp+1]+256*m[pp]; pp += 2;
                                p3 = m[pp+1]+256*m[pp]; pp += 2;
                                printf("CONSTANT_Methodref , class_index = %d", p2);
                                printf(" , name_and_type_index = %d", p3);
				p[i][0] = p3;
                                break;
                        case 11: p2 = m[pp+1]+256*m[pp]; pp += 2;
                                p3 = m[pp+1]+256*m[pp]; pp += 2;
                                printf("CONSTANT_InterfaceMethodref , class_index = %d", p2);
                                printf(" , name_and_type_index = %d", p3);
                                break;
                        case 8: p2 = m[pp+1]+256*m[pp]; pp += 2; ni[i] = p2;
                                printf("CONSTANT_String , name_index = %d", p2);
				p[i][4] = p2;
                                break;
                        case 3: p4 = m[pp+3]+256*(m[pp+2]+256*(m[pp+1]+256*m[pp])); pp += 4;
                                printf("CONSTANT_Integer , value = %d", p4);
                                break;
                        case 4: p4 = m[pp+3]+256*(m[pp+2]+256*(m[pp+1]+256*m[pp])); pp += 4;
                                printf("CONSTANT_Float , value = %d", p4);
                                break;
                        case 5: p4 = m[pp+3]+256*(m[pp+2]+256*(m[pp+1]+256*m[pp])); pp += 4;
                                p5 = m[pp+3]+256*(m[pp+2]+256*(m[pp+1]+256*m[pp])); pp += 4;
                                printf("CONSTANT_Float , high = %d , low = %d", p4, p5); i++;
                                break;
                        case 6: p4 = m[pp+3]+256*(m[pp+2]+256*(m[pp+1]+256*m[pp])); pp += 4;
                                p5 = m[pp+3]+256*(m[pp+2]+256*(m[pp+1]+256*m[pp])); pp += 4;
                                printf("CONSTANT_Double , high = %d , low = %d", p4, p5); i++;
                                break;
                        case 12: p2 = m[pp+1]+256*m[pp]; pp += 2;
                                p3 = m[pp+1]+256*m[pp]; pp += 2;
                                printf("CONSTANT_NameAndType , name_index = %d", p2); ni[i] = p2;
                                printf(" , signature_index = %d", p3);
				p[i][1] = p2;
                                break;
                        case 1: case 2:
                                p2 = m[pp+1]+256*m[pp]; pp += 2;
                                if(d0==1) printf("CONSTANT_Utf8 , ");
                                else printf("CONSTANT_Unicode , ");
                                k = 0;
                                for(j=0;j<p2;j++){
                                        d1 = m[pp++];
                                        if((d1&0x80)==0) n[i][k++] = d1;
                                        else{
                                                d2 = m[pp++];
                                                if((d1&0xe0)==0xc0){
                                                        n[i][k++] = (64*(d1&0x1f)+(d2&0x3f))/256;
                                                        n[i][k++] = (64*(d1&0x1f)+(d2&0x3f))%256;
                                                }
                                                else{
                                                        d3 = m[pp++];
                                                        n[i][k++] = (256*16*(d1&0x0f)+64*(d2&0x3f)+(d3&0x3f))/256;
                                                        n[i][k++] = (256*16*(d1&0x0f)+64*(d2&0x3f)+(d3&0x3f))%256;
                                                }
                                        }
                                }
                                n[i][k] = 0; printf("Data = %s",n[i]);
                                break;
                        default:       printf("\nFormat Error !!!\n");
                                break;
                }
        }
        p1 = m[pp+1]+256*m[pp]; pp += 2; printf("\n\n\t%06X  Access Flag = %04X --- ", pp-2, p1 );
        access_flag_printf( p1 );
        p1 = m[pp+1]+256*m[pp]; pp += 2; printf("\n\n\t%06X  This Class = %s", pp-2, n[ni[p1]] );
        p1 = m[pp+1]+256*m[pp]; pp += 2; printf("\n\n\t%06X  Super Class = %s", pp-2, n[ni[p1]] );
        p1 = m[pp+1]+256*m[pp]; pp += 2; printf("\n\n\t%06X  Interface Count = %d", pp-2, p1 );
        if( p1 != 0 ){
                printf("\n");
                for(i=0;i<p1;i++){
                        p2 = m[pp+1]+256*m[pp]; pp += 2;
                        printf("\n\t\t%06X  interface[%d] : Name = %s", pp-2, i, n[ni[p2]] );
                }
        }
        p1 = m[pp+1]+256*m[pp]; pp += 2; printf("\n\n\t%06X  Fields Count = %d\n", pp-2, p1 );
        for(i=0;i<p1;i++){
                printf("\n\t\t%06X   field[%d] : ", pp, i);
                p2 = m[pp+1]+256*m[pp]; pp += 2; access_flag_printf( p2 );
                p2 = m[pp+1]+256*m[pp]; pp += 2; printf(" , Name = %s", n[p2] );
                p2 = m[pp+1]+256*m[pp]; pp += 2; printf(" , Signature = %s", n[p2] );
                p2 = m[pp+1]+256*m[pp]; pp += 2; printf(" , Attribute = %d", p2 );
                if( p2 != 0 ){
                        printf("\n");
                        for(j=0;j<p2;j++){
                                p3 = m[pp+1]+256*m[pp]; pp += 2;
                                printf("\n\t\t\ttype = %s , ", n[p3] );
                                p4 = m[pp+3]+256*(m[pp+2]+256*(m[pp+1]+256*m[pp])); pp += 4;
                                printf("length = %d\n", p4);
                                for(k=0;k<p4;k++){
                                        if((k%25)==0) printf("\n\t\t\t\t");
                                        printf("%02X ", m[pp++] );
                                }
                        }
                }
        }
        p1 = m[pp+1]+256*m[pp]; pp += 2; printf("\n\n\t%06X  Methods Count = %d", pp-2, p1 );
        for(i=0;i<p1;i++){
                printf("\n\n\t\t%06X   method[%d] : ", pp, i);
                p2 = m[pp+1]+256*m[pp]; pp += 2; access_flag_printf( p2 );
                p2 = m[pp+1]+256*m[pp]; pp += 2; printf(" , Name = %s", n[p2] );
                p2 = m[pp+1]+256*m[pp]; pp += 2; printf(" , Signature = %s", n[p2] );
                p2 = m[pp+1]+256*m[pp]; pp += 2; printf(" , Attribute = %d", p2 );
                if( p2 != 0 ){
                        printf("\n");
                        for(j=0;j<p2;j++){
                                p3 = m[pp+1]+256*m[pp]; pp += 2;
                                printf("\n\t\t\ttype = %s , ", n[p3] );
                                p4 = m[pp+3]+256*(m[pp+2]+256*(m[pp+1]+256*m[pp])); pp += 4;
                                printf("length = %d", p4);
                                p5 = pp; pp += p4;
                                if( strcmp( n[p3], "Code" ) == 0 ) byte_code_printf( p5 );
                                else if( strcmp( n[p3], "Exceptions" ) == 0 ) byte_code_printf( p5 );
                        }
                }
        }
        p1 = m[pp+1]+256*m[pp]; pp += 2; printf("\n\n\t%06X  Attributes Count = %d", pp-2, p1 );
        if( p1 != 0 ){
                for(i=0;i<p1;i++){
                        p2 = m[pp+1]+256*m[pp]; pp += 2;
                        printf("\n\n\t\t%06X  attribute[%d] : type = %s , ", pp-2, i, n[p2] );
                        p4 = m[pp+3]+256*(m[pp+2]+256*(m[pp+1]+256*m[pp])); pp += 4;
                        p5 = pp;
                        printf("length = %d\n", p4);
                        for(k=0;k<p4;k++){
                                if((k%25)==0) printf("\n\t\t\t\t");
                                printf("%02X ", m[pp++] );
                        }
                        if( ( p4 == 2 ) && ( strcmp( n[p2], "SourceFile" ) == 0 ) ){
                                p3 = m[p5+1]+256*m[p5];
                                printf("\n\n\t\t\tSource File Name = %s", n[p3] );
                        }
                }
        }
        printf("\n\n..... (^_^) Java analyze completely finished. (^_^)\n\n");		return;
}



void byte_code_printf( long address ){
        int k, l, p1, p2, p3, mm, m1, m2, m3, m4;
        long pp, p4, p5;
        pp = address;
        p1 = m[pp+1]+256*m[pp]; pp += 2;
        p2 = m[pp+1]+256*m[pp]; pp += 2;
        printf(" , max_stack = %d , max_locals = %d , ", p1, p2 );
        p4 = m[pp+3]+256*(m[pp+2]+256*(m[pp+1]+256*m[pp])); pp += 4;
        printf("code_length = %d\n", p4);
        k = 0;
        while( k < p4 ){
                printf("\n\t\t\t\t%06X\t", k );
                mm = m[pp++];
                switch(mm){
                        default :       printf("?? %02X ??\t\t(..... not defined .....)", mm);
                                break;
/***** この部分は以下にあるもの以外はリスト76と同様なので省略 *****/
                        case 181:       m1 = m[pp++]; m2 = m[pp++];
                                printf("putfield\t%04X\t(Set field in object)", 256*m1+m2);
				display_information(5,256*m1+m2);
                                k += 2; break;
                        case 180:       m1 = m[pp++]; m2 = m[pp++];
                                printf("getfield\t%04X\t(Fetch field from object)", 256*m1+m2);
				display_information(6,256*m1+m2);
                                k += 2; break;
                        case 178:       m1 = m[pp++]; m2 = m[pp++];
                                printf("getstatic\t%04X\t(Get static field from class)", 256*m1+m2);
				display_information(3,256*m1+m2);
                                k += 2; break;
                        case 182:       m1 = m[pp++]; m2 = m[pp++];
                                printf("invokevirtual\t%04X\t(Invoke instance method)", 256*m1+m2);
				display_information(1,256*m1+m2);
                                k += 2; break;
                        case 183:       m1 = m[pp++]; m2 = m[pp++];
                                printf("invokenonvirt\t%04X\t(Invoke instance method, dispatching based on compile-time type)", 256*m1+m2);
				display_information(1,256*m1+m2);
                                k += 2; break;
                        case 184:       m1 = m[pp++]; m2 = m[pp++];
                                printf("invokestatic\t%04X\t(Invoke a class (static) method)", 256*m1+m2);
				display_information(1,256*m1+m2);
                                k += 2; break;
                        case 185:       m1 = m[pp++]; m2 = m[pp++];
                                m3 = m[pp++]; m4 = m[pp++];
                                printf("invokeinterf\t%04X %02X %02X\t(Invoke interface method)", 256*m1+m2, m3, m4);
				display_information(1,256*m1+m2);
                                k += 2; break;
                        case 187:       m1 = m[pp++]; m2 = m[pp++];
                                printf("new\t%04X\t(Create new object)", 256*m1+m2);
				display_information(2,256*m1+m2);
                                k += 2; break;
                }
                k++;
        }
        p1 = m[pp+1]+256*m[pp]; pp += 2;
        printf("\n\n\t\t\texception_table_length = %d", p1 );
        if( p1 != 0 ){
                printf("\n");
                for(k=0;k<p1;k++){
                        p2 = m[pp+1]+256*m[pp]; pp += 2;
                        printf("\n\t\t\t\t%06X  start_pc = %d , ", pp, p2 );
                        p2 = m[pp+1]+256*m[pp]; pp += 2;
                        printf("end_pc = %d , ", p2 );
                        p2 = m[pp+1]+256*m[pp]; pp += 2;
                        printf("handler_pc = %d , ", p2 );
                        p2 = m[pp+1]+256*m[pp]; pp += 2;
                        if( p2 != 0 ) printf("catch_type = %s", n[ni[p2]] );
                        else printf("catch_type = all exceptions");
                }
        }
        p1 = m[pp+1]+256*m[pp]; pp += 2;
        printf("\n\n\t\t\tattributes_count = %d", p1 );
        if( p1 != 0 ){
                printf("\n");
                for(k=0;k<p1;k++){
                        p2 = m[pp+1]+256*m[pp]; pp += 2;
                        printf("\n\t\t\t\t%06X  type = %s , ", pp, n[p2] );
                        p4 = m[pp+3]+256*(m[pp+2]+256*(m[pp+1]+256*m[pp])); pp += 4;
                        printf("attribute_length = %d\n", p4);
                        for(l=0;l<p4;l++){
                                if((l%20)==0) printf("\n\t\t\t\t\t");
                                printf("%02X ", m[pp++] );
                        }
                }
        }
}

void display_information(int mode, int id){
	switch(mode){
		case 1:
			printf("\n\t\t\t\t\t     ##### Call [ %s ]#####", n[(p[(p[id][0])][1])]);
			break;
		case 2:
			printf("\n\t\t\t\t\t     ##### Define [ %s ]#####", n[(p[id][2])]);
			break;
		case 3:
			printf("\n\t\t\t\t\t     ##### Get Static [ %s ]#####", n[(p[(p[id][3])][1])]);
			break;
		case 4:
			printf("\n\t\t\t\t\t     ##### Push Item [ %s ]#####", n[(p[id][4])]);
			break;
		case 5:
			printf("\n\t\t\t\t\t     ##### Put Field [ %s ]#####", n[(p[(p[id][3])][1])]);
			break;
		case 6:
			printf("\n\t\t\t\t\t     ##### Get Field [ %s ]#####", n[(p[(p[id][3])][1])]);
			break;
	}
}

void access_flag_printf(int para){
        switch(para){
                case 0x0001:    printf("ACC_PUBLIC");   break;
                case 0x0002:    printf("ACC_PRIVATE");  break;
                case 0x0004:    printf("ACC_PROTECTED");        break;
                case 0x0008:    printf("ACC_STATIC");   break;
                case 0x0010:    printf("ACC_FINAL");    break;
                case 0x0020:    printf("ACC_SYNCHRONIZED");     break;
                case 0x0040:    printf("ACC_VOLATILE"); break;
                case 0x0080:    printf("ACC_TRANSIENT");        break;
                case 0x0100:    printf("ACC_NATIVE");   break;
                case 0x0200:    printf("ACC_INTERFACE");        break;
                case 0x0400:    printf("ACC_ABSTRACT"); break;
                default:        printf("( no flag )");  break;
        }
}

============================================================================