100+ results results for 'i++; source:Bitbucket repo:sign42/sharpssh' (2281 ms)
115 } 116 i++; 117 if( 'A'+i == '[' ) 151 j = 0; 152 i++; 153 }jazzdma.c https://bitbucket.org/hachicmo/hachicha1.git | C | 566 lines
197 pgtbl[i].owner = VDMA_PAGE_EMPTY; 198 i++; 199 }accounting.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 499 lines
408 if (hapd->acct_session_id_lo == 0) { 409 hapd->acct_session_id_hi++; 410 }traps.c https://bitbucket.org/alfredchen/linux-gc.git | C | 540 lines
232 printk(" [<%08lx>]", addr); 233 i++; 234 }st7586fb.c https://bitbucket.org/sirokujira/toppershrp2_ev3rt_test.git | C | 605 lines
219 } 220 i++; 221 } while (!end_script); 255 if (!driver_inited) { 256 while ( (!vmem[i]) && (i <(WIDTH+2)/3*HEIGHT)) i++; 257 if (i != ((WIDTH+2)/3*HEIGHT)) driver_inited = true;language.php https://bitbucket.org/alex_poluektov/itech_test.git | PHP | 566 lines
374 $arDetectionFrom[$lang][] = $i; 375 $i++; 376 } 408 $arDetection[$lang_from_to][] = $lang_from_to; 409 $i++; 410 } 557 $result[$p1." ".$p2] = $weight; 558 $i++; 559 }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 }logconf.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 312 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++; 125pA.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(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 }patchedInterpolation2DTable.C https://bitbucket.org/bgschaid/swak4foam-temporary-replacement-for-original-repo-on | C | 520 lines
322 { 323 i++; 324 }sql.php https://bitbucket.org/jojoluzifer/web-megagenius.git | PHP | 242 lines
61 // Find first interesting character, several strpos seem to be faster than simple loop in php: 62 //while (($i < $len) && (strpos('\'";#-/', $buffer[$i]) === FALSE)) $i++; 63 //if ($i == $len) break; 141 } 142 $i++; 143 // Aren't we at the end? 190 } 191 $i++; 192 } 193 // Skip last char 194 $i++; 195 // Next query part will start here 231 } else { 232 $i++; 233 $start_pos = $i;paf.c https://bitbucket.org/mveljko78/ffmpeg.git | C | 455 lines
178 copy_block4(dst, src, avctx->width, avctx->width, 4); 179 i++; 180 if ((i & 0x3F) == 0)ringmod.cpp https://bitbucket.org/bucket_brigade/neil/ | C++ | 421 lines
51 while (numsamples--) { 52 *o++ += *i++; 53 }sh_stack.c https://bitbucket.org/vrrm/brl-cad-copy-for-fast-history-browsing-in-git.git | C | 378 lines
260 inputs |= sp->mfuncs[i]->mf_inputs; 261 i++; 262 } else { 279 inputs |= sp->mfuncs[i]->mf_inputs; 280 i++; 281 } else {i2c-sh7760.c https://bitbucket.org/droidzone/supernova-kernel.git | C | 577 lines
352 msgs++; 353 i++; 354 }card.c https://bitbucket.org/emiliolopez/linux.git | C | 458 lines
44 break; 45 i++; 46 }LexTACL.cxx https://bitbucket.org/cafu/cafu.git | C++ | 400 lines
55 s[i] = static_cast<char>(tolower(styler[start + i])); 56 i++; 57 }smp.c https://bitbucket.org/alfredchen/linux-gc.git | C | 512 lines
87 action >>= 1; 88 i++; 89 }yaffs_yaffs1.c https://bitbucket.org/droidzone/supernova-kernel.git | C | 465 lines
85 } 86 bi++; 87 }inode.c https://bitbucket.org/cyanogenmod/cm-kernel.git | C | 466 lines
280 goto out; 281 i++; 282 filp->f_pos++; 289 goto out; 290 i++; 291 filp->f_pos++;interpolationCellPointFace.hpp https://bitbucket.org/gsoxley/caelus-contributors.git | C++ Header | 450 lines
264 } 265 faceI++; 266 }fb_generic.c https://bitbucket.org/vrrm/brl-cad-copy-for-fast-history-browsing-in-git.git | C | 442 lines
166 } 167 i++; 168 } 358 _if_list[i]->if_type); 359 i++; 360 }fdt_ro.c https://bitbucket.org/__wp__/mb-linux-msli.git | C | 502 lines
103 while (fdt64_to_cpu(_fdt_mem_rsv(fdt, i)->size) != 0) 104 i++; 105 return i;LexCOBOL.cxx https://bitbucket.org/cafu/cafu.git | C++ | 379 lines
74 s[i] = static_cast<char>(tolower(styler[start + i])); 75 i++; 76 }mem.c https://bitbucket.org/alfredchen/linux-gc.git | C | 248 lines
104 p++; 105 i++; 106 } 212 } 213 i++; 214Serializer.php https://bitbucket.org/brunoMaurice/youfood.git | PHP | 346 lines
159 } 160 $i++; 161 }Form3s.cs https://bitbucket.org/sivanov68/examples_of_my_work.git | C# | 299 lines
46 str = listBox1.Items[i].ToString(); 47 if (str != "") i++; 48 }profile_helpers.c https://bitbucket.org/thelearninglabs/uclinux-distro-tll-public.git | C | 309 lines
293 if (*t == 0) { 294 i++; 295 break;OpenGlGui.cxx https://bitbucket.org/a30151/mikey-sakke.git | C++ | 305 lines
104 while (i<len && s[i]!=' ') //pass first digits 105 i++; 106 106 107 i++; //pass space 108 114 while (i<len && s[i]!=' ') //pass repeat counter 115 i++; 116 116 117 i++; //pass space 118make_nurb_face.c https://bitbucket.org/vrrm/brl-cad-copy-for-fast-history-browsing-in-git.git | C | 445 lines
150 } 151 i++; 152 if ( i == no_of_edges ) 369 } 370 i++; 371 if ( i == no_of_edges )fileman.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 485 lines
164 while (line[i] && whitespace (line[i])) 165 i++; 166 word = line + i; 168 while (line[i] && !whitespace (line[i])) 169 i++; 170 183 while (whitespace (line[i])) 184 i++; 185main.c https://bitbucket.org/floren/inferno/ | C | 469 lines
79 for(i = 0; i < 100*1024*1024; i++) 80 i++; 81}gpu_cooling.c https://bitbucket.org/corsicanu/hadeskernel-o.git | C | 460 lines
189 } 190 i++; 191 }fscore.php https://bitbucket.org/jorgenio/boca.git | PHP | 349 lines
289 while ($i<$n) { 290 if($a[$i]["anstime"] > $ta) { $i++; continue; } 291 $user = $a[$i]["user"]; 294 $k = 0; 295 if(!isset($resp[$user])) { $i++; continue; } 296 $resp[$user]["user"] = $user; 309 $k++; 310 $i++; 311 } 326 while ($i<$n && $a[$i]["user"]==$user && $a[$i]["problem"]==$problem) { 327 $i++; 328 }debugfs.c https://bitbucket.org/cyanogenmod/android_kernel_sony_msm8x60.git | C | 506 lines
176 break; 177 i++; 178 }handlebars-base.js https://bitbucket.org/moodle/moodle.git | JavaScript | 463 lines
161 ret = ret + fn(context[key], {data: data}); 162 i++; 163 }fw-card.c https://bitbucket.org/hachicmo/hachicha1.git | C | 557 lines
101 config_rom[i] = desc->key | (j - i); 102 i++; 103 j += desc->length;ftrfork.h https://bitbucket.org/preining/tex-live.git | C Header | 258 lines
105 local[i].type = FT_RFork_Rule_ ## type_suffix; \ 106 i++; 107#define CONST_FT_RFORK_RULE_ARRAY_END }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 }FidQueryTest.java https://bitbucket.org/dyp/geotools.git | Java | 265 lines
244 for (Iterator iter = fids.entrySet().iterator(); iter.hasNext();) { 245 i++; 246 Map.Entry entry = (Map.Entry) iter.next();FontUtils.java https://bitbucket.org/prupe/mcpatcher.git | Java | 255 lines
169 if (cWidth < 0.0f && i < s.length() - 1) { 170 i++; 171 c = s.charAt(i);OnlineTest.php https://bitbucket.org/pcelta/zf2.git | PHP | 277 lines
220 $this->assertEquals($key, $node->getDnString(Ldap\Dn::ATTR_CASEFOLD_LOWER)); 221 $i++; 222 }add_post_list.php https://bitbucket.org/Yatindra_Mohite/spectre.git | PHP | 239 lines
124 { 125 $i++; 126ucstr.c https://bitbucket.org/__wp__/mb-linux-msli.git | C | 452 lines
218 *p = s[i] & mask[clen]; 219 i++; 220 for (j = 1; j < clen; j++) { 226 *p |= s[i] & 0x3f; 227 i++; 228 } 282 /* finish off everything up to char before next non-ascii */ 283 for (i++; (i < len) && KRB5_UTF8_ISASCII(s + i); i++) { 284 out[outpos++] = casefold ? TOLOWER(s[i - 1]) : s[i - 1];MeshIterate.cpp https://bitbucket.org/imsejae/meshgencpp.git | C++ | 272 lines
113 t[numtri].n3 = ttemp[i].n3; 114 numtri++; 115 }except.cxx https://bitbucket.org/jorgenio/libreoffice.git | C++ | 438 lines
88 while( *pRTTI == ':' ) 89 pRTTI++; 90 pLast = pRTTI; 94 else 95 pRTTI++; 96 }DateUtils.java https://bitbucket.org/jervisfm/android-research.git | Java | 256 lines
130 { 131 i++; 132 localCalendar3.add(1, 1); 194 localCalendar2.setTimeInMillis(localCalendar2.getTimeInMillis() - 900000L); 195 i++; 196 break label73; 198 localCalendar2.setTimeInMillis(localCalendar2.getTimeInMillis() - 1800000L); 199 i++; 200 break label114; 203 localCalendar2.setTimeInMillis(localCalendar2.getTimeInMillis() - 3600000L); 204 i++; 205 }IntervalSet.cpp https://bitbucket.org/HanyunseopEverspin/eversafe_ios_obfuscator_archive.git | C++ | 521 lines
160 if (rightInterval.b < resultInterval.a) { 161 rightI++; 162 continue; 165 if (rightInterval.a > resultInterval.b) { 166 resultI++; 167 continue; 184 result._intervals.insert(result._intervals.begin() + resultI + 1, afterCurrent); 185 resultI++; 186 rightI++; 189 result._intervals[resultI] = beforeCurrent; 190 resultI++; 191 } 195 result._intervals[resultI] = afterCurrent; 196 rightI++; 197 } else {sortid.c https://bitbucket.org/preining/tex-live.git | C | 310 lines
180 if (a[i] == SPC) 181 i++; 182 if (b[j] == SPC) 189 return (al - bl); 190 i++; 191 j++; 207 { 208 i++; 209 }smfParser.js https://bitbucket.org/ryoyakawai/public.git | JavaScript | 427 lines
110 success = true; 111 i++; 112 break;tsin-parse.cpp https://bitbucket.org/solomonhuang/gcin.git | C++ | 339 lines
317 318 ofsi++; 319 }AverageCase.java https://bitbucket.org/GeoTrif/misc.git | Java | 342 lines
304 305 i++; 306grid.custom.js https://bitbucket.org/dmaslov/era2346.git | JavaScript | 440 lines
186 ruleGroup += "\"data\":\"" + n.replace(/\\/g,'\\\\').replace(/\"/g,'\\"') + "\"}"; 187 gi++; 188 }); 257 ruleGroup += "\"data\":\"" + n.replace(/\\/g,'\\\\').replace(/\"/g,'\\"') + "\"}"; 258 gi++; 259 });wpa.h https://bitbucket.org/Mali_Laurent/ps50c550.git | C Header | 554 lines
72 { \ 73 i++; \ 74 if (i == (_cnt)) \kern_lock.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1462 lines
105 while (mtx_owned(&Giant)) { \ 106 _i++; \ 107 mtx_unlock(&Giant); \puc.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 766 lines
83 while (i < PUC_PCI_BARS && sc->sc_bar[i].b_rid != rid) 84 i++; 85 if (i < PUC_PCI_BARS)dbfileio.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 578 lines
201 } 202 i++; 203 }ec_asn1.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1429 lines
75 while (group->poly[i] != 0) 76 i++; 77dbus_new_handlers.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1780 lines
189 return FALSE; 190 i++; 191 }scan.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 689 lines
179 if (a[i]) 180 i++; 181 a[i] = 0;macro.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1108 lines
319 while (body[i] && body[i] != '\\') 320 i++; 321 327 if (body[i]) /* move past \ */ 328 i++; 329files.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 784 lines
55 if (i && string[i] == path_sep_char) 56 i++; 57 58 start = i; 59 while (string[i] && string[i] != path_sep_char) i++; 60 *index = i; 354 if (IS_SLASH (filename[i])) 355 i++; 356 else if (filename[i] && HAVE_DRIVE (filename)) 549 if (IS_SLASH (result[i])) 550 i++; 551info-utils.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 701 lines
82 while (string[i] && string[i] != ')') 83 i++; 84utilities.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 912 lines
531 fprintf(NetTrace, "%d ", pointer[i]); 532 i++; 533 }smbutil.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1590 lines
283 printf("%02X ", buf[i] & 0xff); 284 i++; 285 if (i%8 == 0) 332 fmt = p + 1; 333 i++; 334 }domain.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1147 lines
432 if (sm_strcasecmp(mxhosts[i], mxhosts[i + 1]) != 0) 433 i++; 434 elselib.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 706 lines
294 break; 295 i++; 296 if (i > nfields) 310 char buf[2]; 311 i++; 312 if (i > nfields) 330 for (;;) { 331 i++; 332 if (i > nfields)b.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 976 lines
335 *bp++ = j; 336 i++; 337 } 343 *bp++ = c; 344 i++; 345 }X86DisassemblerTables.cpp https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C++ | 676 lines
430 431 i++; 432 437 o.indent(i * 2) << "{ /* " << index << " */" << "\n"; 438 i++; 439 448 o.indent(i * 2) << "{" << "\n"; 449 i++; 450 491 "[256] = {\n"; 492 i++; 493MBlazeFrameLowering.cpp https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C++ | 450 lines
129 MachineBasicBlock::iterator SI = I; 130 for (SI++; SI != MIE; ++SI) { 131 if (!SI->getOperand(0).isReg() ||LoopInfo.cpp https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C++ | 705 lines
138 "Loop must have at least one backedge!"); 139 Backedge = *PI++; 140 if (PI == pred_end(H)) return 0; // dead loop 140 if (PI == pred_end(H)) return 0; // dead loop 141 Incoming = *PI++; 142 if (PI != pred_end(H)) return 0; // multiple backedges?std_bitset.h https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C Header | 1344 lines
315 // check subsequent words 316 __i++; 317 for (; __i < _Nw; __i++)histexpand.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1593 lines
157 /* Move on to the specification. */ 158 i++; 159 168 { 169 i++; 170 which = history_base + (history_length - 1); 178 sign = -1; 179 i++; 180 } 201 substring_okay++; 202 i++; 203 } 240 if (substring_okay && string[i] == '?') 241 i++; 242ipfcomp.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1360 lines
521 fprintf(fp, ", "); 522 i++; 523 } 541 fprintf(fp, ", "); 542 i++; 543 }font.cpp https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C++ | 1054 lines
450 break; 451 i++; 452 if (i < nindices) {html-table.cpp https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C++ | 783 lines
184 for (p = tab; p != NULL; p = p->next) { 185 i++; 186 if (p->position == pos) 232 printf("tab %d is %d\n", i, p->position); 233 i++; 234 }tui-winsource.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 654 lines
359 } 360 i++; 361 }tui-regs.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 754 lines
106 else 107 i++; 108 } 392 tui_display_register (data_element_ptr, data_item_win); 393 i++; /* next register */ 394 }tui-data.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 924 lines
399 } 400 i++; 401 }valprint.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1445 lines
236 val_ulong /= (1000 * 1000 * 1000); 237 i++; 238 }symmisc.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1258 lines
211 if (ps->readin == 0) 212 i++; 213 } 217 { 218 i++; 219 if (s->linetable != NULL)expr.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1543 lines
92 case 'i': case 'I': 93 case 'j': case 'J': i++; break; 94 case 'd': case 'D': 131 case 'i': case 'I': 132 case 'j': case 'J': i++; break; 133 case 'l': case 'L': l++;cfg.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1156 lines
174 bb->index = i; 175 i++; 176 }blocksort.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1094 lines
521 ptr[j] = v; 522 i++; 523 535 ptr[j] = v; 536 i++; 537 549 ptr[j] = v; 550 i++; 551macro.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1378 lines
158 while (i < ptr->len && ISWHITE (ptr->ptr[i])) 159 i++; 160 } 166 break; 167 i++; 168 while (i < ptr->len && is_part_of_name (ptr->ptr[i])) 168 while (i < ptr->len && is_part_of_name (ptr->ptr[i])) 169 i++; 170 if (i < ptr->len && is_name_ender (ptr->ptr[i])) 170 if (i < ptr->len && is_name_ender (ptr->ptr[i])) 171 i++; 172 if (LABELS_WITHOUT_COLONS) 175 while (i < ptr->len && ISWHITE (ptr->ptr[i])) 176 i++; 177 /* Check for the colon. */resrc.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1987 lines
220 if (*s == ' ') 221 i++; 222 222 223 i++; 224 argv = alloca (sizeof (char *) * (i + 3));jobs.c https://bitbucket.org/killerpenguinassassins/open_distrib_devel.git | C | 1407 lines
130 while (i <= 2 && !isatty(i)) 131 i++; 132 if (i > 2 || (ttyfd = fcntl(i, F_DUPFD, 10)) < 0)lgrp.c https://bitbucket.org/a3217055/illumos-joyent.git | C | 1187 lines
290 if (j < ncpus) { 291 i++; 292 continue;encode.c https://bitbucket.org/a3217055/illumos-joyent.git | C | 688 lines
186 if ( (mask && !sign) || (sign && !mask) ) 187 i++; 188 195 return( -1 ); 196 i++; 197 netnum = LBER_HTONL( num );display.c https://bitbucket.org/a3217055/illumos-joyent.git | C | 1068 lines
206 "%s", tmp); 207 i++; 208 } 396 xpos += ITEM_WIDTH; 397 i++; 398 } 485 xpos += ITEM_WIDTH; 486 i++; 487 }import.c https://bitbucket.org/a3217055/illumos-joyent.git | C | 1174 lines
378 KMF_KEYSTORE_TYPE_ATTR, &kstype, sizeof (KMF_KEYSTORE_TYPE)); 379 i++; 380 382 filename, strlen(filename)); 383 i++; 384 387 label, strlen(label)); 388 i++; 389 } 394 trustflags, strlen(trustflags)); 395 i++; 396 } 401 token_spec, strlen(token_spec)); 402 i++; 403 }lib.c https://bitbucket.org/a3217055/illumos-joyent.git | C | 795 lines
257 break; 258 i++; 259 p = getfld(i); 273 for (;;) { 274 i++; 275 p = getfld(i);util.c https://bitbucket.org/a3217055/illumos-2.git | C | 1138 lines
454 z[j++] = quote; 455 i++; 456 }else{func.c https://bitbucket.org/a3217055/illumos-2.git | C | 766 lines
132 } 133 while( z[i] && (z[i]&0xc0)==0x80 ){ i++; p1++; } 134 for(; i<p1+p2 && z[i]; i++){ 136 } 137 while( z[i] && (z[i]&0xc0)==0x80 ){ i++; p2++; } 138#endifencode.c https://bitbucket.org/a3217055/illumos-2.git | C | 737 lines
189 if ((mask && !sign) || (sign && !mask)) 190 i++; 191 198 return (-1); 199 i++; 200 netnum = htonl(num);debug.c https://bitbucket.org/a3217055/illumos-2.git | C | 1601 lines
311 FREE(debug_names[i]); 312 for (i++; i < ndebug_names; i++) 313 debug_names[i - 1] = debug_names[i];device.c https://bitbucket.org/a3217055/illumos-2.git | C | 1352 lines
608 buf[i] = '\t'; 609 i++; 610 }io.c https://bitbucket.org/a3217055/illumos-2.git | C | 2263 lines
260 while ((*s1 != '\0') && (*s1++ == *s2++)) 261 i++; 262 return (i);utilities.c https://bitbucket.org/a3217055/illumos-2.git | C | 1153 lines
89 for (np = lookupino(ep->e_ino); np != NIL && np != ep; np = np->e_links) 90 i++; 91 if (np == NIL)