/linux-master/drivers/android/ |
H A D | binder_internal.h | 177 * @rb_node: element for proc->nodes tree 228 * Bookkeeping structure for binder nodes. 298 * struct binder_ref - struct to track references on nodes 333 * @nodes: rbtree of binder nodes associated with 405 struct rb_root nodes; member in struct:binder_proc 548 * @fbo: binder object (nodes and refs)
|
H A D | binder.c | 22 * (proc->threads, proc->waiting_threads, proc->nodes) 698 struct rb_node *n = proc->nodes.rb_node; 739 struct rb_node **p = &proc->nodes.rb_node; 771 rb_insert_color(&node->rb_node, &proc->nodes); 911 rb_erase(&node->rb_node, &proc->nodes); 970 * print nodes) 4550 rb_erase(&node->rb_node, &proc->nodes); 5213 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) { 5833 int threads, nodes, incoming_refs, outgoing_refs, active_transactions; local 5871 nodes [all...] |
/linux-master/fs/dlm/ |
H A D | recoverd.c | 72 * Add or remove nodes from the lockspace's ls_nodes list. 103 * nodes their master rsb names that hash to us. 138 * Clear lkb's for departed nodes. 145 * departed nodes. 202 * rebuild and will be resent by the requesting nodes. 295 kfree(rv->nodes);
|
/linux-master/fs/btrfs/tests/ |
H A D | extent-buffer-tests.c | 52 path->nodes[0] = eb;
|
/linux-master/include/linux/ |
H A D | mempolicy.h | 50 nodemask_t nodes; /* interleave/bind/perfer */ member in struct:mempolicy 54 nodemask_t cpuset_mems_allowed; /* relative to these nodes */
|
/linux-master/fs/ubifs/ |
H A D | replay.c | 41 * sorts the replay list in nodes sequence number order, and then inserts all 584 * with the authentication nodes on this LEB. Authentication nodes are written 588 * because a powercut happened when some nodes were written but not the 589 * corresponding authentication node. This function returns the number of nodes 605 list_for_each_entry(snod, &sleb->nodes, list) { 637 * A powercut can happen when some nodes were written, but not yet 643 dbg_mnt("%d unauthenticated nodes found on LEB %d, Ignoring them", 647 dbg_mnt("%d unauthenticated nodes found on non-last LEB %d", 663 * This function replays bud @bud, recovers it if needed, and adds all nodes [all...] |
H A D | master.c | 16 * ubifs_compare_master_node - compare two UBIFS master nodes 21 * This function compares two UBIFS master nodes. Returns 0 if they are equal 57 * Note that we have two master nodes on a UBIFS image which have different 59 * both master nodes we exclude the common node header containing the sequence 103 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, 121 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, list);
|
H A D | auth.c | 55 * @inhash: input hash of previous nodes 210 snod = list_first_entry(&sleb->nodes, struct ubifs_scan_node, list);
|
/linux-master/drivers/interconnect/qcom/ |
H A D | msm8939.c | 1284 .nodes = msm8939_snoc_nodes, 1305 .nodes = msm8939_snoc_mm_nodes, 1334 .nodes = msm8939_bimc_nodes, 1406 .nodes = msm8939_pcnoc_nodes,
|
H A D | msm8916.c | 1231 .nodes = msm8916_snoc_nodes, 1260 .nodes = msm8916_bimc_nodes, 1330 .nodes = msm8916_pcnoc_nodes,
|
H A D | msm8909.c | 1191 .nodes = msm8909_bimc_nodes, 1259 .nodes = msm8909_pcnoc_nodes, 1302 .nodes = msm8909_snoc_nodes,
|
/linux-master/fs/btrfs/ |
H A D | dev-replace.c | 129 eb = path->nodes[0]; 381 btrfs_item_size(path->nodes[0], path->slots[0]) < sizeof(*ptr)) { 415 eb = path->nodes[0]; 514 struct extent_buffer *leaf = path->nodes[0];
|
H A D | extent_io.c | 1577 * btree nodes/leafs whose content on disk is invalid - either garbage 2745 struct extent_buffer *clone = path->nodes[0]; 2751 if (path->slots[0] < btrfs_header_nritems(path->nodes[0])) 2770 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 2777 copy_extent_buffer_full(clone, path->nodes[0]); 2782 clone->start = path->nodes[0]->start; 2786 path->nodes[0] = clone; 2819 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0] - 1); 2824 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { 2829 btrfs_item_key_to_cpu(path->nodes[ [all...] |
H A D | super.c | 796 root_ref = btrfs_item_ptr(path->nodes[0], path->slots[0], 798 len = btrfs_root_ref_name_len(path->nodes[0], root_ref); 804 read_extent_buffer(path->nodes[0], ptr + 1, 807 dirid = btrfs_root_ref_dirid(path->nodes[0], root_ref); 836 inode_ref = btrfs_item_ptr(path->nodes[0], 839 len = btrfs_inode_ref_name_len(path->nodes[0], 846 read_extent_buffer(path->nodes[0], ptr + 1, 906 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &location);
|
H A D | file.c | 257 leaf = path->nodes[0]; 265 leaf = path->nodes[0]; 275 leaf = path->nodes[0]; 360 leaf = path->nodes[0]; 522 leaf = path->nodes[0]; 637 leaf = path->nodes[0]; 735 leaf = path->nodes[0]; 2110 leaf = path->nodes[0]; 2280 leaf = path->nodes[0]; 3545 btrfs_item_key_to_cpu(path->nodes[ [all...] |
H A D | volumes.c | 1662 l = path->nodes[0]; 1783 leaf = path->nodes[0]; 1793 leaf = path->nodes[0]; 1861 btrfs_item_key_to_cpu(path->nodes[0], &found_key, 1900 leaf = path->nodes[0]; 2588 leaf = path->nodes[0]; 2596 leaf = path->nodes[0]; 2908 leaf = path->nodes[0]; 3470 leaf = path->nodes[0]; 3615 leaf = path->nodes[ [all...] |
H A D | ioctl.c | 1588 leaf = path->nodes[0]; 1883 l = path->nodes[0]; 1968 leaf = path->nodes[0]; 1994 leaf = path->nodes[0]; 2053 leaf = path->nodes[0]; 2233 btrfs_header_nritems(path->nodes[0])) { 2243 leaf = path->nodes[0]; 2316 btrfs_header_nritems(path->nodes[0])) { 2326 leaf = path->nodes[0]; 3014 btrfs_set_dir_item_key(path->nodes[ [all...] |
/linux-master/mm/ |
H A D | migrate.c | 2173 * Migrate an array of page address onto an array of nodes and fill 2179 const int __user *nodes, 2206 if (get_user(node, nodes + i)) 2280 * Determine the nodes of an array of pages and store it in an array of status. 2342 * Determine the nodes of a user array of pages and store it in 2431 const int __user *nodes, 2449 if (nodes) 2451 nodes, status, flags); 2461 const int __user *, nodes, 2464 return kernel_move_pages(pid, nr_pages, pages, nodes, statu 2176 do_pages_move(struct mm_struct *mm, nodemask_t task_nodes, unsigned long nr_pages, const void __user * __user *pages, const int __user *nodes, int __user *status, int flags) argument 2429 kernel_move_pages(pid_t pid, unsigned long nr_pages, const void __user * __user *pages, const int __user *nodes, int __user *status, int flags) argument [all...] |
H A D | slub.c | 442 * Iterator over all nodes. The body will be executed for each node that has 443 * a kmem_cache_node structure allocated (which is true for all online nodes) 450 * Tracks for which NUMA nodes we have kmem_cache_nodes allocated. 2643 * instead of attempting to obtain partial slabs from other nodes. 2648 * from other nodes and filled up. 2652 * allocation will first attempt to defrag slab caches on other nodes. 2653 * This means scanning over all nodes to look for partial slabs which 5521 * XXX: kmem_cache_alloc_node will fallback to other nodes 5828 nodemask_t nodes; member in struct:location 5917 node_set(page_to_nid(virt_to_page(track)), l->nodes); 5999 unsigned long *nodes; local [all...] |
/linux-master/drivers/net/ethernet/hisilicon/hns3/hns3pf/ |
H A D | hclge_debugfs.c | 932 struct hclge_tm_nodes_cmd *nodes; local 941 "failed to dump tm nodes, ret = %d\n", ret); 945 nodes = (struct hclge_tm_nodes_cmd *)desc.data; 949 nodes->pg_base_id, nodes->pg_num); 951 nodes->pri_base_id, nodes->pri_num); 953 le16_to_cpu(nodes->qset_base_id), 954 le16_to_cpu(nodes->qset_num)); 956 le16_to_cpu(nodes [all...] |
/linux-master/drivers/net/wireless/broadcom/brcm80211/brcmfmac/ |
H A D | fwsignal.c | 447 struct brcmf_fws_mac_descriptor nodes[BRCMF_FWS_MAC_DESC_TABLE_SIZE]; member in struct:brcmf_fws_macdesc_table 736 entry = &fws->desc.nodes[0]; 737 for (i = 0; i < ARRAY_SIZE(fws->desc.nodes); i++) { 847 /* cleanup individual nodes */ 848 table = &fws->desc.nodes[0]; 849 for (i = 0; i < ARRAY_SIZE(fws->desc.nodes); i++) 997 entry = &fws->desc.nodes[mac_handle & 0x1F]; 1054 entry = &fws->desc.nodes[mac_handle & 0x1F]; 1128 entry = &fws->desc.nodes[data[1] & 0x1F];
|
/linux-master/drivers/acpi/acpica/ |
H A D | dbnames.c | 244 * PARAMETERS: owner_arg - Owner ID whose nodes will be displayed 465 /* Search all nodes in namespace */ 775 info->nodes++; 838 /* Search all nodes in namespace */ 844 acpi_os_printf("Verified %u namespace nodes with %u Objects\n", 845 info.nodes, info.objects); 912 /* Search all nodes in namespace */ 1034 /* Search all nodes in namespace */
|
/linux-master/fs/jffs2/ |
H A D | build.c | 95 - Scan physical nodes. Build map of inodes/dirents. Allocate inocaches as we go 109 lists of physical nodes */ 251 raw = ic->nodes; 307 The erase code will do that, when all the nodes are completely gone. 322 of the medium to be available, for overhead caused by nodes being 335 /* When do we allow garbage collection to merge nodes to make 345 can't mark nodes obsolete on the medium, the old dirty nodes cause
|
/linux-master/arch/x86/events/amd/ |
H A D | ibs.c | 1353 int nodes; local 1356 nodes = 0; 1364 ++nodes; 1376 if (!nodes) { 1387 * success we initialize all nodes with this offset. This updates then
|
/linux-master/drivers/memory/tegra/ |
H A D | tegra186-emc.c | 245 list_for_each_entry(node, &provider->nodes, node_list) {
|