Searched refs:nelem (Results 1 - 5 of 5) sorted by path
| /haiku/src/system/libroot/posix/glibc/regex/ |
| H A D | regcomp.c | 311 for (node_cnt = 0; node_cnt < init_state->nodes.nelem; ++node_cnt)
984 for (i = 0; i < init_nodes.nelem; ++i)
992 for (clexp_idx = 0; clexp_idx < init_nodes.nelem; ++clexp_idx)
1000 if (clexp_idx == init_nodes.nelem)
1467 else if (dfa->edests[org_node].nelem == 0)
1475 else if (dfa->edests[org_node].nelem == 1)
1499 else /* dfa->edests[org_node].nelem == 2 */
1592 for (idx = 0; idx < dfa->eclosures[src].nelem; ++idx)
1627 assert (dfa->eclosures[node_idx].nelem != -1);
1631 if (dfa->eclosures[node_idx].nelem !
[all...] |
| H A D | regex_internal.c | 960 set->nelem = 0;
972 set->nelem = 1;
976 set->alloc = set->nelem = 0;
993 set->nelem = 1;
998 set->nelem = 2;
1017 dest->nelem = src->nelem;
1018 if (src->nelem > 0)
1020 dest->alloc = dest->nelem;
1024 dest->alloc = dest->nelem
[all...] |
| H A D | regex_internal.h | 186 int nelem; member in struct:__anon5494
665 #define re_node_set_empty(p) ((p)->nelem = 0)
|
| H A D | regexec.c | 668 if (dfa->init_state->nodes.nelem == 0
669 && dfa->init_state_word->nodes.nelem == 0
670 && (dfa->init_state_nl->nodes.nelem == 0
1236 for (i = 0; i < state->nodes.nelem; ++i)
1264 for (dest_node = -1, i = 0; i < edests->nelem; ++i)
1664 for (i = 0; i < cur_src->nelem; i++)
1692 if (sctx->limits.nelem)
1774 if (dest_nodes->nelem == 0)
1787 if (sctx->limits.nelem)
1824 err = re_node_set_alloc (&state->inveclosure, dest_nodes->nelem);
[all...] |
| /haiku/src/system/libroot/posix/malloc_hoard2/ |
| H A D | wrapper.cpp | 345 calloc(size_t nelem, size_t elsize) argument
348 size_t size = nelem * elsize;
351 if ((nelem > 0) && ((size/nelem) != elsize))
357 if (nelem == 0 || elsize == 0)
359 if (size < (nelem * size)&& size < (elsize * size))
372 KTRACE("calloc(%lu, %lu) -> NULL", nelem, elsize);
389 KTRACE("calloc(%lu, %lu) -> %p", nelem, elsize, ptr);
|
Completed in 71 milliseconds