HomeSort by: relevance | last modified time | path
    Searched defs:froms (Results 1 - 6 of 6) sorted by relevancy

  /src/lib/libpam/modules/pam_login_access/
login_access.c 80 char *froms; /* becomes list of terminals or hosts */ local
110 || !(froms = strtok((char *) 0, fs))
121 match = (list_match(froms, from, from_match)
  /src/sys/sys/
gmon.h 125 u_short *froms; member in struct:gmonparam
  /src/usr.sbin/kgmon/
kgmon.c 347 u_short *froms, *tickbuf; local
419 if ((froms = malloc((size_t)kvp->gpm.fromssize)) == NULL)
420 err(EXIT_FAILURE, "cannot allocate %zu froms space",
423 i = kvm_read(kvp->kd, (u_long)kvp->gpm.froms, froms,
428 if (sysctl(mib, miblen, froms, &i, NULL, 0) < 0)
432 errx(EXIT_FAILURE, "read froms: read %lu, got %lu: %s",
454 endfrom = kvp->gpm.fromssize / sizeof(*froms);
456 if (froms[fromindex] == 0)
459 (fromindex * kvp->gpm.hashfraction * sizeof(*froms));
    [all...]
  /src/external/gpl3/gcc/dist/libgcc/config/sol2/
gmon.c 77 /* froms is actually a bunch of unsigned shorts indexing tos. */
79 static unsigned short *froms; variable
116 froms = sbrk (s_textsize / HASHFRACTION);
117 if (froms == (void *) -1) {
119 froms = NULL;
131 froms = NULL;
197 endfrom = s_textsize / (HASHFRACTION * sizeof (*froms));
199 if (froms[fromindex] == 0) {
202 frompc = s_lowpc + (fromindex * HASHFRACTION * sizeof (*froms));
203 for (toindex = froms[fromindex]
    [all...]
  /src/external/gpl3/gcc.old/dist/libgcc/config/sol2/
gmon.c 77 /* froms is actually a bunch of unsigned shorts indexing tos. */
79 static unsigned short *froms; variable
116 froms = sbrk (s_textsize / HASHFRACTION);
117 if (froms == (void *) -1) {
119 froms = NULL;
131 froms = NULL;
197 endfrom = s_textsize / (HASHFRACTION * sizeof (*froms));
199 if (froms[fromindex] == 0) {
202 frompc = s_lowpc + (fromindex * HASHFRACTION * sizeof (*froms));
203 for (toindex = froms[fromindex]
    [all...]
  /src/external/bsd/byacc/dist/
output.c 21 static Value_t **froms; variable
566 froms[i] = r = NEW2(shiftcount, Value_t);
586 froms[nstates + i] = r = NEW2(reducecount, Value_t);
607 froms[2 * nstates + i] = r = NEW2(conflictcount, Value_t);
692 froms[symno] = sp1 = sp = NEW2(count, Value_t);
825 if (tos[j][k] != tos[i][k] || froms[j][k] != froms[i][k])
852 from = froms[i];
954 if (froms[i])
955 FREE(froms[i])
    [all...]

Completed in 25 milliseconds