| /fuchsia/zircon/third_party/uapp/dash/src/ |
| H A D | jobs.c | 127 set_curjob(struct job *jp, unsigned mode) argument
136 if (jp1 == jp)
166 jp->prev_job = *jpp;
167 *jpp = jp;
251 struct job *jp; local
322 jp = getjob(*argv, 0);
323 pid = -jp->ps[0].pid;
337 jobno(const struct job *jp) argument
339 return jp - jobtab + 1;
346 struct job *jp; local
379 restartjob(struct job *jp, int mode) argument
448 showjob(struct output *out, struct job *jp, int mode) argument
553 struct job *jp; local
572 freejob(struct job *jp) argument
597 struct job *jp; local
665 struct job *jp; local
754 struct job *jp; local
797 struct job *jp, *jq; local
854 forkchild(struct job *jp, union node *n, int mode) argument
902 forkparent(struct job *jp, union node *n, int mode, pid_t pid) argument
937 forkshell(struct job *jp, union node *n, int mode) argument
978 waitforjob(struct job *jp) argument
1018 struct job *jp; local
1182 struct job *jp; local
1474 showpipe(struct job *jp, struct output *out) argument
[all...] |
| H A D | eval.h | 47 struct job *jp; /* job structure for command */ member in struct:backcmd
|
| H A D | jobs.h | 108 void freejob(struct job *jp);
|
| H A D | eval.c | 471 struct job *jp; local
486 jp = makejob(n, 1);
495 zx_status_t exec_result = process_subshell(n, envp, &process, jp->zx_job_hndl, NULL, err_msg);
498 forkparent(jp, n, backgnd, process);
505 status = process_await_termination(process, jp->zx_job_hndl, true);
557 struct job *jp; local
570 jp = makejob(n, pipelen);
590 zx_status_t status = process_subshell(lp->n, envp, &processes[idx], jp->zx_job_hndl, fds, err_msg);
597 forkparent(jp, lp->n, FORK_NOJOB, processes[idx]);
599 freejob(jp);
629 struct job *jp; local
[all...] |
| H A D | expand.c | 555 back_exitstatus = waitforjob(in.jp);
|
| /fuchsia/zircon/third_party/ulib/musl/src/string/ |
| H A D | wcsstr.c | 8 size_t l, ip, jp, k, p, ms, p0, mem, mem0; local
18 jp = 0;
20 while (jp + k < l) {
21 if (n[ip + k] == n[jp + k]) {
23 jp += p;
27 } else if (n[ip + k] > n[jp + k]) {
28 jp += k;
30 p = jp - ip;
32 ip = jp++;
41 jp
[all...] |
| H A D | memmem.c | 39 size_t i, ip, jp, k, p, ms, p0, mem, mem0; local
50 jp = 0;
52 while (jp + k < l) {
53 if (n[ip + k] == n[jp + k]) {
55 jp += p;
59 } else if (n[ip + k] > n[jp + k]) {
60 jp += k;
62 p = jp - ip;
64 ip = jp++;
73 jp
[all...] |
| H A D | strstr.c | 35 size_t l, ip, jp, k, p, ms, p0, mem, mem0; local
48 jp = 0;
50 while (jp + k < l) {
51 if (n[ip + k] == n[jp + k]) {
53 jp += p;
57 } else if (n[ip + k] > n[jp + k]) {
58 jp += k;
60 p = jp - ip;
62 ip = jp++;
71 jp
[all...] |
| /fuchsia/zircon/system/utest/thread-initial-state/ |
| H A D | x86-64.S | 46 jp .Lfail
|
| /fuchsia/zircon/third_party/ulib/musl/third_party/math/ |
| H A D | __rem_pio2_large.c | 96 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
237 int32_t jz, jx, jv, jp, jk, carry, n, iq[20], i, j, k, m, q0, ih; local
242 jp = jk;
366 /* compute PIo2[0,...,jp]*q[jz,...,0] */
368 for (fw = 0.0, k = 0; k <= jp && k <= jz - i; k++)
|