/dports/multimedia/v4l-utils/linux-5.13-rc2/block/ |
H A D | blk-mq-cpumap.c | 39 unsigned int cpu, first_sibling, q = 0; in blk_mq_map_queues() local 66 first_sibling = get_first_sibling(cpu); in blk_mq_map_queues() 67 if (first_sibling == cpu) in blk_mq_map_queues() 70 map[cpu] = map[first_sibling]; in blk_mq_map_queues()
|
/dports/multimedia/v4l_compat/linux-5.13-rc2/block/ |
H A D | blk-mq-cpumap.c | 39 unsigned int cpu, first_sibling, q = 0; in blk_mq_map_queues() local 66 first_sibling = get_first_sibling(cpu); in blk_mq_map_queues() 67 if (first_sibling == cpu) in blk_mq_map_queues() 70 map[cpu] = map[first_sibling]; in blk_mq_map_queues()
|
/dports/multimedia/libv4l/linux-5.13-rc2/block/ |
H A D | blk-mq-cpumap.c | 39 unsigned int cpu, first_sibling, q = 0; in blk_mq_map_queues() local 66 first_sibling = get_first_sibling(cpu); in blk_mq_map_queues() 67 if (first_sibling == cpu) in blk_mq_map_queues() 70 map[cpu] = map[first_sibling]; in blk_mq_map_queues()
|
/dports/www/firefox/firefox-99.0/testing/web-platform/meta/css/selectors/invalidation/ |
H A D | has-sibling.html.ini | 2 [add .test to first_sibling] 23 [insert element div.test before first_sibling] 44 [insert element div.test after first_sibling] 65 [insert tree div>div.test before first_sibling] 86 [insert tree div>div.test after first_sibling]
|
/dports/math/polymake/polymake-4.5/apps/graph/include/ |
H A D | DijkstraShortestPathWithSiblings.h | 64 label_t* first_sibling = old_first_label->sibling; in rotate_siblings() local 66 label_t* next_sibling = first_sibling; in rotate_siblings() 69 this->labels_on_node[node] = first_sibling; in rotate_siblings() 70 return first_sibling; in rotate_siblings()
|
/dports/textproc/htmlq/htmlq-0.3.0/cargo-crates/kuchiki-0.8.1/src/ |
H A D | iter.rs | 29 let first_sibling = parent.first_child().unwrap(); in inclusive_preceding_siblings() localVariable 30 debug_assert!(self.previous_sibling().is_some() || *self == first_sibling); in inclusive_preceding_siblings() 32 next: first_sibling, in inclusive_preceding_siblings() 52 let first_sibling = parent.first_child().unwrap(); in preceding_siblings() localVariable 54 next: first_sibling, in preceding_siblings()
|
/dports/science/dftbplus/dftbplus-19.1/external/xmlf90/ |
H A D | dom_node.f90 | 421 logical :: first_sibling local 426 first_sibling = .true. 437 if (first_sibling) then 441 first_sibling = .false.
|
/dports/textproc/xmlf90/xmlf90-1.5.5/src/dom/ |
H A D | m_dom_node.f90 | 419 logical :: first_sibling local 424 first_sibling = .true. 435 if (first_sibling) then 439 first_sibling = .false.
|
/dports/net/libyang/libyang-1.0.240/src/ |
H A D | parser_json.c | 436 json_get_value(struct lyd_node_leaf_list *leaf, struct lyd_node **first_sibling, const char *data, … in json_get_value() argument 566 lyv_multicases((struct lyd_node*)leaf, NULL, first_sibling, 0, NULL)) { in json_get_value() 583 (*first_sibling)->prev = (struct lyd_node *)new; in json_get_value() 891 … struct lyd_node *first_sibling, struct lyd_node *prev, struct attr_cont **attrs, int options, in json_parse_data() argument 1156 first_sibling = result; in json_parse_data() 1176 first_sibling->prev = result; in json_parse_data() 1179 first_sibling = result; in json_parse_data() 1192 …r = json_get_value((struct lyd_node_leaf_list *)result, &first_sibling, &data[len], options, unres… in json_parse_data() 1352 lyv_multicases(list, NULL, prev ? &first_sibling : NULL, 0, NULL)) { in json_parse_data() 1368 first_sibling->prev = new; in json_parse_data() [all …]
|
H A D | parser_lyb.c | 1006 lyb_parse_subtree(const char *data, struct lyd_node *parent, struct lyd_node **first_sibling, const… in lyb_parse_subtree() argument 1014 assert((parent && !first_sibling) || (!parent && first_sibling)); in lyb_parse_subtree() 1092 } else if (*first_sibling) { in lyb_parse_subtree() 1094 (*first_sibling)->prev->next = node; in lyb_parse_subtree() 1095 node->prev = (*first_sibling)->prev; in lyb_parse_subtree() 1096 (*first_sibling)->prev = node; in lyb_parse_subtree() 1099 *first_sibling = node; in lyb_parse_subtree() 1137 if (first_sibling && (*first_sibling == node)) { in lyb_parse_subtree() 1138 *first_sibling = NULL; in lyb_parse_subtree()
|
H A D | validation.c | 895 lyv_multicases(struct lyd_node *node, struct lys_node *schemanode, struct lyd_node **first_sibling, in lyv_multicases() argument 910 } else if (!first_sibling || !(*first_sibling)) { in lyv_multicases() 926 LY_TREE_FOR_SAFE(*first_sibling, next, iter) { in lyv_multicases() 940 if (iter == *first_sibling) { in lyv_multicases() 941 *first_sibling = next; in lyv_multicases() 951 if (*first_sibling && (saux = lys_parent(schoice)) && (saux->nodetype & LYS_CASE)) { in lyv_multicases()
|
H A D | validation.h | 86 …struct lyd_node *node, struct lys_node *schemanode, struct lyd_node **first_sibling, int autodelet…
|
H A D | printer_lyb.c | 900 struct lys_node *first_sibling, *parent; in lyb_print_schema_hash() local 909 first_sibling = (struct lys_node *)lys_getnext(NULL, parent, lys_node_module(schema), 0); in lyb_print_schema_hash() 911 if (lybs->sib_ht[r].first_sibling == first_sibling) { in lyb_print_schema_hash() 920 *sibling_ht = lyb_hash_siblings(first_sibling, NULL, 0); in lyb_print_schema_hash() 931 lybs->sib_ht[lybs->sib_ht_count - 1].first_sibling = first_sibling; in lyb_print_schema_hash()
|
H A D | parser_xml.c | 104 …truct ly_ctx *ctx, struct lyxml_elem *xml, struct lyd_node *parent, struct lyd_node *first_sibling, in xml_parse_data() argument 284 first_sibling = *result; in xml_parse_data() 304 first_sibling->prev = *result; in xml_parse_data() 307 first_sibling = *result; in xml_parse_data() 538 lyv_multicases(*result, NULL, prev ? &first_sibling : NULL, 0, NULL)) { in xml_parse_data()
|
/dports/databases/p5-DBIx-Class/DBIx-Class-0.082842/t/ |
H A D | 87ordered.t | 252 ok( !$row->first_sibling(), 'no first sibling' ); 259 ok( $row->first_sibling(), 'first sibling' ); 262 ok( $row->first_sibling->position < $position, 'first sibling position < than us'); 269 ok( $row->first_sibling->position < $position, 'first sibling position < than us');
|
/dports/devel/glibmm/glibmm-2.64.2/glib/glibmm/ |
H A D | nodetree.h | 490 NodeTree<T>* first_sibling() in first_sibling() function 498 const NodeTree<T>* first_sibling() const in first_sibling() function 500 return const_cast<NodeTree<T>*>(this)->first_sibling(); in first_sibling()
|
/dports/databases/p5-DBIx-Class-Tree-NestedSet/DBIx-Class-Tree-NestedSet-0.10/t/ |
H A D | 16-siblings.t | 143 $sibling = $child1_4->first_sibling; 146 $sibling = $child1_1->first_sibling;
|
/dports/misc/e2fsprogs-libblkid/e2fsprogs-1.46.5/debugfs/ |
H A D | extent_cmds.ct | 17 first_sibling, first_sib;
|
/dports/misc/e2fsprogs-libuuid/e2fsprogs-1.46.5/debugfs/ |
H A D | extent_cmds.ct | 17 first_sibling, first_sib;
|
/dports/sysutils/e2fsprogs/e2fsprogs-1.46.5/debugfs/ |
H A D | extent_cmds.ct | 17 first_sibling, first_sib;
|
/dports/audio/faust/faust-2.37.3/tools/physicalModeling/mesh2faust/vega/libraries/glui/glui-2.35/src/ |
H A D | glui_node.cpp | 50 GLUI_Node *GLUI_Node::first_sibling( void ) in first_sibling() function in GLUI_Node
|
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/bullet/Extras/glui/ |
H A D | glui_node.cpp | 50 GLUI_Node *GLUI_Node::first_sibling( void ) in first_sibling() function in GLUI_Node
|
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/box2d/glui/ |
H A D | glui_node.cpp | 50 GLUI_Node *GLUI_Node::first_sibling( void ) in first_sibling() function in GLUI_Node
|
/dports/devel/glui/glui-2.36/src/ |
H A D | glui_node.cpp | 52 GLUI_Node *GLUI_Node::first_sibling( void ) in first_sibling() function in GLUI_Node
|
/dports/textproc/p5-Tree-Nary/Tree-Nary-1.3/ |
H A D | README | 66 $first_sibling = $node->first_sibling($node); 291 first_sibling( NODE )
|