HomeSort by: relevance | last modified time | path
    Searched refs:peers (Results 1 - 25 of 65) sorted by relevancy

1 2 3

  /src/external/ibm-public/postfix/dist/src/qmgr/
qmgr.h 52 #define QMGR_LIST_ROTATE(head, object, peers) { \
53 head.next->peers.prev = head.prev; \
54 head.prev->peers.next = head.next; \
55 head.next = object->peers.next; \
56 head.next->peers.prev = 0; \
58 object->peers.next = 0; \
61 #define QMGR_LIST_UNLINK(head, type, object, peers) { \
62 type _next = object->peers.next; \
63 type _prev = object->peers.prev; \
64 if (_prev) _prev->peers.next = _next;
204 QMGR_TRANSPORT_LIST peers; \/* linkage *\/ member in struct:QMGR_TRANSPORT
252 QMGR_QUEUE_LIST peers; \/* neighbor queues *\/ member in struct:QMGR_QUEUE
441 QMGR_PEER_LIST peers; \/* neighbor linkage *\/ member in struct:QMGR_PEER
    [all...]
qmgr_enable.c 73 for (xport = qmgr_transport_list.next; xport; xport = xport->peers.next)
93 next = queue->peers.next;
qmgr_peer.c 7 /* per-job peers
30 /* These routines add/delete/manipulate per-job peers.
52 /* round-robin search among job's peers.
87 QMGR_LIST_APPEND(job->peer_list, peer, peers);
110 QMGR_LIST_UNLINK(job->peer_list, QMGR_PEER *, peer, peers);
144 for (peer = job->peer_list.next; peer; peer = peer->peers.next) {
147 QMGR_LIST_ROTATE(job->peer_list, peer, peers);
qmgr_defer.c 103 next = queue->peers.next;
qmgr_transport.c 323 for (xport = qmgr_transport_list.next; xport; xport = xport->peers.next) {
329 for (queue = xport->queue_list.next; queue; queue = queue->peers.next) {
334 QMGR_LIST_ROTATE(qmgr_transport_list, xport, peers);
493 QMGR_LIST_PREPEND(qmgr_transport_list, transport, peers);
  /src/external/ibm-public/postfix/dist/src/oqmgr/
qmgr.h 49 head.next->peers.prev = head.prev; \
50 head.prev->peers.next = head.next; \
51 head.next = object->peers.next; \
52 if (object->peers.next) \
53 head.next->peers.prev = 0; \
55 object->peers.next = 0; \
59 type next = object->peers.next; \
60 type prev = object->peers.prev; \
61 if (prev) prev->peers.next = next; \
63 if (next) next->peers.prev = prev;
163 QMGR_TRANSPORT_LIST peers; \/* linkage *\/ member in struct:QMGR_TRANSPORT
213 QMGR_QUEUE_LIST peers; \/* neighbor queues *\/ member in struct:QMGR_QUEUE
269 QMGR_ENTRY_LIST peers; \/* neighbor entries *\/ member in struct:QMGR_ENTRY
    [all...]
qmgr_enable.c 73 for (xport = qmgr_transport_list.next; xport; xport = xport->peers.next)
93 next = queue->peers.next;
qmgr_defer.c 98 next = queue->peers.next;
133 next = entry->peers.next;
qmgr_entry.c 371 else if (queue->peers.next != queue->peers.prev)
qmgr_transport.c 318 for (xport = qmgr_transport_list.next; xport; xport = xport->peers.next) {
324 for (queue = xport->queue_list.next; queue; queue = queue->peers.next) {
  /src/etc/rc.d/
ppp 27 # /etc/ppp/peers and $ppp_peers contain boot configuration
29 # file in /etc/ppp/peers of the same name, will be run as
38 if [ -f /etc/ppp/peers/$peer ]; then
  /src/external/bsd/ntp/dist/scripts/ntpsweep/
ntpsweep-opts.def 29 name = peers;
31 descrip = 'Recursively list all peers a host synchronizes to';
38 descrip = 'Traverse peers up to this level (4 is a reasonable number)';
64 all peers.
ntpsweep.in 44 ($opts->{peers}, $opts->{maxlevel}, $opts->{strip});
106 my @peers;
146 push @peers, $_->{remote};
162 $known_host_peers{$host} = [@peers];
171 # append number of peers in brackets if requested and valid
180 # Loop through peers
  /src/external/mpl/bind/dist/lib/dns/include/dns/
peer.h 24 * Data structures for peers (e.g. a 'server' config file statement)
66 dns_peerlist_addpeer(dns_peerlist_t *peers, dns_peer_t *peer);
71 dns_peerlist_peerbyaddr(dns_peerlist_t *peers, const isc_netaddr_t *addr,
78 dns_peerlist_currpeer(dns_peerlist_t *peers, dns_peer_t **retval);
  /src/usr.sbin/ldpd/
ldp_peer.h 75 SLIST_ENTRY(ldp_peer) peers; member in struct:ldp_peer
84 /* LDP Peers States */
ldp_peer.c 166 SLIST_INSERT_HEAD(&ldp_peer_head, p, peers);
235 SLIST_FOREACH(p, &ldp_peer_head, peers) {
251 SLIST_REMOVE(&ldp_peer_head, p, ldp_peer, peers);
265 SLIST_FOREACH(p, &ldp_peer_head, peers) {
284 SLIST_FOREACH(p, &ldp_peer_head, peers)
296 SLIST_FOREACH(p, &ldp_peer_head, peers)
  /src/external/bsd/wpa/dist/wpa_supplicant/
ibss_rsn.h 49 struct ibss_rsn_peer *peers; member in struct:ibss_rsn
ibss_rsn.c 32 for (peer = ibss_rsn->peers; peer; peer = peer->next)
377 for (peer = ibss_rsn->peers; peer; peer = peer->next) {
568 peer->next = ibss_rsn->peers;
569 ibss_rsn->peers = peer;
659 /* remove all peers */
660 wpa_printf(MSG_DEBUG, "%s: Remove all peers", __func__);
661 peer = ibss_rsn->peers;
666 ibss_rsn->peers = peer;
673 for (prev = NULL, peer = ibss_rsn->peers; peer != NULL;
677 ibss_rsn->peers = peer->next
    [all...]
  /src/external/mpl/bind/dist/lib/dns/
peer.c 177 dns_peerlist_addpeer(dns_peerlist_t *peers, dns_peer_t *peer) {
185 for (p = ISC_LIST_HEAD(peers->elements); p != NULL;
194 ISC_LIST_INSERTBEFORE(peers->elements, p, peer, next);
196 ISC_LIST_APPEND(peers->elements, peer, next);
231 dns_peerlist_currpeer(dns_peerlist_t *peers, dns_peer_t **retval) {
234 p = ISC_LIST_TAIL(peers->elements);
  /src/external/mpl/dhcp/bind/dist/lib/dns/include/dns/
peer.h 25 * Data structures for peers (e.g. a 'server' config file statement)
117 dns_peerlist_addpeer(dns_peerlist_t *peers, dns_peer_t *peer);
122 dns_peerlist_peerbyaddr(dns_peerlist_t *peers, const isc_netaddr_t *addr,
129 dns_peerlist_currpeer(dns_peerlist_t *peers, dns_peer_t **retval);
  /src/external/bsd/ntp/dist/ntpd/
ntp_proto.c 91 * flag bits propagated from pool/manycast to individual peers
160 int peer_ntpdate; /* active peers in ntpdate mode */
539 * If preemptible and we have more peers than maxclock,
567 * set and all peers have completed the burst,
2995 * Clock was stepped. Flush all time values of all peers.
3541 static peer_select *peers = NULL; local
3567 peers_size = ALIGNED_SIZE(nlist * sizeof(*peers));
3571 peers = INC_ALIGNED_PTR(endpoint, endpoint_size);
3572 indx = INC_ALIGNED_PTR(peers, peers_size);
3575 * Initially, we populate the island with all the rifraff peers
    [all...]
  /src/external/bsd/tmux/dist/
proc.c 51 TAILQ_HEAD(, tmuxpeer) peers;
203 TAILQ_INIT(&tp->peers);
223 TAILQ_FOREACH(peer, &tp->peers, entry)
321 TAILQ_INSERT_TAIL(&tp->peers, peer, entry);
330 TAILQ_REMOVE(&peer->parent->peers, peer, entry);
  /src/external/bsd/wpa/dist/wpa_supplicant/wpa_gui-qt4/
wpagui.cpp 130 peers = NULL;
209 if (peers) {
210 peers->close();
211 delete peers;
212 peers = NULL;
953 if (peers)
954 peers->event_notify(wm);
1603 if (peers) {
1604 peers->close();
1605 delete peers;
    [all...]
  /src/external/bsd/wpa/dist/src/wps/
wps_upnp_i.h 112 struct dl_list peers; /* active UPnP peer sessions */ member in struct:upnp_wps_device_interface
  /src/external/bsd/ntp/dist/scripts/
plot_summary-opts.def 50 descrip = 'Peers to generate plots for';
53 specify list of peers if you want to generate plots for them.

Completed in 29 milliseconds

1 2 3