orphan 73 drivers/clk/clk.c bool orphan; orphan 1688 drivers/clk/clk.c core->orphan = is_orphan; orphan 1696 drivers/clk/clk.c bool was_orphan = core->orphan; orphan 1701 drivers/clk/clk.c bool becomes_orphan = new_parent->orphan; orphan 3259 drivers/clk/clk.c struct clk_core *orphan; orphan 3266 drivers/clk/clk.c hlist_for_each_entry_safe(orphan, tmp2, &clk_orphan_list, child_node) { orphan 3267 drivers/clk/clk.c struct clk_core *parent = __clk_init_parent(orphan); orphan 3277 drivers/clk/clk.c __clk_set_parent_before(orphan, parent); orphan 3278 drivers/clk/clk.c __clk_set_parent_after(orphan, parent, NULL); orphan 3279 drivers/clk/clk.c __clk_recalc_accuracies(orphan); orphan 3280 drivers/clk/clk.c __clk_recalc_rates(orphan, 0); orphan 3376 drivers/clk/clk.c core->orphan = core->parent->orphan; orphan 3379 drivers/clk/clk.c core->orphan = false; orphan 3382 drivers/clk/clk.c core->orphan = true; orphan 984 drivers/hwtracing/coresight/coresight.c if (!i_csdev->orphan) orphan 1004 drivers/hwtracing/coresight/coresight.c i_csdev->orphan = still_orphan; orphan 1038 drivers/hwtracing/coresight/coresight.c csdev->orphan = true; orphan 1068 drivers/hwtracing/coresight/coresight.c iterator->orphan = true; orphan 1208 drivers/hwtracing/coresight/coresight.c csdev->orphan = false; orphan 360 drivers/scsi/gdth.h u8 orphan; /* flag: drive fragment */ orphan 126 drivers/scsi/sg.c char orphan; /* 1 -> drop on sight, 0 -> normal */ orphan 892 drivers/scsi/sg.c rinfo[val].orphan = srp->orphan; orphan 941 drivers/scsi/sg.c srp->orphan = 1; orphan 1395 drivers/scsi/sg.c if (unlikely(srp->orphan)) { orphan 27 drivers/soc/qcom/smem_state.c bool orphan; orphan 49 drivers/soc/qcom/smem_state.c if (state->orphan) orphan 190 drivers/soc/qcom/smem_state.c state->orphan = true; orphan 2841 fs/btrfs/send.c struct fs_path *orphan; orphan 2843 fs/btrfs/send.c orphan = fs_path_alloc(); orphan 2844 fs/btrfs/send.c if (!orphan) orphan 2847 fs/btrfs/send.c ret = gen_unique_name(sctx, ino, gen, orphan); orphan 2851 fs/btrfs/send.c ret = send_rename(sctx, path, orphan); orphan 2854 fs/btrfs/send.c fs_path_free(orphan); orphan 241 fs/compat_ioctl.c char orphan; orphan 3688 fs/ext4/inode.c int orphan = 0; orphan 3703 fs/ext4/inode.c orphan = 1; orphan 3784 fs/ext4/inode.c if (orphan) { orphan 5545 fs/ext4/inode.c int orphan = 0; orphan 5658 fs/ext4/inode.c orphan = 1; orphan 5719 fs/ext4/inode.c if (orphan && inode->i_nlink) orphan 747 fs/f2fs/checkpoint.c struct ino_entry *orphan = NULL; orphan 760 fs/f2fs/checkpoint.c list_for_each_entry(orphan, head, list) { orphan 768 fs/f2fs/checkpoint.c orphan_blk->ino[nentries++] = cpu_to_le32(orphan->ino); orphan 567 fs/overlayfs/namei.c goto orphan; orphan 585 fs/overlayfs/namei.c goto orphan; orphan 598 fs/overlayfs/namei.c orphan: orphan 48 fs/ubifs/orphan.c struct ubifs_orphan *orphan, *o; orphan 51 fs/ubifs/orphan.c orphan = kzalloc(sizeof(struct ubifs_orphan), GFP_NOFS); orphan 52 fs/ubifs/orphan.c if (!orphan) orphan 54 fs/ubifs/orphan.c orphan->inum = inum; orphan 55 fs/ubifs/orphan.c orphan->new = 1; orphan 56 fs/ubifs/orphan.c INIT_LIST_HEAD(&orphan->child_list); orphan 61 fs/ubifs/orphan.c kfree(orphan); orphan 75 fs/ubifs/orphan.c kfree(orphan); orphan 81 fs/ubifs/orphan.c rb_link_node(&orphan->rb, parent, p); orphan 82 fs/ubifs/orphan.c rb_insert_color(&orphan->rb, &c->orph_tree); orphan 83 fs/ubifs/orphan.c list_add_tail(&orphan->list, &c->orph_list); orphan 84 fs/ubifs/orphan.c list_add_tail(&orphan->new_list, &c->orph_new); orphan 87 fs/ubifs/orphan.c list_add_tail(&orphan->child_list, orphan 93 fs/ubifs/orphan.c return orphan; orphan 163 fs/ubifs/orphan.c struct ubifs_orphan *orphan; orphan 165 fs/ubifs/orphan.c orphan = orphan_add(c, inum, NULL); orphan 166 fs/ubifs/orphan.c if (IS_ERR(orphan)) orphan 167 fs/ubifs/orphan.c return PTR_ERR(orphan); orphan 183 fs/ubifs/orphan.c xattr_orphan = orphan_add(c, xattr_inum, orphan); orphan 233 fs/ubifs/orphan.c struct ubifs_orphan *orphan, **last; orphan 237 fs/ubifs/orphan.c list_for_each_entry(orphan, &c->orph_new, new_list) { orphan 238 fs/ubifs/orphan.c ubifs_assert(c, orphan->new); orphan 239 fs/ubifs/orphan.c ubifs_assert(c, !orphan->cmt); orphan 240 fs/ubifs/orphan.c orphan->new = 0; orphan 241 fs/ubifs/orphan.c orphan->cmt = 1; orphan 242 fs/ubifs/orphan.c *last = orphan; orphan 243 fs/ubifs/orphan.c last = &orphan->cnext; orphan 338 fs/ubifs/orphan.c struct ubifs_orphan *orphan, *cnext; orphan 367 fs/ubifs/orphan.c orphan = cnext; orphan 368 fs/ubifs/orphan.c ubifs_assert(c, orphan->cmt); orphan 369 fs/ubifs/orphan.c orph->inos[i] = cpu_to_le64(orphan->inum); orphan 370 fs/ubifs/orphan.c orphan->cmt = 0; orphan 371 fs/ubifs/orphan.c cnext = orphan->cnext; orphan 372 fs/ubifs/orphan.c orphan->cnext = NULL; orphan 440 fs/ubifs/orphan.c struct ubifs_orphan *orphan, **last; orphan 445 fs/ubifs/orphan.c list_for_each_entry(orphan, &c->orph_list, list) { orphan 446 fs/ubifs/orphan.c if (orphan->new) orphan 448 fs/ubifs/orphan.c orphan->cmt = 1; orphan 449 fs/ubifs/orphan.c *last = orphan; orphan 450 fs/ubifs/orphan.c last = &orphan->cnext; orphan 505 fs/ubifs/orphan.c struct ubifs_orphan *orphan, *dnext; orphan 510 fs/ubifs/orphan.c orphan = dnext; orphan 511 fs/ubifs/orphan.c dnext = orphan->dnext; orphan 512 fs/ubifs/orphan.c ubifs_assert(c, !orphan->new); orphan 513 fs/ubifs/orphan.c ubifs_assert(c, orphan->del); orphan 514 fs/ubifs/orphan.c rb_erase(&orphan->rb, &c->orph_tree); orphan 515 fs/ubifs/orphan.c list_del(&orphan->list); orphan 517 fs/ubifs/orphan.c dbg_gen("deleting orphan ino %lu", (unsigned long)orphan->inum); orphan 518 fs/ubifs/orphan.c kfree(orphan); orphan 577 fs/ubifs/orphan.c struct ubifs_orphan *orphan, *o; orphan 580 fs/ubifs/orphan.c orphan = kzalloc(sizeof(struct ubifs_orphan), GFP_KERNEL); orphan 581 fs/ubifs/orphan.c if (!orphan) orphan 583 fs/ubifs/orphan.c orphan->inum = inum; orphan 595 fs/ubifs/orphan.c kfree(orphan); orphan 600 fs/ubifs/orphan.c rb_link_node(&orphan->rb, parent, p); orphan 601 fs/ubifs/orphan.c rb_insert_color(&orphan->rb, &c->orph_tree); orphan 602 fs/ubifs/orphan.c list_add_tail(&orphan->list, &c->orph_list); orphan 603 fs/ubifs/orphan.c orphan->del = 1; orphan 604 fs/ubifs/orphan.c orphan->dnext = c->orph_dnext; orphan 605 fs/ubifs/orphan.c c->orph_dnext = orphan; orphan 858 fs/ubifs/orphan.c struct check_orphan *orphan, *o; orphan 861 fs/ubifs/orphan.c orphan = kzalloc(sizeof(struct check_orphan), GFP_NOFS); orphan 862 fs/ubifs/orphan.c if (!orphan) orphan 864 fs/ubifs/orphan.c orphan->inum = inum; orphan 875 fs/ubifs/orphan.c kfree(orphan); orphan 879 fs/ubifs/orphan.c rb_link_node(&orphan->rb, parent, p); orphan 880 fs/ubifs/orphan.c rb_insert_color(&orphan->rb, root); orphan 164 include/linux/coresight.h bool orphan; orphan 118 include/scsi/sg.h char orphan; /* 0 -> normal request, 1 -> from interruped SG_IO */