/src/sys/arch/atari/stand/tostools/aptck/ |
setrev.awk | 5 function revcmp(r1, r2, n1, n2, a1, a2, n, i) { 6 n1 = split(r1, a1, "\.") 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) 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/usr.bin/telnet/ |
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;
|
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)) {
|
/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/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/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/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/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/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/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) 150 if (i == n1)
|
/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/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/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/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/lib/libcurses/ |
tscroll.c | 50 __tscroll(const char *cap, int n1, int n2) 53 return __parse_cap(cap, n1, n2);
|
/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/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/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/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) 173 if (i == n1)
|
/src/usr.sbin/tprof/ |
tprof_analyze.c | 71 addrtree_compare_key(void *ctx, const void *n1, const void *keyp) 73 const struct addr *a1 = n1; 105 addrtree_compare_nodes(void *ctx, const void *n1, const void *n2) 109 return addrtree_compare_key(ctx, n1, a2);
|
/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/tests/ipf/ |
t_nat_exec.sh | 63 test_case n1 nattest text text 103 atf_add_test_case n1
|
/src/sys/kern/ |
bufq_priocscan.c | 74 /* return positive if n1 > n2 */ 76 cscan_tree_compare_nodes(void *context, const void *n1, const void *n2) 79 const struct buf * const b1 = n1; 104 /* return positive if n1 > k2 */ 106 cscan_tree_compare_key(void *context, const void *n1, const void *k2) 109 const struct buf * const b1 = n1;
|
/src/tests/ipf/input/ |
Makefile | 45 n1 \
|