Searched refs:i (Results 1 – 2 of 2) sorted by relevance
15282 UINT i = 0, n, li, hi; in ff_uni2oem() local15295 i = li + (hi - li) / 2; in ff_uni2oem()15296 if (uc == p[i * 2]) break; in ff_uni2oem()15297 if (uc > p[i * 2]) { in ff_uni2oem()15298 li = i; in ff_uni2oem()15300 hi = i; in ff_uni2oem()15303 if (n != 0) c = p[i * 2 + 1]; in ff_uni2oem()15318 UINT i = 0, n, li, hi; in ff_oem2uni() local15330 i = li + (hi - li) / 2; in ff_oem2uni()15331 if (oem == p[i * 2]) break; in ff_oem2uni()[all …]
953 UINT i, be; in chk_share() local957 for (i = 0; i < FF_FS_LOCK; i++) { in chk_share()958 if (Files[i].fs) { /* Existing entry */ in chk_share()959 if (Files[i].fs == dp->obj.fs && /* Check if the object matches with an open object */ in chk_share()960 Files[i].clu == dp->obj.sclust && in chk_share()961 Files[i].ofs == dp->dptr) break; in chk_share()966 if (i == FF_FS_LOCK) { /* The object has not been opened */ in chk_share()971 return (acc != 0 || Files[i].ctr == 0x100) ? FR_LOCKED : FR_OK; in chk_share()977 UINT i; in enq_share() local979 for (i = 0; i < FF_FS_LOCK && Files[i].fs; i++) ; /* Find a free entry */ in enq_share()[all …]
