HomeSort by: relevance | last modified time | path
    Searched refs:last_node (Results 1 - 17 of 17) sorted by relevancy

  /src/sys/ufs/chfs/
chfs_malloc.c 222 old = cheb->last_node;
223 nref = cheb->last_node;
230 cheb->last_node = nref;
245 cheb->last_node = nref;
chfs_erase.c 116 cheb->last_node = NULL;
chfs.h 306 struct chfs_node_ref *last_node; /* last node of the block */ member in struct:chfs_eraseblock
chfs_gc.c 552 if (nref == chmp->chm_blocks[nref->nref_lnr].last_node) {
  /src/external/apache2/argon2/dist/phc-winner-argon2/src/blake2/
blake2.h 58 uint8_t last_node; member in struct:__blake2b_state
blake2b.c 51 if (S->last_node) {
  /src/external/bsd/libarchive/dist/libarchive/
archive_blake2sp_ref.c 96 S->R->last_node = 1;
97 S->S[PARALLELISM_DEGREE - 1]->last_node = 1;
119 S->R->last_node = 1;
120 S->S[PARALLELISM_DEGREE - 1]->last_node = 1;
237 S[PARALLELISM_DEGREE - 1]->last_node = 1; /* mark last node */
285 FS->last_node = 1;
archive_blake2.h 60 uint8_t last_node; member in struct:blake2s_state__
71 uint8_t last_node; member in struct:blake2b_state__
archive_blake2s_ref.c 58 if( S->last_node ) blake2s_set_lastnode( S );
  /src/external/bsd/jemalloc/dist/test/unit/
rb.c 587 node_t *last_node; member in struct:iter_ctx_s
599 if (ctx->last_node != NULL) {
601 expect_d_lt(node_cmp(ctx->last_node, node), 0,
604 expect_d_gt(node_cmp(ctx->last_node, node), 0,
608 ctx->last_node = node;
823 ctx.last_node = NULL;
836 ctx.last_node = NULL;
846 ctx.last_node = NULL;
858 ctx.last_node = NULL;
872 ctx.last_node = NULL
    [all...]
  /src/sys/external/isc/libsodium/dist/src/libsodium/include/sodium/
crypto_generichash_blake2b.h 29 uint8_t last_node; variable
  /src/sys/external/isc/libsodium/dist/src/libsodium/crypto_generichash/blake2b/ref/
blake2b-ref.c 54 if (S->last_node)
100 memset(S->t, 0, offsetof(blake2b_state, last_node) + sizeof(S->last_node)
  /src/external/gpl2/xcvs/dist/lib/
regexec.c 38 re_dfastate_t **limited_sts, Idx last_node,
151 Idx top_str, Idx last_node, Idx last_str,
840 mctx.last_node = check_halt_state_context (&mctx, pstate,
953 halt_node = mctx->last_node;
1012 mctx->last_node = halt_node;
1442 if (idx == pmatch[0].rm_eo && cur_node == mctx->last_node)
1573 If `a' isn't the LAST_NODE and `a' can't epsilon transit to
1574 the LAST_NODE, we throw away the node `a'.
1604 transit to the last_node and the last_node itself. *
    [all...]
regex_internal.h 673 Idx last_node; member in struct:__anon7265
691 Idx last_node; member in struct:__anon7266
  /src/external/gpl3/gcc.old/dist/gcc/
lto-cgraph.cc 142 lto_encoder_entry last_node; local
153 last_node = encoder->nodes.pop ();
154 if (last_node.node != node)
156 bool existed = encoder->map->put (last_node.node, index + 1);
160 encoder->nodes[index] = last_node;
  /src/external/gpl2/xcvs/dist/src/
server.c 2747 static struct notify_note *last_node; variable in typeref:struct:notify_note
2871 if (last_node == NULL)
2874 last_node->next = new;
2875 last_node = new;
2973 last_node = NULL;
  /src/external/gpl2/groff/dist/src/roff/troff/
node.cpp 2565 node *last_node = n->last_char_node(); local
2566 if (last_node)
2567 return last_node;
3088 node *last_node = 0; local
3095 last_node = tem;
3097 for (tem = last_node; tem; tem = tem->last)

Completed in 53 milliseconds