/linux-master/arch/mips/cavium-octeon/ |
H A D | csrc-octeon.c | 146 u64 cur, end, inc; local 148 cur = read_c0_cvmcount(); 151 end = cur + inc; 153 while (end > cur) 154 cur = read_c0_cvmcount(); 160 u64 cur, end, inc; local 162 cur = read_c0_cvmcount(); 165 end = cur + inc; 167 while (end > cur) 168 cur 174 u64 cur, end; local 195 u64 cur, end; local [all...] |
/linux-master/security/selinux/ss/ |
H A D | hashtab.h | 66 struct hashtab_node *prev, *cur; local 75 cur = h->htable[hvalue]; 76 while (cur) { 77 int cmp = key_params.cmp(key, cur->key); 83 prev = cur; 84 cur = cur->next; 101 struct hashtab_node *cur; local 107 cur = h->htable[hvalue]; 108 while (cur) { [all...] |
H A D | avtab.c | 124 struct avtab_node *prev, *cur, *newnode; local 131 for (prev = NULL, cur = h->htable[hvalue]; cur; 132 prev = cur, cur = cur->next) { 133 cmp = avtab_node_cmp(key, &cur->key); 158 struct avtab_node *prev, *cur; local 164 for (prev = NULL, cur = h->htable[hvalue]; cur; 181 struct avtab_node *cur; local 202 struct avtab_node *cur; local 222 struct avtab_node *cur, *temp; local 296 struct avtab_node *cur; local 546 avtab_write_item(struct policydb *p, const struct avtab_node *cur, void *fp) argument 586 struct avtab_node *cur; local [all...] |
/linux-master/fs/xfs/scrub/ |
H A D | rcbag.c | 78 struct xfs_btree_cur *cur; local 82 cur = rcbagbt_mem_cursor(mp, tp, &bag->xfbtree); 83 error = rcbagbt_lookup_eq(cur, rmap, &has); 88 error = rcbagbt_get_rec(cur, &bagrec, &has); 97 error = rcbagbt_update(cur, &bagrec); 105 error = rcbagbt_insert(cur, &bagrec, &has); 114 xfs_btree_del_cursor(cur, 0); 124 xfs_btree_del_cursor(cur, error); 156 struct xfs_btree_cur *cur; local 164 cur 217 struct xfs_btree_cur *cur; local 273 struct xfs_btree_cur *cur; local [all...] |
H A D | rcbag_btree.c | 39 struct xfs_btree_cur *cur, 43 struct rcbag_rec *bag_irec = (struct rcbag_rec *)&cur->bc_rec; 52 struct xfs_btree_cur *cur, 55 struct rcbag_rec *rec = (struct rcbag_rec *)&cur->bc_rec; 73 struct xfs_btree_cur *cur, 98 struct xfs_btree_cur *cur, 120 struct xfs_btree_cur *cur, 218 struct xfs_btree_cur *cur; local 220 cur = xfs_btree_alloc_cursor(mp, tp, &rcbagbt_mem_ops, 223 cur 38 rcbagbt_init_rec_from_cur( struct xfs_btree_cur *cur, union xfs_btree_rec *rec) argument 51 rcbagbt_key_diff( struct xfs_btree_cur *cur, const union xfs_btree_key *key) argument 72 rcbagbt_diff_two_keys( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2, const union xfs_btree_key *mask) argument 97 rcbagbt_keys_inorder( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2) argument 119 rcbagbt_recs_inorder( struct xfs_btree_cur *cur, const union xfs_btree_rec *r1, const union xfs_btree_rec *r2) argument 316 rcbagbt_lookup_eq( struct xfs_btree_cur *cur, const struct xfs_rmap_irec *rmap, int *success) argument 331 rcbagbt_get_rec( struct xfs_btree_cur *cur, struct rcbag_rec *rec, int *has) argument 349 rcbagbt_update( struct xfs_btree_cur *cur, const struct rcbag_rec *rec) argument 361 rcbagbt_insert( struct xfs_btree_cur *cur, const struct rcbag_rec *rec, int *success) argument [all...] |
H A D | rmap.c | 150 struct xfs_btree_cur *cur = bs->cur; local 159 for (level = 1; level < cur->bc_nlevels; level++) { 164 if (cur->bc_levels[level].ptr > 1) 167 keyblock = xfs_btree_get_block(cur, level, &bp); 169 lkey = xfs_btree_key_addr(cur, ptr, keyblock); 172 xchk_btree_set_preen(sc, cur, level); 176 hkey = xfs_btree_high_key_addr(cur, ptr, keyblock); 178 xchk_btree_set_preen(sc, cur, level); 224 xchk_btree_set_corrupt(bs->sc, bs->cur, 403 struct xfs_btree_cur *cur; local 513 struct xfs_btree_cur *cur = sc->sa.rmap_cur; local [all...] |
/linux-master/fs/xfs/libxfs/ |
H A D | xfs_btree_mem.c | 25 struct xfs_btree_cur *cur, 29 ASSERT(cur->bc_ops->type == XFS_BTREE_TYPE_MEM); 31 cur->bc_mem.xfbtree->root = *ptr; 32 cur->bc_mem.xfbtree->nlevels += inc; 38 struct xfs_btree_cur *cur, 41 ASSERT(cur->bc_ops->type == XFS_BTREE_TYPE_MEM); 43 *ptr = cur->bc_mem.xfbtree->root; 49 struct xfs_btree_cur *cur) 53 ASSERT(cur->bc_ops->type == XFS_BTREE_TYPE_MEM); 55 ncur = xfs_btree_alloc_cursor(cur 24 xfbtree_set_root( struct xfs_btree_cur *cur, const union xfs_btree_ptr *ptr, int inc) argument 37 xfbtree_init_ptr_from_cur( struct xfs_btree_cur *cur, union xfs_btree_ptr *ptr) argument 48 xfbtree_dup_cursor( struct xfs_btree_cur *cur) argument 163 xfbtree_alloc_block( struct xfs_btree_cur *cur, const union xfs_btree_ptr *start, union xfs_btree_ptr *new, int *stat) argument 190 xfbtree_free_block( struct xfs_btree_cur *cur, struct xfs_buf *bp) argument 210 xfbtree_get_minrecs( struct xfs_btree_cur *cur, int level) argument 221 xfbtree_get_maxrecs( struct xfs_btree_cur *cur, int level) argument [all...] |
H A D | xfs_iext_tree.c | 140 static inline struct xfs_iext_rec *cur_rec(struct xfs_iext_cursor *cur) argument 142 return &cur->leaf->recs[cur->pos]; 146 struct xfs_iext_cursor *cur) 148 if (!cur->leaf) 150 if (cur->pos < 0 || cur->pos >= xfs_iext_max_recs(ifp)) 152 if (xfs_iext_rec_is_empty(cur_rec(cur))) 199 struct xfs_iext_cursor *cur) 201 cur 145 xfs_iext_valid(struct xfs_ifork *ifp, struct xfs_iext_cursor *cur) argument 197 xfs_iext_first( struct xfs_ifork *ifp, struct xfs_iext_cursor *cur) argument 206 xfs_iext_last( struct xfs_ifork *ifp, struct xfs_iext_cursor *cur) argument 226 xfs_iext_next( struct xfs_ifork *ifp, struct xfs_iext_cursor *cur) argument 248 xfs_iext_prev( struct xfs_ifork *ifp, struct xfs_iext_cursor *cur) argument 547 xfs_iext_split_leaf( struct xfs_iext_cursor *cur, int *nr_entries) argument 587 xfs_iext_alloc_root( struct xfs_ifork *ifp, struct xfs_iext_cursor *cur) argument 602 xfs_iext_realloc_root( struct xfs_ifork *ifp, struct xfs_iext_cursor *cur) argument 633 xfs_iext_insert_raw( struct xfs_ifork *ifp, struct xfs_iext_cursor *cur, struct xfs_bmbt_irec *irec) argument 676 xfs_iext_insert( struct xfs_inode *ip, struct xfs_iext_cursor *cur, struct xfs_bmbt_irec *irec, int state) argument 805 xfs_iext_rebalance_leaf( struct xfs_ifork *ifp, struct xfs_iext_cursor *cur, struct xfs_iext_leaf *leaf, xfs_fileoff_t offset, int nr_entries) argument 879 xfs_iext_remove( struct xfs_inode *ip, struct xfs_iext_cursor *cur, int state) argument 936 xfs_iext_lookup_extent( struct xfs_inode *ip, struct xfs_ifork *ifp, xfs_fileoff_t offset, struct xfs_iext_cursor *cur, struct xfs_bmbt_irec *gotp) argument 977 xfs_iext_lookup_extent_before( struct xfs_inode *ip, struct xfs_ifork *ifp, xfs_fileoff_t *end, struct xfs_iext_cursor *cur, struct xfs_bmbt_irec *gotp) argument 995 xfs_iext_update_extent( struct xfs_inode *ip, int state, struct xfs_iext_cursor *cur, struct xfs_bmbt_irec *new) argument 1025 xfs_iext_get_extent( struct xfs_ifork *ifp, struct xfs_iext_cursor *cur, struct xfs_bmbt_irec *gotp) argument [all...] |
H A D | xfs_alloc_btree.c | 28 struct xfs_btree_cur *cur) 30 return xfs_bnobt_init_cursor(cur->bc_mp, cur->bc_tp, cur->bc_ag.agbp, 31 cur->bc_ag.pag); 36 struct xfs_btree_cur *cur) 38 return xfs_cntbt_init_cursor(cur->bc_mp, cur->bc_tp, cur->bc_ag.agbp, 39 cur 27 xfs_bnobt_dup_cursor( struct xfs_btree_cur *cur) argument 35 xfs_cntbt_dup_cursor( struct xfs_btree_cur *cur) argument 44 xfs_allocbt_set_root( struct xfs_btree_cur *cur, const union xfs_btree_ptr *ptr, int inc) argument 68 xfs_allocbt_alloc_block( struct xfs_btree_cur *cur, const union xfs_btree_ptr *start, union xfs_btree_ptr *new, int *stat) argument 98 xfs_allocbt_free_block( struct xfs_btree_cur *cur, struct xfs_buf *bp) argument 122 xfs_allocbt_update_lastrec( struct xfs_btree_cur *cur, const struct xfs_btree_block *block, const union xfs_btree_rec *rec, int ptr, int reason) argument 180 xfs_allocbt_get_minrecs( struct xfs_btree_cur *cur, int level) argument 188 xfs_allocbt_get_maxrecs( struct xfs_btree_cur *cur, int level) argument 227 xfs_allocbt_init_rec_from_cur( struct xfs_btree_cur *cur, union xfs_btree_rec *rec) argument 236 xfs_allocbt_init_ptr_from_cur( struct xfs_btree_cur *cur, union xfs_btree_ptr *ptr) argument 251 xfs_bnobt_key_diff( struct xfs_btree_cur *cur, const union xfs_btree_key *key) argument 262 xfs_cntbt_key_diff( struct xfs_btree_cur *cur, const union xfs_btree_key *key) argument 278 xfs_bnobt_diff_two_keys( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2, const union xfs_btree_key *mask) argument 291 xfs_cntbt_diff_two_keys( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2, const union xfs_btree_key *mask) argument 421 xfs_bnobt_keys_inorder( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2) argument 431 xfs_bnobt_recs_inorder( struct xfs_btree_cur *cur, const union xfs_btree_rec *r1, const union xfs_btree_rec *r2) argument 442 xfs_cntbt_keys_inorder( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2) argument 455 xfs_cntbt_recs_inorder( struct xfs_btree_cur *cur, const union xfs_btree_rec *r1, const union xfs_btree_rec *r2) argument 468 xfs_allocbt_keys_contiguous( struct xfs_btree_cur *cur, const union xfs_btree_key *key1, const union xfs_btree_key *key2, const union xfs_btree_key *mask) argument 555 struct xfs_btree_cur *cur; local 581 struct xfs_btree_cur *cur; local 600 xfs_allocbt_commit_staged_btree( struct xfs_btree_cur *cur, struct xfs_trans *tp, struct xfs_buf *agbp) argument [all...] |
H A D | xfs_btree_mem.h | 50 void xfbtree_set_root(struct xfs_btree_cur *cur, 52 void xfbtree_init_ptr_from_cur(struct xfs_btree_cur *cur, 54 struct xfs_btree_cur *xfbtree_dup_cursor(struct xfs_btree_cur *cur); 56 int xfbtree_get_minrecs(struct xfs_btree_cur *cur, int level); 57 int xfbtree_get_maxrecs(struct xfs_btree_cur *cur, int level); 59 int xfbtree_alloc_block(struct xfs_btree_cur *cur, 62 int xfbtree_free_block(struct xfs_btree_cur *cur, struct xfs_buf *bp);
|
H A D | xfs_refcount_btree.c | 30 struct xfs_btree_cur *cur) 32 return xfs_refcountbt_init_cursor(cur->bc_mp, cur->bc_tp, 33 cur->bc_ag.agbp, cur->bc_ag.pag); 38 struct xfs_btree_cur *cur, 42 struct xfs_buf *agbp = cur->bc_ag.agbp; 52 xfs_alloc_log_agf(cur->bc_tp, agbp, 58 struct xfs_btree_cur *cur, 63 struct xfs_buf *agbp = cur 29 xfs_refcountbt_dup_cursor( struct xfs_btree_cur *cur) argument 37 xfs_refcountbt_set_root( struct xfs_btree_cur *cur, const union xfs_btree_ptr *ptr, int inc) argument 57 xfs_refcountbt_alloc_block( struct xfs_btree_cur *cur, const union xfs_btree_ptr *start, union xfs_btree_ptr *new, int *stat) argument 100 xfs_refcountbt_free_block( struct xfs_btree_cur *cur, struct xfs_buf *bp) argument 116 xfs_refcountbt_get_minrecs( struct xfs_btree_cur *cur, int level) argument 124 xfs_refcountbt_get_maxrecs( struct xfs_btree_cur *cur, int level) argument 152 xfs_refcountbt_init_rec_from_cur( struct xfs_btree_cur *cur, union xfs_btree_rec *rec) argument 167 xfs_refcountbt_init_ptr_from_cur( struct xfs_btree_cur *cur, union xfs_btree_ptr *ptr) argument 179 xfs_refcountbt_key_diff( struct xfs_btree_cur *cur, const union xfs_btree_key *key) argument 193 xfs_refcountbt_diff_two_keys( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2, const union xfs_btree_key *mask) argument 288 xfs_refcountbt_keys_inorder( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2) argument 298 xfs_refcountbt_recs_inorder( struct xfs_btree_cur *cur, const union xfs_btree_rec *r1, const union xfs_btree_rec *r2) argument 309 xfs_refcountbt_keys_contiguous( struct xfs_btree_cur *cur, const union xfs_btree_key *key1, const union xfs_btree_key *key2, const union xfs_btree_key *mask) argument 363 struct xfs_btree_cur *cur; local 386 xfs_refcountbt_commit_staged_btree( struct xfs_btree_cur *cur, struct xfs_trans *tp, struct xfs_buf *agbp) argument [all...] |
H A D | xfs_bmap_btree.c | 182 struct xfs_btree_cur *cur) 186 new = xfs_bmbt_init_cursor(cur->bc_mp, cur->bc_tp, 187 cur->bc_ino.ip, cur->bc_ino.whichfork); 188 new->bc_flags |= (cur->bc_flags & 209 struct xfs_btree_cur *cur, 218 args.tp = cur->bc_tp; 219 args.mp = cur->bc_mp; 220 xfs_rmap_ino_bmbt_owner(&args.oinfo, cur 181 xfs_bmbt_dup_cursor( struct xfs_btree_cur *cur) argument 208 xfs_bmbt_alloc_block( struct xfs_btree_cur *cur, const union xfs_btree_ptr *start, union xfs_btree_ptr *new, int *stat) argument 272 xfs_bmbt_free_block( struct xfs_btree_cur *cur, struct xfs_buf *bp) argument 296 xfs_bmbt_get_minrecs( struct xfs_btree_cur *cur, int level) argument 311 xfs_bmbt_get_maxrecs( struct xfs_btree_cur *cur, int level) argument 336 xfs_bmbt_get_dmaxrecs( struct xfs_btree_cur *cur, int level) argument 365 xfs_bmbt_init_rec_from_cur( struct xfs_btree_cur *cur, union xfs_btree_rec *rec) argument 373 xfs_bmbt_key_diff( struct xfs_btree_cur *cur, const union xfs_btree_key *key) argument 382 xfs_bmbt_diff_two_keys( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2, const union xfs_btree_key *mask) argument 486 xfs_bmbt_keys_inorder( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2) argument 496 xfs_bmbt_recs_inorder( struct xfs_btree_cur *cur, const union xfs_btree_rec *r1, const union xfs_btree_rec *r2) argument 507 xfs_bmbt_keys_contiguous( struct xfs_btree_cur *cur, const union xfs_btree_key *key1, const union xfs_btree_key *key2, const union xfs_btree_key *mask) argument 560 struct xfs_btree_cur *cur; local 607 xfs_bmbt_commit_staged_btree( struct xfs_btree_cur *cur, struct xfs_trans *tp, int whichfork) argument 720 struct xfs_btree_cur *cur; local [all...] |
H A D | xfs_rmap_btree.c | 57 struct xfs_btree_cur *cur) 59 return xfs_rmapbt_init_cursor(cur->bc_mp, cur->bc_tp, 60 cur->bc_ag.agbp, cur->bc_ag.pag); 65 struct xfs_btree_cur *cur, 69 struct xfs_buf *agbp = cur->bc_ag.agbp; 76 cur->bc_ag.pag->pagf_rmap_level += inc; 78 xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS); 83 struct xfs_btree_cur *cur, 56 xfs_rmapbt_dup_cursor( struct xfs_btree_cur *cur) argument 64 xfs_rmapbt_set_root( struct xfs_btree_cur *cur, const union xfs_btree_ptr *ptr, int inc) argument 82 xfs_rmapbt_alloc_block( struct xfs_btree_cur *cur, const union xfs_btree_ptr *start, union xfs_btree_ptr *new, int *stat) argument 117 xfs_rmapbt_free_block( struct xfs_btree_cur *cur, struct xfs_buf *bp) argument 142 xfs_rmapbt_get_minrecs( struct xfs_btree_cur *cur, int level) argument 150 xfs_rmapbt_get_maxrecs( struct xfs_btree_cur *cur, int level) argument 207 xfs_rmapbt_init_rec_from_cur( struct xfs_btree_cur *cur, union xfs_btree_rec *rec) argument 219 xfs_rmapbt_init_ptr_from_cur( struct xfs_btree_cur *cur, union xfs_btree_ptr *ptr) argument 241 xfs_rmapbt_key_diff( struct xfs_btree_cur *cur, const union xfs_btree_key *key) argument 271 xfs_rmapbt_diff_two_keys( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2, const union xfs_btree_key *mask) argument 409 xfs_rmapbt_keys_inorder( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2) argument 439 xfs_rmapbt_recs_inorder( struct xfs_btree_cur *cur, const union xfs_btree_rec *r1, const union xfs_btree_rec *r2) argument 469 xfs_rmapbt_keys_contiguous( struct xfs_btree_cur *cur, const union xfs_btree_key *key1, const union xfs_btree_key *key2, const union xfs_btree_key *mask) argument 532 struct xfs_btree_cur *cur; local 644 struct xfs_btree_cur *cur; local 696 xfs_rmapbt_commit_staged_btree( struct xfs_btree_cur *cur, struct xfs_trans *tp, struct xfs_buf *agbp) argument [all...] |
H A D | xfs_refcount.h | 16 extern int xfs_refcount_lookup_le(struct xfs_btree_cur *cur, 18 extern int xfs_refcount_lookup_ge(struct xfs_btree_cur *cur, 20 extern int xfs_refcount_lookup_eq(struct xfs_btree_cur *cur, 22 extern int xfs_refcount_get_rec(struct xfs_btree_cur *cur, 84 extern int xfs_refcount_find_shared(struct xfs_btree_cur *cur, 114 extern int xfs_refcount_has_records(struct xfs_btree_cur *cur, 122 extern int xfs_refcount_insert(struct xfs_btree_cur *cur, 131 struct xfs_btree_cur *cur, 135 int xfs_refcount_query_range(struct xfs_btree_cur *cur,
|
/linux-master/lib/ |
H A D | errseq.c | 61 errseq_t cur, old; local 90 cur = new; 95 cur = cmpxchg(eseq, old, new); 101 if (likely(cur == old || cur == new)) 105 old = cur; 107 return cur; 147 errseq_t cur = READ_ONCE(*eseq); local 149 if (likely(cur == since)) 151 return -(cur [all...] |
H A D | test_list_sort.c | 62 struct list_head *cur; local 84 for (cur = head.next; cur->next != &head; cur = cur->next) { 88 KUNIT_ASSERT_PTR_EQ_MSG(test, cur->next->prev, cur, 91 cmp_result = cmp(test, cur, cur->next); 94 el = container_of(cur, struc [all...] |
/linux-master/tools/perf/util/ |
H A D | strfilter.c | 84 struct strfilter_node root, *cur, *last_op; local 91 last_op = cur = &root; 97 if (!cur->r || !last_op->r) 99 cur = strfilter_node__alloc(OP_and, last_op->r, NULL); 100 if (!cur) 102 last_op->r = cur; 103 last_op = cur; 106 if (!cur->r || !root.r) 108 cur = strfilter_node__alloc(OP_or, root.r, NULL); 109 if (!cur) [all...] |
/linux-master/net/dccp/ccids/lib/ |
H A D | loss_interval.c | 89 struct tfrc_loss_interval *cur = tfrc_lh_peek(lh); local 93 if (cur == NULL) /* not initialised */ 96 len = dccp_delta_seqno(cur->li_seqno, DCCP_SKB_CB(skb)->dccpd_seq) + 1; 98 if (len - (s64)cur->li_length <= 0) /* duplicate or reordered */ 101 if (SUB16(dccp_hdr(skb)->dccph_ccval, cur->li_ccval) > 4) 105 * starting the current loss interval (cur) and if the modulo-16 106 * distance from C(cur) to C(S) is greater than 4, consider all 110 cur->li_is_closed = 1; 115 cur->li_length = len; 122 static inline u8 tfrc_lh_is_new_loss(struct tfrc_loss_interval *cur, argument 141 struct tfrc_loss_interval *cur = tfrc_lh_peek(lh), *new; local [all...] |
/linux-master/drivers/net/wireless/mediatek/mt76/ |
H A D | util.c | 12 u32 cur; local 16 cur = __mt76_rr(dev, offset) & mask; 17 if (cur == val) 30 u32 cur; local 34 cur = __mt76_rr(dev, offset) & mask; 35 if (cur == val) 47 int i, idx = 0, cur; local 55 cur = i * 32 + idx; 56 if (cur >= size) 60 return cur; [all...] |
/linux-master/drivers/misc/vmw_vmci/ |
H A D | vmci_event.c | 49 struct vmci_subscription *cur, *p2; local 50 list_for_each_entry_safe(cur, p2, &subscriber_array[e], node) { 58 list_del(&cur->node); 59 kfree(cur); 72 struct vmci_subscription *cur; local 73 list_for_each_entry(cur, &subscriber_array[e], node) { 74 if (cur->id == sub_id) 75 return cur; 87 struct vmci_subscription *cur; local 92 list_for_each_entry_rcu(cur, subscriber_lis [all...] |
/linux-master/drivers/char/agp/ |
H A D | isoch.c | 25 struct agp_3_5_dev *cur, *n = list_entry(new, struct agp_3_5_dev, list); local 29 cur = list_entry(pos, struct agp_3_5_dev, list); 30 if (cur->maxbw > n->maxbw) 38 struct agp_3_5_dev *cur; local 46 cur = list_entry(pos, struct agp_3_5_dev, list); 47 dev = cur->dev; 49 pci_read_config_dword(dev, cur->capndx+AGPNISTAT, &nistat); 50 cur->maxbw = (nistat >> 16) & 0xff; 82 struct agp_3_5_dev *cur; local 137 cur 286 struct agp_3_5_dev *cur; local 321 struct agp_3_5_dev *dev_list, *cur; local [all...] |
/linux-master/tools/lib/ |
H A D | bitmap.c | 34 /* current bit is 'cur', most recently seen range is [rbot, rtop] */ 35 unsigned int cur, rbot, rtop; local 39 rbot = cur = find_first_bit(bitmap, nbits); 40 while (cur < nbits) { 41 rtop = cur; 42 cur = find_next_bit(bitmap, nbits, cur + 1); 43 if (cur < nbits && cur <= rtop + 1) 55 rbot = cur; [all...] |
/linux-master/arch/x86/kernel/ |
H A D | reboot_fixups_32.c | 84 const struct device_fixup *cur; local 94 cur = &(fixups_table[i]); 95 dev = pci_get_device(cur->vendor, cur->device, NULL); 99 cur->reboot_fixup(dev);
|
/linux-master/arch/csky/kernel/ |
H A D | cpu-probe.c | 14 unsigned int cur, next, i; local 20 cur = mfcr("cr13"); 22 seq_printf(m, "product info[%d] : 0x%08x\n", i, cur); 27 if (cur == next) 30 cur = next;
|
/linux-master/drivers/mtd/nand/ |
H A D | ecc-sw-hamming.c | 121 u32 cur; local 152 cur = *bp++; 153 tmppar = cur; 154 rp4 ^= cur; 155 cur = *bp++; 156 tmppar ^= cur; 158 cur = *bp++; 159 tmppar ^= cur; 160 rp4 ^= cur; 161 cur [all...] |