Searched refs:previous (Results 51 - 75 of 109) sorted by relevance

12345

/freebsd-11-stable/contrib/gcc/
H A Dcgraph.h115 struct cgraph_node GTY((chain_next ("%h.next"), chain_prev ("%h.previous")))
121 struct cgraph_node *previous; local
H A Dc-pragma.c449 "conflict with previous rename");
467 tree previous = purpose_member (oldname, pending_redefine_extname); local
468 if (previous)
470 if (TREE_VALUE (previous) != newname)
472 "conflict with previous #pragma redefine_extname");
527 "conflict with previous rename");
536 "conflict with previous rename");
/freebsd-11-stable/sys/powerpc/include/
H A Dasm.h111 .previous; \
/freebsd-11-stable/stand/ofw/libofw/
H A Dopenfirm.c297 OF_nextprop(phandle_t package, const char *previous, char *buf) argument
304 cell_t previous; member in struct:__anon5067
314 args.previous = (cell_t)previous;
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/lua/
H A Dlstate.h72 struct CallInfo *previous, *next; /* dynamic call link */ member in struct:CallInfo
98 luaV_execute of previous call */
H A Dlstate.c114 ci->previous = L->ci;
142 ci->next = ci->previous = NULL;
H A Dldebug.c95 for (ci = L->ci; level > 0 && ci != &L->base_ci; ci = ci->previous)
258 if (ci && !(ci->callstatus & CIST_TAIL) && isLua(ci->previous))
259 ar->namewhat = getfuncname(L, ci->previous, &ar->name);
H A Dlparser.c42 struct BlockCnt *previous; /* chain */ member in struct:BlockCnt
261 while (bl->nactvar > level) bl = bl->previous;
443 bl->previous = fs->bl;
474 if (bl->previous && bl->upval) {
482 fs->bl = bl->previous;
487 if (bl->previous) /* inner block? */
1103 ** upvalue/local variable is begin used in a previous assignment to a
1105 ** use this safe copy in the previous assignment.
1111 for (; lh; lh = lh->prev) { /* check all previous assignments */
1117 lh->v.u.ind.t = extra; /* previous assignmen
[all...]
/freebsd-11-stable/contrib/lua/src/
H A Dlstate.h95 struct CallInfo *previous, *next; /* dynamic call link */ member in struct:CallInfo
H A Dlcode.c59 ** Create a OP_LOADNIL instruction, but try to optimize: if the previous
61 ** range of previous instruction instead of emitting a new one. (For
65 Instruction *previous; local
68 previous = &fs->f->code[fs->pc-1];
69 if (GET_OPCODE(*previous) == OP_LOADNIL) { /* previous is LOADNIL? */
70 int pfrom = GETARG_A(*previous); /* get previous range */
71 int pl = pfrom + GETARG_B(*previous);
76 SETARG_A(*previous, fro
[all...]
H A Dlparser.c49 struct BlockCnt *previous; /* chain */ member in struct:BlockCnt
261 bl = bl->previous;
445 bl->previous = fs->bl;
476 if (bl->previous && bl->upval) {
484 fs->bl = bl->previous;
489 if (bl->previous) /* inner block? */
1115 ** upvalue/local variable is begin used in a previous assignment to a
1117 ** use this safe copy in the previous assignment.
1123 for (; lh; lh = lh->prev) { /* check all previous assignments */
1129 lh->v.u.ind.t = extra; /* previous assignmen
[all...]
/freebsd-11-stable/contrib/gdb/
H A Ddjunpack.bat29 Rem empty files. We need that because the previous line will create
/freebsd-11-stable/contrib/gcc/config/rs6000/
H A Ddarwin-world.asm175 /* Pickup previous SP */
184 /* Pickup previous SP */
207 /* R11 := previous SP */
/freebsd-11-stable/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_affinity.h51 int next(int previous) const override {
52 return hwloc_bitmap_next(mask, previous);
293 int next(int previous) const override {
294 int retval = previous + 1;
421 int next(int previous) const override {
422 int retval = previous + 1;
H A Dz_Windows_NT-586_asm.asm149 and eax, 1 ; sign extend previous instruction
174 and eax, 1 ; sign extend previous instruction
199 and eax, 1 ; sign extend previous instruction
232 and eax, 1 ; sign extend previous instruction
735 and rax, 1 ; sign extend previous instruction
763 and rax, 1 ; sign extend previous instruction
791 and rax, 1 ; sign extend previous instruction
819 and rax, 1 ; sign extend previous instruction
1265 sub rdx, 8 ; decrement p_argv pointer to previous parm
H A Dkmp_affinity.cpp96 int start = 0, finish = 0, previous = 0; local
116 // [start, previous] is inclusive range of contiguous bits in mask
117 for (finish = mask->next(start), previous = start;
118 finish == previous + 1 && finish != mask->end();
120 previous = finish;
132 if (previous - start > 1) {
134 static_cast<int>(previous));
139 if (previous - start > 0) {
140 KMP_SNPRINTF(scan, end - scan + 1, ",%d", static_cast<int>(previous));
165 int start = 0, finish = 0, previous local
[all...]
/freebsd-11-stable/lib/libc/db/test/btree.tests/
H A Dmain.c80 void previous(DB *, char **);
106 "p", 0, 0, previous, "previous", "move cursor back one record",
683 previous(db, argv) function
694 perror("previous/seq");
/freebsd-11-stable/contrib/gcclibs/libcpp/
H A Dinternal.h607 /* The previous character. */
608 cppchar_t previous; member in struct:normalize_state
609 /* The combining class of the previous character. */
620 ((st)->previous = 0, (st)->prev_class = 0)
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/tsan/rtl/
H A Dtsan_rtl_ppc64.S15 .previous
158 .previous
/freebsd-11-stable/contrib/gcc/cp/
H A Dname-lookup.h71 cxx_binding *previous;
220 label in this scope. The TREE_PURPOSE is the previous value of
236 /* List of VAR_DECLS saved from a previous for statement.
70 cxx_binding *previous; local
H A Dname-lookup.c282 binding->previous = NULL;
294 free_bindings = binding->previous;
310 binding->previous = free_bindings;
350 binding->previous = IDENTIFIER_BINDING (id);
392 IDENTIFIER_BINDING (id) = binding->previous;
506 error ("conflicts with previous declaration %q+#D", bval);
619 receives the linkage of the previous declaration. */
641 previous declaration.) */
668 inherits linkage from the previous decl; in
671 the previous dec
[all...]
/freebsd-11-stable/crypto/heimdal/lib/krb5/
H A Dconfig_file.c578 krb5_config_binding *d, *previous = NULL; local
598 if (previous)
599 previous->next = d;
601 previous = d;
/freebsd-11-stable/usr.sbin/autofs/
H A Dcommon.c278 * Move (reparent) node 'n' to make it sibling of 'previous', placed
282 node_move_after(struct node *n, struct node *previous) argument
286 n->n_parent = previous->n_parent;
287 TAILQ_INSERT_AFTER(&previous->n_parent->n_children, previous, n, n_next);
/freebsd-11-stable/contrib/gdb/gdb/
H A Dinfttrace.c1853 /* Remember this one, and throw away any previous
2272 warning ("Can't find event, using previous event.");
2350 struct memory_page *previous;
2384 memory_page_dictionary.buckets[i].previous = NULL;
5211 page->previous = NULL;
5217 page->previous = previous_page;
5234 if (page->previous != NULL)
5235 page->previous->next = page->next;
5237 page->next->previous = page->previous;
2338 struct memory_page *previous; member in struct:memory_page
[all...]
/freebsd-11-stable/sys/dev/ofw/
H A Dopenfirm.c495 OF_nextprop(phandle_t package, const char *previous, char *buf, size_t size) argument
501 return (OFW_NEXTPROP(ofw_obj, package, previous, buf, size));

Completed in 412 milliseconds

12345