/linux-master/fs/jbd2/ |
H A D | journal.c | 358 repeat: 407 goto repeat; 2918 repeat: 2932 goto repeat;
|
H A D | transaction.c | 382 repeat: 401 goto repeat; 415 goto repeat; 428 goto repeat; 440 goto repeat; 981 repeat: 1112 goto repeat; 1134 goto repeat; 1408 repeat: 1420 goto repeat; [all...] |
/linux-master/fs/jffs2/ |
H A D | compr_rtime.c | 89 int repeat; local 93 repeat = data_in[pos++]; 97 if (repeat) { 98 if (backoffs + repeat >= outpos) { 99 while(repeat) { 101 repeat--; 104 memcpy(&cpage_out[outpos],&cpage_out[backoffs],repeat); 105 outpos+=repeat;
|
/linux-master/fs/jfs/ |
H A D | jfs_dtree.c | 2762 repeat: 2779 goto repeat;
|
/linux-master/fs/kernfs/ |
H A D | dir.c | 560 repeat: 583 goto repeat;
|
H A D | file.c | 898 repeat: 952 goto repeat;
|
/linux-master/fs/ |
H A D | locks.c | 47 * lock (1). We then repeat the process recursively with those 2761 loff_t id, char *pfx, int repeat) 2781 if (repeat) 2782 seq_printf(f, "%*s", repeat - 1 + (int)strlen(pfx), pfx); 2760 lock_get_status(struct seq_file *f, struct file_lock_core *flc, loff_t id, char *pfx, int repeat) argument
|
H A D | namespace.c | 3493 repeat: 3508 goto repeat;
|
H A D | splice.c | 529 repeat: 552 goto repeat;
|
/linux-master/fs/nilfs2/ |
H A D | inode.c | 830 repeat: 845 goto repeat;
|
H A D | page.c | 252 repeat: 286 goto repeat; 306 repeat: 354 goto repeat; 510 repeat: 548 goto repeat;
|
H A D | segbuf.c | 380 repeat: 397 goto repeat;
|
H A D | segment.c | 717 repeat: 755 goto repeat;
|
/linux-master/fs/ocfs2/dlm/ |
H A D | dlmthread.c | 49 repeat: 55 goto repeat;
|
/linux-master/fs/ramfs/ |
H A D | file-nommu.c | 226 repeat: 251 goto repeat; /* loop if pages are missing */
|
/linux-master/fs/reiserfs/ |
H A D | fix_node.c | 2627 /* FIXME: maybe -ENOMEM when tb->vn_buf == 0? Now just repeat */ 2634 goto repeat; 2643 goto repeat; 2652 goto repeat; 2657 goto repeat; 2665 goto repeat; 2706 goto repeat; 2712 goto repeat; 2715 repeat:
|
H A D | inode.c | 652 int repeat, retval = 0; local 755 repeat = 764 if (repeat == NO_DISK_SPACE || repeat == QUOTA_EXCEEDED) { 769 repeat = 773 if (repeat != NO_DISK_SPACE && repeat != QUOTA_EXCEEDED) { 776 if (repeat == QUOTA_EXCEEDED)
|
H A D | journal.c | 161 repeat: 173 goto repeat;
|
/linux-master/fs/udf/ |
H A D | balloc.c | 254 repeat: 360 goto repeat;
|
/linux-master/include/linux/iio/ |
H A D | iio.h | 192 * @scan_type.repeat: Number of times real/storage bits repeats. 193 * When the repeat element is more than 1, then 194 * the type element in sysfs will show a repeat 253 u8 repeat; member in struct:iio_chan_spec::__anon402
|
/linux-master/include/linux/input/ |
H A D | adp5589.h | 152 bool repeat; /* Enable key repeat */ member in struct:adp5589_kpad_platform_data
|
/linux-master/include/linux/ |
H A D | leds.h | 157 struct led_pattern *pattern, u32 len, int repeat);
|
/linux-master/include/uapi/linux/ |
H A D | bpf.h | 357 * Run the eBPF program associated with the *prog_fd* a *repeat* 379 * *repeat* must be zero. 1609 __u32 repeat; member in struct:bpf_attr::__anon2599 3554 * report a successfully decoded repeat key message. This delays 5208 * and will not repeat unless another bpf_timer_start() is made.
|
/linux-master/kernel/bpf/ |
H A D | syscall.c | 5819 attr->test.repeat || attr->test.flags)
|
/linux-master/kernel/cgroup/ |
H A D | cgroup.c | 4860 repeat: 4895 goto repeat; 4900 goto repeat; 4904 goto repeat;
|