100+ results results for 'i++; source:Bitbucket repo:rbair/rbair-controls-8' (432 ms)
115 } 116 i++; 117 if( 'A'+i == '[' ) 151 j = 0; 152 i++; 153 }boxpack2d.c https://bitbucket.org/DeanGiberson/blender.git | C | 439 lines
184 vert->trb = box; 185 vert->index = i; i++; 186 box->v[BL] = vert; vert++; 192 vert->blb = box; 193 vert->index = i; i++; 194 box->v[TR] = vert; vert++; 200 vert->brb = box; 201 vert->index = i; i++; 202 box->v[TL] = vert; vert++; 208 vert->tlb = box; 209 vert->index = i; i++; 210 box->v[BR] = vert; vert++;domain.c https://bitbucket.org/thelearninglabs/uclinux-distro-tll-public.git | C | 611 lines
76 *(d++) = *((*name) ++); 77 i++; 78 } else if (isdigit(**name)) { 91 *(d++) = (char) n; 92 i++; 93 102 *(d++) = *((*name) ++); 103 i++; 104 }ringmod.cpp https://bitbucket.org/bucket_brigade/neil/ | C++ | 421 lines
51 while (numsamples--) { 52 *o++ += *i++; 53 }main.c https://bitbucket.org/floren/inferno/ | C | 469 lines
79 for(i = 0; i < 100*1024*1024; i++) 80 i++; 81}PorterStemmer.java https://bitbucket.org/szitnik/iobie.git | Java | 428 lines
133 { if (i > j) return n; 134 if (! cons(i)) break; i++; 135 } 135 } 136 i++; 137 while(true) 140 if (cons(i)) break; 141 i++; 142 } 142 } 143 i++; 144 n++; 147 if (! cons(i)) break; 148 i++; 149 }tsin-parse.cpp https://bitbucket.org/solomonhuang/gcin.git | C++ | 339 lines
317 318 ofsi++; 319 }overloaded-operator.cpp https://bitbucket.org/dwilliamson/clreflect/ | C++ | 418 lines
120void incdec_test(PostInc pi, PostDec pd) { 121 const PostInc& pi1 = pi++; 122 const PostDec& pd1 = pd--;ThreadManager.java https://bitbucket.org/Hanyuu/wipe.git | Java | 421 lines
212 destroyThread(running.get(i), "Stopped."); 213 i++; 214 }app.js https://bitbucket.org/alex-di/printer-sprinter-server.git | JavaScript | 339 lines
209 io.sockets.emit("unprintedList", data); 210 i++; 211 }DataServer.java https://bitbucket.org/palvaro/netdb-bfs-branch | Java | 397 lines
169 if (b == '|') { 170 i++; 171 path[i] = "";resources.inc https://bitbucket.org/rbonesource1234/no2co2 | PHP | 370 lines
19 $arykeyword[$i]['value'] = $ary['KeywordText']; 20 $i++; 21 } 37 $aryresources[$i]['value'] = $ary['CompanyName']; 38 $i++; 39 } 56 $ArySend[$i]['value'] = $ary['CityName']; 57 $i++; 58 }main.c https://bitbucket.org/rsc/plan9port/ | C | 543 lines
105 else if(strcmp(argv[i], "-font") == 0 && i+1<argc){ 106 i++; 107 fname = argv[i];config.c https://bitbucket.org/hudson/magic-lantern/ | C | 379 lines
50 while( line[i] && is_space( line[i] ) ) 51 i++; 52 68 while( line[i] && is_space( line[i] ) ) 69 i++; 70 if( line[i++] != '=' ) 72 while( line[i] && is_space( line[i] ) ) 73 i++; 74modsupport.c https://bitbucket.org/mirror/python-release25-maint | C | 632 lines
248 Py_UNICODE *v = u; 249 while (*v != 0) { i++; v++; } 250 return i;my_hash.c https://bitbucket.org/boria8/boria | C | 364 lines
69 } 70 i++; 71 }DataManager.java https://bitbucket.org/cos_clav/hellobooks | Java | 514 lines
68 } 69 i++; 70 100 } 101 i++; 102 }VideoTab.cpp https://bitbucket.org/face/ovp | C++ | 238 lines
110 } 111 i++; 112 }Representation.cpp https://bitbucket.org/vrrm/brl-cad-copy-for-fast-history-browsing-in-git.git | C++ | 280 lines
98 } 99 i++; 100 } 113 } 114 i++; 115 } 128 } 129 i++; 130 }tk.b https://bitbucket.org/floren/inferno/ | Brainfuck | 439 lines
252 } 253 i++; 254 }hash.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 352 lines
83 while (i < 10 && string[i]) 84 i++; 85Lemur3.java https://bitbucket.org/wraybowling/lemur-clone.git | Java | 487 lines
159 midi_controller[0] = next_available_midi; 160 next_available_midi++; 161 } 216 midi_controller[0] = next_available_midi; 217 next_available_midi++; 218 } 391 midi_controller[0] = next_available_midi; 392 next_available_midi++; 393 } 402 midi_controller[0] = next_available_midi; 403 next_available_midi++; 404 } 416 midi_controller[1] = next_available_midi; 417 next_available_midi++; 418 }logconf.c https://bitbucket.org/freebsd/freebsd-head/ | C | 313 lines
117 if (fileobj != NULL) 118 i++; 119 if (syslogobj != NULL) 119 if (syslogobj != NULL) 120 i++; 121 if (nullobj != NULL) 121 if (nullobj != NULL) 122 i++; 123 if (stderrobj != NULL) 123 if (stderrobj != NULL) 124 i++; 125PrintfFormatString.cpp https://bitbucket.org/freebsd/freebsd-head | C++ | 680 lines
72 if (c == '%') { 73 Start = I++; // Record the start of the format specifier. 74 break; 166 // Finally, look for the conversion specifier. 167 const char *conversionPosition = I++; 168 ConversionSpecifier::Kind k = ConversionSpecifier::InvalidSpecifier;LagrangeCurve.java https://bitbucket.org/jorgenio/gvsig.git | Java | 294 lines
235 pt[j] = cp.getPoint(gi.next()).getLocation(); 236 i++; 237 }FoobarSvgHandler.java https://bitbucket.org/ivertex/itext-fork | Java | 398 lines
63 break; 64 i++; 65 } 73 } 74 i++; 75 } 82 break; 83 i++; 84 } 92 } 93 i++; 94 if (i == value.length()) {pdpotrf.c https://bitbucket.org/bosilca/dague.public | C | 255 lines
198 p = atoi(argv[i+1]); 199 i++; 200 continue; 203 q = atoi(argv[i+1]); 204 i++; 205 continue; 208 params[PARAM_N] = atoi(argv[i+1]); 209 i++; 210 continue; 213 params[PARAM_NB] = atoi(argv[i+1]); 214 i++; 215 continue; 222 params[PARAM_NRHS] = atoi(argv[i+1]); 223 i++; 224 continue;codingSnps.pl https://bitbucket.org/cistrome/cistrome-harvard/ | Perl | 570 lines
78 if (!exists $chrSt{$f[0]}) { $chrSt{$f[0]} = $i; } 79 $i++; 80} 141 while ($s[$col1] > $g[2] && $i < $#genes) { 142 $i++; 143 @g = split(/\t/, $genes[$i]); 264 } 265 $i++; 266 }ps2dev9.c https://bitbucket.org/ifcaro/open-ps2-loader/ | C | 1147 lines
559 DelayThread(1000); 560 i++; 561 }while(i<100);ps2mc_io.c https://bitbucket.org/ifcaro/open-ps2-loader/ | C | 1437 lines
109 110 i++; 111 } while (i < mcdi->clusters_per_card); 117 j++; 118 i++; 119 } while (j < ifc_length); 146 147 i++; 148 } while (i < mcdi->clusters_per_card); 155 fc->entry[indirect_offset] = i; 156 i++; 157main.c https://bitbucket.org/ifcaro/open-ps2-loader/ | C | 4295 lines
335 checksum ^= p[i]; 336 i++; 337 } 353 return 0; 354 i++; 355 }ps1mc_io.c https://bitbucket.org/ifcaro/open-ps2-loader/ | C | 718 lines
606 607 i++; 608 info++;fat_driver.c https://bitbucket.org/ifcaro/open-ps2-loader/ | C | 1034 lines
104 buf[i] = cluster; //store first cluster 105 i++; 106 } 143 buf[i] = cluster & 0xFFF; 144 i++; 145 } 164 buf[i] = cluster; //store first cluster 165 i++; 166 } 182 buf[i] = cluster & 0xFFFF; 183 i++; 184 } 202 buf[i] = cluster; //store first cluster 203 i++; 204 }ForwardAccessor_impl.h https://bitbucket.org/jake_lever/sstruct | C Header | 290 lines
251 //mfc_read_tag_status_all(); 252 i++; 253 } while (i < needChanged);bios_disk.cpp https://bitbucket.org/alunbestor/boxer/ | C++ | 531 lines
214 } 215 i++; 216 }selectmodule.c https://bitbucket.org/arigo/cpython-withatomic/ | C | 2294 lines
174 175 i++; 176 } 363 self->ufds[i].events = (short)PyLong_AsLong(value); 364 i++; 365 } 551 while (!self->ufds[i].revents) { 552 i++; 553 }_localemodule.c https://bitbucket.org/arigo/cpython-withatomic/ | C | 681 lines
69 do { 70 i++; 71 val = PyLong_FromLong(s[i]);getargs.c https://bitbucket.org/arigo/cpython-withatomic/ | C | 1810 lines
375 p += strlen(p); 376 i++; 377 }KahluaParser.java https://bitbucket.org/sylvanaar2/lua-for-idea/ | Java | 1709 lines
62// RESERVED_LOCAL_VAR_KEYWORDS_TABLE.put(RESERVED_LOCAL_VAR_KEYWORD, Boolean.TRUE); 63// i++; 64// }web.php https://bitbucket.org/wez/mtrack/ | PHP | 1403 lines
14 $return_vars[$name] = $data[$i]; 15 $i++; 16 } else {message.c https://bitbucket.org/vstakhov/rspamd/ | C | 1682 lines
231 } 232 i++; 233 if (i < (gint)src->len) {lmtp_proto.c https://bitbucket.org/vstakhov/rspamd/ | C | 699 lines
128 while (g_ascii_isspace (*c) && i < (gint)line->len) { 129 i++; 130 c++; 201 while (g_ascii_isspace (*c++)) { 202 i++; 203 }GUIEngine.cpp https://bitbucket.org/Ogre/worldapocalypse/ | C++ | 585 lines
41 return true; 42 i++; 43 }OgreGLESHardwarePixelBuffer.cpp https://bitbucket.org/masterfalcon/ogre-gl3plus/ | C++ | 835 lines
54 value = value >> 1; 55 i++; 56 }glew.cpp https://bitbucket.org/masterfalcon/ogre-gl3plus/ | C++ | 4298 lines
178 if (s == NULL) return 0; 179 while (s[i] != '\0') i++; 180 return i; 186 if (s == NULL) return 0; 187 while (s[i] != '\0' && s[i] != c) i++; 188 return (s[i] == '\0' || s[i] == c) ? i : 0; 195 return (a == NULL && b == NULL && n == 0) ? GL_TRUE : GL_FALSE; 196 while (i < n && a[i] != '\0' && b[i] != '\0' && a[i] == b[i]) i++; 197 return i == n ? GL_TRUE : GL_FALSE; 209 GLuint i=0; 210 while (i < nb && (*a)+i != NULL && b+i != NULL && (*a)[i] == b[i]) i++; 211 if(i == nb) 225 GLuint i=0; 226 while (i < nb && (*a)+i != NULL && b+i != NULL && (*a)[i] == b[i]) i++; 227 if(i == nb)OgreGLSLPreprocessor.cpp https://bitbucket.org/masterfalcon/ogre-gl3plus/ | C++ | 1287 lines
104 while (isspace (String [i])) 105 i++; 106glew.cpp https://bitbucket.org/masterfalcon/ogre-gl3plus/ | C++ | 4286 lines
177 if (s == NULL) return 0; 178 while (s[i] != '\0') i++; 179 return i; 185 if (s == NULL) return 0; 186 while (s[i] != '\0' && s[i] != c) i++; 187 return (s[i] == '\0' || s[i] == c) ? i : 0; 194 return (a == NULL && b == NULL && n == 0) ? GL_TRUE : GL_FALSE; 195 while (i < n && a[i] != '\0' && b[i] != '\0' && a[i] == b[i]) i++; 196 return i == n ? GL_TRUE : GL_FALSE; 208 GLuint i=0; 209 while (i < nb && (*a)+i != NULL && b+i != NULL && (*a)[i] == b[i]) i++; 210 if(i == nb) 224 GLuint i=0; 225 while (i < nb && (*a)+i != NULL && b+i != NULL && (*a)[i] == b[i]) i++; 226 if(i == nb)modsupport.c https://bitbucket.org/pypy/pypy/ | C | 588 lines
175 Py_UNICODE *v = u; 176 while (*v != 0) { i++; v++; } 177 return i;flags.c https://bitbucket.org/dabomb69/bash-portable | C | 271 lines
194 return (shell_flags[i].value); 195 i++; 196 }dom_versus_inner_html.html https://bitbucket.org/scope/dragonfly-stp-1/ | HTML | 1584 lines
214 ele = first_arg in CustomElements ? CustomElements[first_arg].create() : doc.createElement(first_arg); 215 i++; 216 }dom.js https://bitbucket.org/scope/dragonfly-stp-1/ | JavaScript | 995 lines
126 } 127 i++; 128 }canvs.c https://bitbucket.org/floren/inferno/ | C | 2221 lines
247 inf[i].r = it->p.bb; 248 i++; 249 }txt.c https://bitbucket.org/floren/inferno/ | C | 1251 lines
321 reg[i]++; 322/* lasti++; *** StrongARM does register forwarding */ 323 if(lasti >= 5)lib.c https://bitbucket.org/floren/inferno/ | C | 683 lines
282 break; 283 i++; 284 if (i > nfields) 298 char buf[2]; 299 i++; 300 if (i > nfields) 311 for (;;) { 312 i++; 313 if (i > nfields)b.c https://bitbucket.org/floren/inferno/ | C | 856 lines
314 *bp++ = ++c; 315 i++; 316 } 322 *bp++ = c; 323 i++; 324 }txt.c https://bitbucket.org/floren/inferno/ | C | 1200 lines
321 reg[i]++; 322/* lasti++; *** StrongARM does register forwarding */ 323/*span.c https://bitbucket.org/floren/inferno/ | C | 1390 lines
137 cput(0); 138 i++; 139 }txt.c https://bitbucket.org/floren/inferno/ | C | 1748 lines
340 reg[i]++; 341 lasti++; 342 if(lasti >= 5)readjpg.b https://bitbucket.org/floren/inferno/ | Brainfuck | 974 lines
351 code <<= 1; 352 si++; 353 }while(t.size[k] != si); 364 for(;;){ 365 i++; 366 if(i > 16)ftree.b https://bitbucket.org/floren/inferno/ | Brainfuck | 874 lines
577 while (i < len s && s[i] == '/') 578 i++; 579 if (len t > 1 && t[len t - 1] == '/')mand.b https://bitbucket.org/floren/inferno/ | Brainfuck | 861 lines
476 calc.dispbase[d] = byte BORDER; 477 i++; 478 } 481 calc.dispbase[d] = byte BORDER; 482 i++; 483 } 486 calc.dispbase[d] = byte BORDER; 487 i++; 488 } 491 calc.dispbase[d] = byte BORDER; 492 i++; 493 }factotum.b https://bitbucket.org/floren/inferno/ | Brainfuck | 1067 lines
147 if(i < len s) 148 i++; 149 s = s[i:];blur.b https://bitbucket.org/floren/inferno/ | Brainfuck | 654 lines
489 if (gox) { 490 i++; 491 x++;readjpg.b https://bitbucket.org/floren/inferno/ | Brainfuck | 1147 lines
353 code <<= 1; 354 si++; 355 } while(t.size[k] != si); 366 for(;;) { 367 i++; 368 if(i > 16)element.c https://bitbucket.org/floren/inferno/ | C | 724 lines
296 translateelement(e, p); 297 i++; 298 } 360 translateelement(e, p); 361 i++; 362 }devsd.c https://bitbucket.org/floren/inferno/ | C | 1475 lines
369 devs[i].dev->next = nil; 370 i++; 371 }DataGrid.cs https://bitbucket.org/dariusdamalakas/sourcegrid/ | C# | 583 lines
215 Columns.Insert(i, DataGridColumn.CreateRowHeader(this)); 216 i++; 217 }selectmodule.c https://bitbucket.org/mirror/cpython/ | C | 2592 lines
167 168 i++; 169 } 369 self->ufds[i].events = (short)(unsigned short)PyLong_AsLong(value); 370 i++; 371 }_heapqmodule.c https://bitbucket.org/mirror/cpython/ | C | 648 lines
266 n >>= 1; 267 i++; 268 }xf86DCConf.c https://bitbucket.org/mischief/oskit | C | 311 lines
194 else 195 i++; 196 } 234 else 235 i++; 236 } 277 } 278 i++; 279 }LogGraph.m https://bitbucket.org/juice/machg | Objective C | 377 lines
188 maxColumn = MAX(maxColumn,i); 189 i++; 190 }common.C https://bitbucket.org/ball/ball.git | C | 560 lines
355 interpolated_values[i] = (bezier[8] - bezier[7]) * evaluation_point + bezier[7]; 356 i++; 357 }Tween.js https://bitbucket.org/Godunov/geodyn.git | JavaScript | 531 lines
94 95 i++; 96HexEdgeBasis.cpp https://bitbucket.org/lge/gmsh.git | C++ | 469 lines
174 175 i++; 176 } 184 185 i++; 186 } 244 245 i++; 246 } 278 279 i++; 280 } 295 296 i++; 297 }TestLocalStringKeys.java https://bitbucket.org/openesb/openesb-core.git | Java | 200 lines
128 } 129 i++; 130 }jobs.c https://bitbucket.org/freebsd/freebsd-head | C | 1405 lines
129 while (i <= 2 && !isatty(i)) 130 i++; 131 if (i > 2 || (ttyfd = fcntl(i, F_DUPFD, 10)) < 0)pA.cpp https://bitbucket.org/vermapratyush/online-judges.git | C++ | 339 lines
57 {vector<pair<T,int> > R;for (T i=2;n>1;){if (n%i==0){int C=0;for (;n%i==0;C++,n/=i);R.push_back(make_pair(i,C));} 58 i++;if (i>n/i) i=n;}if (n>1) R.push_back(make_pair(n,1));return R;} 59template<class T> inline bool isPrimeNumber(T n)//NOTES:isPrimeNumber(multistaffinfo.cpp https://bitbucket.org/jmb/noteedit | C++ | 285 lines
93 if (isInBraceList) { 94 for (i++; i < staffCount_ && i <= mainWidget_->braceMatrix_[j].end; i++) { 95 contList[i] = false; 215 mstaffinfo[bracketCount].staffcount = 1; 216 for (i++; i < staffCount_ && i <= mainWidget_->bracketMatrix_[j].end; i++) { 217 if (NResource::staffSelExport_[i] && multistaffIdxOfStaff(i, &multistaffnr, &dummy) == 0) {lstrlib.c https://bitbucket.org/hudson/magic-lantern/ | C | 870 lines
304 while ((s+i)<ms->src_end && singlematch(uchar(*(s+i)), p, ep)) 305 i++; 306 /* keeps trying to match with the maximum repetitions */vga_draw.cpp https://bitbucket.org/alunbestor/boxer/ | C++ | 1512 lines
102 103 temp1 = temp[i] + temp[i+1] + temp[i+2] + temp[i+3]; i++; 104 temp2 = temp[i] + temp[i+1] + temp[i+2] + temp[i+3]; i++; 104 temp2 = temp[i] + temp[i+1] + temp[i+2] + temp[i+3]; i++; 105 temp3 = temp[i] + temp[i+1] + temp[i+2] + temp[i+3]; i++; 106 temp4 = temp[i] + temp[i+1] + temp[i+2] + temp[i+3]; i++; 112 ((temp4|val1) <<24)); 113 temp1 = temp[i] + temp[i+1] + temp[i+2] + temp[i+3]; i++; 114 temp2 = temp[i] + temp[i+1] + temp[i+2] + temp[i+3]; i++; 114 temp2 = temp[i] + temp[i+1] + temp[i+2] + temp[i+3]; i++; 115 temp3 = temp[i] + temp[i+1] + temp[i+2] + temp[i+3]; i++; 116 temp4 = temp[i] + temp[i+1] + temp[i+2] + temp[i+3]; i++;sysfile.c https://bitbucket.org/ericvh/hare/ | C | 1580 lines
394 /* Advance to next element */ 395 c->uri++; 396 if(c->umc){adc.c https://bitbucket.org/ericvh/hare/ | C | 636 lines
107 mask=mask>>1; 108 i++; 109 continue; 129 mask=mask>>1; 130 i++; 131 } 443 } 444 i++; 445 kwd=adcKeyword[i];FumTest.cs https://bitbucket.org/fabiomaulo/nhibernate/ | C# | 0 lines
209 Assert.IsTrue(enumerator.Current is FumCompositeID, "Iterating Identifiers"); 210 i++; 211 } 303 s.Delete(fum); 304 i++; 305 } 418 s.Delete(fum); 419 i++; 420 }sha.js https://bitbucket.org/philikon/weaveclient-chromium/ | JavaScript | 483 lines
225 x = 0x10000 + ((x & 0x03FF) << 10) + (y & 0x03FF); 226 i++; 227 }sharedbook.c https://bitbucket.org/rminnich/vx32/ | C | 735 lines
408 while((lo+1)<n && c->codelist[lo+1]<=word)lo++; 409 while( hi<n && word>=(c->codelist[hi]&mask))hi++; 410 470 471 for(i++;i<tt->threshvals-1;i++) 472 if(a[o]<tt->quantthresh[i])break;sysproc.c https://bitbucket.org/rminnich/vx32/ | C | 1140 lines
585 break; 586 i++; 587 *ap++ = s;display_model.php https://bitbucket.org/gradido/gradido-easy/ | PHP | 1556 lines
200 201 $i++; 202makewebstatistics.d https://bitbucket.org/lindquist/ldc/ | D | 706 lines
66 back~=b[i]; 67 ii++; 68 }dateparse.d https://bitbucket.org/lindquist/ldc/ | D | 789 lines
184 { 185 si++; 186 break; 189 ret_inc: 190 si++; 191 goto Lret; 197 case ',': 198 si++; 199 break; 204 { 205 si++; 206 if (si == s.length) 223 Lendofcomment: 224 si++; 225 break;bitarray.d https://bitbucket.org/lindquist/ldc/ | D | 956 lines
161 } 162 i++; 163 }gcx.d https://bitbucket.org/lindquist/ldc/ | D | 2682 lines
562 break; 563 i++; 564 }aaA.d https://bitbucket.org/lindquist/ldc/ | D | 826 lines
465 valuesize); 466 resi++; 467 if (e.left) 601 memcpy(&res[resi * keysize], cast(byte*)(e + 1), keysize); 602 resi++; 603 if (e.left)adi.d https://bitbucket.org/lindquist/ldc/ | D | 839 lines
83 chi = *--hi; 84 stridehi++; 85 assert(hi >= lo); 177 chi = *--hi; 178 stridehi++; 179 assert(hi >= lo);aApplyR.d https://bitbucket.org/lindquist/ldc/ | D | 978 lines
93 } 94 i++; 95 } 110 } 111 i++; 112 } 157 } 158 i++; 159 } 174 } 175 i++; 176 } 243 } 244 i++; 245 }utf.d https://bitbucket.org/lindquist/ldc/ | D | 852 lines
260 V = cast(dchar) u; 261 i++; 262 } 366 else 367 i++; 368 } 370 { 371 i++; 372 } 678 { 679 i++; 680 r ~= cast(wchar)c; 702 { 703 i++; 704 r ~= cast(wchar)c;aaA.d https://bitbucket.org/lindquist/ldc/ | D | 799 lines
427 valuesize); 428 resi++; 429 if (e.left) 567 memcpy(&res[resi * keysize], cast(byte*)(e + 1), keysize); 568 resi++; 569 if (e.left)aApplyR.d https://bitbucket.org/lindquist/ldc/ | D | 976 lines
95 } 96 i++; 97 } 112 } 113 i++; 114 } 159 } 160 i++; 161 } 176 } 177 i++; 178 } 245 } 246 i++; 247 }class.c https://bitbucket.org/lindquist/ldc/ | C | 1554 lines
314 else 315 i++; 316 } 446 } 447 i++; 448 }init.c https://bitbucket.org/lindquist/ldc/ | C | 717 lines
211 } 212 fieldi++; 213 }MimeType.java https://bitbucket.org/bedlaczech/fan-1.0 | Java | 316 lines
128 { 129 eq = i++; 130 while (FanInt.isSpace(s.charAt(i))) ++i; 182 if (c != '\\') buf.append((char)c); 183 else if (s.charAt(i+1) == '\\') { buf.append('\\'); i++; } 184 }lex.c https://bitbucket.org/kbairak/dotfiles | C | 722 lines
162 while (i<tokenl && ((tokenst[i]^tblp->key[i])&0137)==0) 163 i++; 164 if (i >= tokenl) {kern_lock.c https://bitbucket.org/freebsd/freebsd-head | C | 1479 lines
111 while (mtx_owned(&Giant)) { \ 112 _i++; \ 113 mtx_unlock(&Giant); \io.c https://bitbucket.org/psiphon/psiphon-circumvention-system/ | C | 1171 lines
266 iov[i].iov_len = -request->offset - chunk_header_len; 267 i++; 268 } 279 } 280 i++; 281 } 296 iov[i].iov_len = request->len; 297 i++; 298 } else if(request->offset < request->len) { 300 iov[i].iov_len = request->len - request->offset; 301 i++; 302 } 308 iov[i].iov_len = request->len2; 309 i++; 310 } else if(request->offset < request->len + request->len2) {http_parse.c https://bitbucket.org/psiphon/psiphon-circumvention-system/ | C | 1567 lines
123 int x, y; 124 while(buf[i] == ' ') i++; 125 if(buf[i] == '\n' || buf[i] == '\r') return -1; 126 x = i; 127 while(buf[i] > 32 && buf[i] < 127) i++; 128 y = i; 140 141 i++; 142 while(1) { 156 } else { 157 i++; 158 } 168 if(buf[i] == ' ' || buf[i] == '\t') 169 i++; 170 else if(buf[i] == '(') {util.c https://bitbucket.org/psiphon/psiphon-circumvention-system/ | C | 809 lines
84 return 1; 85 i++; 86 } 153 return 1; 154 i++; 155 } 174 val = val * 10 + (string[i] - '0'); 175 i++; 176 } 241 while(2 * j <= x) { 242 i++; 243 j *= 2; 258 while(j < x) { 259 i++; 260 j *= 2;dchChoice.c https://bitbucket.org/alanmi/abc/ | C | 553 lines
189 if ( Aig_ObjRepr(p, pObj) && Aig_ObjIsCi(Aig_ObjRepr(p, pObj)) ) 190 ClassCi++; 191 }ltl_parser.c https://bitbucket.org/alanmi/abc/ | C | 840 lines
101 while( !isNotVarNameSymbol( suffixFormula[i] ) ) 102 i++; 103 *endLocation = i; 163 case '\f': 164 i++; 165 startOfSuffixString = i; 167 case ':': 168 i++; 169 if( !isTemporalOperator( formula, i ) ) 176 { 177 i++; 178 startOfSuffixString = i; 206 { 207 i++; 208 startOfSuffixString = i;