PageRenderTime 582ms queryFilters 0ms Sphinxql 236ms GetByIds 280ms meta 0ms repositoryFilters 6ms languageFilters 2ms sourceFilters 1ms

829,250 results for 'i++;' (582 ms)

Source

Language

Repository

Exploit.as https://github.com/Jonono2/metasploit-framework.git | ActionScript | 898 lines
43				this.massage_array[i] = new Vector.<int>(1);
44				i++;
45			}
50				this.massage_array[i][0] = 0x41414141;
51				i++;
52			}
62				}
63				i++;
64			}
87				trigger_byte_array.writeUnsignedInt(trigger_decrypted);
88				i++;
89			}
147				}
148				i++;
149			}
ZaurusDatabaseManager.java https://github.com/vkhoroshko/voltdb.git | Java | 671 lines
143            if (arg[i].equalsIgnoreCase("-driver") && (i + 1 < arg.length)) {
144                i++;
145
148                       && (i + 1 < arg.length)) {
149                i++;
150
153                       && (i + 1 < arg.length)) {
154                i++;
155
160                       && (i + 1 < arg.length)) {
161                i++;
162
167                       && (i + 1 < arg.length)) {
168                i++;
169
angular-google-maps.js https://github.com/Avallach160/angular-google-maps.git | JavaScript | 8,179 lines
215      }
216      i++;
217    }
553              }
554              i++;
555            }
593              }
594              i++;
595            }
611              result.push(latlng);
612              i++;
613            }
634              result.push(new google.maps.LatLng(array[i][1], array[i][0]));
635              i++;
636            }
config.c https://github.com/hanselpc/polipo.git | C | 870 lines
460    while(buf[i] == ' ' || buf[i] == '\t' || buf[i] == '\r')
461        i++;
462    return i;
502    while(letter(buf[i]))
503        i++;
504    for(n = 0; n < sizeof(states) / sizeof(states[0]); n++) {
550    if(buf[i] == '\"') {
551        i++;
552        y0 = i;
557            } else
558                i++;
559        }
567              buf[i] == '.' || buf[i] == ':' || buf[i] == '/')
568            i++;
569        j = i;
talker.c https://github.com/masche842/Open-AVB.git | C | 890 lines
277		while (buf[i] != 'D')
278			i++;
279		i += 2;		/* skip the ':' */
281		while (buf[i] != 'S')
282			i++;
283		i += 2;		/* skip the ':' */
321		while ((i < buflen) && (buf[i] != '\n') && (buf[i] != '\0'))
322			i++;
323		if (i == buflen)
326			return 0;
327		i++;
328		k = i;
336		while (buf[i] != 'P')
337			i++;
338		i += 2;		/* skip the ':' */
smc91111_eeprom.c https://github.com/oSaiYa/u-boot-sh4-1.3.1_stm23_0051.git | C | 390 lines
130						if (i <= 45)
131							i++;
132						start = 0;
141						if (i <= 45)
142							i++;
143						break;
160			while ((input[i] != ' ') && (input[i] != 0))
161				i++;
162
163			if (input[i] != 0)
164				i++;
165
180			while ((input[i] != ' ') && (input[i] != 0))
181				i++;
182			if (input[i] != 0)
RevisionLinkInputFormat.java https://github.com/giangbinhtran/Hedera.git | Java | 351 lines
93							if (b == START_ID[i]) {
94								i++;
95							} else i = 0;
105							if (b == END_ID[i]) {
106								i++;
107							} else i = 0;
131							if (curMatch > 0 && (i == 0 || parOrTs == 3 || curMatch == parOrTs)) {					
132								i++;			
133								parOrTs = curMatch;
148							if (b == END_TIMESTAMP[i]) {
149								i++;
150							} else i = 0;
166							if (b == END_PARENT_ID[i]) {
167								i++;
168							} else i = 0;
smc91111_eeprom.c https://github.com/Vodalys/u-boot-fslc.git | C | 373 lines
111						if (i <= 45)
112							i++;
113						start = 0;
122						if (i <= 45)
123							i++;
124						break;
141			while ((input[i] != ' ') && (input[i] != 0))
142				i++;
143
144			if (input[i] != 0)
145				i++;
146
161			while ((input[i] != ' ') && (input[i] != 0))
162				i++;
163			if (input[i] != 0)
allegro.cpp https://github.com/tim81cortes/csound.git | C++ | 3,517 lines
835    while ((i < beats.len) && (time > beats[i].time)) {
836        i++;
837    }
845    while ((i < beats.len) && (beat > beats[i].beat)) {
846        i++;
847    }
962        // apply new_diff to score and beats
963        i++;
964        while (i < beats.len) {
965            beats[i].time = beats[i].time + diff;
966            i++;
967        }
982    // (Consider the case beat == 0.0)
983    if (i < beats.len && beat >= beats[i].beat) i++;
984    // case 1: beat is between two time/beat pairs
RPNUtils.java https://github.com/zen7280110/firefly.git | Java | 484 lines
69					outSymbol(String.valueOf(content.charAt(i)) + "=", 0, symbolDeque, list);
70					i++;
71					break;
83					outSymbol(String.valueOf(content.charAt(i)) + "=", 0, symbolDeque, list);
84					i++;
85					break;
89					pre.append(content.charAt(i)).append(content.charAt(i + 1));
90					i++;
91					break;
140					outSymbol(String.valueOf(content.charAt(i)) + content.charAt(i + 1), 8, symbolDeque, list);
141					i++;
142					break;
168					outSymbol(String.valueOf(content.charAt(i)) + "=", 7, symbolDeque, list);
169					i++;
170					break;
LIS331.cpp https://github.com/VT-ATEx/Core-2014.git | C++ | 910 lines
654        maxx.push_back(localx);
655        i++;
656    }
661        minx.push_back(localx);
662        i++;
663    }
668        maxy.push_back(localx);
669        i++;
670    }
675        miny.push_back(localy);
676        i++;
677    }
682        maxz.push_back(localz);
683        i++;
684    }
LIS331.cpp https://github.com/VT-ATEx/Core-2014.git | C++ | 913 lines
656        maxx.push_back(localx);
657        i++;
658    }
663        minx.push_back(localx);
664        i++;
665    }
670        maxy.push_back(localx);
671        i++;
672    }
677        miny.push_back(localy);
678        i++;
679    }
684        maxz.push_back(localz);
685        i++;
686    }
tinyFAT.cpp https://github.com/sherckuith/opensprinkler.git | C++ | 952 lines
214			tmpFN[i]=tmpDE.filename[i];
215			i++;
216		}
217		tmpFN[i]='.';
218		i++;
219		while ((tmpDE.fileext[j]!=0x20) and (j<3))
221			tmpFN[i]=tmpDE.fileext[j];
222			i++;
223			j++;
245					tmpFN[i]=tmpDE.filename[i];
246					i++;
247				}
248				tmpFN[i]='.';
249				i++;
250				while ((tmpDE.fileext[j]!=0x20) and (j<3))
angular-google-maps.js https://github.com/IBM-Bluemix/bluemix-retail.git | JavaScript | 8,131 lines
215      }
216      i++;
217    }
531              }
532              i++;
533            }
555              }
556              i++;
557            }
573              result.push(latlng);
574              i++;
575            }
584              result.push(new google.maps.LatLng(array[i][1], array[i][0]));
585              i++;
586            }
worker-common.js https://github.com/asankah/web-platform-tests.git | JavaScript | 1,018 lines
354            for (var x in input) {
355              i++;
356            }
400            for (var x in input) {
401              i++;
402              if (!check_true(input[x] instanceof Boolean, 'input['+x+'] instanceof Boolean'))
475            for (var x in input) {
476              i++;
477              if (!check_true(input[x] instanceof String, 'input['+x+'] instanceof Boolean'))
595            for (var x in input) {
596              i++;
597              if (!check_true(input[x] instanceof Number, 'input['+x+'] instanceof Number'))
661            for (var x in input) {
662              i++;
663              if (!check_true(input[x] instanceof Date, 'input['+x+'] instanceof Date'))
stm320518_eval_cec.c https://github.com/rurume/stm32-test.git | C | 2,045 lines
804    HDMI_CEC_Follower_String[0][1] = (uint8_t *)"1";
805    i++;
806    errorstatus = HDMI_CEC_OK;
844    HDMI_CEC_Follower_String[1][1] = (uint8_t *)"1";
845    i++;
846    errorstatus = HDMI_CEC_OK;
885    HDMI_CEC_Follower_String[2][1] = (uint8_t *)"1";
886    i++;
887    errorstatus = HDMI_CEC_OK;
925    HDMI_CEC_Follower_String[3][1] = (uint8_t *)"1";
926    i++;
927    errorstatus = HDMI_CEC_OK;
965    HDMI_CEC_Follower_String[4][1] = (uint8_t *)"1";
966    i++;
967    errorstatus = HDMI_CEC_OK;
Program.cs https://bitbucket.org/lokkju/sql-cli | C# | 340 lines
88				{
89					//if (i < 39100) { sqlf.ReadLine(); i++; continue; }
90					if ((i > n))
104					cmdtxt = ln;
105					if (ln.StartsWith("--")) { Console.Write("\r\nLine " + i + ":\tSkipping (--)\r\n"); i++; continue; }
106					else if (ln.Trim().Length < 5) { Console.Write("\r\nLine " + i + ":\tSkipping (<5)\r\n"); i++; continue; }
106					else if (ln.Trim().Length < 5) { Console.Write("\r\nLine " + i + ":\tSkipping (<5)\r\n"); i++; continue; }
107					else if (ln.StartsWith("SET")) { Console.Write("\r\nLine " + i + ":\tSkipping (SET)\r\n"); i++; continue; }
108					else if (ln.StartsWith("GO")) { Console.Write("\r\nLine " + i + ":\tSkipping (GO)\r\n"); i++; continue; }
109
110					//else if (!ln.StartsWith("INSERT")) { Console.Write("Line " + i + ":\tInvalid SQL Statement\r\n"); i++; continue; }
111					//else { cmdtxt += ln; }
153					{
154						i++;
155					}
filter_logoaway.c https://bitbucket.org/france/transcode-tcforge | C | 1,099 lines
362            while ((tmpx != 255) && (col-i > pd->xpos))
363                i++;
364            buf_off_xpos   = ((height-row)*width + col-i) * 3;
367            while ((tmpx != 255) && (col + i < pd->width))
368                i++;
369            buf_off_width  = ((height-row)*width + col+i) * 3;
373            while ((tmpx != 255) && (row - i > pd->ypos))
374                i++;
375            buf_off_ypos   = (height*width*3)-((row-i)*width - col) * 3;
378            while ((tmpx != 255) && (row + i < pd->height))
379                i++;
380            buf_off_height = (height*width*3)-((row+i)*width - col) * 3;
583          px = (uint8_t)ScaleQuantumToChar(pd->pixels[pkt_off-i].red);
584          while( (px != 255) && (col-i>pd->xpos) ) i++;
585          buf_off_xpos   = (row*width + col-i);
ScriptHighlighter.cpp https://bitbucket.org/MnemonicWME/wme | C++ | 282 lines
98			{
99				i++;
100			}
102			{
103				i++;
104				state = Number;
107			{
108				i++;
109				state = Identifier;
113				setFormat(i, 1, m_Formats[FORMAT_STRING]);
114				i++;
115				state = String;
140				}
141				i++;
142				state = Initial;
IdentityFile.cs https://bitbucket.org/ajlennon/sharpssh | C# | 950 lines
135					{
136						i++;
137						continue;
155						{
156							i++; 
157							encrypted=false;    // no passphrase
184					if(buf[i]=='-'){  break; }
185					i++;
186				}
244					i=0;
245					do{i++;}while(buf.Length>i && buf[i]!=0x0a);
246					if(buf.Length<=i) return;
297					i=0;
298					while(i<len){ if(buf[i]==' ')break; i++;} i++;
299					if(i>=len) return;
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21