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

1 2

  /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/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;
meson_clk.h 304 struct meson_clk_pll_reg n2; member in struct:meson_clk_mpll
323 .u.mpll.n2 = _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/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/sys/arch/arm/iomd/
iomd_clock.c 357 volatile u_int n2; local in function:delay
361 n2 = n;
362 while (n2-- > 0) {
  /src/usr.sbin/autofs/
automount.c 146 struct node *n, *n2; local in function:mount_unmount
184 TAILQ_FOREACH(n2, &n->n_children, n_next) {
185 mount_if_not_already(n2, n->n_map, n->n_options,
common.c 283 struct node *n, *n2, *tmp, *tmp2, *tmproot; local in function:node_expand_includes
319 TAILQ_FOREACH_REVERSE_SAFE(n2,
321 node_move_after(n2, n);
  /src/lib/libbluetooth/
bluetooth.c 349 int n1, n2; local in function:bt_hex_byte
354 if ((n2 = bt_hex_nibble(str[1])) < 0)
357 return ((((n1 & 0x0f) << 4) | (n2 & 0x0f)) & 0xff);
  /src/lib/libm/ld80/
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);
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...]
  /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/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/bsd/drm2/dist/drm/nouveau/nvkm/subdev/clk/
nouveau_nvkm_subdev_clk_gk20a.c 145 u32 m, n, n2; local in function:gk20a_pllg_calc_mnp
158 n2 = ((target_vco_f * m) + (ref_clk_f - 1)) / ref_clk_f;
163 for (; n <= n2; n++) {
  /src/usr.bin/infocmp/
infocmp.c 351 compare_ents(TIENT *ents1, size_t n1, TIENT *ents2, size_t n2)
362 while (i1 != n1 || i2 != n2) {
365 else if (i2 == n2)
649 size_t n, n2; local in function:main
764 n2 = 5 + strlen(argv[optind]);
766 if (n + n2 > cols) {
789 n2 = load_ents(ents2, t2, 'f');
790 compare_ents(ents, n, ents2, n2);
797 n2 = load_ents(ents2, t2, 'n');
798 compare_ents(ents, n, ents2, n2);
    [all...]
  /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/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/libm/ld128/
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);
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...]
  /src/usr.bin/config/
mkioconf.c 135 int n1, n2; local in function:cforder
138 n2 = (*(const struct devi * const *)b)->i_cfindex;
139 if (n1 < n2)
141 else if (n1 > 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/spell/spellprog/
spellprog.c 146 int n2; member in struct:suftab
156 .n2 = 2, .d2 = "-y+ies", .a2 = "+es" },
193 .n2 = 2, .d2 = "-y+ier", .a2 = "+er" },
196 .n2 = 2, .d2 = "-y+ied", .a2 = "+ed" },
203 .n2 = 3, .d2 = "-y+iest",.a2 = "+est" },
459 return (*t->p2)(ep - t->n2, t->d2, t->a2, lev);
  /src/sys/dev/pci/
tdvfb.c 676 int n1, n2; local in function:tdvfb_gendac_calc_pll
684 /* select highest possible n2, check n2 * fCLK < TDV_GENDAC_MAXVCO */
685 for (n2 = TDV_GENDAC_MAX_N2; n2 >= TDV_GENDAC_MIN_N2; n2--) {
686 if ((freq * (1 << n2)) < TDV_GENDAC_MAXVCO)
693 * m+2 2^n2 * fOUT
699 mdbl = (2 * freq * (1 << n2)*(n1 + 2)) / TDV_GENDAC_REFFREQ - 4;
708 fout = (TDV_GENDAC_REFFREQ * (m + 2)) / ((1 << n2) * (n1 + 2))
    [all...]
  /src/sys/arch/amiga/dev/
grf_rh.c 662 long n2 = 3; local in function:rh_CompFQ
676 } while (n2-- > 0);
678 if (n2 < 0)
687 f <<= n2;
695 tmp = (((m * 14318180) >> n2) / n1) - fq;
701 erg = (((n2 << 5) | (n1-2)) << 8) | (m-2);
  /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...]

Completed in 24 milliseconds

1 2