| /src/sys/dev/raidframe/ |
| rf_stripelocks.c | 128 /* Determines if a candidate lock request conflicts with a predecessor
133 * a candidate read conflicts with a predecessor write if any
136 * a candidate write conflicts with a predecessor read if any
139 * a candidate write conflicts with a predecessor write if any
386 RF_LockReqDesc_t *candidate, *candidate_t, *predecessor; local
517 for (predecessor = lockDesc->granted; predecessor;
518 predecessor = predecessor->next) {
520 predecessor)) {
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| typed-splay-tree.h | 42 value_type predecessor (key_type k);
141 /* Return the immediate predecessor of KEY, or NULL if there is no
142 predecessor. KEY need not be present in the tree. */
146 typed_splay_tree<KEY_TYPE, VALUE_TYPE>::predecessor (key_type key) function in class:typed_splay_tree
586 /* Return the immediate predecessor KEY, or NULL if there is no
587 predecessor. KEY need not be present in the tree. */
597 /* If the tree is empty, there is certainly no predecessor. */
602 itself, its predecessor, or its successor at the root. */
606 /* If the predecessor is at the root, just return it. */
635 itself, its predecessor, or its successor at the root. *
[all...] |
| cfgrtl.cc | 1947 /* For non-fallthru edges, we must adjust the predecessor's
2046 one predecessor, insert there. Except for the exit block. */
2068 Don't do this if the predecessor ends in a jump other than
4317 edge e, predecessor = NULL;
4325 if (predecessor == NULL)
4326 predecessor = e;
4339 forwarder = split_edge (predecessor);
4295 edge e, predecessor = NULL; local
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| typed-splay-tree.h | 42 value_type predecessor (key_type k);
141 /* Return the immediate predecessor of KEY, or NULL if there is no
142 predecessor. KEY need not be present in the tree. */
146 typed_splay_tree<KEY_TYPE, VALUE_TYPE>::predecessor (key_type key) function in class:typed_splay_tree
586 /* Return the immediate predecessor KEY, or NULL if there is no
587 predecessor. KEY need not be present in the tree. */
597 /* If the tree is empty, there is certainly no predecessor. */
602 itself, its predecessor, or its successor at the root. */
606 /* If the predecessor is at the root, just return it. */
635 itself, its predecessor, or its successor at the root. *
[all...] |
| cfgrtl.cc | 1948 /* For non-fallthru edges, we must adjust the predecessor's
2032 one predecessor, insert there. Except for the exit block. */
2054 Don't do this if the predecessor ends in a jump other than
4259 edge e, predecessor = NULL;
4267 if (predecessor == NULL)
4268 predecessor = e;
4281 forwarder = split_edge (predecessor);
4237 edge e, predecessor = NULL; local
|
| /src/external/mpl/bind/dist/bin/dnssec/ |
| dnssec-keyfromlabel.c | 118 const char *predecessor = NULL; local
328 predecessor = isc_commandline_argument;
366 if (predecessor == NULL) {
503 ret = dst_key_fromnamedfile(predecessor, directory,
507 fatal("Invalid keyfile %s: %s", predecessor,
511 fatal("%s is not a private key", predecessor);
|
| dnssec-keygen.c | 86 const char *predecessor; member in struct:keygen_ctx
278 if (ctx->predecessor == NULL) {
440 ret = dst_key_fromnamedfile(ctx->predecessor, ctx->directory,
445 fatal("Invalid keyfile %s: %s", ctx->predecessor,
449 fatal("%s is not a private key", ctx->predecessor);
666 * For a new key without an explicit predecessor, publish
671 * predecessor's inactivation date. Publish is set to 30
674 * an error; the inactivation date of the predecessor key
812 if (ctx->predecessor != NULL && prevkey != NULL) {
820 fatal("failed to update predecessor %s: %s\n", keystr
[all...] |
| dnssec-settime.c | 197 const char *predecessor = NULL; local
512 predecessor = isc_commandline_argument;
569 if (predecessor != NULL) {
583 result = dst_key_fromnamedfile(predecessor, directory, options,
602 fatal("Predecessor has incompatible format "
609 fatal("Predecessor has no activation date. "
617 fatal("Predecessor has no inactivation date. "
626 fatal("Time until predecessor inactivation is\n\t"
629 "predecessor inactivation date, or use the -i "
637 "%s: warning: Predecessor has no
[all...] |
| /src/external/mpl/bind/dist/tests/dns/ |
| qp_test.c | 627 const char *predecessor; member in struct:check_predecessors
647 * normalize the expected predecessor name, in
654 dns_test_namefromstring(check[i].predecessor, &fn3);
669 * the predecessor.
678 * already be pointed at the predecessor node.
686 fprintf(stderr, "... expected predecessor %s got %s\n",
|
| /src/external/mpl/bind/dist/lib/dns/ |
| rbt.c | 1071 * this case is handled here, because the predecessor
1086 * needs to be pointed at the DNSSEC predecessor of
1096 * predecessor.
1158 * necessarily the predecessor. If the stop
1160 * predecessor is at the end of a level below
1167 * the predecessor is handily encapsulated
1173 * no predecessor?
1190 * predecessor.
1207 * There is no predecessor.
2486 dns_rbtnode_t *current, *previous, *predecessor; local
[all...] |
| qpcache.c | 1503 dns_name_t *predecessor = NULL, *fname = NULL; local
1530 predecessor = dns_fixedname_initname(&fpredecessor);
1535 * Extract predecessor from iterator.
1537 result = dns_qpiter_current(&iter, predecessor, NULL, NULL);
1543 * Lookup the predecessor in the main tree.
1546 result = dns_qp_getname(search->qpdb->tree, predecessor, (void **)&node,
|
| /src/external/mpl/dhcp/bind/dist/lib/dns/ |
| rbt.c | 1902 * this case is handled here, because the predecessor
1917 * needs to be pointed at the DNSSEC predecessor of
1927 * predecessor.
1989 * necessarily the predecessor. If the stop
1991 * predecessor is at the end of a level below
1998 * the predecessor is handily encapsulated
2004 * no predecessor?
2021 * predecessor.
2038 * There is no predecessor.
3361 dns_rbtnode_t *current, *previous, *predecessor; local
[all...] |
