Home
last modified time | relevance | path

Searched refs:n (Results 151 – 175 of 7148) sorted by relevance

12345678910>>...286

/freebsd/sys/fs/nfs/
H A Dnfsport.h183 #define NFSD_VNET_NAME(n) VNET_NAME(n) argument
184 #define NFSD_VNET_DECLARE(t, n) VNET_DECLARE(t, n) argument
185 #define NFSD_VNET_DEFINE(t, n) VNET_DEFINE(t, n) argument
187 #define NFSD_VNET(n) VNET(n) argument
191 #define NFSD_CURVNET_SET(n) CURVNET_SET(n) argument
194 #define NFSD_TD_TO_VNET(n) TD_TO_VNET(n) argument
830 #define NFSLOCKNODE(n) mtx_lock(&((n)->n_mtx)) argument
831 #define NFSUNLOCKNODE(n) mtx_unlock(&((n)->n_mtx)) argument
877 #define NFSMAKEDEV(m, n) makedev((m), (n)) argument
1058 #define NFSHASNFSV4N(n) ((n)->nm_minorvers > 0) argument
[all …]
/freebsd/contrib/ncurses/progs/
H A Dtabs.c91 int n = 0; in decode_tabs() local
105 if (n > 0 && result[n] <= result[n - 1]) { in decode_tabs()
113 ++n; in decode_tabs()
117 if (n) in decode_tabs()
139 result[n] = 0; in decode_tabs()
150 int n; in print_ruler() local
153 for (n = 0; n < max_cols; n += 10) { in print_ruler()
166 for (n = 0, last = 0; (tab_list[n] > 0) && (last < max_cols); ++n) { in print_ruler()
308 for (n = 0; tab_list[n] != '\0'; ++n) { in legal_tab_list()
397 for (n = 1; n < argc; ++n) { in main()
[all …]
/freebsd/contrib/mandoc/
H A Dman.c253 n = man->last; in man_pmacro()
290 n = man->last; in man_breakscope()
292 n = n->parent; in man_breakscope()
296 n = n->parent; in man_breakscope()
298 mandoc_msg(MANDOCERR_BLK_LINE, n->line, n->pos, in man_breakscope()
313 n = man->last; in man_breakscope()
315 roff_body_alloc(man, n->line, n->pos, n->tok); in man_breakscope()
329 n = n->parent; in man_breakscope()
332 n = n->parent; in man_breakscope()
335 n = n->parent; in man_breakscope()
[all …]
/freebsd/usr.bin/m4/
H A Dmisc.c102 size_t n; in pbstr() local
104 n = strlen(s); in pbstr()
107 while (n > 0) in pbstr()
115 pbnum(int n) in pbnum() argument
133 num = (n < 0) ? -n : n; in pbnumbase()
140 if (n < 0) in pbnumbase()
145 if (n < 0) in pbnumbase()
229 getdiv(int n) in getdiv() argument
256 int n; in killdiv() local
258 for (n = 0; n < maxout; n++) in killdiv()
[all …]
/freebsd/usr.sbin/bluetooth/hccontrol/
H A Dinfo.c45 int n; in hci_read_local_version_information() local
47 n = sizeof(rp); in hci_read_local_version_information()
79 int n; in hci_read_local_supported_commands() local
82 n = sizeof(rp); in hci_read_local_supported_commands()
95 for (n = 0; n < sizeof(rp.features); n++) { in hci_read_local_supported_commands()
111 int n; in hci_read_local_supported_features() local
114 n = sizeof(rp); in hci_read_local_supported_features()
127 for (n = 0; n < sizeof(rp.features); n++) in hci_read_local_supported_features()
140 int n; in hci_read_buffer_size() local
171 int n; in hci_read_country_code() local
[all …]
H A Dadv_data.c50 int n=0; in dump_adv_data() local
52 for (n = 0; n < len+1; n++) { in dump_adv_data()
60 int n=0; in print_adv_data() local
61 while(n < len) in print_adv_data()
67 ++n; in print_adv_data()
75 &advdata[n], in print_adv_data()
85 &advdata[n], in print_adv_data()
95 &advdata[n], in print_adv_data()
105 &advdata[n], in print_adv_data()
163 advdata[n]|advdata[n+1]<<8)); in print_adv_data()
[all …]
/freebsd/lib/libutil/
H A Dproperty.c46 properties n; in property_alloc() local
53 free(n); in property_alloc()
57 n->name = NULL; in property_alloc()
61 free(n); in property_alloc()
66 return (n); in property_alloc()
123 n = 0; in properties_read()
144 v = n = 0; in properties_read()
151 v = n = 0; in properties_read()
172 v = n = 0; in properties_read()
191 n = v = 0; in properties_read()
[all …]
/freebsd/lib/msun/src/
H A De_jnf.c32 jnf(int n, float x) in jnf() argument
45 if(n<0){ in jnf()
46 n = -n; in jnf()
56 else if((float)n<=x) { in jnf()
60 for(i=1;i<n;i++){ in jnf()
112 w = (n+n)/(float)x; h = (float)2.0/(float)x; in jnf()
120 m = n+n; in jnf()
132 tmp = n; in jnf()
170 ynf(int n, float x) in ynf() argument
182 if(n<0){ in ynf()
[all …]
H A Ds_scalbnl.c24 if (n > 16383) { in scalbnl()
26 n -= 16383; in scalbnl()
27 if (n > 16383) { in scalbnl()
29 n -= 16383; in scalbnl()
30 if (n > 16383) in scalbnl()
31 n = 16383; in scalbnl()
35 n += 16382 - 113; in scalbnl()
36 if (n < -16382) { in scalbnl()
38 n += 16382 - 113; in scalbnl()
39 if (n < -16382) in scalbnl()
[all …]
H A Ds_scalbnf.c17 if (n > 127) { in scalbnf()
19 n -= 127; in scalbnf()
20 if (n > 127) { in scalbnf()
22 n -= 127; in scalbnf()
23 if (n > 127) in scalbnf()
24 n = 127; in scalbnf()
28 n += 126 - 24; in scalbnf()
29 if (n < -126) { in scalbnf()
31 n += 126 - 24; in scalbnf()
32 if (n < -126) in scalbnf()
[all …]
/freebsd/lib/libc/regex/
H A Dregexec.c95 #define SET0(v, n) ((v) &= ~((unsigned long)1 << (n))) argument
96 #define SET1(v, n) ((v) |= (unsigned long)1 << (n)) argument
97 #define ISSET(v, n) (((v) & ((unsigned long)1 << (n))) != 0) argument
105 #define INIT(o, n) ((o) = (unsigned long)1 << (n)) argument
147 #define SET0(v, n) ((v)[n] = 0) argument
148 #define SET1(v, n) ((v)[n] = 1) argument
149 #define ISSET(v, n) ((v)[n]) argument
159 #define INIT(o, n) ((o) = (n)) argument
164 #define FWD(dst, src, n) ((dst)[here+(n)] |= (src)[here]) argument
165 #define BACK(dst, src, n) ((dst)[here-(n)] |= (src)[here]) argument
[all …]
/freebsd/crypto/openssl/test/
H A Dssl_test.tmpl34 $OUT .= "\n[$testname-server2]\n";
41 $OUT .= "\n[$testname-resume-server]\n";
55 $OUT .= "\n[$testname-resume-client]\n";
70 $OUT .= "server = $testname-server-extra\n";
75 $OUT .= "server2 = $testname-server-extra\n";
83 $OUT .= "client = $testname-client-extra\n";
92 $OUT .= "\n[$testname-server-extra]\n";
99 $OUT .= "\n[$testname-server2-extra]\n";
106 $OUT .= "\n[$testname-resume-server-extra]\n";
113 $OUT .= "\n[$testname-client-extra]\n";
[all …]
H A Dbftest.c299 BF_set_key(&key, strlen(bf_key[n]), (unsigned char *)bf_key[n]); in test_bf_ecb_raw()
377 int n, ret = 1; in test_bf_cfb64() local
387 n = 0; in test_bf_cfb64()
395 n = 0; in test_bf_cfb64()
409 int n, ret = 1; in test_bf_ofb64() local
419 n = 0; in test_bf_ofb64()
421 &n); in test_bf_ofb64()
427 n = 0; in test_bf_ofb64()
460 int n; in setup_tests() local
462 for (n = 0; n < 2; n++) { in setup_tests()
[all …]
H A Dparams_api_test.c148 static int test_param_int(int n) in test_param_int() argument
175 static int test_param_long(int n) in test_param_long() argument
202 static int test_param_uint(int n) in test_param_uint() argument
228 static int test_param_ulong(int n) in test_param_ulong() argument
255 static int test_param_int32(int n) in test_param_int32() argument
282 static int test_param_uint32(int n) in test_param_uint32() argument
309 static int test_param_int64(int n) in test_param_int64() argument
336 static int test_param_uint64(int n) in test_param_uint64() argument
363 static int test_param_size_t(int n) in test_param_size_t() argument
390 static int test_param_time_t(int n) in test_param_time_t() argument
[all …]
/freebsd/contrib/googletest/googletest/samples/
H A Dprime_tables.h45 virtual bool IsPrime(int n) const = 0;
55 bool IsPrime(int n) const override { in IsPrime() argument
56 if (n <= 1) return false; in IsPrime()
58 for (int i = 2; i * i <= n; i++) { in IsPrime()
60 if ((n % i) == 0) return false; in IsPrime()
69 for (int n = p + 1;; n++) { in GetNextPrime() local
70 if (IsPrime(n)) return n; in GetNextPrime()
87 bool IsPrime(int n) const override { in IsPrime() argument
88 return 0 <= n && n < is_prime_size_ && is_prime_[n]; in IsPrime()
92 for (int n = p + 1; n < is_prime_size_; n++) { in GetNextPrime() local
[all …]
/freebsd/sbin/routed/
H A Dinput.c174 n = rip->rip_nets; in input()
188 && n < lim && n->n_family == RIP_AF_AUTH) { in input()
244 if (n >= lim) { in input()
249 if (cc%sizeof(*n) != sizeof(struct rip)%sizeof(*n)) { in input()
274 n->n_metric = ntohl(n->n_metric); in input()
350 v12buf.n++; in input()
435 v12buf.n->n_metric = htonl(v12buf.n->n_metric); in input()
496 if (cc%sizeof(*n) != sizeof(struct rip)%sizeof(*n)) { in input()
551 if (n >= lim) { in input()
604 n->n_metric = ntohl(n->n_metric); in input()
[all …]
/freebsd/sys/kern/
H A Duipc_mbuf.c629 n = n->m_next; in m_copypacket()
800 n = m_free(n); in m_cat()
940 n->m_data + len < &n->m_dat[MLEN] && n->m_next) { in m_pullup()
943 m = n; in m_pullup()
944 n = n->m_next; in m_pullup()
967 n = m_free(n); in m_pullup()
1011 n = m_free(n); in m_copyup()
1359 bcopy(cp, mtod(n, caddr_t), n->m_len); in m_append()
1360 cp += n->m_len, remainder -= n->m_len; in m_append()
1362 m = n; in m_append()
[all …]
/freebsd/sys/dev/drm2/
H A Ddrm_linux_list.h142 pos = n, n = list_entry(n->member.next, __typeof(*n), member))
147 pos = n, n = list_entry(n->member.next, __typeof(*n), member))
217 n->next->pprev = n->pprev; in hlist_del()
218 *n->pprev = n->next; in hlist_del()
227 hlist_del(n); in hlist_del_init()
238 h->first = n; in hlist_add_head()
247 n->next = next; in hlist_add_before()
249 *(n->pprev) = n; in hlist_add_before()
257 n->next = next; in hlist_add_after()
279 for (p = (head)->first; p && ({ n = p->next; 1; }); p = n)
[all …]
/freebsd/contrib/bc/gen/
H A Dlib2.bc89 n=abs(n)$
90 for(r=1;n>1;--n)r*=n
104 n=abs(n)$
117 n=abs(n)$
131 n=abs(n)$
154 if(n<0)sqrt(n)
155 n=n$
156 if(n==0)x/n
284 return irand(x-n+1)+n
573 n=abs(n)$*8
[all …]
/freebsd/sys/dev/usb/controller/
H A Davr32dci.h59 #define AVR32_INT_EPT_INT(n) (0x00000100 << (n)) argument
60 #define AVR32_INT_DMA_INT(n) (0x01000000 << (n)) argument
63 #define AVR32_EPTRST_MASK(n) (0x00000001 << (n)) argument
84 #define _A(base,n) ((base) + (0x20*(n))) argument
85 #define AVR32_EPTCFG(n) _A(0x100, n) /* Endpoint Configuration */ argument
86 #define AVR32_EPTCFG_EPSIZE(n) ((n)-3) /* power of two */ argument
93 #define AVR32_EPTCFG_NBANK(n) (0x00000400*(n)) argument
94 #define AVR32_EPTCFG_NB_TRANS(n) (0x00001000*(n)) argument
99 #define AVR32_EPTCTL(n) _A(0x10C, n) /* Endpoint Control */ argument
118 #define AVR32_EPTSETSTA(n) _A(0x114, n) /* Endpoint Set Status */ argument
[all …]
/freebsd/lib/libfigpar/
H A Dfigpar.c54 uint32_t n; in get_config_option() local
61 for (n = 0; options[n].directive != NULL; n++) in get_config_option()
108 uint32_t n; in parse_config() local
171 for (n = 0; r != 0; n++) { in parse_config()
202 dsize = n; in parse_config()
293 for (n = 1; *p == '\\'; n++) { in parse_config()
365 n--; in parse_config()
380 vsize = n; in parse_config()
388 t = value + n; in parse_config()
399 vsize = n + x; in parse_config()
[all …]
/freebsd/sys/compat/linuxkpi/common/include/linux/
H A Dlist.h189 for (p = (head)->next, n = (p)->next; p != (head); p = n, n = (p)->next)
198 p = n, n = list_entry(n->field.next, typeof(*n), field))
211 pos = n, n = list_entry(n->member.next, typeof(*n), member))
220 p = n, n = list_entry(n->field.prev, typeof(*n), field))
231 p = n, n = (p)->prev)
370 WRITE_ONCE(*(n->pprev), n->next); in hlist_del()
372 n->next->pprev = n->pprev; in hlist_del()
381 hlist_del(n); in hlist_del_init()
403 WRITE_ONCE(*(n->pprev), n); in hlist_add_before()
415 n->next->pprev = &n->next; in hlist_add_behind()
[all …]
/freebsd/sys/contrib/openzfs/module/lua/
H A Dlzio.c28 z->n = size - 1; /* discount char being returned */ in luaZ_fill()
38 z->n = 0; in luaZ_init()
44 size_t luaZ_read (ZIO *z, void *b, size_t n) { in luaZ_read() argument
45 while (n) { in luaZ_read()
47 if (z->n == 0) { /* no bytes in buffer? */ in luaZ_read()
55 m = (n <= z->n) ? n : z->n; /* min. between n and z->n */ in luaZ_read()
57 z->n -= m; in luaZ_read()
60 n -= m; in luaZ_read()
67 if (n > buff->buffsize) { in luaZ_openspace()
68 if (n < LUA_MINBUFFER) n = LUA_MINBUFFER; in luaZ_openspace()
[all …]
/freebsd/sys/arm/broadcom/bcm2835/
H A Dbcm2836_mp.c62 #define MBOXINTRCTRL_CORE(n) (0x00000050 + (0x04 * (n))) argument
63 #define MBOX0SET_CORE(n) (0x00000080 + (0x10 * (n))) argument
64 #define MBOX1SET_CORE(n) (0x00000084 + (0x10 * (n))) argument
65 #define MBOX2SET_CORE(n) (0x00000088 + (0x10 * (n))) argument
66 #define MBOX3SET_CORE(n) (0x0000008C + (0x10 * (n))) argument
67 #define MBOX0CLR_CORE(n) (0x000000C0 + (0x10 * (n))) argument
68 #define MBOX1CLR_CORE(n) (0x000000C4 + (0x10 * (n))) argument
69 #define MBOX2CLR_CORE(n) (0x000000C8 + (0x10 * (n))) argument
70 #define MBOX3CLR_CORE(n) (0x000000CC + (0x10 * (n))) argument
/freebsd/contrib/arm-optimized-routines/string/test/
H A Dstrncmp.c109 int n; in main() local
117 for (n = 2; n < 100; n++) in main()
119 test (funtab + i, d, s, n, -1, n, 0); in main()
120 test (funtab + i, d, s, n, n / 2, n, 1); in main()
121 test (funtab + i, d, s, n / 2, -1, n, 0); in main()
122 test (funtab + i, d, s, n / 2, n / 2, n, -1); in main()
124 for (; n < LEN; n *= 2) in main()
126 test (funtab + i, d, s, n, -1, n, 0); in main()
127 test (funtab + i, d, s, n, n / 2, n, -1); in main()
128 test (funtab + i, d, s, n / 2, -1, n, 0); in main()
[all …]

12345678910>>...286