Home
last modified time | relevance | path

Searched refs:node2 (Results 1 – 25 of 34) sorted by relevance

12

/OK3568_Linux_fs/kernel/arch/sparc/prom/
H A Dtree_32.c234 phandle node = prom_root_node, node2; in prom_finddevice() local
256 node2 = node; in prom_finddevice()
257 while (node2 && (s32)node2 != -1) { in prom_finddevice()
258 if (prom_getproperty (node2, "reg", (char *)reg, sizeof (reg)) > 0) { in prom_finddevice()
260 node = node2; in prom_finddevice()
264 node2 = prom_getsibling(node2); in prom_finddevice()
265 if (!node2 || (s32)node2 == -1) in prom_finddevice()
267 node2 = prom_searchsiblings(prom_getsibling(node2), nbuf); in prom_finddevice()
/OK3568_Linux_fs/external/camera_engine_rkaiq/rkaiq/include/common/
H A Dlist.h258 static inline void list_swap_item(struct list_head* node1, struct list_head* node2) in list_swap_item() argument
269 n3 = node2->next; in list_swap_item()
270 if (node1->next == node2) { in list_swap_item()
273 node1->prev = node2; in list_swap_item()
274 node2->next = node1; in list_swap_item()
275 node2->prev = n0; in list_swap_item()
276 n0->next = node2; in list_swap_item()
/OK3568_Linux_fs/kernel/include/net/
H A Dnetrom.h163 #define nr_neigh_for_each_safe(__nr_neigh, node2, list) \ argument
164 hlist_for_each_entry_safe(__nr_neigh, node2, list, neigh_node)
169 #define nr_node_for_each_safe(__nr_node, node2, list) \ argument
170 hlist_for_each_entry_safe(__nr_node, node2, list, node_node)
/OK3568_Linux_fs/kernel/fs/hfs/
H A Dbnode.c253 struct hfs_bnode *node, *node2; in __hfs_bnode_create() local
277 node2 = hfs_bnode_findhash(tree, cnid); in __hfs_bnode_create()
278 if (!node2) { in __hfs_bnode_create()
286 wait_event(node2->lock_wq, !test_bit(HFS_BNODE_NEW, &node2->flags)); in __hfs_bnode_create()
287 return node2; in __hfs_bnode_create()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dsymbol-summary.h193 static void symtab_duplication (cgraph_node *node, cgraph_node *node2, in class()
269 cgraph_node *node2, void *data) in symtab_duplication() argument
275 summary->duplicate (node, node2, v, summary->get_create (node2)); in symtab_duplication()
402 static void symtab_duplication (cgraph_node *node, cgraph_node *node2,
470 cgraph_node *node2,
478 T *duplicate = summary->get_create (node2);
479 summary->duplicate (node, node2, v, duplicate);
H A Dipa-prop.h847 cgraph_node *node2, in class()
898 cgraph_node *node2,
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A Dsymbol-summary.h193 static void symtab_duplication (cgraph_node *node, cgraph_node *node2, in class()
269 cgraph_node *node2, void *data) in symtab_duplication() argument
275 summary->duplicate (node, node2, v, summary->get_create (node2)); in symtab_duplication()
402 static void symtab_duplication (cgraph_node *node, cgraph_node *node2,
470 cgraph_node *node2,
478 T *duplicate = summary->get_create (node2);
479 summary->duplicate (node, node2, v, duplicate);
H A Dipa-prop.h847 cgraph_node *node2, in class()
898 cgraph_node *node2,
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/wagyu/0.4.3/include/mapbox/geometry/wagyu/
H A Dintersect_util.hpp19 inline bool operator()(intersect_node<T> const& node1, intersect_node<T> const& node2) { in operator ()()
20 if (!values_are_equal(node2.pt.y, node1.pt.y)) { in operator ()()
21 return node2.pt.y < node1.pt.y; in operator ()()
23 return (node2.bound1->winding_count2 + node2.bound2->winding_count2) > in operator ()()
/OK3568_Linux_fs/kernel/drivers/pci/
H A Dof.c121 struct device_node *node, *node2; in of_pci_find_child_device() local
132 for_each_child_of_node(node, node2) { in of_pci_find_child_device()
133 if (__of_pci_pci_compare(node2, devfn)) { in of_pci_find_child_device()
135 return node2; in of_pci_find_child_device()
/OK3568_Linux_fs/kernel/fs/hfsplus/
H A Dbnode.c402 struct hfs_bnode *node, *node2; in __hfs_bnode_create() local
427 node2 = hfs_bnode_findhash(tree, cnid); in __hfs_bnode_create()
428 if (!node2) { in __hfs_bnode_create()
436 wait_event(node2->lock_wq, in __hfs_bnode_create()
437 !test_bit(HFS_BNODE_NEW, &node2->flags)); in __hfs_bnode_create()
438 return node2; in __hfs_bnode_create()
/OK3568_Linux_fs/kernel/include/linux/
H A Drculist.h551 struct hlist_node *node2 = right->first; in hlists_swap_heads_rcu() local
553 rcu_assign_pointer(left->first, node2); in hlists_swap_heads_rcu()
555 WRITE_ONCE(node2->pprev, &left->first); in hlists_swap_heads_rcu()
/OK3568_Linux_fs/kernel/fs/xfs/libxfs/
H A Dxfs_da_btree.c866 struct xfs_da_intnode *node2; in xfs_da3_node_rebalance() local
883 node2 = blk2->bp->b_addr; in xfs_da3_node_rebalance()
885 xfs_da3_node_hdr_from_disk(dp->i_mount, &nodehdr2, node2); in xfs_da3_node_rebalance()
898 node1 = node2; in xfs_da3_node_rebalance()
899 node2 = tmpnode; in xfs_da3_node_rebalance()
901 xfs_da3_node_hdr_from_disk(dp->i_mount, &nodehdr2, node2); in xfs_da3_node_rebalance()
970 xfs_da3_node_hdr_to_disk(dp->i_mount, node2, &nodehdr2); in xfs_da3_node_rebalance()
972 XFS_DA_LOGRANGE(node2, &node2->hdr, in xfs_da3_node_rebalance()
982 node2 = blk2->bp->b_addr; in xfs_da3_node_rebalance()
984 xfs_da3_node_hdr_from_disk(dp->i_mount, &nodehdr2, node2); in xfs_da3_node_rebalance()
[all …]
/OK3568_Linux_fs/kernel/drivers/scsi/aic7xxx/aicasm/
H A Daicasm_symbol.c299 symbol_node_t *node1, *node2; in symlist_free() local
303 node2 = SLIST_NEXT(node1, links); in symlist_free()
305 node1 = node2; in symlist_free()
/OK3568_Linux_fs/u-boot/drivers/mtd/ubi/
H A Dfastmap.c423 struct rb_node *node, *node2; in unmap_peb() local
429 for (node2 = rb_first(&av->root); node2; in unmap_peb()
430 node2 = rb_next(node2)) { in unmap_peb()
431 aeb = rb_entry(node2, struct ubi_ainf_peb, u.rb); in unmap_peb()
/OK3568_Linux_fs/kernel/Documentation/devicetree/bindings/interrupt-controller/
H A Dmarvell,icu.txt74 node2 {
/OK3568_Linux_fs/kernel/drivers/pci/hotplug/
H A Dcpqphp_ctrl.c816 struct pci_resource *node2; in cpqhp_resource_sort_and_combine() local
849 node2 = node1->next; in cpqhp_resource_sort_and_combine()
852 node2->next = node1->next; in cpqhp_resource_sort_and_combine()
853 node1->next = node2; in cpqhp_resource_sort_and_combine()
866 node2 = node1->next; in cpqhp_resource_sort_and_combine()
868 kfree(node2); in cpqhp_resource_sort_and_combine()
/OK3568_Linux_fs/kernel/drivers/net/ethernet/intel/i40e/
H A Di40e_ethtool.c3222 struct hlist_node *node2; in i40e_get_ethtool_fdir_all() local
3228 hlist_for_each_entry_safe(rule, node2, in i40e_get_ethtool_fdir_all()
3259 struct hlist_node *node2; in i40e_get_ethtool_fdir_entry() local
3263 hlist_for_each_entry_safe(rule, node2, in i40e_get_ethtool_fdir_entry()
3590 struct hlist_node *node2; in i40e_update_ethtool_fdir_entry() local
3596 hlist_for_each_entry_safe(rule, node2, in i40e_update_ethtool_fdir_entry()
4472 struct hlist_node *node2; in i40e_disallow_matching_filters() local
4475 hlist_for_each_entry_safe(rule, node2, in i40e_disallow_matching_filters()
4719 struct hlist_node *node2; in i40e_set_channels() local
4748 hlist_for_each_entry_safe(rule, node2, in i40e_set_channels()
/OK3568_Linux_fs/kernel/scripts/gcc-plugins/
H A Dgcc-common.h827 static inline void cgraph_call_node_duplication_hooks(cgraph_node_ptr node, cgraph_node_ptr node2) in cgraph_call_node_duplication_hooks() argument
829 symtab->call_cgraph_duplication_hooks(node, node2); in cgraph_call_node_duplication_hooks()
/OK3568_Linux_fs/kernel/drivers/gpu/drm/selftests/
H A Dtest-drm_mm.c1274 const char *node1 = NULL, *node2 = NULL; in show_holes() local
1282 node2 = kasprintf(GFP_KERNEL, in show_holes()
1289 node2); in show_holes()
1291 kfree(node2); in show_holes()
/OK3568_Linux_fs/kernel/drivers/net/ethernet/intel/ixgbe/
H A Dixgbe_ethtool.c2515 struct hlist_node *node2; in ixgbe_get_ethtool_fdir_entry() local
2521 hlist_for_each_entry_safe(rule, node2, in ixgbe_get_ethtool_fdir_entry()
2582 struct hlist_node *node2; in ixgbe_get_ethtool_fdir_all() local
2589 hlist_for_each_entry_safe(rule, node2, in ixgbe_get_ethtool_fdir_all()
2680 struct hlist_node *node2; in ixgbe_update_ethtool_fdir_entry() local
2687 hlist_for_each_entry_safe(rule, node2, in ixgbe_update_ethtool_fdir_entry()
/OK3568_Linux_fs/kernel/lib/842/
H A D842_compress.c106 struct sw842_hlist_node2 node2[1 << I2_BITS]; member
/OK3568_Linux_fs/kernel/drivers/mtd/ubi/
H A Dfastmap.c373 struct rb_node *node, *node2; in unmap_peb() local
377 ubi_rb_for_each_entry(node2, aeb, &av->root, u.rb) { in unmap_peb()
/OK3568_Linux_fs/kernel/tools/perf/
H A Dbuiltin-kmem.c196 node2 = evsel__intval(evsel, sample, "node"); in evsel__process_alloc_node_event() local
198 if (node1 != node2) in evsel__process_alloc_node_event()
/OK3568_Linux_fs/kernel/fs/ext4/
H A Dnamei.c2487 struct dx_node *node2; in ext4_dx_add_entry() local
2519 node2 = (struct dx_node *)(bh2->b_data); in ext4_dx_add_entry()
2520 entries2 = node2->entries; in ext4_dx_add_entry()
2521 memset(&node2->fake, 0, sizeof(struct fake_dirent)); in ext4_dx_add_entry()
2522 node2->fake.rec_len = ext4_rec_len_to_disk(sb->s_blocksize, in ext4_dx_add_entry()

12