Searched refs:cur (Results 1 - 25 of 773) sorted by last modified time

1234567891011>>

/linux-master/scripts/
H A Dcheckpatch.pl2077 my $cur = $stream;
2081 while (length($cur)) {
2085 if ($cur =~ /^(\s+)/o) {
2092 } elsif ($cur =~ /^(\(\s*$Type\s*)\)/ && $av_pending eq '_') {
2097 } elsif ($cur =~ /^($Type)\s*(?:$Ident|,|\)|\(|\s*$)/) {
2101 } elsif ($cur =~ /^($Modifier)\s*/) {
2105 } elsif ($cur =~ /^(\#\s*define\s*$Ident)(\(?)/o) {
2114 } elsif ($cur =~ /^(\#\s*(?:undef\s*$Ident|include\b))/o) {
2119 } elsif ($cur =~ /^(\#\s*(?:ifdef|ifndef|if))/o) {
2127 } elsif ($cur
[all...]
/linux-master/kernel/sched/
H A Dtopology.c2639 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur, argument
2645 if (!new && !cur)
2650 return !memcmp(cur ? (cur + idx_cur) : &tmp,
H A Dfair.c2169 struct task_struct *cur; local
2180 cur = rcu_dereference(dst_rq->curr);
2181 if (cur && ((cur->flags & PF_EXITING) || is_idle_task(cur)))
2182 cur = NULL;
2188 if (cur == env->p) {
2193 if (!cur) {
2201 if (!cpumask_test_cpu(env->src_cpu, cur->cpus_ptr))
2210 cur
[all...]
H A Dcore.c3475 int migrate_swap(struct task_struct *cur, struct task_struct *p, argument
3482 .src_task = cur,
3504 trace_sched_swap_numa(cur, arg.src_cpu, p, arg.dst_cpu);
9332 int cpuset_cpumask_can_shrink(const struct cpumask *cur, argument
9337 if (cpumask_empty(cur))
9340 ret = dl_cpuset_cpumask_can_shrink(cur, trial);
/linux-master/kernel/power/
H A Dswap.c96 struct swap_map_page *cur; member in struct:swap_map_handle
417 if (handle->cur)
418 free_page((unsigned long)handle->cur);
419 handle->cur = NULL;
432 handle->cur = (struct swap_map_page *)get_zeroed_page(GFP_KERNEL);
433 if (!handle->cur) {
459 if (!handle->cur)
465 handle->cur->entries[handle->k++] = offset;
470 handle->cur->next_swap = offset;
471 error = write_page(handle->cur, handl
[all...]
/linux-master/kernel/
H A Dcrash_reserve.c62 char *cur = cmdline, *tmp; local
78 start = memparse(cur, &tmp);
79 if (cur == tmp) {
83 cur = tmp;
84 if (*cur != '-') {
88 cur++;
91 if (*cur != ':') {
92 end = memparse(cur, &tmp);
93 if (cur == tmp) {
97 cur
156 char *cur = cmdline; local
194 char *cur = cmdline; local
[all...]
/linux-master/kernel/cgroup/
H A Dcpuset.c738 static int validate_change_legacy(struct cpuset *cur, struct cpuset *trial) argument
748 cpuset_for_each_child(c, css, cur)
754 par = parent_cs(cur);
768 * (cur) with those values in the trial cpuset (trial), would
772 * 'cur' is the address of an actual, in-use cpuset. Operations
774 * cpuset in the list must use cur below, not trial.
776 * 'trial' is the address of bulk structure copy of cur, with
783 static int validate_change(struct cpuset *cur, struct cpuset *trial) argument
792 ret = validate_change_legacy(cur, trial);
797 if (cur
[all...]
/linux-master/fs/xfs/
H A Dxfs_trans.c731 struct xfs_ail_cursor *cur,
740 xfs_trans_ail_update_bulk(ailp, cur, log_items, nr_items, commit_lsn);
780 struct xfs_ail_cursor cur; local
784 xfs_trans_ail_cursor_last(ailp, &cur, commit_lsn);
842 xfs_log_item_batch_insert(ailp, &cur, log_items,
850 xfs_log_item_batch_insert(ailp, &cur, log_items, i, commit_lsn);
853 xfs_trans_ail_cursor_done(&cur);
729 xfs_log_item_batch_insert( struct xfs_ail *ailp, struct xfs_ail_cursor *cur, struct xfs_log_item **log_items, int nr_items, xfs_lsn_t commit_lsn) argument
H A Dxfs_trace.h376 TP_PROTO(struct xfs_inode *ip, struct xfs_iext_cursor *cur, int state,
378 TP_ARGS(ip, cur, state, caller_ip),
396 xfs_iext_get_extent(ifp, cur, &r);
399 __entry->leaf = cur->leaf;
400 __entry->pos = cur->pos;
408 TP_printk("dev %d:%d ino 0x%llx state %s cur %p/%d "
424 TP_PROTO(struct xfs_inode *ip, struct xfs_iext_cursor *cur, int state, \
426 TP_ARGS(ip, cur, state, caller_ip))
1903 TP_PROTO(struct xfs_btree_cur *cur, xfs_agblock_t bno,
1905 TP_ARGS(cur, bn
[all...]
H A Dxfs_reflink.c140 struct xfs_btree_cur *cur; local
147 cur = xfs_refcountbt_init_cursor(pag->pag_mount, tp, agbp, pag);
149 error = xfs_refcount_find_shared(cur, agbno, aglen, fbno, flen,
152 xfs_btree_del_cursor(cur, error);
H A Dxfs_iwalk.c404 struct xfs_btree_cur *cur = NULL; local
412 error = xfs_iwalk_ag_start(iwag, agino, &cur, &agi_bp, &has_more);
424 error = xfs_inobt_get_rec(cur, irec, &has_more);
432 xfs_btree_mark_sick(cur);
440 error = xfs_btree_increment(cur, 0, &has_more);
458 error = xfs_btree_increment(cur, 0, &has_more);
471 error = xfs_iwalk_run_callbacks(iwag, &cur, &agi_bp, &has_more);
478 error = xfs_iwalk_run_callbacks(iwag, &cur, &agi_bp, &has_more);
481 xfs_iwalk_del_inobt(iwag->tp, &cur, &agi_bp, error);
H A Dxfs_health.c528 struct xfs_btree_cur *cur)
530 switch (cur->bc_ops->type) {
535 ASSERT(cur->bc_ops->sick_mask);
536 xfs_ag_mark_sick(cur->bc_ag.pag, cur->bc_ops->sick_mask);
539 if (xfs_btree_is_bmap(cur->bc_ops)) {
540 xfs_bmap_mark_sick(cur->bc_ino.ip,
541 cur->bc_ino.whichfork);
527 xfs_btree_mark_sick( struct xfs_btree_cur *cur) argument
H A Dxfs_fsmap.c208 struct xfs_btree_cur *cur; local
222 cur = xfs_refcountbt_init_cursor(mp, tp, info->agf_bp, info->pag);
224 error = xfs_refcount_find_shared(cur, rec->rm_startblock,
227 xfs_btree_del_cursor(cur, error);
376 struct xfs_btree_cur *cur,
380 struct xfs_mount *mp = cur->bc_mp;
385 fsb = XFS_AGB_TO_FSB(mp, cur->bc_ag.pag->pag_agno, rec->rm_startblock);
388 return xfs_getfsmap_helper(cur->bc_tp, info, rec, rec_daddr, 0);
394 struct xfs_btree_cur *cur,
398 struct xfs_mount *mp = cur
375 xfs_getfsmap_datadev_helper( struct xfs_btree_cur *cur, const struct xfs_rmap_irec *rec, void *priv) argument
393 xfs_getfsmap_datadev_bnobt_helper( struct xfs_btree_cur *cur, const struct xfs_alloc_rec_incore *rec, void *priv) argument
[all...]
H A Dxfs_dquot.c730 struct xfs_iext_cursor cur; local
752 if (xfs_iext_lookup_extent(quotip, &quotip->i_df, start, &cur, &got)) {
H A Dxfs_discard.c165 struct xfs_btree_cur *cur; local
188 cur = xfs_bnobt_init_cursor(mp, tp, agbp, pag);
189 error = xfs_alloc_lookup_le(cur, tcur->start, 0, &i);
191 error = xfs_alloc_lookup_ge(cur, tcur->start, 0, &i);
194 cur = xfs_cntbt_init_cursor(mp, tp, agbp, pag);
195 error = xfs_alloc_lookup_ge(cur, 0, tcur->count, &i);
198 cur = xfs_cntbt_init_cursor(mp, tp, agbp, pag);
199 error = xfs_alloc_lookup_le(cur, tcur->start, tcur->count, &i);
217 error = xfs_alloc_get_rec(cur, &fbno, &flen, &i);
221 xfs_btree_mark_sick(cur);
[all...]
H A Dxfs_bmap_util.c113 struct xfs_btree_cur *cur; local
129 cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork);
130 error = xfs_btree_count_blocks(cur, &btblocks);
131 xfs_btree_del_cursor(cur, error);
/linux-master/fs/xfs/scrub/
H A Dtrace.h545 TP_PROTO(struct xfs_scrub *sc, struct xfs_btree_cur *cur,
547 TP_ARGS(sc, cur, level, error, ret_ip),
551 __string(name, cur->bc_ops->name)
560 xfs_fsblock_t fsbno = xchk_btree_cur_fsbno(cur, level);
564 __assign_str(name, cur->bc_ops->name);
566 __entry->agno = XFS_FSB_TO_AGNO(cur->bc_mp, fsbno);
567 __entry->bno = XFS_FSB_TO_AGBNO(cur->bc_mp, fsbno);
568 __entry->ptr = cur->bc_levels[level].ptr;
585 TP_PROTO(struct xfs_scrub *sc, struct xfs_btree_cur *cur,
587 TP_ARGS(sc, cur, leve
[all...]
H A Dxfarray.c277 * @cur is the array index, and @pos is the file offset of that array index in
288 xfarray_idx_t *cur,
327 *cur = xfarray_idx(array, new_pos);
328 *pos = xfarray_pos(array, *cur);
344 xfarray_idx_t cur = *idx; local
345 loff_t pos = xfarray_pos(array, cur);
349 if (cur >= array->nr)
356 error = xfarray_find_data(array, &cur, &pos);
359 error = xfarray_load(array, cur, rec);
363 cur
286 xfarray_find_data( struct xfarray *array, xfarray_idx_t *cur, loff_t *pos) argument
[all...]
H A Dtrace.c39 struct xfs_btree_cur *cur,
42 if (level < cur->bc_nlevels && cur->bc_levels[level].bp)
43 return XFS_DADDR_TO_FSB(cur->bc_mp,
44 xfs_buf_daddr(cur->bc_levels[level].bp));
46 if (level == cur->bc_nlevels - 1 &&
47 cur->bc_ops->type == XFS_BTREE_TYPE_INODE)
48 return XFS_INO_TO_FSB(cur->bc_mp, cur->bc_ino.ip->i_ino);
38 xchk_btree_cur_fsbno( struct xfs_btree_cur *cur, int level) argument
H A Drmap_repair.c335 struct xfs_btree_cur *cur,
380 struct xfs_btree_cur *cur,
389 xfs_btree_get_block(cur, level, &bp);
393 fsbno = XFS_DADDR_TO_FSB(cur->bc_mp, xfs_buf_daddr(bp));
394 if (XFS_FSB_TO_AGNO(cur->bc_mp, fsbno) != rf->rr->sc->sa.pag->pag_agno)
397 agbno = XFS_FSB_TO_AGBNO(cur->bc_mp, fsbno);
408 struct xfs_btree_cur *cur)
417 error = xfs_btree_visit_blocks(cur, xrep_rmap_visit_iroot_btree_block,
447 struct xfs_btree_cur *cur; local
453 cur
334 xrep_rmap_visit_bmbt( struct xfs_btree_cur *cur, struct xfs_bmbt_irec *rec, void *priv) argument
379 xrep_rmap_visit_iroot_btree_block( struct xfs_btree_cur *cur, int level, void *priv) argument
406 xrep_rmap_scan_iroot_btree( struct xrep_rmap_ifork *rf, struct xfs_btree_cur *cur) argument
604 xrep_rmap_walk_inobt( struct xfs_btree_cur *cur, const union xfs_btree_rec *rec, void *priv) argument
719 xrep_rmap_walk_cowblocks( struct xfs_btree_cur *cur, const struct xfs_refcount_irec *irec, void *priv) argument
814 xrep_rmap_check_record( struct xfs_btree_cur *cur, const struct xfs_rmap_irec *rec, void *priv) argument
1153 xrep_rmap_get_records( struct xfs_btree_cur *cur, unsigned int idx, struct xfs_btree_block *block, unsigned int nr_wanted, void *priv) argument
1189 xrep_rmap_claim_block( struct xfs_btree_cur *cur, union xfs_btree_ptr *ptr, void *priv) argument
1241 xrep_rmap_count_records( struct xfs_btree_cur *cur, unsigned long long *nr) argument
1397 xrep_rmap_find_freesp( struct xfs_btree_cur *cur, const struct xfs_alloc_rec_incore *rec, void *priv) argument
1410 xrep_rmap_find_gaps( struct xfs_btree_cur *cur, const struct xfs_rmap_irec *rec, void *priv) argument
[all...]
H A Drepair.c628 struct xfs_btree_cur *cur,
672 struct xfs_btree_cur *cur; local
689 cur = xfs_rmapbt_init_cursor(mp, sc->tp, agf_bp, sc->sa.pag);
690 error = xfs_rmap_query_all(cur, xrep_findroot_rmap, &ri);
691 xfs_btree_del_cursor(cur, error);
627 xrep_findroot_rmap( struct xfs_btree_cur *cur, const struct xfs_rmap_irec *rec, void *priv) argument
H A Dreap.c332 struct xfs_btree_cur *cur; local
341 cur = xfs_rmapbt_init_cursor(sc->mp, sc->tp, sc->sa.agf_bp,
343 error = xfs_rmap_has_other_keys(cur, agbno, 1, rs->oinfo,
359 error = xfs_rmap_has_other_keys(cur, bno, 1, rs->oinfo,
375 xfs_btree_del_cursor(cur, error);
697 struct xfs_btree_cur *cur; local
707 cur = xfs_rmapbt_init_cursor(sc->mp, sc->tp, sc->sa.agf_bp,
711 error = xfs_rmap_has_other_keys(cur, agbno, 1, &oinfo, crosslinked);
720 error = xfs_rmap_has_other_keys(cur, bno, 1, &oinfo,
735 xfs_btree_del_cursor(cur, erro
[all...]
H A Dnlinks.c871 xfarray_idx_t cur = XFARRAY_CURSOR_INIT; local
916 while ((error = xfarray_iter(xnc->nlinks, &cur, &nl)) == 1) {
917 xfs_ino_t ino = cur - 1;
H A Discan.c95 struct xfs_btree_cur *cur; local
116 cur = xfs_inobt_init_cursor(pag, tp, agi_bp);
117 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &has_rec);
119 error = xfs_btree_increment(cur, 0, &has_rec);
120 for (; !error; error = xfs_btree_increment(cur, 0, &has_rec)) {
133 error = xfs_inobt_get_rec(cur, &rec, &has_rec);
185 xfs_btree_del_cursor(cur, error);
H A Dinode_repair.c709 struct xfs_btree_cur *cur,
744 struct xfs_btree_cur *cur; local
752 cur = xfs_rmapbt_init_cursor(ri->sc->mp, ri->sc->tp, agf, pag);
753 error = xfs_rmap_query_all(cur, xrep_dinode_walk_rmap, ri);
754 xfs_btree_del_cursor(cur, error);
708 xrep_dinode_walk_rmap( struct xfs_btree_cur *cur, const struct xfs_rmap_irec *rec, void *priv) argument

Completed in 610 milliseconds

1234567891011>>