Searched refs:root (Results 1 - 25 of 1075) sorted by path

1234567891011>>

/linux-master/Documentation/sound/cards/
H A Dmultisound.sh558 X * This is Linux-specific, and must be run with root permissions.
955 X fprintf(stderr, "note: pinnaclecfg must be run as root\n");
/linux-master/arch/m68k/ifpsp060/src/
H A Dfpsp.S15564 fsqrt.x (%a0),%fp0 # execute square root
15672 fsqrt.x FP_SCR0(%a6),%fp0 # execute square root
15723 fsqrt.x FP_SCR0(%a6),%fp0 # perform square root
/linux-master/arch/parisc/
H A Ddefpalo.conf10 # You need at least one 'root='!
12 # If you want a root ramdisk, use the next 2 lines
15 --commandline=0/vmlinuz HOME=/ root=/dev/ram initrd=0/ramdisk panic_timeout=60 panic=-1
17 # If you want NFS root, use the following command line (Edit the HOSTNAME!!!)
18 #--commandline=0/vmlinuz HOME=/ root=/dev/nfs nfsroot=HOSTNAME ip=bootp
20 # If you have root on a disk partition, use this (Edit the partition name!!!)
21 #--commandline=0/vmlinuz HOME=/ root=/dev/sda1
/linux-master/drivers/acpi/acpica/
H A Ddbutils.c18 acpi_status acpi_db_second_pass_parse(union acpi_parse_object *root);
212 /* Ignore a leading backslash, this is the root prefix */
239 * Note: Currently begins search from the root. Could be enhanced to use
262 * (Uses root node as the search starting point)
315 * PARAMETERS: root - Root of the parse tree
324 acpi_status acpi_db_second_pass_parse(union acpi_parse_object *root) argument
326 union acpi_parse_object *op = root;
394 op = acpi_ps_get_depth_next(root, op);
/linux-master/drivers/gpu/drm/i915/
H A Di915_syncmap.h33 void i915_syncmap_init(struct i915_syncmap **root);
34 int i915_syncmap_set(struct i915_syncmap **root, u64 id, u32 seqno);
35 bool i915_syncmap_is_later(struct i915_syncmap **root, u64 id, u32 seqno);
36 void i915_syncmap_free(struct i915_syncmap **root);
/linux-master/drivers/gpu/drm/nouveau/nvkm/core/
H A Dmm.c26 #define node(root, dir) ((root)->nl_entry.dir == &mm->nodes) ? NULL : \
27 list_entry((root)->nl_entry.dir, struct nvkm_mm_node, nl_entry)
/linux-master/drivers/infiniband/hw/qib/
H A Dqib_debugfs.c243 struct dentry *root; local
247 root = debugfs_create_dir(name, qib_dbg_root);
248 ibd->qib_ibdev_dbg = root;
250 debugfs_create_file("opcode_stats", 0400, root, ibd,
252 debugfs_create_file("ctx_stats", 0400, root, ibd, &_ctx_stats_file_ops);
253 debugfs_create_file("qp_stats", 0400, root, ibd, &_qp_stats_file_ops);
/linux-master/drivers/infiniband/hw/usnic/
H A Dusnic_uiom_interval_tree.h51 struct rb_root_cached *root);
54 struct rb_root_cached *root);
56 usnic_uiom_interval_tree_iter_first(struct rb_root_cached *root,
63 * Inserts {start...last} into {root}. If there are overlaps,
66 int usnic_uiom_insert_interval(struct rb_root_cached *root,
70 * Removed {start...last} from {root}. The nodes removed are returned in
74 void usnic_uiom_remove_interval(struct rb_root_cached *root,
78 * Returns {start...last} - {root} (relative complement of {start...last} in
79 * {root}) in diff_set sorted ascendingly
84 struct rb_root_cached *root,
[all...]
/linux-master/drivers/irqchip/
H A Dirq-atmel-aic-common.c192 struct device_node *root = of_find_node_by_path("/"); local
195 if (!root)
198 match = of_match_node(matches, root);
205 of_node_put(root);
/linux-master/drivers/media/pci/tw5864/
H A Dtw5864.h86 struct tw5864_dev *root; member in struct:tw5864_input
/linux-master/drivers/pci/hotplug/
H A Dcpqphp_sysfs.c184 static struct dentry *root; variable in typeref:struct:dentry
188 if (!root)
189 root = debugfs_create_dir("cpqhp", NULL);
194 debugfs_remove(root);
200 S_IRUGO, root, ctrl, &debug_ops);
/linux-master/drivers/ptp/
H A Dptp_qoriq_debugfs.c72 struct dentry *root; local
74 root = debugfs_create_dir(dev_name(ptp_qoriq->dev), NULL);
75 if (IS_ERR(root))
77 if (!root)
80 ptp_qoriq->debugfs_root = root;
82 if (!debugfs_create_file_unsafe("fiper1-loopback", 0600, root,
85 if (!debugfs_create_file_unsafe("fiper2-loopback", 0600, root,
91 debugfs_remove_recursive(root);
/linux-master/fs/autofs/
H A DMakefile8 autofs4-objs := init.o inode.o root.o symlink.o waitq.o expire.o dev-ioctl.o
/linux-master/fs/hfs/
H A Dbrec.c76 if (!tree->root)
149 new_node->parent = tree->root;
430 new_node->parent = tree->root;
466 if (tree->root) {
467 node = hfs_bnode_find(tree, tree->root);
477 tree->root = new_node->this;
503 /* insert old root idx into new root */
504 node->parent = tree->root;
/linux-master/fs/hfsplus/
H A Dbfind.c162 /* Traverse a B*Tree from the root to a leaf finding best fit to key */
176 nidx = tree->root;
H A Dbrec.c74 if (!tree->root)
149 new_node->parent = tree->root;
434 new_node->parent = tree->root;
470 if (tree->root) {
471 node = hfs_bnode_find(tree, tree->root);
481 tree->root = new_node->this;
507 /* insert old root idx into new root */
508 node->parent = tree->root;
/linux-master/fs/hpfs/
H A Ddnode.c533 int root = dnode->root_dnode; local
537 if (hpfs_sb(i->i_sb)->sb_chk) if (root && !down) {
538 hpfs_error(i->i_sb, "delete_empty_dnode: root dnode %08x is empty", dno);
545 if (root) {
/linux-master/include/linux/
H A Dassoc_array.h23 struct assoc_array_ptr *root; /* The node at the root of the tree */ member in struct:assoc_array
56 array->root = NULL;
H A Deisa.h90 /* The EISA root device. There's rumours about machines with multiple
104 int eisa_root_register (struct eisa_root_device *root);
/linux-master/include/uapi/linux/
H A Dadfs_fs.h23 __le32 root; member in struct:adfs_discrecord
H A Dcramfs_fs.h63 struct cramfs_inode root; /* root inode data */ member in struct:cramfs_super
76 #define CRAMFS_FLAG_SHIFTED_ROOT_OFFSET 0x00000400 /* shifted root fs */
H A Dnfs_mount.h44 struct nfs3_fh root; /* 4 */ member in struct:nfs_mount_data
/linux-master/kernel/cgroup/
H A Ddebug.c105 c->root->hierarchy_id, name_buf);
/linux-master/lib/
H A Dinterval_tree_test.c23 static struct rb_root_cached root = RB_ROOT_CACHED; variable in typeref:struct:rb_root_cached
30 search(struct rb_root_cached *root, unsigned long start, unsigned long last) argument
35 for (node = interval_tree_iter_first(root, start, last); node;
88 interval_tree_insert(nodes + j, &root);
90 interval_tree_remove(nodes + j, &root);
102 interval_tree_insert(nodes + j, &root);
112 results += search(&root, start, last);
/linux-master/lib/reed_solomon/
H A Ddecode_rs.c37 uint16_t *root = rsc->buffers + RS_DECODE_ROOT * (nroots + 1); variable
209 continue; /* Not a root */
216 /* store root (index-form) and error location number */
217 root[count] = i;
258 i * root[j])];
267 num2 = alpha_to[rs_modnn(rs, root[j] * (fcr - 1) + nn)];
275 i * root[j])];

Completed in 355 milliseconds

1234567891011>>