/dports/devel/tdl/tdl-1.5.2/ |
H A D | move.c | 48 struct node *insert_parent, *insert_peer=NULL, *parent; in process_move_internal() local 63 insert_parent = lookup_node(x[0], 0, NULL); in process_move_internal() 64 if (!insert_parent) return -1; in process_move_internal() 65 insert_point = &insert_parent->kids; in process_move_internal() 67 insert_peer = lookup_node(x[0], 1, &insert_parent); /* Allow final component to be zero */ in process_move_internal() 81 if (is_ancestor(table[i], insert_parent)) { in process_move_internal() 103 table[i]->parent = insert_parent; in process_move_internal() 117 parent = insert_parent; in process_move_internal()
|
/dports/audio/festival/festival/src/modules/UniSyn_phonology/ |
H A D | subword.cc | 134 new_parent = met_node->insert_parent(); in make_foot() 138 new_parent = met_node->insert_parent(); in make_foot() 143 new_parent = met_node->insert_parent(); in make_foot() 169 new_parent = met_node->insert_parent(); in make_super_foot() 173 new_parent = met_node->insert_parent(); in make_super_foot()
|
H A D | mettree.cc | 1021 p3 = n1->insert_parent(); in footing()
|
/dports/multimedia/libv4l/linux-5.13-rc2/fs/f2fs/ |
H A D | extent_cache.c | 124 struct rb_node **insert_parent, in f2fs_lookup_rb_tree_ret() argument 132 *insert_parent = NULL; in f2fs_lookup_rb_tree_ret() 163 *insert_parent = parent; in f2fs_lookup_rb_tree_ret() 497 struct rb_node *insert_parent, in __insert_extent_tree() argument 504 if (insert_p && insert_parent) { in __insert_extent_tree() 505 parent = insert_parent; in __insert_extent_tree() 537 struct rb_node **insert_p = NULL, *insert_parent = NULL; in f2fs_update_extent_tree_range() local 569 &insert_p, &insert_parent, false, in f2fs_update_extent_tree_range() 627 insert_parent = NULL; in f2fs_update_extent_tree_range() 638 insert_p, insert_parent, leftmost); in f2fs_update_extent_tree_range()
|
H A D | segment.c | 1277 struct rb_node *insert_parent) in __insert_discard_tree() argument 1284 if (insert_p && insert_parent) { in __insert_discard_tree() 1285 parent = insert_parent; in __insert_discard_tree() 1348 struct rb_node **insert_p = NULL, *insert_parent = NULL; in __update_discard_tree_range() local 1358 &insert_p, &insert_parent, true, NULL); in __update_discard_tree_range() 1457 struct rb_node **insert_p = NULL, *insert_parent = NULL; in __issue_discard_cmd_orderly() local 1469 &insert_p, &insert_parent, true, NULL); in __issue_discard_cmd_orderly() 3012 struct rb_node **insert_p = NULL, *insert_parent = NULL; in __issue_discard_cmd_range() local 3030 &insert_p, &insert_parent, true, NULL); in __issue_discard_cmd_range()
|
H A D | f2fs.h | 3873 struct rb_node ***insert_p, struct rb_node **insert_parent,
|
/dports/multimedia/v4l_compat/linux-5.13-rc2/fs/f2fs/ |
H A D | extent_cache.c | 124 struct rb_node **insert_parent, in f2fs_lookup_rb_tree_ret() argument 132 *insert_parent = NULL; in f2fs_lookup_rb_tree_ret() 163 *insert_parent = parent; in f2fs_lookup_rb_tree_ret() 497 struct rb_node *insert_parent, in __insert_extent_tree() argument 504 if (insert_p && insert_parent) { in __insert_extent_tree() 505 parent = insert_parent; in __insert_extent_tree() 537 struct rb_node **insert_p = NULL, *insert_parent = NULL; in f2fs_update_extent_tree_range() local 569 &insert_p, &insert_parent, false, in f2fs_update_extent_tree_range() 627 insert_parent = NULL; in f2fs_update_extent_tree_range() 638 insert_p, insert_parent, leftmost); in f2fs_update_extent_tree_range()
|
H A D | segment.c | 1277 struct rb_node *insert_parent) in __insert_discard_tree() argument 1284 if (insert_p && insert_parent) { in __insert_discard_tree() 1285 parent = insert_parent; in __insert_discard_tree() 1348 struct rb_node **insert_p = NULL, *insert_parent = NULL; in __update_discard_tree_range() local 1358 &insert_p, &insert_parent, true, NULL); in __update_discard_tree_range() 1457 struct rb_node **insert_p = NULL, *insert_parent = NULL; in __issue_discard_cmd_orderly() local 1469 &insert_p, &insert_parent, true, NULL); in __issue_discard_cmd_orderly() 3012 struct rb_node **insert_p = NULL, *insert_parent = NULL; in __issue_discard_cmd_range() local 3030 &insert_p, &insert_parent, true, NULL); in __issue_discard_cmd_range()
|
H A D | f2fs.h | 3873 struct rb_node ***insert_p, struct rb_node **insert_parent,
|
/dports/multimedia/v4l-utils/linux-5.13-rc2/fs/f2fs/ |
H A D | extent_cache.c | 124 struct rb_node **insert_parent, in f2fs_lookup_rb_tree_ret() argument 132 *insert_parent = NULL; in f2fs_lookup_rb_tree_ret() 163 *insert_parent = parent; in f2fs_lookup_rb_tree_ret() 497 struct rb_node *insert_parent, in __insert_extent_tree() argument 504 if (insert_p && insert_parent) { in __insert_extent_tree() 505 parent = insert_parent; in __insert_extent_tree() 537 struct rb_node **insert_p = NULL, *insert_parent = NULL; in f2fs_update_extent_tree_range() local 569 &insert_p, &insert_parent, false, in f2fs_update_extent_tree_range() 627 insert_parent = NULL; in f2fs_update_extent_tree_range() 638 insert_p, insert_parent, leftmost); in f2fs_update_extent_tree_range()
|
H A D | segment.c | 1277 struct rb_node *insert_parent) in __insert_discard_tree() argument 1284 if (insert_p && insert_parent) { in __insert_discard_tree() 1285 parent = insert_parent; in __insert_discard_tree() 1348 struct rb_node **insert_p = NULL, *insert_parent = NULL; in __update_discard_tree_range() local 1358 &insert_p, &insert_parent, true, NULL); in __update_discard_tree_range() 1457 struct rb_node **insert_p = NULL, *insert_parent = NULL; in __issue_discard_cmd_orderly() local 1469 &insert_p, &insert_parent, true, NULL); in __issue_discard_cmd_orderly() 3012 struct rb_node **insert_p = NULL, *insert_parent = NULL; in __issue_discard_cmd_range() local 3030 &insert_p, &insert_parent, true, NULL); in __issue_discard_cmd_range()
|
H A D | f2fs.h | 3873 struct rb_node ***insert_p, struct rb_node **insert_parent,
|
/dports/devel/systemc/systemc-2.3.4_pub_rev_20190614/src/sysc/communication/ |
H A D | sc_port.cpp | 418 sc_port_base::insert_parent( int i ) in insert_parent() function in sc_core::sc_port_base 471 insert_parent( i ); in complete_binding()
|
H A D | sc_port.h | 169 void insert_parent( int );
|
/dports/graphics/blender/blender-2.91.0/source/blender/editors/space_node/ |
H A D | node_relationships.c | 175 bNode *insert_parent; member 1619 if (ofs_node->parent && ofs_node->parent != data->insert_parent) { in node_link_insert_offset_frame_chain_cb() 1656 if (data->insert_parent) { in node_link_insert_offset_chain_cb() 1665 if (nodeIsChildOf(data->insert_parent, ofs_node) == false) { in node_link_insert_offset_chain_cb() 1666 data->insert_parent = NULL; in node_link_insert_offset_chain_cb() 1779 iofsd->insert_parent = insert->parent; in node_link_insert_offset_ntree()
|
/dports/science/bagel/bagel-1.2.2/src/scf/fmm/ |
H A D | box.h | 64 void insert_parent(std::weak_ptr<const Box> parent);
|
H A D | fmm.cc | 200 box_[ichild]->insert_parent(box_[nbox]); in get_boxes() 208 box_[ichild]->insert_parent(box_[ibox]); in get_boxes()
|
H A D | box.cc | 124 void Box::insert_parent(weak_ptr<const Box> p) { in insert_parent() function in Box
|
/dports/audio/festival/speech_tools/include/ling_class/ |
H A D | EST_Item.h | 381 EST_Item *insert_parent(EST_Item *li=0);
|
/dports/audio/festival/speech_tools/ling_class/ |
H A D | EST_Item.cc | 313 EST_Item *EST_Item::insert_parent(EST_Item *si) in insert_parent() function in EST_Item
|
/dports/audio/festival/festival/src/arch/festival/ |
H A D | utterance.cc | 586 s = l->insert_parent(s); in item_insert_parent()
|
/dports/www/geneweb/geneweb-13c850a0cc3973daf7ae3e0772a1621f84052041/src/ |
H A D | updateFamOk.ml | 154 value insert_parent conf (parents, ext) i = 246 let (parents, ext) = insert_parent conf (parents, ext) i in
|
/dports/x11-wm/durden/durden-0.6.1/durden/ |
H A D | tiler.lua | 4132 local insert_parent = wm.selected; 4155 elseif (not insert_parent or wm.selected.space ~= space) then
|
/dports/audio/festival/festival/doc/ |
H A D | festival.texi | 4008 to insert above and below and the functions @code{item.insert_parent} 4015 @item (item.insert_parent DAUGHTER NEWPARENT)
|