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

  /src/games/arithmetic/
arithmetic.c 100 static int nright, nwrong; variable
168 if (nright + nwrong > 0) {
170 nright, nwrong, (int)(100L * nright / (nright + nwrong)));
171 if (nright > 0)
173 (long)qtime, (float)qtime / nright);
251 ++nright;
  /src/external/gpl3/binutils/dist/gprofng/src/
vec.h 501 size_t nright = nelem - nleft - 1; local
502 if (nleft <= nright)
506 nelem = nright;
510 qsort (mid + 1, nright, qcmp, arg);
  /src/external/gpl3/binutils.old/dist/gprofng/src/
vec.h 501 size_t nright = nelem - nleft - 1; local
502 if (nleft <= nright)
506 nelem = nright;
510 qsort (mid + 1, nright, qcmp, arg);
  /src/external/bsd/openldap/dist/libraries/libldap/
tavl.c 434 int nleft, nright; local
441 nright = ldap_tavl_free( ldap_avl_rchild( root ), dfree );
447 return( nleft + nright + 1 );
avl.c 509 int nleft, nright; local
514 nleft = nright = 0;
519 nright = ldap_avl_free( root->avl_right, dfree );
525 return( nleft + nright + 1 );
  /src/external/bsd/jemalloc/dist/include/jemalloc/internal/
rb.h 1569 a_type *nright = rbtn_right_get(a_type, a_field, node); \
1570 if (nright != NULL && filter_subtree(filter_ctx, nright)) { \
1571 return a_prefix##first_filtered_from_node(nright, filter_node, \
  /src/external/bsd/jemalloc/include/jemalloc/internal/
rb.h 1569 a_type *nright = rbtn_right_get(a_type, a_field, node); \
1570 if (nright != NULL && filter_subtree(filter_ctx, nright)) { \
1571 return a_prefix##first_filtered_from_node(nright, filter_node, \
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
string.d 4599 const nright = width - len - nleft;
4600 return chain(repeat(fillChar, nleft), r, repeat(fillChar, nright));

Completed in 36 milliseconds