HomeSort by: relevance | last modified time | path
    Searched defs:prune (Results 1 - 7 of 7) sorted by relevancy

  /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
erase_fn_imps.hpp 113 prune(Pred pred) function in class:PB_DS_CLASS_C_DEC
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
erase_fn_imps.hpp 113 prune(Pred pred) function in class:PB_DS_CLASS_C_DEC
  /src/regress/sys/uvm/pdsim/
lirs.c 135 prune() function
145 buf_print(bp, ": prune\n");
173 prune();
217 prune();
  /src/external/bsd/openldap/dist/clients/tools/
ldapdelete.c 58 static int prune = 0; variable
128 prune = 1;
250 /* If prune is on, remove a whole subtree. Delete the children of the
253 if ( prune ) {
298 if ( prune && !subentries ) {
  /src/external/apache2/llvm/dist/llvm/lib/ExecutionEngine/JITLink/
JITLinkGeneric.cpp 31 // Prune and optimize the graph.
40 prune(*G);
431 void prune(LinkGraph &G) { function in namespace:llvm::jitlink
  /src/usr.bin/diff/
diffreg.c 182 static void prune(void);
388 prune();
531 prune(void) function
  /src/external/mpl/bind/dist/lib/dns/
rbtdb.c 1172 rbtdb_prune_t *prune = isc_mem_get(rbtdb->common.mctx, sizeof(*prune)); local
1173 *prune = (rbtdb_prune_t){ .node = node };
1175 dns_db_attach((dns_db_t *)rbtdb, &prune->db);
1178 isc_async_run(rbtdb->loop, prune_tree, prune);
1468 * Prune the RBTDB tree of trees. Start by attempting to delete a node that is
1492 rbtdb_prune_t *prune = (rbtdb_prune_t *)arg; local
1493 dns_rbtdb_t *rbtdb = (dns_rbtdb_t *)prune->db;
1494 dns_rbtnode_t *node = prune->node;
1500 isc_mem_put(rbtdb->common.mctx, prune, sizeof(*prune))
    [all...]

Completed in 79 milliseconds