From 19af72ed836f487b0b3c6ff865924b982ab124bd Mon Sep 17 00:00:00 2001 From: jihoonl Date: Sat, 4 Jul 2009 00:16:43 +0000 Subject: [PATCH] change. not compiling yet. --- .../Benchmarks/SingleTM/Intruder/Decoded.java | 2 + .../Benchmarks/SingleTM/Intruder/Decoder.java | 127 +++++++++--------- .../Benchmarks/SingleTM/Intruder/ERROR.java | 30 +++-- .../Benchmarks/SingleTM/Intruder/List_t.java | 27 +--- .../Benchmarks/SingleTM/Intruder/Queue_t.java | 21 +++ .../Benchmarks/SingleTM/Intruder/Random.java | 54 ++++---- .../SingleTM/Intruder/convertURNHex.java | 19 ++- .../Benchmarks/SingleTM/Intruder/toLower.java | 4 +- 8 files changed, 160 insertions(+), 124 deletions(-) diff --git a/Robust/src/Benchmarks/SingleTM/Intruder/Decoded.java b/Robust/src/Benchmarks/SingleTM/Intruder/Decoded.java index ec71a2f4..736970ec 100644 --- a/Robust/src/Benchmarks/SingleTM/Intruder/Decoded.java +++ b/Robust/src/Benchmarks/SingleTM/Intruder/Decoded.java @@ -5,5 +5,7 @@ public class Decoded { int flowId; String data; + + public Decoded() {} } diff --git a/Robust/src/Benchmarks/SingleTM/Intruder/Decoder.java b/Robust/src/Benchmarks/SingleTM/Intruder/Decoder.java index 9374bcaa..4733da87 100644 --- a/Robust/src/Benchmarks/SingleTM/Intruder/Decoder.java +++ b/Robust/src/Benchmarks/SingleTM/Intruder/Decoder.java @@ -72,10 +72,9 @@ #define MAP_T RBTree #define MAP_ALLOC(hash, cmp) RBTree.alloc(cmp) #define MAP_INSERT(map, key, data) map.insert(key, data) -#define MAP_CONTAINS(map, key) map.contains(key); -#define MAP_FIND(map,key) map.get(key); -#define MAP_INSERT(map,key,data) map.insert(key,data); -#define MAP_REMOVE(map,key) map.deleteNode(key); +#define MAP_CONTAINS(map, key) map.contains(key) +#define MAP_FIND(map,key) map.get(key) +#define MAP_REMOVE(map,key) map.deleteNode(key) public class Decoder { @@ -93,23 +92,25 @@ public class Decoder { Decoder decoderPtr; decoderPtr = new Decoder(); - if(decoderPtr) { - decoderPtr.fragementedMapPtr = MAP_ALLOC(0,0); + if(decoderPtr != null) { + decoderPtr.fragmentedMapPtr = MAP_ALLOC(0,0); - if(decoderPtr.fragementedMapPtr == null) + if(decoderPtr.fragmentedMapPtr == null) { System.out.println("Assert in Decoder.alloc"); System.exit(1); } - decoderPtr.decodedQueuePtr = Queue_t.alloc(1024); + decoderPtr.decodedQueuePtr = Queue_t.queue_alloc(1024); if(decoderPtr.decodedQueuePtr == null) { System.out.println("Assert in Decoder.alloc"); System.exit(1); } - return decoderPtr; + } + + return decoderPtr; } @@ -118,28 +119,24 @@ public class Decoder { * ============================================================================= void decoder_free (decoder_t* decoderPtr); */ - public free(Decoder decoderPtr) { - fragmentedMapPtr = null; - decodedQueuePtr = null; - decoderPtr = null; - } /* ============================================================================= * decoder_process * ============================================================================= - error_t decoder_process (decoder_t* decoderPtr, char* bytes, long numByte); + er_t decoder_process (decoder_t* decoderPtr, char* bytes, long numByte); */ public int process(Packet bytes,int numByte) { boolean status; + ERROR er; /* - * Basic error checing + * Basic er checing */ - if (numByte < PACKET_HEADER_LENGTH) { - return ERROR.SHORT; + if (numByte < 0) { + return er.SHORT; } /* need to look into it later */ @@ -150,16 +147,17 @@ public class Decoder { int length = packetPtr.length; if (flowId < 0) { - return ERROR.FLOWID; + return er.FLOWID; } - if ((fragmentedId < 0) || (fragmentId >= numFragment)) { - return ERROR.FRAGMENTID; + if ((fragmentId < 0) || (fragmentId >= numFragment)) { + return er.FRAGMENTID; } if (length < 0) { - return ERROR.LENGTH; + return er.LENGTH; } + /* * Add to fragmented map for reassembling @@ -178,16 +176,15 @@ public class Decoder { } status = MAP_INSERT(fragmentedMapPtr,flowId,fragmentListPtr); - if(status == null) { + if(status) { System.out.println("Assertion in process"); System.exit(1); } } else { - List_Iter it; it.reset(fragmentListPtr); - if(it.hasNext(fragmentListPtr) == null) { + if(it.hasNext(fragmentListPtr)) { System.out.println("Assertion in process"); System.exit(1); } @@ -197,13 +194,13 @@ public class Decoder { if (numFragment != expectedNumFragment) { status = MAP_REMOVE(fragmentedMapPtr,flowId); - if(status == null) { + if(status) { System.out.println("Assertion in process"); System.exit(1); } status = fragmentListPtr.insert(packetPtr); - if(status == null) { + if(status) { System.out.println("Assertion in process"); System.exit(1); } @@ -214,7 +211,8 @@ public class Decoder { if(fragmentListPtr.getSize() == numFragment) { - int numByte = 0; + + int numBytes = 0; int i = 0; it.reset(fragmentListPtr); @@ -222,37 +220,37 @@ public class Decoder { Packet fragmentPtr = (Packet)it.next(fragmentListPtr); if(fragmentPtr.fragmentId != i) { - status = MAP_REMOVE(fragmentedMapPtr,(flowId); + status = MAP_REMOVE(fragmentedMapPtr,flowId); - if(status == null) { + if(status) { System.out.println("Assertion in process"); System.exit(1); } - return ERROR.INCOMPLETE; /* should be sequential */ + return er.INCOMPLETE; /* should be sequential */ } - numByte += fragmentPtr.length; + numBytes += fragmentPtr.length; i++; } - char[] data = new char[numByte+1]; + char[] data = new char[numBytes+1]; if(data == null) { System.out.println("Assertion in process"); System.exit(1); } - data[numByte] = '\0'; + data[numBytes] = '\0'; int dst = 0; // index of data - int i; it.reset(fragmentListPtr); - while(it.hasNext(fragmentLIstPtr)) { + while(it.hasNext(fragmentListPtr)) { Packet fragmentPtr = (Packet)it.next(fragmentListPtr); - for(i=0;i> 30)) + mti); + mt[mti] = (1812433253 * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti); /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */ /* In the previous versions, MSBs of the seed affect */ /* only MSBs of the array mt[]. */ /* 2002/01/09 modified by Makoto Matsumoto */ - mt[mti] &= 0xFFFFFFFFL; + mt[mti] &= 0xFFFFFFFF; /* for >32 bit machines */ } this.mti=mti; } - public void random_seed(long seed) { + public void random_seed(int seed) { init_genrand(seed); } - public long random_generate() { + public int random_generate() { return genrand_int32(); } - //public static long genrand_int32(long[] mt, long mtiPtr) { - public long genrand_int32() { - long y; - long[] mag01= new long[2]; - mag01[0] = 0x0L; + //public static int genrand_int32(int[] mt, int mtiPtr) { + public int genrand_int32() { + int y; + int[] mag01= new int[2]; + mag01[0] = 0x0; mag01[1] = MATRIX_A; int mti = this.mti; @@ -62,18 +62,18 @@ public class Random { int kk; if (mti == N+1) /* if init_genrand() has not been called, */ - init_genrand(5489L); /* a default initial seed is used */ + init_genrand(5489); /* a default initial seed is used */ for (kk=0;kk> 1) ^ mag01[(int)(y & 0x1L)]; + mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[(int)(y & 0x1)]; } for (;kk> 1) ^ mag01[(int)(y & 0x1L)]; + mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[(int)(y & 0x1)]; } y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK); - mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[(int)(y & 0x1L)]; + mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[(int)(y & 0x1)]; mti = 0; } @@ -82,8 +82,8 @@ public class Random { /* Tempering */ y ^= (y >> 11); - y ^= (y << 7) & 0x9d2c5680L; - y ^= (y << 15) & 0xefc60000L; + y ^= (y << 7) & 0x9d2c5680; + y ^= (y << 15) & 0xefc60000; y ^= (y >> 18); this.mti = mti; diff --git a/Robust/src/Benchmarks/SingleTM/Intruder/convertURNHex.java b/Robust/src/Benchmarks/SingleTM/Intruder/convertURNHex.java index 15750b0b..41e839e8 100644 --- a/Robust/src/Benchmarks/SingleTM/Intruder/convertURNHex.java +++ b/Robust/src/Benchmarks/SingleTM/Intruder/convertURNHex.java @@ -5,7 +5,7 @@ public class convertURNHex extends Preprocessor public convertURNHex() { super(); } - public void process(String str) + public static void process(String str) { char[] str_char = str.toCharArray(); int src = 0; @@ -15,8 +15,8 @@ public class convertURNHex extends Preprocessor while((c = str_char[src]) != '\0') { if (c == '%') { char[] hex = new char[3]; - hex[0] = Character.toLowerCase((str_char[src+1])); - hex[1] = Character.toLowerCase((str_char[src+2])); + hex[0] = toLowerCase((int)str_char[src+1]); + hex[1] = toLowerCase((int)str_char[src+2]); hex[2] = '\0'; String a = String.valueOf(hex); @@ -30,6 +30,17 @@ public class convertURNHex extends Preprocessor } str_char[dst] = '\0'; - str = String.valueOf(str_char); + str = new String(str_char); + } + + private static char toLowerCase(int a) { + + if(a >= 65 && a <= 90) + { + return (char)(a + 32); // difference 'a'(97) - 'A'(65) = 32 + } + else return (char)a; + + } } diff --git a/Robust/src/Benchmarks/SingleTM/Intruder/toLower.java b/Robust/src/Benchmarks/SingleTM/Intruder/toLower.java index b52cbe25..69ad36b5 100644 --- a/Robust/src/Benchmarks/SingleTM/Intruder/toLower.java +++ b/Robust/src/Benchmarks/SingleTM/Intruder/toLower.java @@ -4,9 +4,9 @@ public class toLower extends Preprocessor public toLower() { super(); } - public void process(String str) + public static void process(String str) { - return str.toLowerCase(); + str = str.toLowerCase(); } } -- 2.34.1