HomeSort by: relevance | last modified time | path
    Searched refs:n2 (Results 1 - 25 of 63) sorted by relevancy

1 2 3

  /src/sys/arch/atari/stand/tostools/aptck/
setrev.awk 5 function revcmp(r1, r2, n1, n2, a1, a2, n, i) {
7 n2 = split(r2, a2, "\.")
8 n = (n1 < n2) ? n1 : n2
14 if (n1 != n2)
15 return(n1 - n2)
  /src/usr.sbin/mtree/
specspec.c 106 mismatch(NODE *n1, NODE *n2, int differ, char const *path)
109 if (n2 == NULL) {
115 shownode(n2, differ, path);
123 shownode(n2, differ, path);
128 compare_nodes(NODE *n1, NODE *n2, char const *path)
134 if (n2 != NULL && n2->type == F_LINK)
135 n2->flags &= ~F_MODE;
137 if (n1 == NULL && n2 != NULL) {
138 differs = n2->flags
196 NODE *c1, *c2, *n1, *n2; local in function:walk_in_the_forest
    [all...]
  /src/sys/arch/arm/amlogic/
meson_clk_mpll.c 47 uint64_t parent_rate, sdm, n2; local in function:meson_clk_mpll_get_rate
66 val = CLK_READ(sc, mpll->n2.reg);
67 n2 = __SHIFTOUT(val, mpll->n2.mask);
71 const uint64_t div = (SDM_DEN * n2) + sdm;
  /src/lib/libm/ld80/
s_expl.c 162 int k, n, n2; local in function:expm1l
219 /* Reduce x to (k*ln2 + endpoint[n2] + r1 + r2). */
222 n2 = (unsigned)n % INTERVALS;
235 * expl(endpoint[n2] + r1 + r2) = tbl[n2] * expl(r1 + r2).
240 t = (long double)tbl[n2].lo + tbl[n2].hi;
243 t = SUM2P(tbl[n2].hi - 1, tbl[n2].lo * (r1 + 1) + t * q +
244 tbl[n2].hi * r1)
    [all...]
k_expl.h 223 int n, n2; local in function:__k_expl
225 /* Reduce x to (k*ln2 + endpoint[n2] + r1 + r2). */
229 n2 = (unsigned)n % INTERVALS;
235 /* Evaluate expl(endpoint[n2] + r1 + r2) = tbl[n2] * expl(r1 + r2). */
242 t = (long double)tbl[n2].lo + tbl[n2].hi;
243 *hip = tbl[n2].hi;
244 *lop = tbl[n2].lo + t * (q + r1);
  /src/tests/include/sys/
t_list.c 56 } *n1, *n2, *n3; local in function:ATF_TC_BODY
64 n2 = malloc(sizeof(struct entry));
65 n2->value = 2;
66 LIST_INSERT_HEAD(&old_head, n2, entries);
  /src/lib/libm/ld128/
s_expl.c 205 int k, n, n2; local in function:expm1l
266 /* Reduce x to (k*ln2 + endpoint[n2] + r1 + r2). */
269 n2 = (unsigned)n % INTERVALS;
282 * expl(endpoint[n2] + r1 + r2) = tbl[n2] * expl(r1 + r2).
288 t = tbl[n2].lo + tbl[n2].hi;
291 t = SUM2P(tbl[n2].hi - 1, tbl[n2].lo * (r1 + 1) + t * q +
292 tbl[n2].hi * r1)
    [all...]
k_expl.h 242 int n, n2; local in function:__k_expl
244 /* Reduce x to (k*ln2 + endpoint[n2] + r1 + r2). */
247 n2 = (unsigned)n % INTERVALS;
254 /* Evaluate expl(endpoint[n2] + r1 + r2) = tbl[n2] * expl(r1 + r2). */
258 t = tbl[n2].lo + tbl[n2].hi;
259 *hip = tbl[n2].hi;
260 *lop = tbl[n2].lo + t * (q + r1);
  /src/bin/ps/
keyword.c 70 #define UID(n1, n2, of) \
71 { .name = n1, .header = n2, .flag = 0, .oproc = pvar, \
73 #define GID(n1, n2, off) UID(n1, n2, off)
76 #define PID(n1, n2, of) \
77 { .name = n1, .header = n2, .flag = 0, .oproc = pvar, \
80 #define LVAR(n1, n2, fl, of, ty, fm) \
81 { .name = n1, .header = n2, .flag = (fl) | LWP, .oproc = pvar, \
83 #define PVAR(n1, n2, fl, of, ty, fm) \
84 { .name = n1, .header = n2, .flag = (fl) | 0, .oproc = pvar,
    [all...]
  /src/sbin/ldconfig/
shlib.c 136 cmpndewey(int d1[], int n1, int d2[], int n2)
140 for (i = 0; i < n1 && i < n2; i++) {
147 if (n1 == n2)
153 if (i == n2)
  /src/bin/sh/
parser.c 186 union node *ntop, *n1, *n2, *n3; local in function:list
196 n2 = andor();
199 if (n2->type == NCMD || n2->type == NPIPE)
200 n2->ncmd.backgnd = 1;
201 else if (n2->type == NREDIR)
202 n2->type = NBACKGND;
206 n3->nredir.n = n2;
208 n2 = n3;
213 ntop = n2;
263 union node *n1, *n2, *n3; local in function:andor
290 union node *n1, *n2, *pipenode; local in function:pipeline
341 union node *n1, *n2; local in function:command
628 union node *n2; local in function:simplecmd
    [all...]
  /src/games/fortune/strfile/
strfile.c 384 int n1, n2; local in function:cmp_str
401 n2 = 0;
405 SET_N(n2, c2);
407 while (!IS_END(c1, n1) && !IS_END(c2, n2)) {
417 SET_N(n2, c2);
423 if (IS_END(c2, n2))
  /src/lib/libcurses/
tscroll.c 50 __tscroll(const char *cap, int n1, int n2)
53 return __parse_cap(cap, n1, n2);
  /src/sys/arch/mips/cavium/dev/
octeon_pkovar.h 92 int le, int n2, int q, int r, int g, int ipoffp1, int ii, int df, int segs,
103 __SHIFTIN(n2, PKO_CMD_WORD0_N2) |
  /src/usr.sbin/sa/
main.c 469 double n1, n2; local in function:cmp_avgdkio
475 n2 = (double) c2.ci_io / (double) (c2.ci_calls ? c2.ci_calls : 1);
477 if (n1 < n2)
479 else if (n1 == n2)
508 double n1, n2; local in function:cmp_avgcpumem
517 n2 = (double) c2.ci_mem / (double) (t2 ? t2 : 1);
519 if (n1 < n2)
521 else if (n1 == n2)
  /src/lib/libc/stdio/
vfwprintf.c 624 int n, n2; /* handy integer (short term usage) */ local in function:WDECL
706 * BEWARE, these `goto error' on error, PRINT uses `n2' and
750 n2 = (int)td; \
751 if (n2 > (len)) \
752 n2 = (len); \
753 if (n2 > 0) \
754 PRINT((p), n2); \
755 PAD((len) - (n2 > 0 ? n2 : 0), (with)); \
798 n2 = 0;
1541 size_t n, n2; \/* handy index (short term usage) *\/ local in function:__find_arguments
    [all...]
  /src/lib/libtelnet/
pk.c 271 int n1, n2, op; local in function:pk_decode
284 n2 = in[op + 1] - 'A' + 10;
286 n2 = in[op + 1] - '0';
287 buf[l] = (char)(n1 * 16 + n2);
  /src/lib/libc/citrus/
citrus_module.c 156 _cmpndewey(int d1[], unsigned int n1, int d2[], unsigned int n2)
163 for (i = 0; i < n1 && i < n2; i++) {
170 if (n1 == n2)
176 if (i == n2)
  /src/sys/lib/libunwind/
AddressSpace.hpp 443 const LocalAddressSpace::Range *n2 = (const LocalAddressSpace::Range *)n2_; local in function:_Unwind::rangeCmp
445 if (n1->first_pc < n2->first_pc)
447 if (n1->first_pc > n2->first_pc)
449 assert(n1->last_pc == n2->last_pc);
465 const LocalAddressSpace::Range *n2 = (const LocalAddressSpace::Range *)n2_; local in function:_Unwind::dsoTableCmp
467 if (n1->ehframe_base < n2->ehframe_base)
469 if (n1->ehframe_base > n2->ehframe_base)
  /src/usr.bin/tsort/
tsort.c 207 NODE *n2; local in function:add_arc
215 n2 = get_node(s2);
221 if (n1->n_arcs[i] == n2)
233 n1->n_arcs[n1->n_narcs++] = n2;
234 ++n2->n_refcnt;
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/
sanitizer_deadlock_detector_test.cc 73 // Cycle: n1->n2->n1
78 uptr n2 = d.newNode(2); local in function:RunBasicTest
80 EXPECT_FALSE(d.onLock(&dtls, n2));
81 d.onUnlock(&dtls, n2);
84 EXPECT_FALSE(d.onLock(&dtls, n2));
90 EXPECT_EQ(path[1], n2);
92 EXPECT_EQ(d.getData(n2), 2U);
94 d.onUnlock(&dtls, n2);
97 // Cycle: n1->n2->n3->n1
102 uptr n2 = d.newNode(2) local in function:RunBasicTest
    [all...]
  /src/sys/external/isc/libsodium/dist/src/libsodium/crypto_aead/aes256gcm/aesni/
aead_aes256gcm_aesni.c 519 CRYPTO_ALIGN(16) uint32_t n2[4];
530 memcpy(&n2[0], npub, 3 * 4);
531 n2[3] = 0x01000000;
532 aesni_encrypt1(T, _mm_load_si128((const __m128i *) n2), rkeys);
575 aesni_encrypt8full(c + i, n2, rkeys, m + i, accum, Hv, H2v, H3v, H4v, rev); \
589 aesni_encrypt8(outni, n2, rkeys); \
607 n2[3] &= 0x00ffffff;
608 COUNTER_INC2(n2);
658 CRYPTO_ALIGN(16) uint32_t n2[4];
670 memcpy(&n2[0], npub, 3 * 4)
    [all...]
  /src/tests/ipf/
t_nat_exec.sh 64 test_case n2 nattest text text
104 atf_add_test_case n2
  /src/tests/ipf/input/
Makefile 69 n2 \
  /src/sys/arch/arm/iomd/
iomd_clock.c 357 volatile u_int n2; local in function:delay
361 n2 = n;
362 while (n2-- > 0) {

Completed in 26 milliseconds

1 2 3