Searched refs:chain (Results 76 - 100 of 148) sorted by relevance

123456

/freebsd-9.3-release/sys/dev/cx/
H A Dcxddk.h386 int chain, int rev, int osc, int mod, int rev2, int osc2, int mod2);
390 int chain);
/freebsd-9.3-release/sys/netgraph/
H A Dng_etf.c158 struct filterhead *chain = etfp->hashtable + HASH(ethertype); local
162 LIST_FOREACH(fil, chain, next) {
/freebsd-9.3-release/sys/netipsec/
H A Dipsec.h80 LIST_ENTRY(secpolicy) chain; member in struct:secpolicy
119 /* If NULL, it means the end of chain. */
154 LIST_ENTRY(secspacq) chain; member in struct:secspacq
/freebsd-9.3-release/sys/dev/mpr/
H A Dmpr.c126 /* Rate limit chain-fail messages to 1 per minute */
1186 struct mpr_chain *chain; local
1225 device_printf(sc->mpr_dev, "Cannot allocate chain DMA tag\n");
1230 device_printf(sc->mpr_dev, "Cannot allocate chain memory\n");
1269 chain = &sc->chains[i];
1270 chain->chain = (MPI2_SGE_IO_UNION *)(sc->chain_frames +
1272 chain->chain_busaddr = sc->chain_busaddr +
1274 mpr_free_chain(sc, chain);
1467 &sc->chain_free, 0, "number of free chain element
2175 struct mpr_chain *chain; local
[all...]
/freebsd-9.3-release/contrib/gcc/cp/
H A Dname-lookup.c64 /* Compute the chain index of a binding_entry given the HASH value of its
84 free_binding_entry = entry->chain;
91 entry->chain = NULL;
103 entry->chain = free_binding_entry;
113 binding_entry * GTY((length ("%h.chain_count"))) chain;
116 the member "chain" considered as an array. */
130 table->chain = GGC_CNEWVEC (binding_entry, table->chain_count);
146 binding_entry temp = table->chain[i];
150 temp = entry->chain;
153 table->chain[
[all...]
H A Dname-lookup.h37 binding_entry chain; local
70 /* Link to chain together various bindings for this name. */
181 /* A chain of _DECL nodes for all variables, constants, functions,
187 /* Count of elements in names chain. */
190 /* A chain of NAMESPACE_DECL nodes. */
196 /* A chain of VTABLE_DECL nodes. */
223 a chain of BLOCK nodes for all the levels
H A Dpt.c317 chain, and ending at the beginning, since template parms are listed
1662 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
4470 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
7490 tree purpose, value, chain;
7509 chain = TREE_CHAIN (t);
7510 if (chain && chain != void_type_node)
7512 chain = tsubst (chain, args, complain, in_decl);
7513 if (chain
7489 tree purpose, value, chain; local
8329 tree purpose, value, chain; local
8453 tree purpose, value, chain; local
9282 tree purpose, value, chain; local
[all...]
/freebsd-9.3-release/contrib/bind9/lib/dns/
H A Drbtdb.c473 dns_rbtnodechain_t chain; member in struct:__anon199
619 dns_rbtnodechain_t chain; member in struct:rbtdb_dbiterator
2048 * Do we have a valid NSEC/NSEC3 chain?
2947 activeempty(rbtdb_search_t *search, dns_rbtnodechain_t *chain, argument
2969 result = dns_rbtnodechain_next(chain, NULL, NULL);
2972 result = dns_rbtnodechain_current(chain, &prefix,
2989 result = dns_rbtnodechain_next(chain, NULL, NULL);
3011 dns_rbtnodechain_t chain; local
3033 * Use our own copy of the chain.
3036 chain
3632 dns_rbtnodechain_t chain; local
[all...]
/freebsd-9.3-release/sys/dev/mps/
H A Dmps.c1159 struct mps_chain *chain; local
1198 device_printf(sc->mps_dev, "Cannot allocate chain DMA tag\n");
1203 device_printf(sc->mps_dev, "Cannot allocate chain memory\n");
1243 chain = &sc->chains[i];
1244 chain->chain = (MPI2_SGE_IO_UNION *)(sc->chain_frames +
1246 chain->chain_busaddr = sc->chain_busaddr +
1248 mps_free_chain(sc, chain);
1436 &sc->chain_free, 0, "number of free chain elements");
1440 &sc->chain_free_lowwater, 0,"lowest number of free chain element
2133 struct mps_chain *chain; local
[all...]
/freebsd-9.3-release/contrib/gcc/
H A Ddf-scan.c602 /* Link REF at the front of reg_use or reg_def chain for REGNO. */
613 /* We cannot actually link to the head of the chain. */
621 /* Remove REF from the CHAIN. Return the head of the chain. This
622 will be CHAIN unless the REF was at the beginning of the chain. */ argument
625 df_ref_unlink (struct df_ref *chain, struct df_ref *ref)
627 struct df_ref *orig_chain = chain;
629 while (chain)
631 if (chain == ref)
641 chain = ref->next_ref;
643 return chain;
[all...]
H A Ddf-problems.c64 /* Create a du or ud chain from SRC to DST and link it into SRC. */
79 /* Delete a du or ud chain for REF. If LINK is NULL, delete all
87 struct df_link *chain = DF_REF_CHAIN (ref);
90 /* Link was the first element in the chain. */
91 if (chain == link)
95 /* Link is an internal element in the chain. */
96 struct df_link *prev = chain;
97 while (chain)
99 if (chain == link)
101 prev->next = chain
86 struct df_link *chain = DF_REF_CHAIN (ref); local
[all...]
H A Ddf.h257 struct df_ref *defs; /* Head of insn-def chain. */
258 struct df_ref *uses; /* Head of insn-use chain. */
271 struct df_ref *reg_chain; /* Head of reg-use or def chain. */
289 struct df_link *chain; /* Head of def-use, use-def. */ member in struct:df_ref
419 #define DF_REF_CHAIN(REF) ((REF)->chain)
/freebsd-9.3-release/sys/dev/patm/
H A Dif_patm.c289 if (sc->vccs[i]->chain != NULL) {
290 m_freem(sc->vccs[i]->chain);
291 sc->vccs[i]->chain = NULL;
/freebsd-9.3-release/contrib/gdb/gdb/
H A Dsymtab.h117 /* for opaque typedef struct chain */
119 struct symbol *chain; member in union:general_symbol_info::__anon1447
172 #define SYMBOL_VALUE_CHAIN(symbol) (symbol)->ginfo.value.chain
H A Dutils.c178 and return the previous chain pointer
359 /* Set the cleanup_chain to 0, and return the old cleanup chain. */
381 /* Restore the cleanup chain from a previously saved chain. */
383 restore_cleanups (struct cleanup *chain)
385 restore_my_cleanups (&cleanup_chain, chain);
389 restore_final_cleanups (struct cleanup *chain)
391 restore_my_cleanups (&final_cleanup_chain, chain);
395 restore_my_cleanups (struct cleanup **pmy_chain, struct cleanup *chain)
397 *pmy_chain = chain;
382 restore_cleanups(struct cleanup *chain) argument
388 restore_final_cleanups(struct cleanup *chain) argument
394 restore_my_cleanups(struct cleanup **pmy_chain, struct cleanup *chain) argument
[all...]
/freebsd-9.3-release/crypto/heimdal/lib/hx509/
H A Dhxtool.c709 hx509_certs chain; member in struct:verify
720 ret = hx509_verify_path(hxcontext, v->ctx, c, v->chain);
744 hx509_certs anchors, chain, certs; local
757 ret = hx509_certs_init(context, "MEMORY:chain", 0, NULL, &chain);
792 if (strncmp(s, "chain:", 6) == 0) {
795 ret = hx509_certs_append(context, chain, NULL, s);
797 hx509_err(context, 1, ret, "hx509_certs_append: chain: %s: %d", s, ret);
837 v.chain = chain;
[all...]
/freebsd-9.3-release/crypto/openssl/crypto/x509/
H A Dx509_vfy.h112 certificate chain.
178 * validation. Once we have a certificate chain, the 'verify' function is
179 * then called to actually check the cert chain.
197 /* Check revocation status of chain */
226 * cert chain can take some time (and have to be 'retried', this needs to be
236 /* chain of X509s - untrusted - passed in */
252 /* Check revocation status of chain */
263 /* if 0, rebuild chain */
267 /* chain of X509s - built up and trusted */
268 STACK_OF(X509) *chain; member in struct:x509_store_ctx_st
[all...]
/freebsd-9.3-release/crypto/openssl/ssl/
H A Ds3_both.c328 /* TLSv1 sends a chain with nothing in it, instead of an alert */
348 for (i = 0; i < sk_X509_num(xs_ctx.chain); i++) {
349 x = sk_X509_value(xs_ctx.chain, i);
/freebsd-9.3-release/contrib/texinfo/info/
H A Dwindow.c96 after deleting the window from our chain of windows. If DELETER is NULL,
176 /* Change the height of each window in the chain by delta_each. Change
177 the height of the last window in the chain by delta_each and by the
197 /* If this is not the first window in the chain, then change the
205 /* The last window in the chain gets the extra space (or shrinkage). */
276 chain cannot start at window->height, since that is where the modeline
374 the previous and next windows in the chain. If there is only one user
386 /* Find this window in our chain. */
547 /* Readjust the first_row of every window in the chain. */
610 active window, make the next window in the chain b
684 window_mark_chain(WINDOW *chain, int flag) argument
694 window_unmark_chain(WINDOW *chain, int flag) argument
[all...]
/freebsd-9.3-release/sys/dev/ata/
H A Datapi-cam.c87 TAILQ_ENTRY(atapi_hcb) chain;
640 TAILQ_INSERT_TAIL(&softc->pending_hcbs, hcb, chain);
857 TAILQ_REMOVE(&hcb->softc->pending_hcbs, hcb, chain);
870 TAILQ_FOREACH_SAFE(hcb, &scp->pending_hcbs, chain, thcb) {
/freebsd-9.3-release/contrib/ntp/sntp/libevent/include/event2/
H A Dbuffer.h65 the chain.
122 void *chain; member in struct:evbuffer_ptr::__anon182
237 Returns the number of contiguous available bytes in the first buffer chain.
240 chains, or that might all be in the first chain. Calls to
246 in the first buffer chain.
265 Reserves space in the last chain or chains of an evbuffer.
267 Makes space available in the last chain or chains of an evbuffer that can
1060 all data will fit into a single chain. Can be used in lieu of functionality
/freebsd-9.3-release/sys/netinet6/
H A Dnd6_nbr.c639 struct mbuf *chain = NULL; local
923 nd6_output_lle(ifp, ifp, m_hold, L3_ADDR_SIN6(ln), NULL, ln, &chain);
928 if (chain)
932 if (chain)
933 nd6_output_flush(ifp, ifp, chain, &sin6, NULL);
/freebsd-9.3-release/sys/netinet/
H A Dsctp_pcb.c1959 /* Find the head of the ALLADDR chain */
2034 * endpoint call. Since in reality this chain is used from the
4503 struct sctpvtaghead *chain; local
4508 chain = &SCTP_BASE_INFO(vtag_timewait)[(tag % SCTP_STACK_VTAG_HASH_SIZE)];
4509 LIST_FOREACH(twait_block, chain, sctp_nxt_tagblock) {
4530 struct sctpvtaghead *chain; local
4536 chain = &SCTP_BASE_INFO(vtag_timewait)[(tag % SCTP_STACK_VTAG_HASH_SIZE)];
4537 LIST_FOREACH(twait_block, chain, sctp_nxt_tagblock) {
4557 struct sctpvtaghead *chain; local
4567 chain
5926 struct sctpvtaghead *chain; local
6708 struct sctpvtaghead *chain; local
[all...]
/freebsd-9.3-release/contrib/binutils/bfd/
H A Dbout.c896 arelent_chain *chain = section->constructor_chain;
900 *relptr++ = &chain->relent;
901 chain = chain->next;
895 arelent_chain *chain = section->constructor_chain; local
/freebsd-9.3-release/contrib/llvm/include/llvm/Target/
H A DTargetLowering.h194 /// Return true if pow2 div is cheaper than a chain of srl/add/sra.
1757 /// Returns a pair of (return value, chain).
1914 /// return the resulting token chain value.
1976 CallLoweringInfo(SDValue chain, Type *retTy,
1980 : Chain(chain), RetTy(retTy), RetSExt(cs.paramHasAttr(0, Attribute::SExt)),
1991 CallLoweringInfo(SDValue chain, Type *retTy, bool retSExt, bool retZExt,
1996 : Chain(chain), RetTy(retTy), RetSExt(retSExt), RetZExt(retZExt),
2006 /// outgoing token chain. It calls LowerCall to do the actual lowering.
2013 /// return values from the call, and return the resulting token chain value.
2037 /// return the resulting token chain valu
[all...]

Completed in 406 milliseconds

123456