Searched refs:link (Results 76 - 100 of 993) sorted by relevance

1234567891011>>

/freebsd-11.0-release/sys/contrib/ngatm/netnatm/saal/
H A Dsscfupriv.h45 sscfu_sigq_link_t link; /* link to next signal */ member in struct:sscfu_sig
/freebsd-11.0-release/sys/ddb/
H A Ddb_break.h53 struct db_breakpoint *link; /* link in in-use or free chain */ member in struct:db_breakpoint
/freebsd-11.0-release/usr.sbin/ppp/
H A Dmp.h42 #define MP_LINKSENT 0 /* We attached the link to another ppp */
44 #define MP_ADDED 2 /* We've added the link to our MP */
73 struct link link; member in struct:mp
86 int link; /* Next link to send on */ member in struct:mp::__anon14081
103 int period; /* link->throughput sample period */
114 unsigned bandwidth; /* Our link bandwidth (or zero) */
136 extern struct mbuf *mp_Input(struct bundle *, struct link *, struct mbuf *);
H A Dnetgraph.c65 #include "link.h"
255 log_Printf(LogTIMER, "%s: fdunset(ctrl) %d\n", p->link.name, dev->cs);
364 log_Printf(LogTIMER, "%s(ctrl): fdset(r) %d\n", p->link.name, dev->cs);
497 p->link.name, devp);
504 " [nodetype:nodename]\n", p->link.name);
511 log_Printf(LogDEBUG, "%s: Got hook \"%s\"\n", p->link.name, hook);
515 " hook\n", p->link.name);
520 " pos %d\n", p->link.name, devp - p->link.name - 1);
532 log_Printf(LogDEBUG, "%s: Got node \"%s\"\n", p->link
[all...]
H A Dtty.c64 #include "link.h"
133 "using ``set cd off''\n", p->link.name);
144 log_Printf(LogPHASE, "%s: %s: CD detected\n", p->link.name, p->name.full);
148 p->link.name, p->name.full);
151 p->link.name, p->name.full);
159 p->link.name, p->name.full, dev->carrier_seconds,
167 log_Printf(LogDEBUG, "%s: offline -> online\n", p->link.name);
169 log_Printf(LogDEBUG, "%s: online -> offline\n", p->link.name);
170 log_Printf(LogPHASE, "%s: Carrier lost\n", p->link.name);
175 log_Printf(LogDEBUG, "%s: Still %sline\n", p->link
[all...]
/freebsd-11.0-release/contrib/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_deadlock_detector2.cc81 Link link[kMaxLink]; member in struct:__sanitizer::Mutex
236 Link *link = &mtx1->link[li]; local
237 if (link->id == m->id) {
238 if (link->seq != mtx->seq) {
239 link->seq = mtx->seq;
240 link->tid = lt->ctx;
241 link->stk0 = stk1;
242 link->stk1 = cb->Unwind();
244 VPrintf(3, "#%llu: DD::MutexBeforeLock added %d->%d link\
252 Link *link = &mtx1->link[mtx1->nlink++]; local
375 Link link = pt->pending[--npending]; local
409 Link *link = &pt->path[i]; local
[all...]
/freebsd-11.0-release/contrib/ngatm/libngatm/
H A Dsscfucust.h71 #define SIGQ_APPEND(Q,S) TAILQ_INSERT_TAIL(Q, S, link)
78 TAILQ_REMOVE(Q, _s, link); \
89 _s2 = TAILQ_NEXT(_s1, link); \
/freebsd-11.0-release/contrib/mtree/
H A Dexcludes.c60 LIST_ENTRY(exclude) link;
99 LIST_INSERT_HEAD(&excludes, e, link);
118 e = LIST_NEXT(e, link);
/freebsd-11.0-release/contrib/ncurses/form/
H A Dfld_link.c67 New_Field->link = field->link;
68 field->link = New_Field;
/freebsd-11.0-release/usr.sbin/fmtree/
H A Dexcludes.c51 LIST_ENTRY(exclude) link;
92 LIST_INSERT_HEAD(&excludes, e, link);
105 LIST_FOREACH(e, &excludes, link) {
/freebsd-11.0-release/sys/netinet/libalias/
H A Dalias_mod.c63 TAILQ_FOREACH(b, &handler_chain, link) {
69 TAILQ_INSERT_BEFORE(b, p, link);
74 TAILQ_INSERT_TAIL(&handler_chain, p, link);
100 TAILQ_REMOVE(&handler_chain, p, link);
113 TAILQ_FOREACH(p, &handler_chain, link)
/freebsd-11.0-release/sys/fs/devfs/
H A Ddevfs_dir.c47 LIST_ENTRY(dirlistent) link;
65 LIST_FOREACH(dle, &devfs_dirlist, link) {
83 LIST_FOREACH(dle, &devfs_dirlist, link) {
112 LIST_INSERT_HEAD(&devfs_dirlist, dle_new, link);
141 LIST_REMOVE(dle, link);
/freebsd-11.0-release/sys/contrib/octeon-sdk/
H A Dcvmx-spi4000.c370 /* Update the link state before resets. It takes a while for the links to
397 cvmx_gmxx_rxx_rx_inbnd_t link; local
400 link.u64 = 0;
403 return link;
405 return link;
452 read_status = 0; /* If the link is down, force zero */
460 /* If the link is up, we need to set the speed based on the PHY status */
468 /* If the link is down, force 1Gbps so TX traffic dumps fast */
475 link.s.status = 1; /* Link up */
477 link
[all...]
/freebsd-11.0-release/usr.sbin/ngctl/
H A Ddot.c166 hlist->link[j].ourhook, hlist->link[j].ourhook);
174 hlist->link[j].ourhook);
179 if (hlist->link[j].nodeinfo.id > nlist->nodeinfo[i].id)
183 hlist->link[j].ourhook,
184 (uintmax_t)hlist->link[j].nodeinfo.id,
185 hlist->link[j].peerhook);
/freebsd-11.0-release/contrib/gcc/
H A Dhaifa-sched.c632 insn_cost (rtx insn, rtx link, rtx used)
634 return insn_cost1 (insn, used ? REG_NOTE_KIND (link) : REG_NOTE_MAX,
635 link, used);
647 insn_cost1 (rtx insn, enum reg_note dep_type, rtx link, rtx used)
683 gcc_assert (!link || dep_type == REG_NOTE_KIND (link));
704 gcc_assert (link);
706 cost = targetm.sched.adjust_cost (used, link, insn, cost);
721 rtx link;
756 for (link
629 insn_cost(rtx insn, rtx link, rtx used) argument
644 insn_cost1(rtx insn, enum reg_note dep_type, rtx link, rtx used) argument
718 rtx link; local
820 rtx link; local
940 rtx link = alloc_INSN_LIST (insn, insn_queue[next_q]); local
1144 rtx link; local
1667 rtx link; local
1799 rtx link; local
2633 rtx link; local
2944 rtx link; local
3003 rtx link; local
3159 rtx link; local
3355 process_insn_depend_be_in_spec(rtx link, rtx twin, ds_t fs) argument
3414 rtx link, twins = NULL; local
3449 rtx link, check, twin; local
3710 rtx label, check, twin, link; local
3760 rtx link; local
3970 rtx note, insn, link, jump, ready_list = 0; local
4489 rtx link; local
4509 rtx link; local
[all...]
H A Dipa-pure-const.c275 tree link; local
279 for (i=0, link = ASM_OUTPUTS (stmt); link; ++i, link = TREE_CHAIN (link))
282 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
286 check_lhs_var (local, TREE_VALUE (link));
289 for (link = ASM_INPUTS (stmt); link; link
[all...]
H A Dsched-deps.c236 type of dependence that this link represents. DS, if nonzero,
372 rtx link = *linkp;
376 if (XEXP (link, 0) == elem)
383 ds_t new_status = ds | DEP_STATUS (link);
388 || !(DEP_STATUS (link) & SPECULATIVE))
393 && (DEP_STATUS (link) & SPECULATIVE))
409 new_status = ds_merge (DEP_STATUS (link), ds);
416 /* Clear corresponding cache entry because type of the link
421 enum reg_note kind = REG_NOTE_KIND (link);
439 && DEP_STATUS (link) !
366 rtx link = *linkp; local
632 rtx link, prev_nonnote; local
676 rtx link; local
1121 rtx link; local
1479 rtx link, end_seq, r0, set; local
1632 add_forw_dep(rtx to, rtx link) argument
1682 rtx link; local
1689 rtx new = 0, link, next; local
1885 adjust_add_sorted_back_dep(rtx insn, rtx link, rtx *linkp) argument
1917 rtx link; local
[all...]
H A Dlists.c52 rtx link, prev_link; local
55 link = XEXP (prev_link, 1);
62 while (link)
69 prev_link = link;
70 link = XEXP (link, 1);
/freebsd-11.0-release/lib/librpcsec_gss/
H A Drpcsec_gss_conf.c49 SLIST_ENTRY(mech_info) link;
62 SLIST_ENTRY(qop_info) link;
220 SLIST_INSERT_HEAD(&mechs, info, link);
227 SLIST_FOREACH(info, &mechs, link) {
271 SLIST_INSERT_HEAD(&qops, info, link);
278 SLIST_FOREACH(minfo, &mechs, link) {
280 SLIST_FOREACH(info, &qops, link) {
286 SLIST_FOREACH(info, &qops, link) {
301 SLIST_FOREACH(info, &mechs, link) {
317 SLIST_FOREACH(info, &mechs, link) {
[all...]
/freebsd-11.0-release/gnu/usr.bin/grep/
H A Dkwset.c54 struct tree *llink; /* Left link; MUST be first field. */
55 struct tree *rlink; /* Right link (to larger labels). */
132 register struct tree *link; local
151 link = trie->links;
156 while (link && label != link->label)
158 links[depth] = link;
159 if (label < link->label)
160 dirs[depth++] = L, link = link
300 register struct tree *link; local
[all...]
/freebsd-11.0-release/lib/libc/gmon/
H A Dmcount.c192 toindex = ++p->tos[0].link;
201 top->link = 0;
219 if (top->link == 0) {
224 * and link it to the head of the chain.
226 toindex = ++p->tos[0].link;
233 top->link = *frompcindex;
241 top = &p->tos[top->link];
249 toindex = prevtop->link;
250 prevtop->link = top->link;
[all...]
/freebsd-11.0-release/contrib/apr-util/
H A Dapu-config.in59 --ldap-libs print library information to link with ldap
61 --dbm-libs print additional library information to link with DBM
63 --link-ld print link switch(es) for linking to APR-util
64 --link-libtool print the libtool inputs for linking to APR-util
72 APU_LIBS="\`apu-$APRUTIL_MAJOR_VERSION-config --link-libtool --libs\`"
74 APU_LIBS="\`apu-$APRUTIL_MAJOR_VERSION-config --link-ld --libs\`"
166 --link-ld)
174 --link-libtool)
/freebsd-11.0-release/contrib/netbsd-tests/bin/cp/
H A Dt_cp.sh28 FILES="file file2 file3 link dir dir2 dirlink target"
44 ln -s file link
105 atf_set "descr" "Checks the copy of a file to a symbolic link"
109 atf_check -s eq:0 -o empty -e empty cp file2 link
115 atf_set "descr" "Checks the copy of a symbolic link to a file"
119 # file and link are identical (not copied).
120 atf_check -s eq:1 -o empty -e ignore cp link file
121 atf_check -s eq:0 -o empty -e empty cp link file2
127 atf_set "descr" "Checks the copy of a file to a symbolic link" \
132 atf_check -s eq:0 -o empty -e empty cp -P file link
[all...]
/freebsd-11.0-release/sys/netgraph/atm/sscop/
H A Dng_sscop_cust.h142 #define MSGQ_FOREACH(P, Q) TAILQ_FOREACH(P, Q, link)
143 #define MSGQ_REMOVE(Q, M) TAILQ_REMOVE(Q, M, link)
144 #define MSGQ_INSERT_BEFORE(B, M) TAILQ_INSERT_BEFORE(B, M, link)
145 #define MSGQ_APPEND(Q, M) TAILQ_INSERT_TAIL(Q, M, link)
158 TAILQ_REMOVE(q, m, link); \
168 _m2 = TAILQ_NEXT(_m1, link); \
181 #define SIGQ_APPEND(Q, S) TAILQ_INSERT_TAIL(Q, S, link)
193 TAILQ_REMOVE(q, s, link); \
203 TAILQ_REMOVE(F, _s, link); \
204 TAILQ_INSERT_TAIL(T, _s, link); \
[all...]
/freebsd-11.0-release/usr.sbin/bsnmpd/modules/snmp_netgraph/
H A Dsnmp_netgraph.c80 STAILQ_ENTRY(csock_buf) link;
97 SLIST_ENTRY(msgreg) link;
110 SLIST_ENTRY(datareg) link;
129 TAILQ_ENTRY(ngtype) link;
155 SLIST_INSERT_HEAD(&msgreg_list, d, link);
168 SLIST_REMOVE(&msgreg_list, d, msgreg, link);
189 SLIST_INSERT_HEAD(&datareg_list, d, link);
202 SLIST_REMOVE(&datareg_list, d, datareg, link);
218 m1 = SLIST_NEXT(m, link);
220 SLIST_REMOVE(&msgreg_list, m, msgreg, link);
[all...]

Completed in 305 milliseconds

1234567891011>>