Searched refs:cur (Results 51 - 75 of 771) sorted by relevance

1234567891011>>

/linux-master/drivers/gpu/drm/nouveau/
H A Dnouveau_dma.h81 nouveau_bo_wr32(chan->push.buffer, chan->dma.cur++, data);
93 if (chan->dma.cur == chan->dma.put)
99 (chan->dma.cur - chan->dma.put) << 2, false);
101 WRITE_PUT(chan->dma.cur);
104 chan->dma.put = chan->dma.cur;
110 chan->dma.cur = chan->dma.put;
/linux-master/fs/xfs/libxfs/
H A Dxfs_ialloc.c33 * Lookup a record by ino in the btree given by cur.
37 struct xfs_btree_cur *cur, /* btree cursor */
42 cur->bc_rec.i.ir_startino = ino;
43 cur->bc_rec.i.ir_holemask = 0;
44 cur->bc_rec.i.ir_count = 0;
45 cur->bc_rec.i.ir_freecount = 0;
46 cur->bc_rec.i.ir_free = 0;
47 return xfs_btree_lookup(cur, dir, stat);
51 * Update the record referred to by cur to the value given.
56 struct xfs_btree_cur *cur, /* btre
36 xfs_inobt_lookup( struct xfs_btree_cur *cur, xfs_agino_t ino, xfs_lookup_t dir, int *stat) argument
55 xfs_inobt_update( struct xfs_btree_cur *cur, xfs_inobt_rec_incore_t *irec) argument
136 xfs_inobt_complain_bad_rec( struct xfs_btree_cur *cur, xfs_failaddr_t fa, const struct xfs_inobt_rec_incore *irec) argument
158 xfs_inobt_get_rec( struct xfs_btree_cur *cur, struct xfs_inobt_rec_incore *irec, int *stat) argument
184 xfs_inobt_insert_rec( struct xfs_btree_cur *cur, uint16_t holemask, uint8_t count, int32_t freecount, xfs_inofree_t free, int *stat) argument
211 struct xfs_btree_cur *cur; local
252 xfs_check_agi_freecount( struct xfs_btree_cur *cur) argument
555 struct xfs_btree_cur *cur; local
652 struct xfs_btree_cur *cur; local
982 xfs_ialloc_next_rec( struct xfs_btree_cur *cur, xfs_inobt_rec_incore_t *rec, int *done, int left) argument
1013 xfs_ialloc_get_rec( struct xfs_btree_cur *cur, xfs_agino_t agino, xfs_inobt_rec_incore_t *rec, int *done) argument
1075 struct xfs_btree_cur *cur, *tcur; local
1433 xfs_dialloc_ag_finobt_newino( struct xfs_agi *agi, struct xfs_btree_cur *cur, struct xfs_inobt_rec_incore *rec) argument
1485 xfs_dialloc_ag_update_inobt( struct xfs_btree_cur *cur, struct xfs_inobt_rec_incore *frec, int offset) argument
1544 struct xfs_btree_cur *cur; /* finobt cursor */ local
2009 struct xfs_btree_cur *cur; local
2143 struct xfs_btree_cur *cur; local
2330 struct xfs_btree_cur *cur; local
2741 xfs_ialloc_count_ondisk( struct xfs_btree_cur *cur, xfs_agino_t low, xfs_agino_t high, unsigned int *allocated) argument
2787 xfs_ialloc_has_inodes_at_extent( struct xfs_btree_cur *cur, xfs_agblock_t bno, xfs_extlen_t len, enum xbtree_recpacking *outcome) argument
2821 xfs_ialloc_count_inodes_rec( struct xfs_btree_cur *cur, const union xfs_btree_rec *rec, void *priv) argument
2843 xfs_ialloc_count_inodes( struct xfs_btree_cur *cur, xfs_agino_t *count, xfs_agino_t *freecount) argument
3060 struct xfs_btree_cur *cur; local
[all...]
H A Dxfs_inode_fork.h182 struct xfs_iext_cursor *cur,
184 void xfs_iext_insert(struct xfs_inode *, struct xfs_iext_cursor *cur,
192 struct xfs_iext_cursor *cur,
196 struct xfs_iext_cursor *cur,
199 struct xfs_iext_cursor *cur,
202 struct xfs_iext_cursor *cur,
211 struct xfs_iext_cursor *cur, struct xfs_bmbt_irec *gotp)
213 xfs_iext_next(ifp, cur);
214 return xfs_iext_get_extent(ifp, cur, gotp);
218 struct xfs_iext_cursor *cur, struc
210 xfs_iext_next_extent(struct xfs_ifork *ifp, struct xfs_iext_cursor *cur, struct xfs_bmbt_irec *gotp) argument
217 xfs_iext_prev_extent(struct xfs_ifork *ifp, struct xfs_iext_cursor *cur, struct xfs_bmbt_irec *gotp) argument
227 xfs_iext_peek_next_extent(struct xfs_ifork *ifp, struct xfs_iext_cursor *cur, struct xfs_bmbt_irec *gotp) argument
239 xfs_iext_peek_prev_extent(struct xfs_ifork *ifp, struct xfs_iext_cursor *cur, struct xfs_bmbt_irec *gotp) argument
[all...]
H A Dxfs_bmap.c110 struct xfs_btree_cur *cur,
114 cur->bc_rec.b = *irec;
115 return xfs_btree_lookup(cur, XFS_LOOKUP_EQ, stat);
120 struct xfs_btree_cur *cur,
123 cur->bc_rec.b.br_startoff = 0;
124 cur->bc_rec.b.br_startblock = 0;
125 cur->bc_rec.b.br_blockcount = 0;
126 return xfs_btree_lookup(cur, XFS_LOOKUP_GE, stat);
154 * Update the record referred to by cur to the value given by irec
159 struct xfs_btree_cur *cur,
109 xfs_bmbt_lookup_eq( struct xfs_btree_cur *cur, struct xfs_bmbt_irec *irec, int *stat) argument
119 xfs_bmbt_lookup_first( struct xfs_btree_cur *cur, int *stat) argument
158 xfs_bmbt_update( struct xfs_btree_cur *cur, struct xfs_bmbt_irec *irec) argument
255 xfs_bmap_get_bp( struct xfs_btree_cur *cur, xfs_fsblock_t bno) argument
341 xfs_bmap_check_leaf_extents( struct xfs_btree_cur *cur, xfs_inode_t *ip, int whichfork) argument
560 xfs_bmap_btree_to_extents( struct xfs_trans *tp, struct xfs_inode *ip, struct xfs_btree_cur *cur, int *logflagsp, int whichfork) argument
641 struct xfs_btree_cur *cur; /* bmap btree cursor */ local
890 struct xfs_btree_cur *cur; /* btree cursor */ local
934 struct xfs_btree_cur *cur; /* bmap btree cursor */ local
1148 xfs_iread_bmbt_block( struct xfs_btree_cur *cur, int level, void *priv) argument
1215 struct xfs_btree_cur *cur; local
2015 struct xfs_btree_cur *cur; /* btree cursor */ local
2716 struct xfs_btree_cur *cur = *curp; local
4745 struct xfs_btree_cur *cur = NULL; local
5098 xfs_bmap_del_extent_real( xfs_inode_t *ip, xfs_trans_t *tp, struct xfs_iext_cursor *icur, struct xfs_btree_cur *cur, xfs_bmbt_irec_t *del, int *logflagsp, int whichfork, uint32_t bflags) argument
5358 struct xfs_btree_cur *cur; /* bmap btree cursor */ local
5712 xfs_bmse_merge( struct xfs_trans *tp, struct xfs_inode *ip, int whichfork, xfs_fileoff_t shift, struct xfs_iext_cursor *icur, struct xfs_bmbt_irec *got, struct xfs_bmbt_irec *left, struct xfs_btree_cur *cur, int *logflags) argument
5798 xfs_bmap_shift_update_extent( struct xfs_trans *tp, struct xfs_inode *ip, int whichfork, struct xfs_iext_cursor *icur, struct xfs_bmbt_irec *got, struct xfs_btree_cur *cur, int *logflags, xfs_fileoff_t startoff) argument
5852 struct xfs_btree_cur *cur = NULL; local
5967 struct xfs_btree_cur *cur = NULL; local
6068 struct xfs_btree_cur *cur = NULL; local
6369 xfs_bmap_query_range_helper( struct xfs_btree_cur *cur, const union xfs_btree_rec *rec, void *priv) argument
6392 xfs_bmap_query_all( struct xfs_btree_cur *cur, xfs_bmap_query_range_fn fn, void *priv) argument
[all...]
/linux-master/kernel/locking/
H A Dww_mutex.h357 struct MUTEX_WAITER *cur; local
361 for (cur = __ww_waiter_first(lock); cur;
362 cur = __ww_waiter_next(lock, cur)) {
364 if (!cur->ww_ctx)
367 if (__ww_mutex_die(lock, cur, ww_ctx) ||
368 __ww_mutex_wound(lock, cur->ww_ctx, ww_ctx))
446 struct MUTEX_WAITER *cur; local
465 for (cur
493 struct MUTEX_WAITER *cur, *pos = NULL; local
[all...]
/linux-master/fs/xfs/scrub/
H A Dialloc.c73 struct xfs_btree_cur *cur = sc->sa.fino_cur; local
79 ASSERT(xfs_btree_is_fino(cur->bc_ops));
81 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &has_record);
87 error = xfs_inobt_get_rec(cur, &frec, &has_record);
101 xchk_btree_xref_set_corrupt(sc, cur, 0);
103 xchk_btree_xref_set_corrupt(sc, cur, 0);
123 xchk_btree_xref_set_corrupt(sc, cur, 0);
176 struct xfs_btree_cur *cur = sc->sa.ino_cur; local
182 ASSERT(xfs_btree_is_ino(cur->bc_ops));
184 error = xfs_inobt_lookup(cur, agin
714 struct xfs_btree_cur *cur; local
[all...]
H A Drcbag_btree.h69 int rcbagbt_lookup_eq(struct xfs_btree_cur *cur,
71 int rcbagbt_get_rec(struct xfs_btree_cur *cur, struct rcbag_rec *rec, int *has);
72 int rcbagbt_update(struct xfs_btree_cur *cur, const struct rcbag_rec *rec);
73 int rcbagbt_insert(struct xfs_btree_cur *cur, const struct rcbag_rec *rec,
/linux-master/arch/x86/kernel/
H A Dtsc_sync.c122 static void tsc_sanitize_first_cpu(struct tsc_adjust *cur, s64 bootval, argument
152 cur->adjusted = bootval;
158 struct tsc_adjust *cur = this_cpu_ptr(&tsc_adjust); local
169 cur->bootval = bootval;
170 cur->nextcheck = jiffies + HZ;
171 tsc_sanitize_first_cpu(cur, bootval, smp_processor_id(), bootcpu);
182 struct tsc_adjust *ref, *cur = this_cpu_ptr(&tsc_adjust); local
191 cur->bootval = bootval;
192 cur->nextcheck = jiffies + HZ;
193 cur
435 struct tsc_adjust *cur = this_cpu_ptr(&tsc_adjust); local
[all...]
/linux-master/tools/perf/
H A Dperf-completion.sh71 cur)
72 cur=$cur_
118 __ltrim_colon_completions $cur
120 __perf__ltrim_colon_completions $cur
156 if [[ $cur == --* ]]; then
161 __perfcomp "$cmds" "$cur"
204 __perfcomp "$evts" "$cur"
208 __perfcomp "$metrics" "$cur"
214 __perfcomp_colon "$subcmds" "$cur"
217 if [[ $cur
[all...]
/linux-master/drivers/clk/rockchip/
H A Dclk-pll.c167 struct rockchip_pll_rate_table cur; local
170 rockchip_rk3036_pll_get_params(pll, &cur);
172 rate64 *= cur.fbdiv;
173 do_div(rate64, cur.refdiv);
175 if (cur.dsmpd == 0) {
177 u64 frac_rate64 = prate * cur.frac;
179 do_div(frac_rate64, cur.refdiv);
183 do_div(rate64, cur.postdiv1);
184 do_div(rate64, cur.postdiv2);
194 struct rockchip_pll_rate_table cur; local
300 struct rockchip_pll_rate_table cur; local
404 struct rockchip_pll_rate_table cur; local
429 struct rockchip_pll_rate_table cur; local
535 struct rockchip_pll_rate_table cur; local
649 struct rockchip_pll_rate_table cur; local
676 struct rockchip_pll_rate_table cur; local
784 struct rockchip_pll_rate_table cur; local
899 struct rockchip_pll_rate_table cur; local
925 struct rockchip_pll_rate_table cur; local
[all...]
/linux-master/tools/testing/selftests/net/
H A Dtap.c308 uint8_t *cur = buf; local
317 cur += sizeof(*vh);
319 cur += build_eth(cur, ETH_P_IP);
320 cur += build_ipv4_header(cur, payload_len);
321 cur += build_udp_packet(cur, payload_len, true);
323 return cur - buf;
328 uint8_t *cur local
345 uint8_t *cur = buf; local
[all...]
/linux-master/include/linux/
H A Dmdio-mux.h25 int (*switch_fn) (int cur, int desired, void *data),
/linux-master/drivers/net/team/
H A Dteam_mode_broadcast.c16 struct team_port *cur; local
22 list_for_each_entry_rcu(cur, &team->port_list, list) {
23 if (team_port_txable(cur)) {
33 last = cur;
/linux-master/drivers/gpu/drm/i915/gem/
H A Di915_gem_object_frontbuffer.h88 struct intel_frontbuffer *cur = front; local
94 cur = rcu_dereference_protected(obj->frontbuffer, true);
95 kref_get(&cur->ref);
101 return cur;
/linux-master/lib/
H A Dcmdline.c58 char *cur = *str; local
61 if (!cur || !(*cur))
63 if (*cur == '-')
64 value = -simple_strtoull(++cur, str, 0);
66 value = simple_strtoull(cur, str, 0);
69 if (cur == *str)
H A Dinterval_tree.c30 struct interval_tree_node *cur = state->nodes[1]; local
32 state->nodes[0] = cur;
34 if (cur->last > state->nodes[0]->last)
35 state->nodes[0] = cur;
36 cur = interval_tree_iter_next(cur, state->first_index,
38 } while (cur && (state->nodes[0]->last >= cur->start ||
39 state->nodes[0]->last + 1 == cur->start));
40 state->nodes[1] = cur;
[all...]
/linux-master/drivers/gpu/drm/msm/disp/mdp5/
H A Dmdp5_mixer.c54 struct mdp5_hw_mixer *cur = mdp5_kms->hwmixers[i]; local
63 if (new_state->hwmixer_to_crtc[cur->idx] &&
64 new_state->hwmixer_to_crtc[cur->idx] != crtc)
68 if (caps & ~cur->caps)
74 pair_idx = get_right_pair_idx(mdp5_kms, cur->lm);
97 if (!(*mixer) || cur->caps & MDP_LM_CAP_PAIR)
98 *mixer = cur;
H A Dmdp5_pipe.c31 struct mdp5_hw_pipe *cur = mdp5_kms->hwpipes[i]; local
40 if (new_state->hwpipe_to_plane[cur->idx] ||
41 old_state->hwpipe_to_plane[cur->idx])
45 if (caps & ~cur->caps)
52 if (cur->caps & MDP_PIPE_CAP_CURSOR &&
59 if (!(*hwpipe) || (hweight_long(cur->caps & ~caps) <
70 if (r_cur->caps != cur->caps)
74 if (cur->pipe > r_cur->pipe)
84 *hwpipe = cur;
/linux-master/tools/testing/selftests/mm/
H A Dmlock-random-test.c137 struct rlimit cur; local
140 getrlimit(RLIMIT_MEMLOCK, &cur);
141 if (cur.rlim_cur < alloc_size)
143 alloc_size, (unsigned int)cur.rlim_cur);
204 struct rlimit cur; local
206 getrlimit(RLIMIT_MEMLOCK, &cur);
207 if (cur.rlim_cur >= alloc_size)
209 alloc_size, (unsigned int)cur.rlim_cur);
215 int lock_size = (rand() % (alloc_size - cur.rlim_cur))
216 + cur
[all...]
/linux-master/tools/lib/bpf/
H A Dhashmap.c65 struct hashmap_entry *cur, *tmp; local
68 hashmap__for_each_entry_safe(map, cur, tmp, bkt) {
69 free(cur);
104 struct hashmap_entry *cur, *tmp; local
117 hashmap__for_each_entry_safe(map, cur, tmp, bkt) {
118 h = hash_bits(map->hash_fn(cur->key, map->ctx), new_cap_bits);
119 hashmap_add_entry(&new_buckets[h], cur);
135 struct hashmap_entry *cur, **prev_ptr; local
140 for (prev_ptr = &map->buckets[hash], cur = *prev_ptr;
141 cur;
[all...]
/linux-master/tools/perf/util/
H A Dhashmap.c65 struct hashmap_entry *cur, *tmp; local
68 hashmap__for_each_entry_safe(map, cur, tmp, bkt) {
69 free(cur);
104 struct hashmap_entry *cur, *tmp; local
117 hashmap__for_each_entry_safe(map, cur, tmp, bkt) {
118 h = hash_bits(map->hash_fn(cur->key, map->ctx), new_cap_bits);
119 hashmap_add_entry(&new_buckets[h], cur);
135 struct hashmap_entry *cur, **prev_ptr; local
140 for (prev_ptr = &map->buckets[hash], cur = *prev_ptr;
141 cur;
[all...]
/linux-master/net/netfilter/
H A Dnf_conntrack_h323_asn1.c95 unsigned char *cur; member in struct:bitstr
100 #define INC_BIT(bs) if((++(bs)->bit)>7){(bs)->cur++;(bs)->bit=0;}
101 #define INC_BITS(bs,b) if(((bs)->bit+=(b))>7){(bs)->cur+=(bs)->bit>>3;(bs)->bit&=7;}
102 #define BYTE_ALIGN(bs) if((bs)->bit){(bs)->cur++;(bs)->bit=0;}
154 v = *bs->cur++;
159 v += *bs->cur++;
172 if (bs->cur + bytes > bs->end)
180 unsigned int b = (*bs->cur) & (0x80 >> bs->bit);
192 v = (*bs->cur) & (0xffU >> bs->bit);
199 bs->cur
[all...]
/linux-master/drivers/media/test-drivers/vivid/
H A Dvivid-radio-common.c70 rds->picode = dev->radio_tx_rds_pi->cur.val;
71 rds->pty = dev->radio_tx_rds_pty->cur.val;
72 rds->mono_stereo = dev->radio_tx_rds_mono_stereo->cur.val;
73 rds->art_head = dev->radio_tx_rds_art_head->cur.val;
74 rds->compressed = dev->radio_tx_rds_compressed->cur.val;
75 rds->dyn_pty = dev->radio_tx_rds_dyn_pty->cur.val;
76 rds->ta = dev->radio_tx_rds_ta->cur.val;
77 rds->tp = dev->radio_tx_rds_tp->cur.val;
78 rds->ms = dev->radio_tx_rds_ms->cur.val;
/linux-master/drivers/scsi/sym53c8xx_2/
H A Dsym_fw.c351 u32 *end, *cur; local
354 cur = start;
357 while (cur < end) {
359 opcode = *cur;
369 sym_name(np), (int) (cur-start));
370 ++cur;
379 *cur++ = 0;
384 printf ("%d: <%x>\n", (int) (cur-start),
408 tmp1 = cur[1];
409 tmp2 = cur[
[all...]
/linux-master/arch/riscv/kernel/probes/
H A Dkprobes.c227 post_kprobe_handler(struct kprobe *cur, struct kprobe_ctlblk *kcb, struct pt_regs *regs) argument
230 if (cur->ainsn.api.restore != 0)
231 regs->epc = cur->ainsn.api.restore;
241 if (cur->post_handler) {
245 cur->post_handler(cur, regs, 0);
253 struct kprobe *cur = kprobe_running(); local
266 regs->epc = (unsigned long) cur->addr;
344 struct kprobe *cur = kprobe_running(); local
346 if (cur
[all...]

Completed in 217 milliseconds

1234567891011>>