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

  /src/tests/include/sys/
t_list.c 56 } *n1, *n2, *n3; local in function:ATF_TC_BODY
60 n1 = malloc(sizeof(struct entry));
61 n1->value = 1;
62 LIST_INSERT_HEAD(&old_head, n1, entries);
  /src/usr.bin/telnet/
network.c 131 ssize_t n, n1; local in function:netflush
137 if ((n1 = n = ring_full_consecutive(&netoring)) > 0) {
172 if ((n1 == n) && ring_full_consecutive(&netoring)) {
terminal.c 91 int n, n0, n1; local in function:ttyflush
94 if ((n1 = n = ring_full_consecutive(&ttyoring)) > 0) {
111 if (n1 == n && n0 > n) {
112 n1 = n0 - n;
114 n1 = TerminalWrite(ttyoring.bottom, n1);
115 if (n1 > 0)
116 n += n1;
  /src/lib/libc/string/
bm.c 174 size_t *d0, k, md2, n1, ro; local in function:bm_exec
184 n1 = pat->patlen - 1;
204 for (p = pat->pat, q = s - n1; p < ep;)
207 return (s - n1);
221 for (p = pat->pat, q = s - n1; p <= ep;)
224 return (s - n1);
  /src/usr.bin/uudecode/
uudecode.c 131 int n1; local in function:decode
191 n1 = strlen(p);
192 if (n + n1 + 2 > MAXPATHLEN) {
197 memmove(buf + n + 1, p, n1 + 1);
  /src/lib/libm/noieee_src/
n_cbrt.c 86 const int n0=1,n1=0; local in function:cbrt
88 const int n0=0,n1=1; local in function:cbrt
114 pt[n1]=0; pt[n0]+=0x00000001;
  /src/usr.sbin/mtree/
specspec.c 106 mismatch(NODE *n1, NODE *n2, int differ, char const *path)
110 shownode(n1, differ, path);
113 if (n1 == NULL) {
121 shownode(n1, differ, path);
128 compare_nodes(NODE *n1, NODE *n2, char const *path)
132 if (n1 != NULL && n1->type == F_LINK)
133 n1->flags &= ~F_MODE;
137 if (n1 == NULL && n2 != NULL) {
139 mismatch(n1, n2, differs, path)
196 NODE *c1, *c2, *n1, *n2; local in function:walk_in_the_forest
    [all...]
  /src/sys/external/bsd/drm2/linux/
linux_xa.c 159 struct node *n, *n1, *collision __diagused; local in function:xa_alloc
171 while ((n1 = rb_tree_find_node_geq(&xa->xa_tree, &key64)) != NULL &&
172 n1->n_key == key64) {
181 KASSERT(n1 == NULL || n1->n_key > key64);
  /src/lib/libtelnet/
pk.c 271 int n1, n2, op; local in function:pk_decode
280 n1 = in[op] - 'A' + 10;
282 n1 = in[op] - '0';
287 buf[l] = (char)(n1 * 16 + n2);
  /src/lib/libbluetooth/
bluetooth.c 349 int n1, n2; local in function:bt_hex_byte
351 if ((n1 = bt_hex_nibble(str[0])) < 0)
357 return ((((n1 & 0x0f) << 4) | (n2 & 0x0f)) & 0xff);
  /src/games/fortune/strfile/
strfile.c 384 int n1, n2; local in function:cmp_str
400 n1 = 0;
403 SET_N(n1, c1);
407 while (!IS_END(c1, n1) && !IS_END(c2, n2)) {
416 SET_N(n1, c1);
421 if (IS_END(c1, n1))
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/
sanitizer_deadlock_detector_test.cc 73 // Cycle: n1->n2->n1
77 uptr n1 = d.newNode(1); local in function:RunBasicTest
79 EXPECT_FALSE(d.onLock(&dtls, n1));
82 d.onUnlock(&dtls, n1);
85 EXPECT_EQ(0U, d.findPathToLock(&dtls, n1, path, 1));
86 EXPECT_EQ(2U, d.findPathToLock(&dtls, n1, path, 10));
87 EXPECT_EQ(2U, d.findPathToLock(&dtls, n1, path, 2));
88 EXPECT_TRUE(d.onLock(&dtls, n1));
89 EXPECT_EQ(path[0], n1);
101 uptr n1 = d.newNode(1); local in function:RunBasicTest
    [all...]
  /src/sys/lib/libkern/
entpool.c 136 size_t n = len, n1 = n;
142 while (n1) {
146 P->s.u8[P->i++] ^= (n1 >= 0x80 ? 0x80 : 0) | (n1 & 0x7f);
147 n1 >>= 7;
134 size_t n = len, n1 = n; local in function:entpool_enter
  /src/usr.bin/tsort/
tsort.c 206 NODE *n1; local in function:add_arc
210 n1 = get_node(s1);
220 for (i = 0; i < n1->n_narcs; i++)
221 if (n1->n_arcs[i] == n2)
226 if (n1->n_narcs == n1->n_arcsize) {
227 if (!n1->n_arcsize)
228 n1->n_arcsize = 10;
229 bsize = n1->n_arcsize * sizeof(*n1->n_arcs) * 2
    [all...]
  /src/usr.sbin/sa/
main.c 469 double n1, n2; local in function:cmp_avgdkio
474 n1 = (double) c1.ci_io / (double) (c1.ci_calls ? c1.ci_calls : 1);
477 if (n1 < n2)
479 else if (n1 == n2)
508 double n1, n2; local in function:cmp_avgcpumem
516 n1 = (double) c1.ci_mem / (double) (t1 ? t1 : 1);
519 if (n1 < n2)
521 else if (n1 == n2)
  /src/usr.bin/config/
mkioconf.c 135 int n1, n2; local in function:cforder
137 n1 = (*(const struct devi * const *)a)->i_cfindex;
139 if (n1 < n2)
141 else if (n1 > n2)
  /src/lib/libc/gdtoa/
misc.c 476 int i, k1, n, n1; local in function:lshift
482 n1 = n + b->wds + 1;
483 for(i = b->maxwds; n1 > i; i <<= 1)
503 ++n1;
513 ++n1;
519 b1->wds = n1 - 1;
  /src/sys/arch/sh3/sh3/
db_disasm.c 308 int n1, type, md; local in function:f_08
310 n1 = (insn & 0x0f00) >> 8;
314 if (n1 != 0)
425 int n1, fx; local in function:f_0b
427 n1 = (insn & 0x0f00) >> 8;
428 if (n1 != 0)
  /src/sys/lib/libunwind/
AddressSpace.hpp 442 const LocalAddressSpace::Range *n1 = (const LocalAddressSpace::Range *)n1_; 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);
464 const LocalAddressSpace::Range *n1 = (const LocalAddressSpace::Range *)n1_; 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 142 int n1; member in struct:suftab
150 { .suf = "ssen", .p1 = ily, .n1 = 4,
152 { .suf = "ssel", .p1 = ily, .n1 = 4,
154 { .suf = "se", .p1 = s, .n1 = 1,
157 { .suf = "s'", .p1 = s, .n1 = 2,
159 { .suf = "s", .p1 = s, .n1 = 1,
161 { .suf = "ecn", .p1 = ncy, .n1 = 1,
163 { .suf = "ycn", .p1 = ncy, .n1 = 1,
165 { .suf = "ytilb", .p1 = nop, .n1 = 0,
167 { .suf = "ytilib", .p1 = bility, .n1 = 5
    [all...]
  /src/sys/dev/pci/
tdvfb.c 676 int n1, n2; local in function:tdvfb_gendac_calc_pll
695 * n1+2 fREF
697 for (n1 = TDV_GENDAC_MIN_N1; n1 <= TDV_GENDAC_MAX_N1; n1++) {
699 mdbl = (2 * freq * (1 << n2)*(n1 + 2)) / TDV_GENDAC_REFFREQ - 4;
708 fout = (TDV_GENDAC_REFFREQ * (m + 2)) / ((1 << n2) * (n1 + 2));
710 best_n1 = n1;
  /src/lib/libresolv/
res_mkupdate.c 96 u_int32_t n1, rttl; local in function:res_nmkupdate
218 n1 = ntohl(ina.s_addr);
220 PUTLONG(n1, cp);
344 n1 = ntohl(ina.s_addr);
346 PUTLONG(n1, cp);
  /src/sys/arch/amiga/dev/
grf_rh.c 664 long n1 = 3; local in function:rh_CompFQ
690 m = (f * n1) / (14318180/1024);
695 tmp = (((m * 14318180) >> n2) / n1) - fq;
701 erg = (((n2 << 5) | (n1-2)) << 8) | (m-2);
704 } while ( (++n1) <= 21);
  /src/bin/sh/
parser.c 186 union node *ntop, *n1, *n2, *n3; local in function:list
194 ntop = n1 = NULL;
214 else if (n1 == NULL) {
215 n1 = stalloc(sizeof(struct nbinary));
216 n1->type = NSEMI;
217 n1->nbinary.ch1 = ntop;
218 n1->nbinary.ch2 = n2;
219 ntop = n1;
223 n3->nbinary.ch1 = n1->nbinary.ch2;
225 n1->nbinary.ch2 = n3
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
    [all...]
  /src/sbin/nvmectl/
bignum.c 4755 mp_int n1, y, r; local in function:mp_prime_miller_rabin
4766 /* get n1 = a - 1 */
4767 if ((err = mp_init_copy(&n1, a)) != MP_OKAY) {
4770 if ((err = signed_subtract_word(&n1, 1, &n1)) != MP_OKAY) {
4774 /* set 2**s * r = n1 */
4775 if ((err = mp_init_copy(&r, &n1)) != MP_OKAY) {
4797 /* if y != 1 and y != n1 do */
4798 if (compare_digit(&y, 1) != MP_EQ && signed_compare(&y, &n1) != MP_EQ) {
4800 /* while j <= s-1 and y != n1 */
    [all...]

Completed in 25 milliseconds