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

  /src/tests/lib/libexecinfo/
t_backtrace.c 69 size_t j, nptrs, min_frames, max_frames; local in function:myfunc3
80 nptrs = backtrace(buffer, __arraycount(buffer));
81 ATF_REQUIRE(nptrs != (size_t)-1);
82 strings = backtrace_symbols_fmt(buffer, nptrs, "%n");
86 printf("got nptrs=%zu ncalls=%zu (min_frames: %zu, max_frames: %zu)\n",
87 nptrs, ncalls, min_frames, max_frames);
89 for (j = 0; j < nptrs; j++) {
93 ATF_REQUIRE(nptrs >= ncalls + 2 + min_frames);
94 ATF_REQUIRE(nptrs <= ncalls + 2 + max_frames);
101 for (size_t i = 0; j < nptrs; i++, j++)
    [all...]
t_backtrace.c 69 size_t j, nptrs, min_frames, max_frames; local in function:myfunc3
80 nptrs = backtrace(buffer, __arraycount(buffer));
81 ATF_REQUIRE(nptrs != (size_t)-1);
82 strings = backtrace_symbols_fmt(buffer, nptrs, "%n");
86 printf("got nptrs=%zu ncalls=%zu (min_frames: %zu, max_frames: %zu)\n",
87 nptrs, ncalls, min_frames, max_frames);
89 for (j = 0; j < nptrs; j++) {
93 ATF_REQUIRE(nptrs >= ncalls + 2 + min_frames);
94 ATF_REQUIRE(nptrs <= ncalls + 2 + max_frames);
101 for (size_t i = 0; j < nptrs; i++, j++)
    [all...]
  /src/sys/dev/raidframe/
rf_dagutils.c 101 int nptrs; local in function:rf_InitNode
130 nptrs = nSucc + nAnte + nResult + nSucc;
132 if (nptrs <= RF_DAG_PTRCACHESIZE) {
139 * (1) Generally, nptrs doesn't exceed RF_DAG_PTRCACHESIZE by
145 } else if (nptrs <= (RF_DAGPCACHE_SIZE / sizeof(RF_DagNode_t *))) {
149 ptrs = RF_MallocAndAdd(nptrs * sizeof(*ptrs), alist);
rf_dagutils.c 101 int nptrs; local in function:rf_InitNode
130 nptrs = nSucc + nAnte + nResult + nSucc;
132 if (nptrs <= RF_DAG_PTRCACHESIZE) {
139 * (1) Generally, nptrs doesn't exceed RF_DAG_PTRCACHESIZE by
145 } else if (nptrs <= (RF_DAGPCACHE_SIZE / sizeof(RF_DagNode_t *))) {
149 ptrs = RF_MallocAndAdd(nptrs * sizeof(*ptrs), alist);

Completed in 29 milliseconds