Searched refs:parents (Results 1 - 25 of 32) sorted by relevance

12

/freebsd-10.0-release/contrib/subversion/subversion/svn/
H A Dmkdir-cmd.c82 err = svn_client_mkdir4(targets, opt_state->parents,
95 else if (!(opt_state->parents) &&
100 (err, _("Try 'svn mkdir --parents' instead?"));
H A Dmove-cmd.c91 opt_state->parents /* make_parents */,
H A Dadd-cmd.c83 opt_state->no_autoprops, opt_state->parents,
H A Dcopy-cmd.c174 opt_state->parents, opt_state->ignore_externals,
H A Dupdate-cmd.c173 opt_state->parents,
H A Dcl.h224 svn_boolean_t parents; /* create intermediate directories */
220 svn_boolean_t parents; /* create intermediate directories */ member in struct:svn_cl__opt_state_t
/freebsd-10.0-release/contrib/opie/
H A Dopieauto.c48 int parents, s[MAXCLIENTS + 1]; variable
305 if ((parents = socket(PF_UNIX, SOCK_STREAM, 0)) < 0)
314 if (bind(parents, (struct sockaddr *)&sun, sizeof(struct sockaddr_un)))
323 if (listen(parents, 1) < 0)
329 int maxfd = parents;
333 FD_SET(parents, &fds);
353 FD_SET(parents, &fds);
359 if (FD_ISSET(parents, &rfds)) {
370 if ((s[i] = accept(parents, NULL, 0)) < 0)
382 FD_CLR(parents,
[all...]
/freebsd-10.0-release/usr.bin/make/
H A DGNode.h80 * parents
101 #define OP_INVISIBLE 0x00004000 /* The node is invisible to its parents.
103 * parents's local variables. */
176 * Links to parents for which this is an implied source, if any. (nodes
185 Lst parents; member in struct:GNode
H A Dtarg.c145 Lst_Init(&gn->parents);
400 printf("# implicit parents: ");
407 if (!Lst_IsEmpty(&gn->parents)) {
408 printf("# parents: ");
409 LST_FOREACH(tln, &gn->parents)
H A Dsuff.c141 Lst parents; /* Suffixes we have a transformation to */ member in struct:Suff
284 Lst_Destroy(&s->parents, NOFREE);
389 * suffNull should not have parents.
548 SuffInsert(&s->parents, t);
562 * If the node has no commands or children, the children and parents
598 * Remove the target from the source's parents list
600 SuffRemove(&s->parents, t);
641 SuffInsert(&s->parents, s2);
666 SuffInsert(&s2->parents, s);
703 Lst_Init(&s->parents);
[all...]
H A Dmake.c55 * Make_Update Update all parents of a given child. Performs
137 * The mtime field of the node and the cmtime field of its parents
253 * If the target isn't out-of-date, the parents need to know its
256 * have their mtime stay below their children's mtime to keep parents
260 LST_FOREACH(ln, &gn->parents)
311 Lst_AtEnd(&gn->parents, pgn);
334 * Perform update on the parents of a node. Used by JobFinish once
359 LstNode *ln; /* Element in parents and iParents lists */
434 for (ln = Lst_First(&cgn->parents); ln != NULL; ln = Lst_Succ(ln)) {
472 * Set the .PREFIX and .IMPSRC variables for all the implied parents
[all...]
H A Dparse.c430 * New elements are added to the parents lists of cgn and the
436 ParseLinkSrc(Lst *parents, GNode *cgn) argument
441 LST_FOREACH(ln, parents) {
446 Lst_AtEnd(&cgn->parents, pgn);
497 * and the new instance is linked to all parents of the
503 * Duplicate links to parents so graph traversal is
507 * duplicating it into other variables. True, parents
511 ParseLinkSrc(&gn->parents, cohort);
605 * from a special target or link it to its parents, as
/freebsd-10.0-release/contrib/bmake/
H A Dsuff.c166 Lst parents; /* Suffixes we have a transformation to */ member in struct:_Suff
445 Lst_Destroy(s->parents, NULL);
726 SuffInsert(s->parents, t);
747 * If the node has no commands or children, the children and parents
777 * Store s->parents because s could be deleted in SuffRemove
779 p = s->parents;
792 * Remove the target from the source's parents list
849 SuffInsert(s->parents, s2);
876 SuffInsert(s2->parents, s);
937 SuffInsert(s->parents,
[all...]
H A Dmake.c95 * Make_Update Update all parents of a given child. Performs
211 * The mtime field of the node and the cmgn field of its parents
342 * If the target isn't out-of-date, the parents need to know its
345 * have their mtime stay below their children's mtime to keep parents from
349 Lst_ForEach(gn->parents, MakeTimeStamp, gn);
501 (void)Lst_AtEnd(gn->parents, pgn);
656 * Perform update on the parents of a node. Used by JobFinish once
674 * set the FORCE flag on the parents.
689 LstNode ln; /* Element in parents and iParents lists */
692 Lst parents;
688 Lst parents; local
[all...]
H A Dtarg.c256 gn->parents = Lst_Init(FALSE);
303 Lst_Destroy(gn->parents, NULL);
661 fprintf(debug_file, "# implicit parents: ");
669 if (!Lst_IsEmpty (gn->parents)) {
670 fprintf(debug_file, "# parents: ");
671 Lst_ForEach(gn->parents, TargPrintName, NULL);
H A Darch.c1167 if (Lst_Open(gn->parents) != SUCCESS) {
1171 while ((ln = Lst_Next(gn->parents)) != NULL) {
1179 * child. We keep searching its parents in case some other
1199 Lst_Close(gn->parents);
H A Dmake.h160 * 10) a list of nodes for which this is a source (parents)
164 * 13) a list of ancestor nodes, which includes parents, iParents,
165 * and recursive parents of parents
219 Lst iParents; /* Links to parents for which this is an
222 Lst parents; /* Nodes that depend on this one */ member in struct:GNode
262 #define OP_USE 0x00000010 /* Use associated commands for parents */
281 #define OP_INVISIBLE 0x00004000 /* The node is invisible to its parents.
282 * I.e. it doesn't show up in the parents's
/freebsd-10.0-release/usr.bin/gprof/
H A Darcs.c91 * prepend this parent to the parents of this child
93 arcp -> arc_parentlist = childp -> parents;
94 childp -> parents = arcp;
230 * propagate children times up to parents.
408 cyclenlp -> parents = 0; /* list of caller arcs */
429 for ( arcp=memberp->parents ; arcp ; arcp=arcp->arc_parentlist ) {
464 * some of their parents
472 for ( arcp = nlp -> parents; arcp; arcp = arcp -> arc_parentlist ) {
785 * printflag as the union of parents' printflags
786 * propfraction as the sum of fractional parents' propfraction
[all...]
H A Dgprof.h103 struct arcstruct *arc_parentlist; /* parents-of-this-child list */
142 arctype *parents; /* list of caller arcs */ member in struct:nl
H A Dprintgprof.c186 "" , "" , "" , "" , "called" , "total" , "parents");
314 if ( childp -> parents == 0 ) {
320 for ( arcp = childp -> parents ; arcp ; arcp = arcp -> arc_parentlist ) {
455 * unlink parents from child,
456 * then insertion sort back on to sorted's parents.
463 for ( (arcp = childp -> parents)&&(detachedp = arcp -> arc_parentlist);
483 childp -> parents = sorted.arc_parentlist;
/freebsd-10.0-release/contrib/apr/
H A Dapr.spec79 %doc --parents html
/freebsd-10.0-release/contrib/binutils/binutils/
H A Dprdbg.c74 char *parents; member in struct:pr_stack
75 /* How many parents contains parents. */
394 /* Append a string to the parents on the top of the type stack. */
406 len = info->stack->parents ? strlen (info->stack->parents) : 0;
407 info->stack->parents = (char *) xrealloc (info->stack->parents,
409 strcpy (info->stack->parents + len, s);
2119 info->stack->parents
[all...]
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
H A DDeadStoresChecker.cpp140 BugReporter& br, AnalysisDeclContext* ac, ParentMap& parents,
142 : cfg(cfg), Ctx(ctx), BR(br), AC(ac), Parents(parents),
139 DeadStoreObs(const CFG &cfg, ASTContext &ctx, BugReporter& br, AnalysisDeclContext* ac, ParentMap& parents, llvm::SmallPtrSet<const VarDecl*, 20> &escaped) argument
/freebsd-10.0-release/contrib/ldns/
H A Ddnssec_verify.c231 /* try parents for auth denial of DS */
460 ldns_dnssec_trust_tree_free(tree->parents[i]);
474 parent = ldns_dnssec_trust_tree_depth(tree->parents[i]);
562 if (ldns_rr_get_type(tree->parents[i]->rr) ==
564 ldns_rr_get_type(tree->parents[i]->rr) ==
609 tree->parents[i]->rr);
612 tree->parents[i],
667 tree->parents[tree->parent_count] =
846 if (cur_parent_rr == new_tree->parents[i]->rr) {
1063 ldns_dnssec_trust_tree_contains_keys(tree->parents[
[all...]
/freebsd-10.0-release/contrib/ldns/ldns/
H A Ddnssec_verify.h127 ldns_dnssec_trust_tree *parents[LDNS_DNSSEC_TRUST_TREE_MAX_PARENTS]; member in struct:ldns_dnssec_trust_tree_struct

Completed in 167 milliseconds

12