@ -0,0 +1,14 @@ |
|||
|
|||
template ShR(n, r) { |
|||
signal input in[n]; |
|||
signal output out[n]; |
|||
|
|||
for (var i=0; i<n; i++) { |
|||
if (i+r >= n) { |
|||
out[i] <== 0; |
|||
} else { |
|||
out[i] <== in[ i+r ]; |
|||
} |
|||
} |
|||
} |
|||
|
@ -0,0 +1,178 @@ |
|||
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */ |
|||
/* SHA-256 (FIPS 180-4) implementation in JavaScript (c) Chris Veness 2002-2017 */ |
|||
/* MIT Licence */ |
|||
/* www.movable-type.co.uk/scripts/sha256.html */ |
|||
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */ |
|||
|
|||
'use strict'; |
|||
|
|||
|
|||
/** |
|||
* SHA-256 hash function reference implementation. |
|||
* |
|||
* This is an annotated direct implementation of FIPS 180-4, without any optimisations. It is |
|||
* intended to aid understanding of the algorithm rather than for production use. |
|||
* |
|||
* While it could be used where performance is not critical, I would recommend using the ‘Web |
|||
* Cryptography API’ (developer.mozilla.org/en-US/docs/Web/API/SubtleCrypto/digest) for the browser, |
|||
* or the ‘crypto’ library (nodejs.org/api/crypto.html#crypto_class_hash) in Node.js. |
|||
* |
|||
* See csrc.nist.gov/groups/ST/toolkit/secure_hashing.html |
|||
* csrc.nist.gov/groups/ST/toolkit/examples.html |
|||
*/ |
|||
class Sha256 { |
|||
|
|||
/** |
|||
* Generates SHA-256 hash of string. |
|||
* |
|||
* @param {string} msg - (Unicode) string to be hashed. |
|||
* @param {Object} [options] |
|||
* @param {string} [options.msgFormat=string] - Message format: 'string' for JavaScript string |
|||
* (gets converted to UTF-8 for hashing); 'hex-bytes' for string of hex bytes ('616263' ≡ 'abc') . |
|||
* @param {string} [options.outFormat=hex] - Output format: 'hex' for string of contiguous |
|||
* hex bytes; 'hex-w' for grouping hex bytes into groups of (4 byte / 8 character) words. |
|||
* @returns {string} Hash of msg as hex character string. |
|||
*/ |
|||
static hash(msg, options) { |
|||
const defaults = { msgFormat: 'string', outFormat: 'hex' }; |
|||
const opt = Object.assign(defaults, options); |
|||
|
|||
// note use throughout this routine of 'n >>> 0' to coerce Number 'n' to unsigned 32-bit integer
|
|||
|
|||
switch (opt.msgFormat) { |
|||
default: // default is to convert string to UTF-8, as SHA only deals with byte-streams
|
|||
case 'string': msg = utf8Encode(msg); break; |
|||
case 'hex-bytes':msg = hexBytesToString(msg); break; // mostly for running tests
|
|||
} |
|||
|
|||
// constants [§4.2.2]
|
|||
const K = [ |
|||
0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, |
|||
0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, |
|||
0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, |
|||
0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, |
|||
0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, |
|||
0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, |
|||
0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, |
|||
0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2 ]; |
|||
|
|||
// initial hash value [§5.3.3]
|
|||
const H = [ |
|||
0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19 ]; |
|||
|
|||
// PREPROCESSING [§6.2.1]
|
|||
|
|||
msg += String.fromCharCode(0x80); // add trailing '1' bit (+ 0's padding) to string [§5.1.1]
|
|||
|
|||
// convert string msg into 512-bit blocks (array of 16 32-bit integers) [§5.2.1]
|
|||
const l = msg.length/4 + 2; // length (in 32-bit integers) of msg + ‘1’ + appended length
|
|||
const N = Math.ceil(l/16); // number of 16-integer (512-bit) blocks required to hold 'l' ints
|
|||
const M = new Array(N); // message M is N×16 array of 32-bit integers
|
|||
|
|||
for (let i=0; i<N; i++) { |
|||
M[i] = new Array(16); |
|||
for (let j=0; j<16; j++) { // encode 4 chars per integer (64 per block), big-endian encoding
|
|||
M[i][j] = (msg.charCodeAt(i*64+j*4+0)<<24) | (msg.charCodeAt(i*64+j*4+1)<<16) |
|||
| (msg.charCodeAt(i*64+j*4+2)<< 8) | (msg.charCodeAt(i*64+j*4+3)<< 0); |
|||
} // note running off the end of msg is ok 'cos bitwise ops on NaN return 0
|
|||
} |
|||
// add length (in bits) into final pair of 32-bit integers (big-endian) [§5.1.1]
|
|||
// note: most significant word would be (len-1)*8 >>> 32, but since JS converts
|
|||
// bitwise-op args to 32 bits, we need to simulate this by arithmetic operators
|
|||
const lenHi = ((msg.length-1)*8) / Math.pow(2, 32); |
|||
const lenLo = ((msg.length-1)*8) >>> 0; |
|||
M[N-1][14] = Math.floor(lenHi); |
|||
M[N-1][15] = lenLo; |
|||
|
|||
// HASH COMPUTATION [§6.2.2]
|
|||
|
|||
for (let i=0; i<N; i++) { |
|||
const W = new Array(64); |
|||
|
|||
// 1 - prepare message schedule 'W'
|
|||
for (let t=0; t<16; t++) W[t] = M[i][t]; |
|||
for (let t=16; t<64; t++) { |
|||
W[t] = (Sha256.σ1(W[t-2]) + W[t-7] + Sha256.σ0(W[t-15]) + W[t-16]) >>> 0; |
|||
} |
|||
|
|||
// 2 - initialise working variables a, b, c, d, e, f, g, h with previous hash value
|
|||
let a = H[0], b = H[1], c = H[2], d = H[3], e = H[4], f = H[5], g = H[6], h = H[7]; |
|||
|
|||
// 3 - main loop (note '>>> 0' for 'addition modulo 2^32')
|
|||
for (let t=0; t<64; t++) { |
|||
const T1 = h + Sha256.Σ1(e) + Sha256.Ch(e, f, g) + K[t] + W[t]; |
|||
const T2 = Sha256.Σ0(a) + Sha256.Maj(a, b, c); |
|||
h = g; |
|||
g = f; |
|||
f = e; |
|||
e = (d + T1) >>> 0; |
|||
d = c; |
|||
c = b; |
|||
b = a; |
|||
a = (T1 + T2) >>> 0; |
|||
} |
|||
|
|||
// 4 - compute the new intermediate hash value (note '>>> 0' for 'addition modulo 2^32')
|
|||
H[0] = (H[0]+a) >>> 0; |
|||
H[1] = (H[1]+b) >>> 0; |
|||
H[2] = (H[2]+c) >>> 0; |
|||
H[3] = (H[3]+d) >>> 0; |
|||
H[4] = (H[4]+e) >>> 0; |
|||
H[5] = (H[5]+f) >>> 0; |
|||
H[6] = (H[6]+g) >>> 0; |
|||
H[7] = (H[7]+h) >>> 0; |
|||
} |
|||
|
|||
// convert H0..H7 to hex strings (with leading zeros)
|
|||
for (let h=0; h<H.length; h++) H[h] = ('00000000'+H[h].toString(16)).slice(-8); |
|||
|
|||
// concatenate H0..H7, with separator if required
|
|||
const separator = opt.outFormat=='hex-w' ? ' ' : ''; |
|||
|
|||
return H.join(separator); |
|||
|
|||
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */ |
|||
|
|||
function utf8Encode(str) { |
|||
try { |
|||
return new TextEncoder().encode(str, 'utf-8').reduce((prev, curr) => prev + String.fromCharCode(curr), ''); |
|||
} catch (e) { // no TextEncoder available?
|
|||
return unescape(encodeURIComponent(str)); // monsur.hossa.in/2012/07/20/utf-8-in-javascript.html
|
|||
} |
|||
} |
|||
|
|||
function hexBytesToString(hexStr) { // convert string of hex numbers to a string of chars (eg '616263' -> 'abc').
|
|||
const str = hexStr.replace(' ', ''); // allow space-separated groups
|
|||
return str=='' ? '' : str.match(/.{2}/g).map(byte => String.fromCharCode(parseInt(byte, 16))).join(''); |
|||
} |
|||
} |
|||
|
|||
|
|||
|
|||
/** |
|||
* Rotates right (circular right shift) value x by n positions [§3.2.4]. |
|||
* @private |
|||
*/ |
|||
static ROTR(n, x) { |
|||
return (x >>> n) | (x << (32-n)); |
|||
} |
|||
|
|||
|
|||
/** |
|||
* Logical functions [§4.1.2]. |
|||
* @private |
|||
*/ |
|||
static Σ0(x) { return Sha256.ROTR(2, x) ^ Sha256.ROTR(13, x) ^ Sha256.ROTR(22, x); } |
|||
static Σ1(x) { return Sha256.ROTR(6, x) ^ Sha256.ROTR(11, x) ^ Sha256.ROTR(25, x); } |
|||
static σ0(x) { return Sha256.ROTR(7, x) ^ Sha256.ROTR(18, x) ^ (x>>>3); } |
|||
static σ1(x) { return Sha256.ROTR(17, x) ^ Sha256.ROTR(19, x) ^ (x>>>10); } |
|||
static Ch(x, y, z) { return (x & y) ^ (~x & z); } // 'choice'
|
|||
static Maj(x, y, z) { return (x & y) ^ (x & z) ^ (y & z); } // 'majority'
|
|||
|
|||
} |
|||
|
|||
|
|||
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */ |
|||
|
|||
if (typeof module != 'undefined' && module.exports) module.exports = Sha256; // ≡ export default Sha256
|
|||
|
@ -1,61 +0,0 @@ |
|||
const path = require("path"); |
|||
const fs = require("fs"); |
|||
const cmd=require("node-cmd"); |
|||
const util = require("util"); |
|||
const assert = require("assert"); |
|||
|
|||
const claimUtils = require("../src/claimUtils.js"); |
|||
|
|||
cmd.get[util.promisify.custom] = (c) => { |
|||
return new Promise((resolve, reject) => { |
|||
cmd.get(c, (err, data, stderr) => { |
|||
if (err) { |
|||
reject(err); |
|||
} else { |
|||
resolve([data, stderr]); |
|||
} |
|||
}); |
|||
}); |
|||
}; |
|||
|
|||
const getAsync = util.promisify(cmd.get); |
|||
const mkdir = util.promisify(fs.mkdir); |
|||
const writeFile = util.promisify(fs.writeFile); |
|||
|
|||
describe("command line", () => { |
|||
|
|||
let tmpPath; |
|||
before(async () => { |
|||
tmpPath = path.join(__dirname, "..", "tmp"); |
|||
if (!fs.existsSync(tmpPath)) { |
|||
await mkdir(tmpPath, 0o744); |
|||
} |
|||
process.chdir(tmpPath); |
|||
}); |
|||
|
|||
it("Should create a tree from a claim files", async () => { |
|||
|
|||
let i; |
|||
let claims = []; |
|||
for (i=0; i<100; i++) { |
|||
const b = Buffer.from([ i / 256, i % 256 ]); |
|||
claims[i] = claimUtils.buildClaim("0x01", "0x02", "0x03", b).toString("hex"); |
|||
} |
|||
|
|||
claims = claims.sort(); |
|||
const claimsFile = path.join(tmpPath, "claims100.hex"); |
|||
const dbFile = path.join(tmpPath, "claims100.db"); |
|||
await writeFile(claimsFile, claims.join("\n"), "utf8"); |
|||
|
|||
await getAsync(`${path.join("..", "cli.js")} -d ${dbFile} add ${claimsFile} `); |
|||
|
|||
const data = await getAsync(`${path.join("..", "cli.js")} -d ${dbFile} export`); |
|||
let claims2 = data[0].split("\n"); |
|||
|
|||
claims2 = claims2.filter(function(n){ return n.length>0; }); |
|||
claims2 = claims2.sort(); |
|||
|
|||
assert.equal(claims2.join("\n"), claims.join("\n")); |
|||
|
|||
}).timeout(20000); |
|||
}); |
@ -1,2 +0,0 @@ |
|||
1 * 2 * 3 |
|||
* 4 |
@ -1,141 +0,0 @@ |
|||
const assert = require("assert"); |
|||
|
|||
const StaticMerkle = require("../src/StaticMerkle.js"); |
|||
const MemDB = require("../src/dbMem.js"); |
|||
const hash = require("../src/hashKeccak.js"); |
|||
const buffUtils = require("../src/buffUtils.js"); |
|||
const claimUtils = require("../src/claimUtils.js"); |
|||
|
|||
describe("static merkle", () => { |
|||
before(async () => { |
|||
|
|||
}); |
|||
|
|||
it("Create an empty tring of 0 levels", async () => { |
|||
const dbPrv0 = await MemDB(); |
|||
const SM0 = await StaticMerkle(hash, dbPrv0, 0); |
|||
const empty = SM0.root; |
|||
assert.equal(buffUtils.toHex(empty), "0x0000000000000000000000000000000000000000000000000000000000000000"); |
|||
}); |
|||
|
|||
it("create an empty", async () => { |
|||
const dbPrv = await MemDB(); |
|||
const SM140 = await StaticMerkle(hash, dbPrv, 140); |
|||
const empty = SM140.root; |
|||
assert.equal(buffUtils.toHex(empty), "0x0000000000000000000000000000000000000000000000000000000000000000"); |
|||
}); |
|||
|
|||
it("should add and remove a claim", async() => { |
|||
const dbPrv = await MemDB(); |
|||
const SM140 = await StaticMerkle(hash, dbPrv, 140); |
|||
const empty = SM140.root; |
|||
const claim = claimUtils.buildClaim("0x01", "0x02", "0x03", "0x04"); |
|||
await SM140.addClaim(claim); |
|||
assert.equal(buffUtils.toHex(SM140.root), "0xd3d9ad5e3c0b38c4e3eb411e9e3114b5ed8fb5c4bc69158329feb1a62743cda1"); |
|||
await SM140.removeClaim(claim); |
|||
assert.equal(buffUtils.toHex(SM140.root), buffUtils.toHex(empty)); |
|||
|
|||
assert.equal(SM140.tx.inserts.length, 0); |
|||
|
|||
}); |
|||
|
|||
it("should add two claims in different order and should be the same", async () => { |
|||
const dbPrv_1 = await MemDB(); |
|||
const SM140_1 = await StaticMerkle(hash, dbPrv_1, 140); |
|||
const dbPrv_2 = await MemDB(); |
|||
const SM140_2 = await StaticMerkle(hash, dbPrv_2, 140); |
|||
const empty = SM140_1.root; |
|||
const claim1 = claimUtils.buildClaim("0x01", "0x02", "0x03", "0x04"); |
|||
const claim2 = claimUtils.buildClaim("0x01", "0x02", "0x03", "0x05"); |
|||
|
|||
await SM140_1.addClaim(claim1); |
|||
await SM140_1.addClaim(claim2); |
|||
|
|||
await SM140_2.addClaim(claim2); |
|||
await SM140_2.addClaim(claim1); |
|||
|
|||
assert.equal(buffUtils.toHex(SM140_1.root), buffUtils.toHex(SM140_2.root)); |
|||
|
|||
await SM140_1.removeClaim(claim1); |
|||
await SM140_1.removeClaim(claim2); |
|||
assert.equal(buffUtils.toHex(SM140_1.root), buffUtils.toHex(empty)); |
|||
|
|||
await SM140_2.removeClaim(claim2); |
|||
await SM140_2.removeClaim(claim1); |
|||
assert.equal(buffUtils.toHex(SM140_2.root), buffUtils.toHex(empty)); |
|||
|
|||
}); |
|||
|
|||
it("should add 10 claims and remove them in different order", async () => { |
|||
const dbPrv = await MemDB(); |
|||
const SM140 = await StaticMerkle(hash, dbPrv, 140); |
|||
const empty = SM140.root; |
|||
const claims = []; |
|||
let i; |
|||
for (i=0; i<10; i++) { |
|||
const b = Buffer.from([ i / 256, i % 256 ]); |
|||
claims[i] = claimUtils.buildClaim("0x01", "0x02", "0x03", b); |
|||
} |
|||
|
|||
for (i=0;i<claims.length; i++) { |
|||
await SM140.addClaim(claims[i]); |
|||
} |
|||
|
|||
assert.equal(buffUtils.toHex(SM140.root), "0xb57c288d5c018c56610a3fb783062c9b199221734c8c5617795b57cbdbd4347f"); |
|||
|
|||
for (i=0;i<claims.length; i++) { |
|||
await SM140.removeClaim(claims[i]); |
|||
} |
|||
|
|||
assert.equal(buffUtils.toHex(SM140.root), buffUtils.toHex(empty)); |
|||
assert.equal(SM140.tx.inserts.length, 0); |
|||
}); |
|||
|
|||
it("Should give the same root when added a repeated claim", async () => { |
|||
const dbPrv = await MemDB(); |
|||
const SM140 = await StaticMerkle(hash, dbPrv, 140); |
|||
const empty = SM140.root; |
|||
const claims = []; |
|||
let i; |
|||
for (i=0; i<100; i++) { |
|||
const b = Buffer.from([ i % 10 ]); |
|||
claims[i] = claimUtils.buildClaim("0x01", "0x02", "0x03", b); |
|||
} |
|||
|
|||
for (i=0;i<claims.length; i++) { |
|||
await SM140.addClaim(claims[i]); |
|||
} |
|||
|
|||
assert.equal(buffUtils.toHex(SM140.root), "0xb57c288d5c018c56610a3fb783062c9b199221734c8c5617795b57cbdbd4347f"); |
|||
|
|||
for (i=0;i<claims.length; i++) { |
|||
await SM140.removeClaim(claims[i]); |
|||
} |
|||
|
|||
assert.equal(buffUtils.toHex(SM140.root), buffUtils.toHex(empty)); |
|||
assert.equal(SM140.tx.inserts.length, 0); |
|||
}).timeout(20000); |
|||
|
|||
it("Should create a merkle proof and verify it ok", async () => { |
|||
const dbPrv = await MemDB(); |
|||
const SM140 = await StaticMerkle(hash, dbPrv, 140); |
|||
const empty = SM140.root; |
|||
const claim1 = claimUtils.buildClaim("0x01", "0x02", "0x03", "0x04"); |
|||
const claim2 = claimUtils.buildClaim("0x01", "0x02", "0x03", "0x05"); |
|||
|
|||
await SM140.addClaim(claim1); |
|||
await SM140.addClaim(claim2); |
|||
|
|||
const mp = await SM140.getMerkeProof(claim1); |
|||
|
|||
assert.equal(SM140.checkClaim(SM140.root, claim1, mp), true); |
|||
assert.equal(SM140.checkClaim(empty, claim1, mp), false); |
|||
assert.equal(SM140.checkClaim(empty, claim2, mp), false); |
|||
|
|||
const mp1 = await SM140.getMerkeProof(claim1); |
|||
assert.equal(SM140.checkClaim(SM140.root, claim1, mp1), true); |
|||
const mp2 = await SM140.getMerkeProof(claim2); |
|||
assert.equal(SM140.checkClaim(SM140.root, claim2, mp2), true); |
|||
}); |
|||
|
|||
}); |
@ -1,45 +0,0 @@ |
|||
11+12; 13; |
|||
14; 15; |
|||
/* Multi Line |
|||
comment */ |
|||
/*** / * /* **/ |
|||
// Single line comment /* sss */ |
|||
16; 0x1f; 0xAa; |
|||
12; id1; A; B; A+B; |
|||
A*B+A*B+3; |
|||
4/2; |
|||
4/3; |
|||
4/3*3; |
|||
8/2; |
|||
0/2; |
|||
2/1; |
|||
8 % 5; |
|||
-1; +--1; |
|||
(3+4)*(5*2); |
|||
0xFF & 0x12; |
|||
1 << 8; |
|||
-1 >> 257; |
|||
-1 << 257; |
|||
-1 >> 256; |
|||
-1 << 256; |
|||
-1 >> 250; |
|||
-1 << 250; |
|||
33 == 33; |
|||
33 == 34; |
|||
3>3; |
|||
3>=3; |
|||
3<=3; |
|||
3<3; |
|||
3 && 0; |
|||
0 && 3; |
|||
3 && 3; |
|||
0 && 0; |
|||
!3; |
|||
!0; |
|||
!!8; |
|||
2**3; |
|||
(-1)**(-1); |
|||
a[3]; |
|||
a[3][b] + b[4][c][d]; |
|||
func() + func(a) + func(a,b); |
|||
3*4==6+6 && 2+1==3 ? 3+3*2 : (3+2)*6 |
@ -1 +0,0 @@ |
|||
f(1,2) |
@ -1,9 +0,0 @@ |
|||
a+b*c |
|||
(a+b)*c |
|||
var c + a[1].b[2] + c |
|||
f(1,2) |
|||
component f(4) d; |
|||
|
|||
a++ + b++; |
|||
|
|||
--a; |
@ -1,5 +0,0 @@ |
|||
var a; |
|||
var b; |
|||
var c; |
|||
a+b*b[3+a][2]; |
|||
a<<2<=2>>a |
@ -1,3 +0,0 @@ |
|||
a <== b === c |
|||
r = a ? c ? 5 : 6 : b ? 3 : 4 |
|||
c = sqrt(a**2+b**2) |
@ -1,8 +0,0 @@ |
|||
(a + bb) + c; |
|||
include "filename.ext" |
|||
include "secondfile" |
|||
include "therdfile"; |
|||
include "4th file" |
|||
{ |
|||
include "fifthfile" |
|||
} |
@ -1,13 +0,0 @@ |
|||
{ |
|||
3+3 |
|||
4+4 |
|||
5+5 |
|||
} |
|||
6 |
|||
7 |
|||
a <-- 3 |
|||
3 --> a; |
|||
signal input b <== 4; |
|||
4 ==> signal b; |
|||
c === d; |
|||
|
@ -1,10 +0,0 @@ |
|||
signal input b <== 3; |
|||
signal o[44] <-- 2; |
|||
a[1][2].b[3] <== 4 |
|||
function f(a,b) { |
|||
c=a+b; |
|||
} |
|||
|
|||
component b(b1,b2) { |
|||
b1 <== b2[3].pin[4] |
|||
} |
@ -1,7 +0,0 @@ |
|||
if (a) b; else c; |
|||
if (a) { |
|||
1 |
|||
} else { |
|||
2 |
|||
} |
|||
if (1) if(0) 1; else 2; |
@ -1,4 +0,0 @@ |
|||
var a=0; |
|||
for (i=0; i<10; i=i+1) { |
|||
a=a+1; |
|||
} |
@ -1,7 +0,0 @@ |
|||
++a; |
|||
a++; |
|||
b--; |
|||
--b; |
|||
a -- > 0; |
|||
0 < ++ b; |
|||
|
@ -1,11 +0,0 @@ |
|||
a=3 |
|||
a+=3 |
|||
a-=3 |
|||
a*=3 |
|||
a/=3 |
|||
a%=3 |
|||
a>>=3 |
|||
a<<=3 |
|||
a&=3 |
|||
a|=3 |
|||
a^=3 |
@ -1,6 +0,0 @@ |
|||
while (1) { |
|||
a |
|||
} |
|||
do { |
|||
xx; |
|||
} while (1) |
@ -1,9 +0,0 @@ |
|||
function f() { |
|||
return 3; |
|||
} |
|||
|
|||
function ff(a) { |
|||
return 4; |
|||
} |
|||
|
|||
component c = s(a); |