PageRenderTime 132ms queryFilters 1ms Sphinxql 434ms app.CodeModel.GetByIds 9ms findMatchingLines 29ms GetByIds 38ms meta 0ms repositoryFilters 2ms languageFilters 0ms sourceFilters 4ms

12,159,181 results for 'while' (132 ms)

Source

Language

Repository

ServerLog.txt https://bitbucket.org/weageoo/asyncsocketserver.git | Plain Text | 500 lines
817:42:07 AcceptServer ��������� �������.

917:42:13 ResponceServer �����������. �������: Error occurred while bind(): WSAEADDRINUSE.

1017:42:19 AcceptServer �����������. �������: Error occurred while bind(): WSAEADDRINUSE.

1917:51:42 ResponceServer ��������� �������.

2017:52:29 AcceptServer �����������. �������: Error occurred while bind(): WSAEADDRINUSE.

2117:52:32 ResponceServer �����������. �������: Error occurred while bind(): WSAEADDRINUSE.

2417:53:27 ConsolePipe ��������� �������.

2517:53:48 AcceptServer �����������. �������: Error occurred while bind(): WSAEADDRINUSE.

2617:53:50 ConsolePipe �����������. �������: CreateNamedPipe failed.

2617:53:50 ConsolePipe �����������. �������: CreateNamedPipe failed.

2717:53:53 ResponceServer �����������. �������: Error occurred while bind(): WSAEADDRINUSE.

2817:55:06 ResponceServer ��������� �������.

3417:57:46 ConsolePipe ��������� �������.

3517:57:53 ResponceServer �����������. �������: Error occurred while bind(): WSAEADDRINUSE.

3617:57:57 AcceptServer �����������. �������: Error occurred while bind(): WSAEADDRINUSE.

PeepholeSubstituteAlternateSyntaxTest.java https://bitbucket.org/simpler/squeeze.git | Java | 1,065 lines
499    fold("while(!(x||!y)) foo()", "while(!x&&y) foo()");
500    fold("while(!(x||y)) foo()", "while(!x&&!y) foo()");
501    fold("while(!(!x||y-z)) foo()", "while(x&&!(y-z)) foo()");
704    // A break here only breaks out of the inner loop.
705    foldSame("function f() { while(x) { while (y) { throw Error } } }");
706
803  public void testNestedIfCombine() {
804    fold("if(x)if(y){while(1){}}", "if(x&&y){while(1){}}");
805    fold("if(x||z)if(y){while(1){}}", "if((x||z)&&y){while(1){}}");
805    fold("if(x||z)if(y){while(1){}}", "if((x||z)&&y){while(1){}}");
806    fold("if(x)if(y||z){while(1){}}", "if((x)&&(y||z)){while(1){}}");
807    foldSame("if(x||z)if(y||z){while(1){}}");
807    foldSame("if(x||z)if(y||z){while(1){}}");
808    fold("if(x)if(y){if(z){while(1){}}}", "if(x&&y&&z){while(1){}}");
809  }
john.conf https://bitbucket.org/lcirvin/cse465-project.git | Config | 1,617 lines
485	i = 0;
486	while (c = word[i++])
487	if (c < 'a' || c > 'z') {
497	i = 0;
498	while (c = word[i++])
499	if (c < '0' || c > '9') {
509	i = 0;
510	while (c = word[i++])
511	if ((c < 'a' || c > 'z') && (c < '0' || c > '9')) {
521	i = 0;
522	while (c = word[i++])
523	if ((c < 'a' || c > 'z') && (c < '0' || c > '9')) {
536	i = 0;				// Convert to uppercase
537	while (c = word[i]) {
538		if (c >= 'a' && c <= 'z') word[i] &= 0xDF;
dumb32.conf https://bitbucket.org/lcirvin/cse465-project.git | Config | 1,435 lines
33	c = 0x20;		// from SPACE
34	while (c < 0x7f)	// ..to TILDE
35		charset[i++] = c++;
36	c = 0xa0;		// from NO-BREAK SPACE
37	while (c < 0x378)	// ..to GREEK SMALL LETTER PAMPHYLIAN DIGAMMA
38		charset[i++] = c++;
39	c = 0x37a;		// from GREEK YPOGEGRAMMENI
40	while (c < 0x37f)	// ..to GREEK QUESTION MARK
41		charset[i++] = c++;
42	c = 0x384;		// from GREEK TONOS
43	while (c < 0x38b)	// ..to GREEK CAPITAL LETTER IOTA WITH TONOS
44		charset[i++] = c++;
45	c = 0x38e;		// from GREEK CAPITAL LETTER UPSILON WITH TONOS
46	while (c < 0x3a2)	// ..to GREEK CAPITAL LETTER RHO
47		charset[i++] = c++;
dumb16.conf https://bitbucket.org/lcirvin/cse465-project.git | Config | 1,079 lines
33	c = 0x20;		// from SPACE
34	while (c < 0x7f)	// ..to TILDE
35		charset[i++] = c++;
36	c = 0xa0;		// from NO-BREAK SPACE
37	while (c < 0x378)	// ..to GREEK SMALL LETTER PAMPHYLIAN DIGAMMA
38		charset[i++] = c++;
39	c = 0x37a;		// from GREEK YPOGEGRAMMENI
40	while (c < 0x37f)	// ..to GREEK QUESTION MARK
41		charset[i++] = c++;
42	c = 0x384;		// from GREEK TONOS
43	while (c < 0x38b)	// ..to GREEK CAPITAL LETTER IOTA WITH TONOS
44		charset[i++] = c++;
45	c = 0x38e;		// from GREEK CAPITAL LETTER UPSILON WITH TONOS
46	while (c < 0x3a2)	// ..to GREEK CAPITAL LETTER RHO
47		charset[i++] = c++;
warn-enum-compare.cpp https://bitbucket.org/codefirex/external_clang.git | C++ | 212 lines
32
33  while (x == FooA);
34  while (y == BarD);
34  while (y == BarD);
35  while (a == name1::F1);
36  while (z == name1::B2);
36  while (z == name1::B2);
37  while (a == b);
38  while (a == c);
38  while (a == c);
39  while (b == c);
40  while (B1 == name1::B2);
40  while (B1 == name1::B2);
41  while (B2 == name2::B1);
42  while (x == AnonAA); // expected-warning {{comparison of constant 42 with expression of type 'Foo' is always false}}
markdown.c https://bitbucket.org/yangkit/redcarpet.git | C | 2,505 lines
153	size_t i = 0, org;
154	while (i < src->size) {
155		org = i;
155		org = i;
156		while (i < src->size && src->data[i] != '\\')
157			i++;
206
207	while (ref != NULL) {
208		if (ref->id == hash)
225
226		while (r) {
227			next = r->next;
308	/* try to find the beginning of an URI */
309	while (i < size && (isalnum(data[i]) || data[i] == '.' || data[i] == '+' || data[i] == '-'))
310		i++;
ir-emit.h https://bitbucket.org/danipen/mono.git | C Header | 897 lines
116        (dest)->cil_code = (cfg)->ip;  \
117	} while (0)
118
126		(dest)->dreg = alloc_dreg ((cfg), STACK_I4);	\
127	} while (0)
128
137		(dest)->dreg = alloc_dreg ((cfg), STACK_PTR);	\
138	} while (0)
139
144        (dest)->inst_l = (val); \
145	} while (0)
146
151        (dest)->inst_offset = offset; \
152	} while (0)
153
while.test https://bitbucket.org/vrrm/brl-cad-copy-for-fast-history-browsing-in-git.git | Unknown | 622 lines
56} 6
57test while-1.6 {TclCompileWhileCmd: test expr is enclosed in quotes} {
58    set i 0
136} {1 2 3}
137test while-1.13 {TclCompileWhileCmd: while command result} {
138    set i 0
141} {}
142test while-1.14 {TclCompileWhileCmd: while command result} {
143    set i 0
423} {1 2 3}
424test while-4.14 {while (not compiled): while command result} {
425    set i 0
429} {}
430test while-4.15 {while (not compiled): while command result} {
431    set i 0
trigo-benchmark-java.csv https://bitbucket.org/alexandre.navarro/benchmark-languages | Unknown | 100 lines
1[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,498
2[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,498
2[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,498
3[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,497
4[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,499
4[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,499
5[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,502
6[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,498
6[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,498
7[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,498
8[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,498
8[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,498
9[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,498
10[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,498
10[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,498
11[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },, average time,498, min time,497, max time,502, relative deviation time,0.2
12[TrigoTest], Calculation of Fast Sine 1 while (i < 1.0E7) {sine = sin(i)  i++ }, sine=0.9906646476829858, snapshot time,1905
trigo-benchmark-java-firstinvoke.csv https://bitbucket.org/alexandre.navarro/benchmark-languages | Unknown | 100 lines
1[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,517
2[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,520
2[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,520
3[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,496
4[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,497
4[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,497
5[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,498
6[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,501
6[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,501
7[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,497
8[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,496
8[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,496
9[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,497
10[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,497
10[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361245, snapshot time,497
11[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },, average time,501, min time,496, max time,520, relative deviation time,1.71
12[TrigoTest], Calculation of Fast Sine 1 while (i < 1.0E7) {sine = sin(i)  i++ }, sine=0.9906646476829858, snapshot time,1947
trigo-benchmark-java-firstinvoke.csv https://bitbucket.org/alexandre.navarro/benchmark-languages | Unknown | 100 lines
1[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361263, snapshot time,6582
2[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361263, snapshot time,6604
2[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361263, snapshot time,6604
3[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361263, snapshot time,6614
4[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361263, snapshot time,6603
4[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361263, snapshot time,6603
5[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361263, snapshot time,6600
6[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361263, snapshot time,6600
6[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361263, snapshot time,6600
7[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361263, snapshot time,6599
8[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361263, snapshot time,6610
8[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361263, snapshot time,6610
9[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361263, snapshot time,6602
10[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361263, snapshot time,6605
10[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },  sine=0.9906646477361263, snapshot time,6605
11[TrigoTest], Calculation of Sine 1 while (i < 1.0E7) {sine = Math.sin(i)  i++ },, average time,6601, min time,6582, max time,6614, relative deviation time,0.12
12[TrigoTest], Calculation of Fast Sine 1 while (i < 1.0E7) {sine = sin(i)  i++ }, sine=0.9906646476829858, snapshot time,1451
FastList.hx https://bitbucket.org/triplefox/fireball | Unknown | 2,450 lines
42		var ret = false;
43		while(cur!=end()) {
44			if(cur.elem()==obj) {
62	public inline function splice(pre:CxFastNode_PhysObj,cur:CxFastNode_PhysObj,n:Int):CxFastNode_PhysObj {
63		while(n-->0 && cur!=end())
64			cur = erase(pre,cur);
68		if(true) {
69			while(!empty()) {
70				var old = begin();
78		var tmp = new CxFastList_PhysObj();
79		while(!empty())
80			tmp.add(pop());
87		var cur = begin();
88		while(cur!=end()) { cnt++; cur=cur.next; }
89		return cnt;
model6.dot https://bitbucket.org/nacuong/naruto | Unknown | 493 lines
3"FORNODE if_icmpge 17 \n antlr.TokenBuffer 67        while (queue.nbrEntries < amount + markerOffset) {" [color=yellow,style=filled];
4"FORNODE if_icmpge 17 \n antlr.TokenBuffer 67        while (queue.nbrEntries < amount + markerOffset) {" -> "FORNODE if_icmpge 18 \n antlr.CharBuffer 44            while (queue.nbrEntries < amount + markerOffset) {" [label=true];
5"FORNODE if_icmpge 17 \n antlr.TokenBuffer 67        while (queue.nbrEntries < amount + markerOffset) {" -> "FORNODE ifnonnull 170 \n antlr.preprocessor.PreprocessorLexer 178				if ( _returnToken==null ) continue tryAgain; // found SKIP token" [label=true];
6"FORNODE if_icmpge 17 \n antlr.TokenBuffer 67        while (queue.nbrEntries < amount + markerOffset) {" -> "IFNODE if_icmpne 19 \n antlr.preprocessor.PreprocessorLexer 300			if ((LA(1)==' ') && (true)) {" [label=true];
7"FORNODE if_icmpge 17 \n antlr.TokenBuffer 67        while (queue.nbrEntries < amount + markerOffset) {" -> "IFNODE if_icmpne 45 \n antlr.ANTLRLexer 366			if ((LA(1)=='\r') && (LA(2)=='\n')) {" [label=true];
8"FORNODE if_icmpge 17 \n antlr.TokenBuffer 67        while (queue.nbrEntries < amount + markerOffset) {" -> "IFNODE if_icmpne 204 \n antlr.ANTLRLexer 301					if ((LA(1)=='=') && (LA(2)=='>')) {" [label=true];
8"FORNODE if_icmpge 17 \n antlr.TokenBuffer 67        while (queue.nbrEntries < amount + markerOffset) {" -> "IFNODE if_icmpne 204 \n antlr.ANTLRLexer 301					if ((LA(1)=='=') && (LA(2)=='>')) {" [label=true];
9"FORNODE if_icmpge 17 \n antlr.TokenBuffer 67        while (queue.nbrEntries < amount + markerOffset) {" -> "FORNODE if_icmpge 18 \n antlr.CharBuffer 44            while (queue.nbrEntries < amount + markerOffset) {" [label=false];
10"FORNODE if_icmpge 17 \n antlr.TokenBuffer 67        while (queue.nbrEntries < amount + markerOffset) {" -> "IFNODE if_icmpne 19 \n antlr.preprocessor.PreprocessorLexer 300			if ((LA(1)==' ') && (true)) {" [label=false];
10"FORNODE if_icmpge 17 \n antlr.TokenBuffer 67        while (queue.nbrEntries < amount + markerOffset) {" -> "IFNODE if_icmpne 19 \n antlr.preprocessor.PreprocessorLexer 300			if ((LA(1)==' ') && (true)) {" [label=false];
11"FORNODE if_icmpge 17 \n antlr.TokenBuffer 67        while (queue.nbrEntries < amount + markerOffset) {" -> "IFNODE if_icmpne 45 \n antlr.ANTLRLexer 366			if ((LA(1)=='\r') && (LA(2)=='\n')) {" [label=false];
12"FORNODE if_icmpge 17 \n antlr.TokenBuffer 67        while (queue.nbrEntries < amount + markerOffset) {" -> "FORNODE ifnonnull 275 \n antlr.ANTLRLexer 322				if ( _returnToken==null ) continue tryAgain; // found SKIP token" [label=false];
57"FORNODE if_icmpge 18 \n antlr.CharBuffer 44            while (queue.nbrEntries < amount + markerOffset) {" -> "if_icmpne 221 \n antlr.ANTLRLexer 305					else if ((LA(1)=='.') && (LA(2)=='.')) {" [label=false];
58"FORNODE if_icmpge 18 \n antlr.CharBuffer 44            while (queue.nbrEntries < amount + markerOffset) {" -> "FORNODE if_icmpge 17 \n antlr.TokenBuffer 67        while (queue.nbrEntries < amount + markerOffset) {" [label=false];
59"FORNODE if_icmpge 18 \n antlr.CharBuffer 44            while (queue.nbrEntries < amount + markerOffset) {" -> "FORNODE ifeq 83 \n antlr.ANTLRLexer 1088				else if ((_tokenSet_3.member(LA(1)))) {" [label=false];
HCatClientHMSImpl.java git://github.com/apache/hive.git | Java | 1,103 lines
99    } catch (MetaException exp) {
100      throw new HCatException("MetaException while listing db names. " + exp.getMessage(), exp);
101    } catch (TException e) {
101    } catch (TException e) {
102      throw new HCatException("Transport Exception while listing db names. " + e.getMessage(), e);
103    }
116      throw new ObjectNotFoundException(
117        "NoSuchObjectException while fetching database", exp);
118    } catch (MetaException exp) {
118    } catch (MetaException exp) {
119      throw new HCatException("MetaException while fetching database",
120        exp);
122      throw new ConnectionFailureException(
123        "TException while fetching database", exp);
124    }
big.c https://github.com/bsmr-erlang/otp.git | C | 3,005 lines
34	ErtsDigit* _t_v  = v;			\
35	while(_t_sz--) *_t_v++ = 0;		\
36    } while(0)
44	    _t_src = src;					\
45	    while(_t_sz--) *_t_dst++ = *_t_src++;		\
46	}							\
49	    _t_src = (src)+((sz)-1);				\
50	    while(_t_sz--) *_t_dst-- = *_t_src--;		\
51        }							\
51        }							\
52    } while(0)
53
63	c = ___cr;							\
64    }  while(0)
65
big.c https://github.com/cobusc/otp.git | C | 2,978 lines
34	ErtsDigit* _t_v  = v;			\
35	while(_t_sz--) *_t_v++ = 0;		\
36    } while(0)
44	    _t_src = src;					\
45	    while(_t_sz--) *_t_dst++ = *_t_src++;		\
46	}							\
49	    _t_src = (src)+((sz)-1);				\
50	    while(_t_sz--) *_t_dst-- = *_t_src--;		\
51        }							\
51        }							\
52    } while(0)
53
63	c = ___cr;							\
64    }  while(0)
65
newmat2.cpp https://bitbucket.org/olahlou/otb | C++ | 643 lines
37   Real* elx=data+(f-skip); Real* el=mrc.data+(f-mrc.skip);
38   while (l--) *elx++ += *el++;
39}
48   Real* elx=data+(f-skip); Real* el=mrc.data+(f-mrc.skip);
49   while (l--) *elx++ += *el++ * x;
50}
59   Real* elx=data+(f-skip); Real* el=mrc.data+(f-mrc.skip);
60   while (l--) *elx++ -= *el++;
61}
70   Real* elx=data+(f-skip); Real* ely=mrc.data+(f-mrc.skip);
71   while (l--) *elx++ = *ely++;
72}
83   Real sum = 0.0;
84   while (l--) sum += *el1++ * *el2++;
85   return sum;
jit-gen-x86.h https://bitbucket.org/philburr/libjit | C++ Header | 1,747 lines
251
252#define x86_address_byte(inst,m,o,r) do { *(inst)++ = ((((m)&0x03)<<6)|(((o)&0x07)<<3)|(((r)&0x07))); } while (0)
253#define x86_imm_emit32(inst,imm)     \
259			*(inst)++ = imb.b [3];	\
260	} while (0)
261#define x86_imm_emit16(inst,imm)     do { *(short*)(inst) = (imm); (inst) += 2; } while (0)
261#define x86_imm_emit16(inst,imm)     do { *(short*)(inst) = (imm); (inst) += 2; } while (0)
262#define x86_imm_emit8(inst,imm)      do { *(inst) = (unsigned char)((imm) & 0xff); ++(inst); } while (0)
263#define x86_is_imm8(imm)             (((int)(imm) >= -128 && (int)(imm) <= 127))
265
266#define x86_reg_emit(inst,r,regno)   do { x86_address_byte ((inst), 3, (r), (regno)); } while (0)
267#define x86_reg8_emit(inst,r,regno,is_rh,is_rnoh)   do {x86_address_byte ((inst), 3, (is_rh)?((r)|4):(r), (is_rnoh)?((regno)|4):(regno));} while (0)
267#define x86_reg8_emit(inst,r,regno,is_rh,is_rnoh)   do {x86_address_byte ((inst), 3, (is_rh)?((r)|4):(r), (is_rnoh)?((regno)|4):(regno));} while (0)
268#define x86_regp_emit(inst,r,regno)  do { x86_address_byte ((inst), 0, (r), (regno)); } while (0)
269#define x86_mem_emit(inst,r,disp)    do { x86_address_byte ((inst), 0, (r), 5); x86_imm_emit32((inst), (disp)); } while (0)
jit-gen-x86-64.h https://bitbucket.org/philburr/libjit | C++ Header | 5,580 lines
155		*(inst)++ = imb.b[7]; \
156	} while (0)
157
182		} \
183	} while(0)
184
213		} \
214	} while(0)
215
238		} \
239	} while(0)
240
246		x86_64_rex_emit((inst), 0, (modrm_reg), (index_reg), (rm_base_opcode_reg)); \
247	} while(0)
248
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21