HomeSort by: relevance | last modified time | path
    Searched refs:ngroup (Results 1 - 9 of 9) sorted by relevancy

  /src/external/bsd/jemalloc.old/dist/src/
sc.c 35 * (ndelta + ngroup) * delta. The way we choose slabbing strategies
36 * means that delta is at most the page size and ndelta < ngroup. So
37 * the loop executes for at most 2 * ngroup - 1 iterations, which is
93 int ngroup = (1 << lg_ngroup); local
155 while (ndelta < ngroup) {
175 ndelta_limit = ngroup - 1;
177 ndelta_limit = ngroup;
  /src/external/bsd/jemalloc/dist/src/
sc.c 35 * (ndelta + ngroup) * delta. The way we choose slabbing strategies
36 * means that delta is at most the page size and ndelta < ngroup. So
37 * the loop executes for at most 2 * ngroup - 1 iterations, which is
93 int ngroup = (1 << lg_ngroup); local
155 while (ndelta < ngroup) {
175 ndelta_limit = ngroup - 1;
177 ndelta_limit = ngroup;
  /src/bin/ls/
ls.c 509 char nuser[12], ngroup[12]; local
587 (void)snprintf(ngroup, sizeof(ngroup),
589 group = ngroup;
  /src/external/bsd/tcpdump/dist/
print-pim.c 976 uint8_t ngroup; local
991 ngroup = GET_U_1(bp + 1);
993 ND_PRINT("\n\t %u group(s)", ngroup);
1002 for (i = 0; i < ngroup; i++) {
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/regex/internal/
thompson.d 571 finish(t, matches.ptr[0 .. re.ngroup], re.ir[t.pc].data);
771 return re.ngroup
772 ? (Thread!DataIndex).sizeof + (re.ngroup-1)*(Group!DataIndex).sizeof
874 this(ThompsonMatcher matcher, size_t lo, size_t hi, uint nGroup, Stream stream)
880 re = matcher.re.withCode(code).withNGroup(nGroup);
892 this(BackMatcher matcher, size_t lo, size_t hi, uint nGroup, Stream stream)
898 re = matcher.re.withCode(code).withNGroup(nGroup);
910 auto fwdMatcher()(size_t lo, size_t hi, uint nGroup, size_t counter)
912 auto m = new ThompsonMatcher!(Char, Stream)(this, lo, hi, nGroup, s);
917 auto bwdMatcher()(size_t lo, size_t hi, uint nGroup, size_t counter
    [all...]
parser.d 25 ngroup = g.ngroup;
183 uint ngroup; // final number of groups (of all patterns)
321 ngroup = max(ngroup, groupStack.top);
ir.d 683 uint ngroup; // number of internal groups
716 const(Regex) withNGroup(uint nGroup) pure const @trusted
719 r.ngroup = nGroup;
backtracking.d 91 + re.ngroup * (Group!DataIndex).sizeof / size_t.sizeof;
843 total_matches = re.ngroup;
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/regex/
package.d 561 immutable n = rmatch._engine.pattern.ngroup;
861 auto captures = Captures!R(input, prog.ngroup, prog.dict);

Completed in 26 milliseconds