Lines Matching refs:n
1019 UINT n; in dec_share() local
1024 n = Files[i].ctr; in dec_share()
1025 if (n == 0x100) n = 0; /* If write mode open, delete the object semaphore */ in dec_share()
1026 if (n > 0) n--; /* Decrement read mode open count */ in dec_share()
1027 Files[i].ctr = n; in dec_share()
1028 if (n == 0) { /* Delete the object semaphore if open count becomes zero */ in dec_share()
1401 DWORD cl, n; in fill_first_frag() local
1405 for (cl = obj->sclust, n = obj->n_cont; n; cl++, n--) { /* Create cluster chain on the FAT */ in fill_first_frag()
1682 UINT n, szb; in dir_clear() local
1696 …for (n = 0; n < fs->csize && disk_write(fs->pdrv, ibuf, sect + n, szb) == RES_OK; n += szb) ; /* F… in dir_clear()
1702 …for (n = 0; n < fs->csize && disk_write(fs->pdrv, ibuf, sect + n, szb) == RES_OK; n += szb) ; /* F… in dir_clear()
1704 return (n == fs->csize) ? FR_OK : FR_DISK_ERR; in dir_clear()
1830 UINT n; local
1836 n = 0;
1845 if (++n == n_ent) break; /* Is a block of contiguous free entries found? */
1847 n = 0; /* Not a free entry, restart to search */
2076 UINT n = 11; local
2080 } while (--n);
2494 UINT n, len, n_ent; local
2536 for (n = 1; n < 100; n++) {
2537 gen_numname(dp->fn, sn, fs->lfnbuf, n); /* Generate a numbered name */
2541 if (n == 100) return FR_DENIED; /* Abort if too many collisions */
3282 UINT n /* Data length */ argument
3292 } while (--n);
4354 UINT i, n; local
4395 for (n = 0; fno.fname[n]; n++) ; /* Name length */
4396 if (i < n + 1) { /* Insufficient space to store the path name? */
4399 while (n) buff[--i] = fno.fname[--n]; /* Stack the name */
4408 for (n = 0, vp = (const char*)VolumeStr[CurrVol]; vp[n]; n++) ;
4409 if (i >= n + 2) {
4411 for (vl = 0; vl < n; *tp++ = (TCHAR)vp[vl], vl++) ;
5591 DWORD n, clst, stcl, scl, ncl, tcl, lclst; local
5600 n = (DWORD)fs->csize * SS(fs); /* Cluster size */
5601 tcl = (DWORD)(fsz / n) + ((fsz & (n - 1)) ? 1 : 0); /* Number of clusters required */
5623 n = get_fat(&fp->obj, clst);
5625 if (n == 1) {
5628 if (n == 0xFFFFFFFF) {
5631 if (n == 0) { /* Is it a free cluster? */
5642 for (clst = scl, n = tcl; n; clst++, n--) { /* Create a cluster chain on the FAT */
5643 res = put_fat(fs, clst, (n == 1) ? 0xFFFFFFFF : clst + 1);
5914 DWORD sz_buf, sz_blk, n_clst, pau, nsect, n, vsn; local
6100 n = (i + ss - 1) / ss;
6101 if (disk_write(pdrv, buf, sect, n) != RES_OK) LEAVE_MKFS(FR_DISK_ERR);
6102 sect += n; i = 0;
6114 n = (nsect > sz_buf) ? sz_buf : nsect; /* Write the buffered data */
6115 if (disk_write(pdrv, buf, sect, n) != RES_OK) LEAVE_MKFS(FR_DISK_ERR);
6116 sect += n; nsect -= n;
6136 n = (nsect > sz_buf) ? sz_buf : nsect; /* Write the buffered data */
6137 if (disk_write(pdrv, buf, sect, n) != RES_OK) LEAVE_MKFS(FR_DISK_ERR);
6138 sect += n; nsect -= n;
6153 n = (nsect > sz_buf) ? sz_buf : nsect;
6154 if (disk_write(pdrv, buf, sect, n) != RES_OK) LEAVE_MKFS(FR_DISK_ERR);
6156 sect += n; nsect -= n;
6161 for (n = 0; n < 2; n++) {
6210 n = (DWORD)sz_vol / 0x20000; /* Volume size in unit of 128KS */
6211 for (i = 0, pau = 1; cst32[i] && cst32[i] <= n; i++, pau <<= 1) ; /* Get from table */
6220 n = (DWORD)sz_vol / 0x1000; /* Volume size in unit of 4KS */
6221 for (i = 0, pau = 1; cst[i] && cst[i] <= n; i++, pau <<= 1) ; /* Get from table */
6225 n = n_clst * 2 + 4; /* FAT size [byte] */
6228 n = (n_clst * 3 + 1) / 2 + 3; /* FAT size [byte] */
6230 sz_fat = (n + ss - 1) / ss; /* FAT size [sector] */
6238 …n = (DWORD)(((b_data + sz_blk - 1) & ~(sz_blk - 1)) - b_data); /* Sectors to next nearest from cur…
6240 sz_rsv += n; b_fat += n;
6242 if (n % n_fat) { /* Adjust fractional error if needed */
6243 n--; sz_rsv++; b_fat++;
6245 sz_fat += n / n_fat;
6345 n = (nsect > sz_buf) ? sz_buf : nsect;
6346 if (disk_write(pdrv, buf, sect, (UINT)n) != RES_OK) LEAVE_MKFS(FR_DISK_ERR);
6348 sect += n; nsect -= n;
6355 n = (nsect > sz_buf) ? sz_buf : nsect;
6356 if (disk_write(pdrv, buf, sect, (UINT)n) != RES_OK) LEAVE_MKFS(FR_DISK_ERR);
6357 sect += n; nsect -= n;
6599 UINT n; local
6718 f_write(pb->fp, pb->buf, (UINT)i, &n);
6719 i = (n == (UINT)i) ? 0 : -1;
6793 static int ilog10 (double n) /* Calculate log10(n) in integer output */ argument
6797 while (n >= 10) { /* Decimate digit in right shift */
6798 if (n >= 100000) {
6799 n /= 100000; rv += 5;
6801 n /= 10; rv++;
6804 while (n < 1) { /* Decimate digit in left shift */
6805 if (n < 0.00001) {
6806 n *= 100000; rv -= 5;
6808 n *= 10; rv--;
6815 static double i10x (int n) /* Calculate 10^n in integer input */ argument
6819 while (n > 0) { /* Left shift */
6820 if (n >= 5) {
6821 rv *= 100000; n -= 5;
6823 rv *= 10; n--;
6826 while (n < 0) { /* Right shift */
6827 if (n <= -5) {
6828 rv /= 100000; n += 5;
6830 rv /= 10; n++;