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

  /src/lib/libbsdmalloc/
malloc.c 109 * nextf[i] is the pointer to the next free block of size 2^(i+3). The
114 static union overhead *nextf[NBUCKETS]; variable in typeref:union:overhead
239 if ((op = nextf[bucket]) == NULL) {
241 if ((op = nextf[bucket]) == NULL) {
246 nextf[bucket] = op->ov_next;
305 nextf[bucket] = op;
335 op->ov_next = nextf[(unsigned int)size];/* also clobbers ov_magic */
336 nextf[(unsigned int)size] = op;
453 for (p = nextf[i]; p && j != srchlen; p = p->ov_next) {
480 for (j = 0, p = nextf[i]; p; p = p->ov_next, j++
    [all...]
  /src/libexec/ld.elf_so/
xmalloc.c 127 * nextf[i] is the pointer to the next free block of size
134 static union overhead *nextf[NBUCKETS]; variable in typeref:union:overhead
211 if ((op = nextf[bucket]) == NULL) {
213 if ((op = nextf[bucket]) == NULL)
217 nextf[bucket] = op->ov_next;
277 nextf[bucket] = op;
301 op->ov_next = nextf[size]; /* also clobbers ov_magic */
302 nextf[size] = op;
372 for (j = 0, p = nextf[i]; p; p = p->ov_next, j++)
  /src/external/bsd/mdocml/dist/
term_ps.c 76 enum termfont nextf; /* building next font here */ member in struct:termp_ps
1072 if (p->ps->nextf != p->ps->lastf) {
1074 ps_setfont(p, p->ps->nextf);
1076 p->ps->nextf = TERMFONT_NONE;
1131 switch (p->ps->nextf) {
1135 p->ps->nextf = TERMFONT_BI;
1138 p->ps->nextf = TERMFONT_UNDER;
1145 switch (p->ps->nextf) {
1149 p->ps->nextf = TERMFONT_BI;
1152 p->ps->nextf = TERMFONT_BOLD
    [all...]
  /src/games/gomoku/
makemove.c 151 goto nextf;
204 nextf:
  /src/external/gpl3/gcc.old/dist/gcc/
stor-layout.cc 2063 tree nextf, size;
2081 nextf = DECL_CHAIN (field);
2082 while (nextf && TREE_CODE (nextf) != FIELD_DECL)
2083 nextf = DECL_CHAIN (nextf);
2086 nextf = NULL_TREE;
2087 if (nextf)
2092 if (TREE_TYPE (nextf) == error_mark_node)
2097 maxsize = size_diffop (DECL_FIELD_OFFSET (nextf),
2059 tree nextf, size; local
    [all...]
tree.cc 12786 tree nextf = DECL_CHAIN (TREE_OPERAND (ref, 1));
12787 while (nextf && TREE_CODE (nextf) != FIELD_DECL)
12788 nextf = DECL_CHAIN (nextf);
12789 if (nextf)
  /src/external/gpl3/gcc/dist/gcc/
stor-layout.cc 2099 tree nextf, size;
2117 nextf = DECL_CHAIN (field);
2118 while (nextf && TREE_CODE (nextf) != FIELD_DECL)
2119 nextf = DECL_CHAIN (nextf);
2122 nextf = NULL_TREE;
2123 if (nextf)
2128 if (TREE_TYPE (nextf) == error_mark_node)
2133 maxsize = size_diffop (DECL_FIELD_OFFSET (nextf),
2095 tree nextf, size; local
    [all...]
tree.cc 13055 tree nextf = DECL_CHAIN (TREE_OPERAND (ref, 1));
13056 while (nextf && TREE_CODE (nextf) != FIELD_DECL)
13057 nextf = DECL_CHAIN (nextf);
13058 if (nextf)
  /src/external/gpl3/gcc.old/dist/gcc/d/dmd/
opover.d 731 e.error("overloads `%s` and `%s` both match argument list for `%s`", m.lastf.type.toChars(), m.nextf.type.toChars(), m.lastf.toChars());
813 e.error("overloads `%s` and `%s` both match argument list for `%s`", m.lastf.type.toChars(), m.nextf.type.toChars(), m.lastf.toChars());
1261 e.error("overloads `%s` and `%s` both match argument list for `%s`", m.lastf.type.toChars(), m.nextf.type.toChars(), m.lastf.toChars());
1374 e.error("overloads `%s` and `%s` both match argument list for `%s`", m.lastf.type.toChars(), m.nextf.type.toChars(), m.lastf.toChars());
func.d 910 m.nextf = f;
924 m.nextf = null;
3198 if (m.lastf && m.nextf)
3201 TypeFunction tf2 = m.nextf.type.toTypeFunction();
3212 m.nextf.loc.toChars(), m.nextf.toPrettyChars(), nextprms, mod2);
dtemplate.d 2796 m.nextf = fd;
2936 m.nextf = fd;
2954 m.nextf = null;
3040 m.nextf = fd;
3059 m.nextf = null;
declaration.d 213 FuncDeclaration nextf; // if ambiguous match, this is the "other" function
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
string.d 5917 immutable nextf = decode(from, i);
5918 if (lastf <= c && c <= nextf)
5925 n += nextf - lastf;

Completed in 67 milliseconds