| /src/games/quiz/ |
| rxp.c | 98 static Rxp_t *rp; local
106 rp = rxpbuf;
108 *rp++ = SOT; /* auto-anchor: pat is really ^pat$ */
109 *rp++ = GRP_S; /* auto-group: ^pat$ is really ^[pat]$ */
110 *rp++ = 0;
112 *rp++ = ALT_S;
113 alt_ptr = rp;
114 *rp++ = 0;
116 if (rp - rxpbuf >= RXP_LINE_SZ - 4) {
124 *rp++ = LIT
204 static Rxp_t *rp; local
269 static Rxp_t *rp; local
[all...] |
| /src/games/robots/ |
| move_robs.c | 53 COORD *rp; local
63 for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++) {
64 if (rp->y < 0)
66 mvaddch(rp->y, rp->x, ' ');
67 Field[rp->y][rp->x]--;
68 rp->y += sign(My_pos.y - rp->y)
[all...] |
| /src/external/gpl2/gettext/dist/autoconf-lib-link/tests/ |
| rpath-1b | 6 rp=rp1b
|
| rpath-1a | 6 rp=rp1a
|
| /src/external/lgpl3/gmp/dist/mpz/ |
| set_d.c | 52 mp_ptr rp; local
67 rp = MPZ_NEWALLOC (r, rn);
72 MPN_ZERO (rp, rn - LIMBS_PER_DOUBLE);
73 rp += rn - LIMBS_PER_DOUBLE;
77 rp[1] = tp[1], rp[0] = tp[0];
80 rp[0] = tp[1];
85 rp[2] = tp[2], rp[1] = tp[1], rp[0] = tp[0]
[all...] |
| urandomb.c | 38 mp_ptr rp; local
42 rp = MPZ_NEWALLOC (rop, size);
44 _gmp_rand (rp, rstate, nbits);
45 MPN_NORMALIZE (rp, size);
|
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| mul_basecase.c | 53 mpn_mul_basecase (mp_ptr rp,
59 ASSERT (! MPN_OVERLAP_P (rp, un+vn, up, un));
60 ASSERT (! MPN_OVERLAP_P (rp, un+vn, vp, vn));
63 availability, limbs). This result can be stored, not added, to rp. We
69 rp[un + 1] = mpn_mul_2 (rp, up, un, vp);
70 rp += 2, vp += 2, vn -= 2;
74 rp[un] = mpn_mul_1 (rp, up, un, vp[0]);
78 rp[un] = mpn_mul_1 (rp, up, un, vp[0])
[all...] |
| zero.c | 34 mpn_zero (mp_ptr rp, mp_size_t n)
38 rp += n;
40 rp[i] = 0;
|
| bsqrtinv.c | 55 mpn_bsqrtinv (mp_ptr rp, mp_srcptr yp, mp_bitcnt_t bnb, mp_ptr tp)
67 rp[0] = 1;
87 mpn_sqrlo (tp, rp, bn);
88 mpn_mullo_n (tp2, rp, tp, bn); /* tp2 <- rp ^ 3 */
90 mpn_mul_1 (tp, rp, bn, 3);
92 mpn_mullo_n (rp, yp, tp2, bn);
95 mpn_rsh1sub_n (rp, tp, rp, bn);
97 mpn_sub_n (tp2, tp, rp, bn)
[all...] |
| mullo_basecase.c | 47 mpn_mullo_basecase (mp_ptr rp, mp_srcptr up, mp_srcptr vp, mp_size_t n)
51 mpn_mul_1 (rp, up, n, vp[0]);
56 rp++;
57 mpn_addmul_1 (rp, up, i, vp[0]);
65 mpn_mullo_basecase (mp_ptr rp, mp_srcptr up, mp_srcptr vp, mp_size_t n)
77 h += up[n - 1] * v0 + mpn_mul_1 (rp, up, n - 1, v0);
78 rp++;
83 h += up[i] * v0 + mpn_addmul_1 (rp, up, i, v0);
84 rp++;
88 rp[0] = h
[all...] |
| sqr_basecase.c | 42 #define MPN_SQR_DIAGONAL(rp, up, n) \
43 mpn_sqr_diagonal (rp, up, n)
45 #define MPN_SQR_DIAGONAL(rp, up, n) \
52 umul_ppmm ((rp)[2 * _i + 1], lpl, ul, ul << GMP_NAIL_BITS); \
53 (rp)[2 * _i] = lpl >> GMP_NAIL_BITS; \
59 #define MPN_SQR_DIAG_ADDLSH1(rp, tp, up, n) \
60 mpn_sqr_diag_addlsh1 (rp, tp, up, n)
63 #define MPN_SQR_DIAG_ADDLSH1(rp, tp, up, n) \
66 MPN_SQR_DIAGONAL (rp, up, n); \
67 cy = mpn_addlsh1_n (rp + 1, rp + 1, tp, 2 * n - 2);
[all...] |
| pow_1.c | 40 mpn_pow_1 (mp_ptr rp, mp_srcptr bp, mp_size_t bn, mp_limb_t exp, mp_ptr tp)
54 rp[0] = 1;
59 MPN_COPY (rp, bp, bn);
65 order to magically get results in the entry rp. Use simple code,
84 MP_PTR_SWAP (rp, tp);
87 rp[0] = rl >> GMP_NAIL_BITS;
88 rp[1] = rh;
96 rp[rn] = rh = mpn_mul_1 (rp, rp, rn, bl)
[all...] |
| com.c | 37 mpn_com (mp_ptr rp, mp_srcptr up, mp_size_t n)
42 *rp++ = ~ul & GMP_NUMB_MASK;
|
| copyd.c | 34 mpn_copyd (mp_ptr rp, mp_srcptr up, mp_size_t n)
39 rp[i] = up[i];
|
| copyi.c | 34 mpn_copyi (mp_ptr rp, mp_srcptr up, mp_size_t n)
39 rp += n;
41 rp[i] = up[i];
|
| mulmid.c | 45 mpn_mulmid (mp_ptr rp,
54 ASSERT (! MPN_OVERLAP_P (rp, an - bn + 3, ap, an));
55 ASSERT (! MPN_OVERLAP_P (rp, an - bn + 3, bp, bn));
64 mpn_mulmid_basecase (rp, ap, an, bp, bn);
78 mpn_mulmid_basecase (rp, ap, CHUNK, bp, bn);
86 ap += k, rp += k;
87 t0 = rp[0], t1 = rp[1];
88 mpn_mulmid_basecase (rp, ap, CHUNK, bp, bn);
89 ADDC_LIMB (cy, rp[0], rp[0], t0); /* add back saved limbs *
[all...] |
| /src/external/ibm-public/postfix/dist/src/cleanup/ |
| cleanup_region.c | 18 /* int cleanup_region_close(state, rp)
20 /* CLEANUP_REGION *rp;
22 /* CLEANUP_REGION *cleanup_region_return(state, rp)
24 /* CLEANUP_REGION *rp;
98 CLEANUP_REGION *rp; local
100 rp = (CLEANUP_REGION *) mymalloc(sizeof(*rp));
101 rp->write_offs = rp->start = start;
102 rp->len = len
112 CLEANUP_REGION *rp; local
151 CLEANUP_REGION *rp; local
[all...] |
| /src/sys/nfs/ |
| nfs_srvcache.c | 84 #define NETFAMILY(rp) \
85 (((rp)->rc_flags & RC_INETADDR) ? AF_INET : -1)
88 static void nfsrv_unlockcache(struct nfsrvcache *rp);
142 cleanentry(struct nfsrvcache *rp)
145 if ((rp->rc_flags & RC_REPMBUF) != 0) {
146 m_freem(rp->rc_reply);
148 if ((rp->rc_flags & RC_NAM) != 0) {
149 m_free(rp->rc_nam);
151 rp->rc_flags &= ~(RC_REPSTATUS|RC_REPMBUF);
188 struct nfsrvcache *rp; local
240 struct nfsrvcache *rp, *rpdup; local
347 struct nfsrvcache *rp; local
383 struct nfsrvcache *rp; local
[all...] |
| /src/external/lgpl3/gmp/dist/mpn/x86_64/fat/ |
| addmul_2.c | 34 mpn_addmul_2 (mp_ptr rp, mp_srcptr up, mp_size_t n, const mp_limb_t vp[2])
36 rp[n] = mpn_addmul_1 (rp, up, n, vp[0]);
37 return mpn_addmul_1 (rp + 1, up, n, vp[1]);
|
| /src/usr.sbin/rpc.pcnfsd/ |
| pcnfsd_test.c | 115 v2_info_results *rp; local
123 rp = pcnfsd2_info_2(&a, cl2);
125 if(rp == NULL) {
131 rp->vers, rp->cm);
132 printf("facilities_len = %d\n", rp->facilities.facilities_len);
133 if (rp->facilities.facilities_len) {
134 gp = rp->facilities.facilities_val;
135 for(i = 0; i < rp->facilities.facilities_len; i++)
140 if(rp->cm
153 v2_auth_results *rp; local
201 v2_pr_init_results *rp; local
229 v2_pr_start_results *rp; local
281 v2_pr_cancel_results *rp; local
309 v2_pr_list_results *rp; local
367 v2_pr_queue_results *rp; local
439 v2_pr_status_results *rp; local
488 v2_mapid_results *rp; local
[all...] |
| /src/sys/fs/nfs/server/ |
| nfs_nfsdcache.c | 278 #define NETFAMILY(rp) \
279 (((rp)->rc_flag & RC_INETIPV6) ? AF_INET6 : AF_INET)
284 static void nfsrc_lock(struct nfsrvcache *rp);
285 static void nfsrc_unlock(struct nfsrvcache *rp);
286 static void nfsrc_wanted(struct nfsrvcache *rp);
287 static void nfsrc_freecache(struct nfsrvcache *rp);
295 nfsrc_cachemutex(struct nfsrvcache *rp)
298 if ((rp->rc_flag & RC_UDP) != 0)
300 return (&nfsrchash_table[nfsrc_hash(rp->rc_xid)].mtx);
372 struct nfsrvcache *rp; local
461 struct nfsrvcache *rp; local
605 struct nfsrvcache *rp, *nextrp; local
814 struct nfsrvcache *rp, *nextrp; local
842 struct nfsrvcache *rp, *nextrp; local
[all...] |
| /src/external/gpl3/gcc/dist/contrib/reghunt/examples/ |
| 30643.c | 3 void bar (struct s *ps, int *p, int *__restrict__ rp, int *__restrict__ rq)
11 rp[0] = 0;
13 if (rp[0] != 0) abort();
|
| /src/external/gpl3/gcc.old/dist/contrib/reghunt/examples/ |
| 30643.c | 3 void bar (struct s *ps, int *p, int *__restrict__ rp, int *__restrict__ rq)
11 rp[0] = 0;
13 if (rp[0] != 0) abort();
|
| /src/external/lgpl3/mpfr/dist/src/ |
| urandomb.c | 52 mpfr_limb_ptr rp; local
59 rp = MPFR_MANT (rop);
68 mpfr_rand_raw (rp, rstate, nbits);
70 mpn_lshift (rp, rp, nlimbs, cnt);
75 while (nlimbs != 0 && rp[nlimbs - 1] == 0)
84 count_leading_zeros (cnt, rp[nlimbs - 1]);
100 mpn_lshift (rp + k, rp, nlimbs, cnt);
102 mpn_copyd (rp + k, rp, nlimbs)
[all...] |
| /src/sys/net/npf/ |
| npf_rproc.c | 177 npf_rproc_t *rp, const nvlist_t *params)
184 if (rp->rp_ext_count >= RPROC_EXT_COUNT) {
202 error = extops->ctor(rp, params);
207 i = rp->rp_ext_count++;
208 rp->rp_ext[i] = ext;
229 npf_rproc_t *rp; local
231 while ((rp = LIST_FIRST(&rpset->rps_list)) != NULL) {
232 LIST_REMOVE(rp, rp_entry);
233 npf_rproc_release(rp);
244 npf_rproc_t *rp; local
265 const npf_rproc_t *rp; local
292 npf_rproc_t *rp; local
[all...] |
