Searched defs:ns (Results 1 - 13 of 13) sorted by relevance

/ast/src/lib/libast/tm/
H A Dtmxduration.c36 Time_t ns; local
49 ns = tmxdate(s, &last, now) - now;
52 ns = strtod(s, &last) * TMX_RESOLUTION;
61 ns = ts - now;
71 ns = ts - now;
79 return ns;
H A Dtmlocale.c352 int ns; local
360 ns = 3 * GetLocaleInfo(lcid, LOCALE_SSHORTDATE, 0, 0);
362 n = nt + ns + nl;
/ast/src/cmd/tests/vmalloc/
H A Dtalign.c25 static Void_t* alignmem(Vmalloc_t* vm, Void_t* ca, size_t cs, size_t ns, Vmdisc_t* dc) argument
27 static Void_t* alignmem(vm, ca, cs, ns, dc)
31 size_t ns;
/ast/src/lib/libast/misc/
H A Dftwalk.c60 int ns; local
80 ns = strlen(path) + 1;
81 if (!(e = newof(0, FTSENT, 1, ns)))
84 e->fts_namelen = e->fts_pathlen = ns;
118 ns = e->status = e->path == e->fts_accpath ? FTW_PATH : FTW_NAME;
149 if (e->status == ns)
/ast/src/cmd/ksh93/bltins/
H A Dsleep.c73 Time_t now,ns; local
77 ns = tmxdate(cp, &last, now);
90 ns = tmxdate(pp, &last, now);
92 ns = tmxdate(pp, &last, now);
96 d = ns - now;
/ast/src/lib/libvcodex/Vchuff/
H A Dvchtrie.c43 Node_t* root, ssize_t len, Vcbit_t** sort, ssize_t ns, ssize_t lev)
45 static int bldtrie(trie, clen, bits, root, len, sort, ns, lev)
52 ssize_t ns; /* # of elts in sort[] */
61 for(m = 0, k = 0; k < ns; ++k)
96 for(k = 0; k < ns; )
109 { for(m = k+1; m < ns; ++m)
158 ssize_t k, ns; local
176 for(ns = 0, k = 0; k < nsym; ++k)
178 sort[ns++] = bits+k;
179 vcqsort(sort, ns, sizeo
42 bldtrie(Vchtrie_t* trie, ssize_t* clen, Vcbit_t* bits, Node_t* root, ssize_t len, Vcbit_t** sort, ssize_t ns, ssize_t lev) argument
[all...]
/ast/src/cmd/probe/
H A Dprobe.c214 char* ns; local
225 if ((ns = sfgetr(nf, '\n', 1)) && (nz = sfvalue(nf) - 1) > 0)
227 ns += nz;
228 if ((oz = strlen(processor)) <= nz && !strcmp(processor, ns - oz))
231 error(2, "%s: %s clashes with %s", path, processor, ns - nz);
237 ns = sfreserve(nf, 0, 0);
245 if (memcmp(ns, os, nz))
247 nz = sfread(nf, ns, nz);
/ast/src/lib/libcmd/
H A Dcp.c206 preserve(State_t* state, const char* path, struct stat* ns, struct stat* os) argument
214 n = ((ns->st_uid != os->st_uid) << 1) | (ns->st_gid != os->st_gid);
/ast/src/lib/libvcodex/
H A Dvclzparse.c102 #define fknext(cf,ks,ns,ky) (((ky) - (ks)[0]*(cf) )*ALPHA + (ns)[0] )
103 #define fknextm(cf,ks,ns,ky,cm) (((ky) - (cm)[(ks)[0]]*(cf) )*ALPHA + (cm)[(ns)[0]] )
204 Vcchar_t *ks, *ns, *ts, *et, *sm, *em; local
226 ns = (ks = vcpa->src) + mmin;
227 for(endo = (m = hs->src) + vcpa->nsrc - (mmin-1); ; ++ks, ++ns )
232 ky = fk; fk = fknext(coef, ks, ns, fk);
236 ns = (ks = vcpa->tar) + mmin; et = ks + vcpa->ntar; /* bounds of target data */
407 fk = fknext(coef, ks, ns, f
[all...]
/ast/src/lib/libast/regex/
H A Dregnexec.c298 * os is start of old pos array, ns is start of new,
305 better(Env_t* env, Pos_t* os, Pos_t* ns, Pos_t* oend, Pos_t* nend, int level) argument
316 DEBUG_CODE(0x0080,{sfprintf(sfstdout, " %-*.*sold ", (level + 3) * 4, (level + 3) * 4, "");for (oe = os; oe < oend; oe++)sfprintf(sfstdout, "<%d,%d,%d>", oe->p - env->beg, oe->serial, oe->be);sfprintf(sfstdout, "\n %-*.*snew ", (level + 3) * 4, (level + 3) * 4, "");for (oe = ns; oe < nend; oe++)sfprintf(sfstdout, "<%d,%d,%d>", oe->p - env->beg, oe->serial, oe->be);sfprintf(sfstdout, "\n");},{0;});
317 if (ns >= nend)
322 if (ns->serial > n)
324 if (n > ns->serial)
329 if (ns->p > os->p)
331 if (os->p > ns->p)
343 ne = ns;
357 if (k = better(env, os + 1, ns
383 _better(Env_t* env, Pos_t* os, Pos_t* ns, Pos_t* oend, Pos_t* nend, int level) argument
[all...]
/ast/src/lib/libast/vmalloc/
H A Dmalloc.c705 char *ns; local
712 if((ns = malloc(n+1)) )
713 memcpy(ns,s,n+1);
714 return ns;
/ast/src/cmd/nmake/
H A Dscan.c1157 char* ns; local
1160 os = ns = internal.scan->name;
1165 ns = q->rule->name;
1167 error(1, "%s: scan strategy %s overrides %s", u->name, ns, os);
/ast/src/cmd/sortlib/sync/
H A Dss.c2491 struct stat ns; local
2494 if (stat("/dev/null", &ns))
2496 ns.st_dev = 0;
2497 ns.st_ino = 0;
2502 if (!fstat(sffileno(fp->group->io), &ws) && SAME(&ws, &ns))
2565 if (gp->io && !fstat(sffileno(gp->io), &ws) && SAME(&ws, &ns))

Completed in 50 milliseconds