new_node 376 drivers/acpi/acpica/dswload2.c struct acpi_namespace_node *new_node; new_node 711 drivers/acpi/acpica/dswload2.c &(new_node)); new_node 718 drivers/acpi/acpica/dswload2.c if (new_node->type != ACPI_TYPE_METHOD) { new_node 726 drivers/acpi/acpica/dswload2.c op->common.node = new_node; new_node 38 drivers/acpi/acpica/nsaccess.c struct acpi_namespace_node *new_node; new_node 101 drivers/acpi/acpica/nsaccess.c new_node = new_node 103 drivers/acpi/acpica/nsaccess.c if (!new_node) { new_node 108 drivers/acpi/acpica/nsaccess.c ACPI_COPY_NAMESEG(new_node->name.ascii, init_val->name); new_node 109 drivers/acpi/acpica/nsaccess.c new_node->descriptor_type = ACPI_DESC_TYPE_NAMED; new_node 110 drivers/acpi/acpica/nsaccess.c new_node->type = init_val->type; new_node 113 drivers/acpi/acpica/nsaccess.c acpi_gbl_root_node_struct.child = new_node; new_node 115 drivers/acpi/acpica/nsaccess.c prev_node->peer = new_node; new_node 118 drivers/acpi/acpica/nsaccess.c new_node->parent = &acpi_gbl_root_node_struct; new_node 119 drivers/acpi/acpica/nsaccess.c prev_node = new_node; new_node 164 drivers/acpi/acpica/nsaccess.c new_node->value = obj_desc->method.param_count; new_node 191 drivers/acpi/acpica/nsaccess.c obj_desc->mutex.node = new_node; new_node 235 drivers/acpi/acpica/nsaccess.c status = acpi_ns_attach_object(new_node, obj_desc, new_node 259 drivers/acpi/acpica/nssearch.c struct acpi_namespace_node *new_node; new_node 373 drivers/acpi/acpica/nssearch.c new_node = acpi_ns_create_node(target_name); new_node 374 drivers/acpi/acpica/nssearch.c if (!new_node) { new_node 383 drivers/acpi/acpica/nssearch.c new_node->flags |= ANOBJ_IS_EXTERNAL; new_node 388 drivers/acpi/acpica/nssearch.c new_node->flags |= ANOBJ_TEMPORARY; new_node 393 drivers/acpi/acpica/nssearch.c acpi_ns_install_node(walk_state, node, new_node, type); new_node 394 drivers/acpi/acpica/nssearch.c *return_node = new_node; new_node 1105 drivers/android/binder.c struct binder_node *new_node, new_node 1136 drivers/android/binder.c node = new_node; new_node 1164 drivers/android/binder.c struct binder_node *new_node = kzalloc(sizeof(*node), GFP_KERNEL); new_node 1166 drivers/android/binder.c if (!new_node) new_node 1169 drivers/android/binder.c node = binder_init_node_ilocked(proc, new_node, fp); new_node 1171 drivers/android/binder.c if (node != new_node) new_node 1175 drivers/android/binder.c kfree(new_node); new_node 4896 drivers/android/binder.c struct binder_node *new_node; new_node 4920 drivers/android/binder.c new_node = binder_new_node(proc, fbo); new_node 4921 drivers/android/binder.c if (!new_node) { new_node 4925 drivers/android/binder.c binder_node_lock(new_node); new_node 4926 drivers/android/binder.c new_node->local_weak_refs++; new_node 4927 drivers/android/binder.c new_node->local_strong_refs++; new_node 4928 drivers/android/binder.c new_node->has_strong_ref = 1; new_node 4929 drivers/android/binder.c new_node->has_weak_ref = 1; new_node 4930 drivers/android/binder.c context->binder_context_mgr_node = new_node; new_node 4931 drivers/android/binder.c binder_node_unlock(new_node); new_node 4932 drivers/android/binder.c binder_put_node(new_node); new_node 382 drivers/gpu/drm/amd/amdgpu/amdgpu_mn.c struct amdgpu_mn_node *node = NULL, *new_node; new_node 390 drivers/gpu/drm/amd/amdgpu/amdgpu_mn.c new_node = kmalloc(sizeof(*new_node), GFP_KERNEL); new_node 391 drivers/gpu/drm/amd/amdgpu/amdgpu_mn.c if (!new_node) new_node 408 drivers/gpu/drm/amd/amdgpu/amdgpu_mn.c node = new_node; new_node 410 drivers/gpu/drm/amd/amdgpu/amdgpu_mn.c kfree(new_node); new_node 207 drivers/infiniband/ulp/opa_vnic/opa_vnic_encap.c struct opa_vnic_mac_tbl_node *node, *new_node; new_node 268 drivers/infiniband/ulp/opa_vnic/opa_vnic_encap.c new_node = kzalloc(sizeof(*new_node), GFP_KERNEL); new_node 269 drivers/infiniband/ulp/opa_vnic/opa_vnic_encap.c if (!new_node) { new_node 274 drivers/infiniband/ulp/opa_vnic/opa_vnic_encap.c new_node->index = node->index; new_node 275 drivers/infiniband/ulp/opa_vnic/opa_vnic_encap.c memcpy(&new_node->entry, &node->entry, sizeof(node->entry)); new_node 276 drivers/infiniband/ulp/opa_vnic/opa_vnic_encap.c key = new_node->entry.mac_addr[OPA_VNIC_MAC_HASH_IDX]; new_node 277 drivers/infiniband/ulp/opa_vnic/opa_vnic_encap.c vnic_hash_add(new_mactbl, &new_node->hlist, key); new_node 85 drivers/media/dvb-frontends/stv0900_core.c struct stv0900_inode *new_node = stv0900_first_inode; new_node 87 drivers/media/dvb-frontends/stv0900_core.c if (new_node == NULL) { new_node 88 drivers/media/dvb-frontends/stv0900_core.c new_node = kmalloc(sizeof(struct stv0900_inode), GFP_KERNEL); new_node 89 drivers/media/dvb-frontends/stv0900_core.c stv0900_first_inode = new_node; new_node 91 drivers/media/dvb-frontends/stv0900_core.c while (new_node->next_inode != NULL) new_node 92 drivers/media/dvb-frontends/stv0900_core.c new_node = new_node->next_inode; new_node 94 drivers/media/dvb-frontends/stv0900_core.c new_node->next_inode = kmalloc(sizeof(struct stv0900_inode), new_node 96 drivers/media/dvb-frontends/stv0900_core.c if (new_node->next_inode != NULL) new_node 97 drivers/media/dvb-frontends/stv0900_core.c new_node = new_node->next_inode; new_node 99 drivers/media/dvb-frontends/stv0900_core.c new_node = NULL; new_node 102 drivers/media/dvb-frontends/stv0900_core.c if (new_node != NULL) { new_node 103 drivers/media/dvb-frontends/stv0900_core.c new_node->internal = internal; new_node 104 drivers/media/dvb-frontends/stv0900_core.c new_node->next_inode = NULL; new_node 107 drivers/media/dvb-frontends/stv0900_core.c return new_node; new_node 224 drivers/media/pci/cx23885/altera-ci.c struct fpga_inode *new_node = fpga_first_inode; new_node 226 drivers/media/pci/cx23885/altera-ci.c if (new_node == NULL) { new_node 227 drivers/media/pci/cx23885/altera-ci.c new_node = kmalloc(sizeof(struct fpga_inode), GFP_KERNEL); new_node 228 drivers/media/pci/cx23885/altera-ci.c fpga_first_inode = new_node; new_node 230 drivers/media/pci/cx23885/altera-ci.c while (new_node->next_inode != NULL) new_node 231 drivers/media/pci/cx23885/altera-ci.c new_node = new_node->next_inode; new_node 233 drivers/media/pci/cx23885/altera-ci.c new_node->next_inode = new_node 235 drivers/media/pci/cx23885/altera-ci.c if (new_node->next_inode != NULL) new_node 236 drivers/media/pci/cx23885/altera-ci.c new_node = new_node->next_inode; new_node 238 drivers/media/pci/cx23885/altera-ci.c new_node = NULL; new_node 241 drivers/media/pci/cx23885/altera-ci.c if (new_node != NULL) { new_node 242 drivers/media/pci/cx23885/altera-ci.c new_node->internal = internal; new_node 243 drivers/media/pci/cx23885/altera-ci.c new_node->next_inode = NULL; new_node 246 drivers/media/pci/cx23885/altera-ci.c return new_node; new_node 1252 drivers/net/ethernet/broadcom/bnxt/bnxt_tc.c struct bnxt_tc_flow_node *new_node, *old_node; new_node 1260 drivers/net/ethernet/broadcom/bnxt/bnxt_tc.c new_node = kzalloc(sizeof(*new_node), GFP_KERNEL); new_node 1261 drivers/net/ethernet/broadcom/bnxt/bnxt_tc.c if (!new_node) { new_node 1265 drivers/net/ethernet/broadcom/bnxt/bnxt_tc.c new_node->cookie = tc_flow_cmd->cookie; new_node 1266 drivers/net/ethernet/broadcom/bnxt/bnxt_tc.c flow = &new_node->flow; new_node 1291 drivers/net/ethernet/broadcom/bnxt/bnxt_tc.c rc = bnxt_tc_get_ref_flow_handle(bp, flow, new_node, &ref_flow_handle); new_node 1296 drivers/net/ethernet/broadcom/bnxt/bnxt_tc.c rc = bnxt_tc_get_tunnel_handle(bp, flow, new_node, &tunnel_handle); new_node 1302 drivers/net/ethernet/broadcom/bnxt/bnxt_tc.c tunnel_handle, new_node); new_node 1309 drivers/net/ethernet/broadcom/bnxt/bnxt_tc.c rc = rhashtable_insert_fast(&tc_info->flow_table, &new_node->node, new_node 1318 drivers/net/ethernet/broadcom/bnxt/bnxt_tc.c bnxt_hwrm_cfa_flow_free(bp, new_node); new_node 1320 drivers/net/ethernet/broadcom/bnxt/bnxt_tc.c bnxt_tc_put_tunnel_handle(bp, flow, new_node); new_node 1322 drivers/net/ethernet/broadcom/bnxt/bnxt_tc.c bnxt_tc_put_l2_node(bp, new_node); new_node 1326 drivers/net/ethernet/broadcom/bnxt/bnxt_tc.c kfree_rcu(new_node, rcu); new_node 661 drivers/net/ethernet/intel/ice/ice_sched.c struct ice_sched_node *prev, *new_node; new_node 714 drivers/net/ethernet/intel/ice/ice_sched.c new_node = ice_sched_find_node_by_teid(parent, teid); new_node 715 drivers/net/ethernet/intel/ice/ice_sched.c if (!new_node) { new_node 721 drivers/net/ethernet/intel/ice/ice_sched.c new_node->sibling = NULL; new_node 722 drivers/net/ethernet/intel/ice/ice_sched.c new_node->tc_num = tc_node->tc_num; new_node 727 drivers/net/ethernet/intel/ice/ice_sched.c if (prev && prev != new_node) { new_node 730 drivers/net/ethernet/intel/ice/ice_sched.c prev->sibling = new_node; new_node 735 drivers/net/ethernet/intel/ice/ice_sched.c pi->sib_head[tc_node->tc_num][layer] = new_node; new_node 90 drivers/net/ethernet/mellanox/mlx5/core/ipoib/ipoib_vlan.c struct qpn_to_netdev *new_node; new_node 92 drivers/net/ethernet/mellanox/mlx5/core/ipoib/ipoib_vlan.c new_node = kzalloc(sizeof(*new_node), GFP_KERNEL); new_node 93 drivers/net/ethernet/mellanox/mlx5/core/ipoib/ipoib_vlan.c if (!new_node) new_node 96 drivers/net/ethernet/mellanox/mlx5/core/ipoib/ipoib_vlan.c new_node->netdev = netdev; new_node 97 drivers/net/ethernet/mellanox/mlx5/core/ipoib/ipoib_vlan.c new_node->underlay_qpn = qpn; new_node 99 drivers/net/ethernet/mellanox/mlx5/core/ipoib/ipoib_vlan.c hlist_add_head(&new_node->hlist, &ht->buckets[key]); new_node 559 drivers/net/wireless/marvell/mwifiex/11n.c struct mwifiex_tx_ba_stream_tbl *new_node; new_node 564 drivers/net/wireless/marvell/mwifiex/11n.c new_node = kzalloc(sizeof(struct mwifiex_tx_ba_stream_tbl), new_node 566 drivers/net/wireless/marvell/mwifiex/11n.c if (!new_node) new_node 575 drivers/net/wireless/marvell/mwifiex/11n.c INIT_LIST_HEAD(&new_node->list); new_node 577 drivers/net/wireless/marvell/mwifiex/11n.c new_node->tid = tid; new_node 578 drivers/net/wireless/marvell/mwifiex/11n.c new_node->ba_status = ba_status; new_node 579 drivers/net/wireless/marvell/mwifiex/11n.c memcpy(new_node->ra, ra, ETH_ALEN); new_node 582 drivers/net/wireless/marvell/mwifiex/11n.c list_add_tail(&new_node->list, &priv->tx_ba_stream_tbl_ptr); new_node 345 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c struct mwifiex_rx_reorder_tbl *tbl, *new_node; new_node 359 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c new_node = kzalloc(sizeof(struct mwifiex_rx_reorder_tbl), GFP_KERNEL); new_node 360 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c if (!new_node) new_node 363 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c INIT_LIST_HEAD(&new_node->list); new_node 364 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c new_node->tid = tid; new_node 365 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c memcpy(new_node->ta, ta, ETH_ALEN); new_node 366 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c new_node->start_win = seq_num; new_node 367 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c new_node->init_win = seq_num; new_node 368 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c new_node->flags = 0; new_node 388 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c last_seq, new_node->start_win); new_node 391 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c last_seq >= new_node->start_win) { new_node 392 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c new_node->start_win = last_seq + 1; new_node 393 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c new_node->flags |= RXREOR_INIT_WINDOW_SHIFT; new_node 396 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c new_node->win_size = win_size; new_node 398 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c new_node->rx_reorder_ptr = kcalloc(win_size, sizeof(void *), new_node 400 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c if (!new_node->rx_reorder_ptr) { new_node 401 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c kfree((u8 *) new_node); new_node 407 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c new_node->timer_context.ptr = new_node; new_node 408 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c new_node->timer_context.priv = priv; new_node 409 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c new_node->timer_context.timer_is_set = false; new_node 411 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c timer_setup(&new_node->timer_context.timer, mwifiex_flush_data, 0); new_node 414 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c new_node->rx_reorder_ptr[i] = NULL; new_node 417 drivers/net/wireless/marvell/mwifiex/11n_rxreorder.c list_add_tail(&new_node->list, &priv->rx_reorder_tbl_ptr); new_node 1209 fs/btrfs/relocation.c struct backref_node *new_node; new_node 1239 fs/btrfs/relocation.c new_node = alloc_backref_node(cache); new_node 1240 fs/btrfs/relocation.c if (!new_node) new_node 1243 fs/btrfs/relocation.c new_node->bytenr = dest->node->start; new_node 1244 fs/btrfs/relocation.c new_node->level = node->level; new_node 1245 fs/btrfs/relocation.c new_node->lowest = node->lowest; new_node 1246 fs/btrfs/relocation.c new_node->checked = 1; new_node 1247 fs/btrfs/relocation.c new_node->root = dest; new_node 1255 fs/btrfs/relocation.c new_edge->node[UPPER] = new_node; new_node 1258 fs/btrfs/relocation.c &new_node->lower); new_node 1261 fs/btrfs/relocation.c list_add_tail(&new_node->lower, &cache->leaves); new_node 1264 fs/btrfs/relocation.c rb_node = tree_insert(&cache->rb_root, new_node->bytenr, new_node 1265 fs/btrfs/relocation.c &new_node->rb_node); new_node 1267 fs/btrfs/relocation.c backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); new_node 1269 fs/btrfs/relocation.c if (!new_node->lowest) { new_node 1270 fs/btrfs/relocation.c list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { new_node 1277 fs/btrfs/relocation.c while (!list_empty(&new_node->lower)) { new_node 1278 fs/btrfs/relocation.c new_edge = list_entry(new_node->lower.next, new_node 1283 fs/btrfs/relocation.c free_backref_node(cache, new_node); new_node 371 fs/dlm/lowcomms.c struct dlm_node_addr *new_node, *na; new_node 373 fs/dlm/lowcomms.c new_node = kzalloc(sizeof(struct dlm_node_addr), GFP_NOFS); new_node 374 fs/dlm/lowcomms.c if (!new_node) new_node 379 fs/dlm/lowcomms.c kfree(new_node); new_node 388 fs/dlm/lowcomms.c new_node->nodeid = nodeid; new_node 389 fs/dlm/lowcomms.c new_node->addr[0] = new_addr; new_node 390 fs/dlm/lowcomms.c new_node->addr_count = 1; new_node 391 fs/dlm/lowcomms.c list_add(&new_node->list, &dlm_node_addrs); new_node 399 fs/dlm/lowcomms.c kfree(new_node); new_node 405 fs/dlm/lowcomms.c kfree(new_node); new_node 73 fs/ext4/block_validity.c struct rb_node *parent = NULL, *new_node = NULL; new_node 87 fs/ext4/block_validity.c new_node = *n; new_node 88 fs/ext4/block_validity.c new_entry = rb_entry(new_node, struct ext4_system_zone, new_node 101 fs/ext4/block_validity.c new_node = &new_entry->node; new_node 103 fs/ext4/block_validity.c rb_link_node(new_node, parent, n); new_node 104 fs/ext4/block_validity.c rb_insert_color(new_node, &system_blks->root); new_node 108 fs/ext4/block_validity.c node = rb_prev(new_node); new_node 120 fs/ext4/block_validity.c node = rb_next(new_node); new_node 4657 fs/ext4/mballoc.c struct rb_node *parent = NULL, *new_node; new_node 4663 fs/ext4/mballoc.c new_node = &new_entry->efd_node; new_node 4691 fs/ext4/mballoc.c rb_link_node(new_node, parent, n); new_node 4692 fs/ext4/mballoc.c rb_insert_color(new_node, &db->bb_free_root); new_node 4695 fs/ext4/mballoc.c node = rb_prev(new_node); new_node 4702 fs/ext4/mballoc.c node = rb_next(new_node); new_node 68 fs/hfs/brec.c struct hfs_bnode *node, *new_node; new_node 84 fs/hfs/brec.c new_node = NULL; new_node 100 fs/hfs/brec.c if (new_node) new_node 102 fs/hfs/brec.c new_node = hfs_bnode_split(fd); new_node 103 fs/hfs/brec.c if (IS_ERR(new_node)) new_node 104 fs/hfs/brec.c return PTR_ERR(new_node); new_node 140 fs/hfs/brec.c if (!rec && new_node != node) { new_node 145 fs/hfs/brec.c if (new_node) { new_node 147 fs/hfs/brec.c if (!new_node->parent) { new_node 149 fs/hfs/brec.c new_node->parent = tree->root; new_node 151 fs/hfs/brec.c fd->bnode = hfs_bnode_find(tree, new_node->parent); new_node 154 fs/hfs/brec.c cnid = cpu_to_be32(new_node->this); new_node 159 fs/hfs/brec.c hfs_bnode_read_key(new_node, fd->search_key, 14); new_node 162 fs/hfs/brec.c hfs_bnode_put(new_node); new_node 163 fs/hfs/brec.c new_node = NULL; new_node 234 fs/hfs/brec.c struct hfs_bnode *node, *new_node, *next_node; new_node 241 fs/hfs/brec.c new_node = hfs_bmap_alloc(tree); new_node 242 fs/hfs/brec.c if (IS_ERR(new_node)) new_node 243 fs/hfs/brec.c return new_node; new_node 246 fs/hfs/brec.c node->this, new_node->this, node->next); new_node 247 fs/hfs/brec.c new_node->next = node->next; new_node 248 fs/hfs/brec.c new_node->prev = node->this; new_node 249 fs/hfs/brec.c new_node->parent = node->parent; new_node 250 fs/hfs/brec.c new_node->type = node->type; new_node 251 fs/hfs/brec.c new_node->height = node->height; new_node 260 fs/hfs/brec.c hfs_bnode_put(new_node); new_node 276 fs/hfs/brec.c hfs_bnode_put(new_node); new_node 291 fs/hfs/brec.c hfs_bnode_get(new_node); new_node 292 fs/hfs/brec.c fd->bnode = new_node; new_node 297 fs/hfs/brec.c new_node->num_recs = node->num_recs - num_recs; new_node 303 fs/hfs/brec.c num_recs = new_node->num_recs; new_node 306 fs/hfs/brec.c hfs_bnode_write_u16(new_node, new_rec_off, new_off); new_node 313 fs/hfs/brec.c hfs_bnode_write_u16(new_node, new_rec_off, new_off); new_node 314 fs/hfs/brec.c hfs_bnode_copy(new_node, 14, node, data_start, data_end - data_start); new_node 317 fs/hfs/brec.c node_desc.next = cpu_to_be32(new_node->next); new_node 318 fs/hfs/brec.c node_desc.prev = cpu_to_be32(new_node->prev); new_node 319 fs/hfs/brec.c node_desc.type = new_node->type; new_node 320 fs/hfs/brec.c node_desc.height = new_node->height; new_node 321 fs/hfs/brec.c node_desc.num_recs = cpu_to_be16(new_node->num_recs); new_node 323 fs/hfs/brec.c hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc)); new_node 326 fs/hfs/brec.c node->next = new_node->this; new_node 334 fs/hfs/brec.c next_node->prev = new_node->this; new_node 341 fs/hfs/brec.c tree->leaf_tail = new_node->this; new_node 346 fs/hfs/brec.c hfs_bnode_dump(new_node); new_node 349 fs/hfs/brec.c return new_node; new_node 355 fs/hfs/brec.c struct hfs_bnode *node, *new_node, *parent; new_node 362 fs/hfs/brec.c new_node = NULL; new_node 395 fs/hfs/brec.c new_node = hfs_bnode_split(fd); new_node 396 fs/hfs/brec.c if (IS_ERR(new_node)) new_node 397 fs/hfs/brec.c return PTR_ERR(new_node); new_node 425 fs/hfs/brec.c if (new_node) { new_node 428 fs/hfs/brec.c if (!new_node->parent) { new_node 430 fs/hfs/brec.c new_node->parent = tree->root; new_node 432 fs/hfs/brec.c fd->bnode = hfs_bnode_find(tree, new_node->parent); new_node 434 fs/hfs/brec.c hfs_bnode_read_key(new_node, fd->search_key, 14); new_node 435 fs/hfs/brec.c cnid = cpu_to_be32(new_node->this); new_node 440 fs/hfs/brec.c hfs_bnode_put(new_node); new_node 443 fs/hfs/brec.c if (new_node == node) new_node 448 fs/hfs/brec.c new_node = NULL; new_node 460 fs/hfs/brec.c struct hfs_bnode *node, *new_node; new_node 471 fs/hfs/brec.c new_node = hfs_bmap_alloc(tree); new_node 472 fs/hfs/brec.c if (IS_ERR(new_node)) { new_node 474 fs/hfs/brec.c return PTR_ERR(new_node); new_node 477 fs/hfs/brec.c tree->root = new_node->this; new_node 479 fs/hfs/brec.c tree->leaf_head = tree->leaf_tail = new_node->this; new_node 480 fs/hfs/brec.c new_node->type = HFS_NODE_LEAF; new_node 481 fs/hfs/brec.c new_node->num_recs = 0; new_node 483 fs/hfs/brec.c new_node->type = HFS_NODE_INDEX; new_node 484 fs/hfs/brec.c new_node->num_recs = 1; new_node 486 fs/hfs/brec.c new_node->parent = 0; new_node 487 fs/hfs/brec.c new_node->next = 0; new_node 488 fs/hfs/brec.c new_node->prev = 0; new_node 489 fs/hfs/brec.c new_node->height = ++tree->depth; new_node 491 fs/hfs/brec.c node_desc.next = cpu_to_be32(new_node->next); new_node 492 fs/hfs/brec.c node_desc.prev = cpu_to_be32(new_node->prev); new_node 493 fs/hfs/brec.c node_desc.type = new_node->type; new_node 494 fs/hfs/brec.c node_desc.height = new_node->height; new_node 495 fs/hfs/brec.c node_desc.num_recs = cpu_to_be16(new_node->num_recs); new_node 497 fs/hfs/brec.c hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc)); new_node 500 fs/hfs/brec.c hfs_bnode_write_u16(new_node, rec, 14); new_node 510 fs/hfs/brec.c hfs_bnode_copy(new_node, 14, node, 14, key_size); new_node 514 fs/hfs/brec.c hfs_bnode_write_u8(new_node, 14, tree->max_key_len); new_node 518 fs/hfs/brec.c hfs_bnode_write(new_node, &cnid, 14 + key_size, 4); new_node 521 fs/hfs/brec.c hfs_bnode_write_u16(new_node, rec, 14 + key_size + 4); new_node 525 fs/hfs/brec.c hfs_bnode_put(new_node); new_node 66 fs/hfsplus/brec.c struct hfs_bnode *node, *new_node; new_node 82 fs/hfsplus/brec.c new_node = NULL; new_node 98 fs/hfsplus/brec.c if (new_node) new_node 100 fs/hfsplus/brec.c new_node = hfs_bnode_split(fd); new_node 101 fs/hfsplus/brec.c if (IS_ERR(new_node)) new_node 102 fs/hfsplus/brec.c return PTR_ERR(new_node); new_node 140 fs/hfsplus/brec.c if (!rec && new_node != node) { new_node 145 fs/hfsplus/brec.c if (new_node) { new_node 147 fs/hfsplus/brec.c if (!new_node->parent) { new_node 149 fs/hfsplus/brec.c new_node->parent = tree->root; new_node 151 fs/hfsplus/brec.c fd->bnode = hfs_bnode_find(tree, new_node->parent); new_node 154 fs/hfsplus/brec.c cnid = cpu_to_be32(new_node->this); new_node 159 fs/hfsplus/brec.c hfs_bnode_read_key(new_node, fd->search_key, 14); new_node 162 fs/hfsplus/brec.c hfs_bnode_put(new_node); new_node 163 fs/hfsplus/brec.c new_node = NULL; new_node 238 fs/hfsplus/brec.c struct hfs_bnode *node, *new_node, *next_node; new_node 245 fs/hfsplus/brec.c new_node = hfs_bmap_alloc(tree); new_node 246 fs/hfsplus/brec.c if (IS_ERR(new_node)) new_node 247 fs/hfsplus/brec.c return new_node; new_node 250 fs/hfsplus/brec.c node->this, new_node->this, node->next); new_node 251 fs/hfsplus/brec.c new_node->next = node->next; new_node 252 fs/hfsplus/brec.c new_node->prev = node->this; new_node 253 fs/hfsplus/brec.c new_node->parent = node->parent; new_node 254 fs/hfsplus/brec.c new_node->type = node->type; new_node 255 fs/hfsplus/brec.c new_node->height = node->height; new_node 264 fs/hfsplus/brec.c hfs_bnode_put(new_node); new_node 280 fs/hfsplus/brec.c hfs_bnode_put(new_node); new_node 295 fs/hfsplus/brec.c hfs_bnode_get(new_node); new_node 296 fs/hfsplus/brec.c fd->bnode = new_node; new_node 301 fs/hfsplus/brec.c new_node->num_recs = node->num_recs - num_recs; new_node 307 fs/hfsplus/brec.c num_recs = new_node->num_recs; new_node 310 fs/hfsplus/brec.c hfs_bnode_write_u16(new_node, new_rec_off, new_off); new_node 317 fs/hfsplus/brec.c hfs_bnode_write_u16(new_node, new_rec_off, new_off); new_node 318 fs/hfsplus/brec.c hfs_bnode_copy(new_node, 14, node, data_start, data_end - data_start); new_node 321 fs/hfsplus/brec.c node_desc.next = cpu_to_be32(new_node->next); new_node 322 fs/hfsplus/brec.c node_desc.prev = cpu_to_be32(new_node->prev); new_node 323 fs/hfsplus/brec.c node_desc.type = new_node->type; new_node 324 fs/hfsplus/brec.c node_desc.height = new_node->height; new_node 325 fs/hfsplus/brec.c node_desc.num_recs = cpu_to_be16(new_node->num_recs); new_node 327 fs/hfsplus/brec.c hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc)); new_node 330 fs/hfsplus/brec.c node->next = new_node->this; new_node 338 fs/hfsplus/brec.c next_node->prev = new_node->this; new_node 345 fs/hfsplus/brec.c tree->leaf_tail = new_node->this; new_node 350 fs/hfsplus/brec.c hfs_bnode_dump(new_node); new_node 353 fs/hfsplus/brec.c return new_node; new_node 359 fs/hfsplus/brec.c struct hfs_bnode *node, *new_node, *parent; new_node 366 fs/hfsplus/brec.c new_node = NULL; new_node 400 fs/hfsplus/brec.c new_node = hfs_bnode_split(fd); new_node 401 fs/hfsplus/brec.c if (IS_ERR(new_node)) new_node 402 fs/hfsplus/brec.c return PTR_ERR(new_node); new_node 429 fs/hfsplus/brec.c if (new_node) { new_node 432 fs/hfsplus/brec.c if (!new_node->parent) { new_node 434 fs/hfsplus/brec.c new_node->parent = tree->root; new_node 436 fs/hfsplus/brec.c fd->bnode = hfs_bnode_find(tree, new_node->parent); new_node 438 fs/hfsplus/brec.c hfs_bnode_read_key(new_node, fd->search_key, 14); new_node 439 fs/hfsplus/brec.c cnid = cpu_to_be32(new_node->this); new_node 444 fs/hfsplus/brec.c hfs_bnode_put(new_node); new_node 447 fs/hfsplus/brec.c if (new_node == node) new_node 452 fs/hfsplus/brec.c new_node = NULL; new_node 464 fs/hfsplus/brec.c struct hfs_bnode *node, *new_node; new_node 475 fs/hfsplus/brec.c new_node = hfs_bmap_alloc(tree); new_node 476 fs/hfsplus/brec.c if (IS_ERR(new_node)) { new_node 478 fs/hfsplus/brec.c return PTR_ERR(new_node); new_node 481 fs/hfsplus/brec.c tree->root = new_node->this; new_node 483 fs/hfsplus/brec.c tree->leaf_head = tree->leaf_tail = new_node->this; new_node 484 fs/hfsplus/brec.c new_node->type = HFS_NODE_LEAF; new_node 485 fs/hfsplus/brec.c new_node->num_recs = 0; new_node 487 fs/hfsplus/brec.c new_node->type = HFS_NODE_INDEX; new_node 488 fs/hfsplus/brec.c new_node->num_recs = 1; new_node 490 fs/hfsplus/brec.c new_node->parent = 0; new_node 491 fs/hfsplus/brec.c new_node->next = 0; new_node 492 fs/hfsplus/brec.c new_node->prev = 0; new_node 493 fs/hfsplus/brec.c new_node->height = ++tree->depth; new_node 495 fs/hfsplus/brec.c node_desc.next = cpu_to_be32(new_node->next); new_node 496 fs/hfsplus/brec.c node_desc.prev = cpu_to_be32(new_node->prev); new_node 497 fs/hfsplus/brec.c node_desc.type = new_node->type; new_node 498 fs/hfsplus/brec.c node_desc.height = new_node->height; new_node 499 fs/hfsplus/brec.c node_desc.num_recs = cpu_to_be16(new_node->num_recs); new_node 501 fs/hfsplus/brec.c hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc)); new_node 504 fs/hfsplus/brec.c hfs_bnode_write_u16(new_node, rec, 14); new_node 515 fs/hfsplus/brec.c hfs_bnode_copy(new_node, 14, node, 14, key_size); new_node 520 fs/hfsplus/brec.c hfs_bnode_write_u16(new_node, 14, tree->max_key_len); new_node 523 fs/hfsplus/brec.c hfs_bnode_write(new_node, &cnid, 14 + key_size, 4); new_node 526 fs/hfsplus/brec.c hfs_bnode_write_u16(new_node, rec, 14 + key_size + 4); new_node 530 fs/hfsplus/brec.c hfs_bnode_put(new_node); new_node 304 kernel/bpf/lpm_trie.c struct lpm_trie_node *node, *im_node = NULL, *new_node = NULL; new_node 327 kernel/bpf/lpm_trie.c new_node = lpm_trie_node_alloc(trie, value); new_node 328 kernel/bpf/lpm_trie.c if (!new_node) { new_node 335 kernel/bpf/lpm_trie.c new_node->prefixlen = key->prefixlen; new_node 336 kernel/bpf/lpm_trie.c RCU_INIT_POINTER(new_node->child[0], NULL); new_node 337 kernel/bpf/lpm_trie.c RCU_INIT_POINTER(new_node->child[1], NULL); new_node 338 kernel/bpf/lpm_trie.c memcpy(new_node->data, key->data, trie->data_size); new_node 364 kernel/bpf/lpm_trie.c rcu_assign_pointer(*slot, new_node); new_node 372 kernel/bpf/lpm_trie.c new_node->child[0] = node->child[0]; new_node 373 kernel/bpf/lpm_trie.c new_node->child[1] = node->child[1]; new_node 378 kernel/bpf/lpm_trie.c rcu_assign_pointer(*slot, new_node); new_node 389 kernel/bpf/lpm_trie.c rcu_assign_pointer(new_node->child[next_bit], node); new_node 390 kernel/bpf/lpm_trie.c rcu_assign_pointer(*slot, new_node); new_node 407 kernel/bpf/lpm_trie.c rcu_assign_pointer(im_node->child[1], new_node); new_node 409 kernel/bpf/lpm_trie.c rcu_assign_pointer(im_node->child[0], new_node); new_node 418 kernel/bpf/lpm_trie.c if (new_node) new_node 421 kernel/bpf/lpm_trie.c kfree(new_node); new_node 591 kernel/gcov/fs.c node = new_node(parent, NULL, curr); new_node 598 kernel/gcov/fs.c node = new_node(parent, info, curr); new_node 108 lib/generic-radix-tree.c struct genradix_node *n, *new_node = NULL; new_node 121 lib/generic-radix-tree.c if (!new_node) { new_node 122 lib/generic-radix-tree.c new_node = genradix_alloc_node(gfp_mask); new_node 123 lib/generic-radix-tree.c if (!new_node) new_node 127 lib/generic-radix-tree.c new_node->children[0] = n; new_node 129 lib/generic-radix-tree.c ((unsigned long) new_node | (n ? level + 1 : 0))); new_node 133 lib/generic-radix-tree.c new_node = NULL; new_node 144 lib/generic-radix-tree.c if (!new_node) { new_node 145 lib/generic-radix-tree.c new_node = genradix_alloc_node(gfp_mask); new_node 146 lib/generic-radix-tree.c if (!new_node) new_node 150 lib/generic-radix-tree.c if (!(n = cmpxchg_release(p, NULL, new_node))) new_node 151 lib/generic-radix-tree.c swap(n, new_node); new_node 155 lib/generic-radix-tree.c if (new_node) new_node 156 lib/generic-radix-tree.c genradix_free_node(new_node); new_node 1036 mm/memory_hotplug.c bool new_node = false; new_node 1059 mm/memory_hotplug.c new_node = ret; new_node 1073 mm/memory_hotplug.c if (new_node) { new_node 1101 mm/memory_hotplug.c if (new_node) new_node 139 net/hsr/hsr_framereg.c struct hsr_node *new_node, *node; new_node 143 net/hsr/hsr_framereg.c new_node = kzalloc(sizeof(*new_node), GFP_ATOMIC); new_node 144 net/hsr/hsr_framereg.c if (!new_node) new_node 147 net/hsr/hsr_framereg.c ether_addr_copy(new_node->macaddress_A, addr); new_node 154 net/hsr/hsr_framereg.c new_node->time_in[i] = now; new_node 156 net/hsr/hsr_framereg.c new_node->seq_out[i] = seq_out; new_node 165 net/hsr/hsr_framereg.c list_add_tail_rcu(&new_node->mac_list, node_db); new_node 167 net/hsr/hsr_framereg.c return new_node; new_node 170 net/hsr/hsr_framereg.c kfree(new_node); new_node 209 scripts/dtc/dtc.h struct node *merge_nodes(struct node *old_node, struct node *new_node); new_node 210 scripts/dtc/dtc.h struct node *add_orphan_node(struct node *old_node, struct node *new_node, char *ref); new_node 142 scripts/dtc/livetree.c struct node *merge_nodes(struct node *old_node, struct node *new_node) new_node 151 scripts/dtc/livetree.c for_each_label_withdel(new_node->labels, l) new_node 156 scripts/dtc/livetree.c while (new_node->proplist) { new_node 158 scripts/dtc/livetree.c new_prop = new_node->proplist; new_node 159 scripts/dtc/livetree.c new_node->proplist = new_prop->next; new_node 192 scripts/dtc/livetree.c while (new_node->children) { new_node 194 scripts/dtc/livetree.c new_child = new_node->children; new_node 195 scripts/dtc/livetree.c new_node->children = new_child->next_sibling; new_node 219 scripts/dtc/livetree.c old_node->srcpos = srcpos_extend(old_node->srcpos, new_node->srcpos); new_node 223 scripts/dtc/livetree.c free(new_node); new_node 228 scripts/dtc/livetree.c struct node * add_orphan_node(struct node *dt, struct node *new_node, char *ref) new_node 250 scripts/dtc/livetree.c name_node(new_node, "__overlay__"); new_node 251 scripts/dtc/livetree.c node = build_node(p, new_node, NULL); new_node 16 tools/perf/util/rblist.c struct rb_node *parent = NULL, *new_node; new_node 35 tools/perf/util/rblist.c new_node = rblist->node_new(rblist, new_entry); new_node 36 tools/perf/util/rblist.c if (new_node == NULL) new_node 39 tools/perf/util/rblist.c rb_link_node(new_node, parent, p); new_node 40 tools/perf/util/rblist.c rb_insert_color_cached(new_node, &rblist->entries, leftmost); new_node 58 tools/perf/util/rblist.c struct rb_node *parent = NULL, *new_node = NULL; new_node 78 tools/perf/util/rblist.c new_node = rblist->node_new(rblist, entry); new_node 79 tools/perf/util/rblist.c if (new_node) { new_node 80 tools/perf/util/rblist.c rb_link_node(new_node, parent, p); new_node 81 tools/perf/util/rblist.c rb_insert_color_cached(new_node, new_node 87 tools/perf/util/rblist.c return new_node;