Home
last modified time | relevance | path

Searched refs:froms (Results 1 – 10 of 10) sorted by relevance

/netbsd/src/common/lib/libc/gmon/
Dmcount.c186 &p->froms[ in _MCOUNT_DECL()
187 (size_t)(frompc / (HASHFRACTION * sizeof(*p->froms)))]; in _MCOUNT_DECL()
191 &p->froms[ in _MCOUNT_DECL()
192 (size_t)(frompc / (p->hashfraction * sizeof(*p->froms)))]; in _MCOUNT_DECL()
303 endfrom = (q->fromssize / sizeof(*q->froms)); in _gmonparam_merge()
305 if (q->froms[fromindex] == 0) in _gmonparam_merge()
307 for (qtoindex = q->froms[fromindex]; qtoindex != 0; in _gmonparam_merge()
312 frompcindex = &p->froms[fromindex]; in _gmonparam_merge()
/netbsd/src/lib/libc/gmon/
Dgmon.c154 GMON_ALLOC(cp, p->froms, p->fromssize); in monstartup()
234 __alignof(*_gmonparam.froms) + _gmonparam.fromssize + in _m_gmon_alloc()
243 GMON_ALLOC(cp, p->froms, p->fromssize); in _m_gmon_alloc()
244 memset(p->froms, 0, p->fromssize); in _m_gmon_alloc()
269 endfrom = (q->fromssize / sizeof(*q->froms)); in _m_gmon_merge_two()
271 if (q->froms[fromindex] == 0) in _m_gmon_merge_two()
273 for (qtoindex = q->froms[fromindex]; qtoindex != 0; in _m_gmon_merge_two()
278 frompcindex = &p->froms[fromindex]; in _m_gmon_merge_two()
473 endfrom = (int)(p->fromssize / sizeof(*p->froms)); in _mcleanup()
475 if (p->froms[fromindex] == 0) in _mcleanup()
[all …]
/netbsd/src/usr.sbin/kgmon/
Dkgmon.c347 u_short *froms, *tickbuf; in dumpstate() local
419 if ((froms = malloc((size_t)kvp->gpm.fromssize)) == NULL) in dumpstate()
423 i = kvm_read(kvp->kd, (u_long)kvp->gpm.froms, froms, in dumpstate()
428 if (sysctl(mib, miblen, froms, &i, NULL, 0) < 0) in dumpstate()
454 endfrom = kvp->gpm.fromssize / sizeof(*froms); in dumpstate()
456 if (froms[fromindex] == 0) in dumpstate()
459 (fromindex * kvp->gpm.hashfraction * sizeof(*froms)); in dumpstate()
460 for (toindex = froms[fromindex]; toindex != 0; in dumpstate()
543 if ((size_t)kvm_write(kvp->kd, (u_long)kvp->gpm.froms, zbuf, in reset()
/netbsd/src/sys/kern/
Dsubr_prof.c130 p->froms = (u_short *)(cp + p->tossize + p->kcountsize); in kmstartup()
192 _gmonparam.froms = p->froms; in kmstartup()
204 p->froms = (u_short *)cp; in kmstartup()
262 gp->froms = (u_short *)(cp + gp->tossize + gp->kcountsize); in sysctl_kern_profiling()
302 node.sysctl_data = gp->froms; in sysctl_kern_profiling()
395 memmove(ci->ci_gmon->froms, gp->froms, newlen); in sysctl_kern_profiling()
/netbsd/src/lib/libpam/modules/pam_login_access/
Dlogin_access.c80 char *froms; /* becomes list of terminals or hosts */ in login_access() local
110 || !(froms = strtok((char *) 0, fs)) in login_access()
121 match = (list_match(froms, from, from_match) in login_access()
/netbsd/src/external/bsd/byacc/dist/
Doutput.c21 static Value_t **froms; variable
566 froms[i] = r = NEW2(shiftcount, Value_t); in token_actions()
586 froms[nstates + i] = r = NEW2(reducecount, Value_t); in token_actions()
607 froms[2 * nstates + i] = r = NEW2(conflictcount, Value_t); in token_actions()
692 froms[symno] = sp1 = sp = NEW2(count, Value_t); in save_column()
825 if (tos[j][k] != tos[i][k] || froms[j][k] != froms[i][k]) in matching_vector()
852 from = froms[i]; in pack_vector()
954 if (froms[i]) in pack_table()
955 FREE(froms[i]); in pack_table()
960 DO_FREE(froms); in pack_table()
[all …]
/netbsd/src/sys/sys/
Dgmon.h125 u_short *froms; member
/netbsd/src/usr.sbin/timed/timed/
Dreadmsg.c49 #define LOOKAT(msg, mtype, mfrom, netp, froms) \ argument
53 ((netp)->mask & (froms).sin_addr.s_addr) == (netp)->net.s_addr))
/netbsd/src/external/gpl3/gcc/dist/gcc/
Dmatch.pd6418 (for froms (BUILT_IN_TRUNCL
6433 (froms (convert double_value_p@0))
6439 (for froms (BUILT_IN_TRUNCL BUILT_IN_TRUNC
6456 (froms (convert float_value_p@0))
6463 (for froms (BUILT_IN_TRUNCL BUILT_IN_TRUNC BUILT_IN_TRUNCF
6482 (convert (froms (convert float16_value_p@0)))
6503 (for froms (BUILT_IN_FMAF BUILT_IN_FMA BUILT_IN_FMAL)
6506 (convert (froms (convert@3 @0) (convert @1) (convert @2)))
6531 (for froms (XFLOORL XCEILL XROUNDL XRINTL)
6536 (froms (convert double_value_p@0))
[all …]
/netbsd/src/games/fortune/datfiles/
Dfortunes214627 -- Nancy Boxer, "Structured Programming with Come-froms"