Home
last modified time | relevance | path

Searched refs:father (Results 1 – 25 of 32) sorted by relevance

12

/dragonfly/contrib/libarchive/libarchive/
HDarchive_rb.c50 #define RB_SET_FATHER(rb, father) \ argument
51 ((void)((rb)->rb_info = (uintptr_t)(father)|((rb)->rb_info & RB_FLAG_MASK)))
276 struct archive_rb_node * father = RB_FATHER(self); in __archive_rb_tree_insert_rebalance() local
287 grandpa = RB_FATHER(father); in __archive_rb_tree_insert_rebalance()
288 which = (father == grandpa->rb_right); in __archive_rb_tree_insert_rebalance()
302 RB_MARK_BLACK(father); in __archive_rb_tree_insert_rebalance()
312 father = RB_FATHER(self); in __archive_rb_tree_insert_rebalance()
313 if (RB_BLACK_P(father)) { in __archive_rb_tree_insert_rebalance()
324 if (self == father->rb_nodes[other]) { in __archive_rb_tree_insert_rebalance()
331 __archive_rb_tree_reparent_nodes(father, other); in __archive_rb_tree_insert_rebalance()
[all …]
/dragonfly/sys/libprop/
HDprop_rb.c320 struct rb_node * father = RB_FATHER(self); in rb_tree_insert_rebalance() local
321 struct rb_node * grandpa = RB_FATHER(father); in rb_tree_insert_rebalance()
328 KASSERT(RB_RED_P(father)); in rb_tree_insert_rebalance()
335 KASSERT(RB_RED_P(father)); in rb_tree_insert_rebalance()
340 grandpa = RB_FATHER(father); in rb_tree_insert_rebalance()
343 which = (father == grandpa->rb_right); in rb_tree_insert_rebalance()
358 RB_MARK_BLACK(father); in rb_tree_insert_rebalance()
369 father = RB_FATHER(self); in rb_tree_insert_rebalance()
371 if (RB_BLACK_P(father)) { in rb_tree_insert_rebalance()
382 KASSERT(RB_RED_P(father)); in rb_tree_insert_rebalance()
[all …]
HDprop_rb_impl.h73 #define RB_SET_FATHER(rb, father) \ argument
74 ((void)((rb)->rb_info = (uintptr_t)(father)|((rb)->rb_info & RB_FLAG_MASK)))
/dragonfly/contrib/gcc-4.7/gcc/
HDgraphite-poly.h888 lst_p father; in lst_pred() local
897 father = LST_LOOP_FATHER (lst); in lst_pred()
898 return VEC_index (lst_p, LST_SEQ (father), dewey - 1); in lst_pred()
908 lst_p father; in lst_succ() local
914 father = LST_LOOP_FATHER (lst); in lst_succ()
916 if (VEC_length (lst_p, LST_SEQ (father)) == (unsigned) dewey + 1) in lst_succ()
919 return VEC_index (lst_p, LST_SEQ (father), dewey + 1); in lst_succ()
1071 lst_p father = LST_LOOP_FATHER (lst); in lst_remove_from_sequence() local
1074 gcc_assert (lst && father && dewey >= 0); in lst_remove_from_sequence()
1076 VEC_ordered_remove (lst_p, LST_SEQ (father), dewey); in lst_remove_from_sequence()
[all …]
HDet-forest.c475 nw->father = NULL; in et_new_tree()
494 if (t->father) in et_free_tree()
524 et_set_father (struct et_node *t, struct et_node *father) in et_set_father() argument
530 new_f_occ = et_new_occ (father); in et_set_father()
532 rmost = father->rightmost_occ; in et_set_father()
558 t->father = father; in et_set_father()
559 right = father->son; in et_set_father()
570 father->son = t; in et_set_father()
583 struct et_node *father = t->father; in et_split() local
613 if (father->son == t) in et_split()
[all …]
HDcfgloop.c281 establish_preds (struct loop *loop, struct loop *father) in establish_preds() argument
284 unsigned depth = loop_depth (father) + 1; in establish_preds()
289 FOR_EACH_VEC_ELT (loop_p, father->superloops, i, ploop) in establish_preds()
291 VEC_quick_push (loop_p, loop->superloops, father); in establish_preds()
302 flow_loop_tree_node_add (struct loop *father, struct loop *loop) in flow_loop_tree_node_add() argument
304 loop->next = father->inner; in flow_loop_tree_node_add()
305 father->inner = loop; in flow_loop_tree_node_add()
307 establish_preds (loop, father); in flow_loop_tree_node_add()
315 struct loop *prev, *father; in flow_loop_tree_node_remove() local
317 father = loop_outer (loop); in flow_loop_tree_node_remove()
[all …]
HDgraphite-interchange.c677 lst_p father; in lst_interchange_select_outer() local
682 father = LST_LOOP_FATHER (loop); in lst_interchange_select_outer()
683 if (father) in lst_interchange_select_outer()
685 while (lst_interchange_select_inner (scop, father, outer, loop)) in lst_interchange_select_outer()
688 loop = VEC_index (lst_p, LST_SEQ (father), outer); in lst_interchange_select_outer()
HDet-forest.h63 struct et_node *father; /* Father of the node. */ member
HDdominance.c623 if (!bb->dom[dir_index]->father) in compute_dom_fast_query()
707 if (!node->father) in get_immediate_dominator()
710 return (basic_block) node->father->data; in get_immediate_dominator()
724 if (node->father) in set_immediate_dominator()
726 if (node->father->data == dominated_by) in set_immediate_dominator()
1451 return (basic_block) (next->father->son == next ? NULL : next->data); in next_dom_son()
HDcfgloopmanip.c130 struct loop *father = current_loops->tree_root, *act; in fix_loop_placement() local
136 if (flow_loop_nested_p (father, act)) in fix_loop_placement()
137 father = act; in fix_loop_placement()
140 if (father != loop_outer (loop)) in fix_loop_placement()
142 for (act = loop_outer (loop); act != father; act = loop_outer (act)) in fix_loop_placement()
145 flow_loop_tree_node_add (father, loop); in fix_loop_placement()
HDtree-ssa-reassoc.c216 struct loop *father = bb->loop_father; in phi_rank() local
223 if (!father->latch) in phi_rank()
227 if (bb != father->header in phi_rank()
228 || father->inner) in phi_rank()
239 || gimple_bb (use_stmt)->loop_father != father) in phi_rank()
250 if (gimple_bb (def_stmt)->loop_father == father) in phi_rank()
251 return bb_rank[father->latch->index] + PHI_LOOP_BIAS; in phi_rank()
/dragonfly/contrib/dhcpcd/compat/
HDrb.c397 struct rb_node * father = RB_FATHER(self); in rb_tree_insert_rebalance() local
398 struct rb_node * grandpa = RB_FATHER(father); in rb_tree_insert_rebalance()
405 KASSERT(RB_RED_P(father)); in rb_tree_insert_rebalance()
412 KASSERT(RB_RED_P(father)); in rb_tree_insert_rebalance()
417 grandpa = RB_FATHER(father); in rb_tree_insert_rebalance()
420 which = (father == grandpa->rb_right); in rb_tree_insert_rebalance()
435 RB_MARK_BLACK(father); in rb_tree_insert_rebalance()
446 father = RB_FATHER(self); in rb_tree_insert_rebalance()
448 if (RB_BLACK_P(father)) { in rb_tree_insert_rebalance()
459 KASSERT(RB_RED_P(father)); in rb_tree_insert_rebalance()
[all …]
HDrbtree.h76 #define RB_SET_FATHER(rb, father) \ argument
77 ((void)((rb)->rb_info = (uintptr_t)(father)|((rb)->rb_info & RB_FLAG_MASK)))
/dragonfly/contrib/gcc-8.0/gcc/
HDet-forest.c468 nw->father = NULL; in et_new_tree()
487 if (t->father) in et_free_tree()
517 et_set_father (struct et_node *t, struct et_node *father) in et_set_father() argument
523 new_f_occ = et_new_occ (father); in et_set_father()
525 rmost = father->rightmost_occ; in et_set_father()
551 t->father = father; in et_set_father()
552 right = father->son; in et_set_father()
563 father->son = t; in et_set_father()
576 struct et_node *father = t->father; in et_split() local
606 if (father->son == t) in et_split()
[all …]
HDcfgloop.c281 establish_preds (struct loop *loop, struct loop *father) in establish_preds() argument
284 unsigned depth = loop_depth (father) + 1; in establish_preds()
289 FOR_EACH_VEC_SAFE_ELT (father->superloops, i, ploop) in establish_preds()
291 loop->superloops->quick_push (father); in establish_preds()
305 flow_loop_tree_node_add (struct loop *father, struct loop *loop, in flow_loop_tree_node_add() argument
315 loop->next = father->inner; in flow_loop_tree_node_add()
316 father->inner = loop; in flow_loop_tree_node_add()
319 establish_preds (loop, father); in flow_loop_tree_node_add()
327 struct loop *prev, *father; in flow_loop_tree_node_remove() local
329 father = loop_outer (loop); in flow_loop_tree_node_remove()
[all …]
HDdominance.c673 if (!bb->dom[dir_index]->father) in compute_dom_fast_query()
700 if (!bb->dom[dir_index]->father) in compute_dom_fast_query_in_region()
853 if (!node->father) in get_immediate_dominator()
856 return (basic_block) node->father->data; in get_immediate_dominator()
870 if (node->father) in set_immediate_dominator()
872 if (node->father->data == dominated_by) in set_immediate_dominator()
1593 return (basic_block) (next->father->son == next ? NULL : next->data); in next_dom_son()
HDet-forest.h62 struct et_node *father; /* Father of the node. */ member
HDcfgloopmanip.c130 struct loop *father = current_loops->tree_root, *act; in fix_loop_placement() local
136 if (flow_loop_nested_p (father, act)) in fix_loop_placement()
137 father = act; in fix_loop_placement()
140 if (father != loop_outer (loop)) in fix_loop_placement()
142 for (act = loop_outer (loop); act != father; act = loop_outer (act)) in fix_loop_placement()
145 flow_loop_tree_node_add (father, loop); in fix_loop_placement()
HDtree-ssa-loop-ivcanon.c1488 loop_p father = get_loop (cfun, i); in tree_unroll_loops_completely() local
1489 basic_block *body = get_loop_body_in_dom_order (father); in tree_unroll_loops_completely()
1490 for (unsigned j = 0; j < father->num_nodes; j++) in tree_unroll_loops_completely()
HDtree-ssa-reassoc.c273 struct loop *father = bb->loop_father; in phi_rank() local
280 if (!father->latch) in phi_rank()
284 if (bb != father->header in phi_rank()
285 || father->inner) in phi_rank()
296 || gimple_bb (use_stmt)->loop_father != father) in phi_rank()
307 if (gimple_bb (def_stmt)->loop_father == father) in phi_rank()
308 return bb_rank[father->latch->index] + PHI_LOOP_BIAS; in phi_rank()
/dragonfly/sys/net/dummynet/
HDip_dummynet.c297 int father = HEAP_FATHER(son); in heap_insert() local
300 if (DN_KEY_LT(h->p[father].key, h->p[son].key)) in heap_insert()
304 HEAP_SWAP(h->p[son], h->p[father], tmp); in heap_insert()
306 son = father; in heap_insert()
318 int child, father, max = h->elements - 1; in heap_extract() local
325 father = 0; /* Default: move up smallest child */ in heap_extract()
330 father = *((int *)((char *)obj + h->offset)); in heap_extract()
331 if (father < 0 || father >= h->elements) { in heap_extract()
333 father, h->elements); in heap_extract()
336 RESET_OFFSET(h, father); in heap_extract()
[all …]
/dragonfly/sys/net/dummynet3/
HDip_dummynet3.c316 int father = HEAP_FATHER(son); in heap_insert() local
319 if (DN_KEY_LT(h->p[father].key, h->p[son].key)) in heap_insert()
323 HEAP_SWAP(h->p[son], h->p[father], tmp); in heap_insert()
325 son = father; in heap_insert()
337 int child, father, max = h->elements - 1; in heap_extract() local
344 father = 0; /* Default: move up smallest child */ in heap_extract()
349 father = *((int *)((char *)obj + h->offset)); in heap_extract()
350 if (father < 0 || father >= h->elements) { in heap_extract()
352 father, h->elements); in heap_extract()
355 RESET_OFFSET(h, father); in heap_extract()
[all …]
/dragonfly/usr.bin/calendar/calendars/
HDcalendar.birthday65 02/08 Friedleib F. Runge born, 1795, father of paper chromatography
285 08/29 Oliver Wendell Holmes born, 1809, physician & father of the jurist
303 09/18 Konstantin Eduardovich Tsiolkovsky born, 1857, father of rocket flight
/dragonfly/games/quiz/datfiles/
HDbard133 Full fathom five thy father lies{;}:\
/dragonfly/games/fortune/datfiles/
HDfortunes-o175 Amie shyly stood up, scuffed her feet and said, "My father is a
177 "Thank you, Amie," said the teacher. "What about your father, Billy?"
181 Later that day she went to Billy's house and rang the bell. Billy's father
184 Billy's father replied, "Well, I'm really an attorney. But how do
457 A young man asked his father to lend him $50 for a blowjob,
458 whereupon his father solemnly replied, "When I was young we used to
651 "Well," said the husband, "we've just become the father of a
675 pass at the daughter. "Stop that!" she said. "I'll call my father."
677 stop ... that," she said. "I'll call my father."
685 and mumbled, "Stop that! Or I'll call your father."
[all …]

12