Searched refs:sa (Results 251 - 275 of 472) sorted by path

<<111213141516171819

/linux-master/fs/smb/client/
H A Dfscache.c40 const struct sockaddr *sa = (struct sockaddr *)&server->dstaddr; local
57 switch (sa->sa_family) {
63 cifs_dbg(VFS, "Unknown network family '%d'\n", sa->sa_family);
81 key = kasprintf(GFP_KERNEL, "cifs,%pISpc,%s", sa, sharename);
/linux-master/fs/smb/server/
H A Dtransport_tcp.c163 static unsigned short ksmbd_tcp_get_port(const struct sockaddr *sa) argument
165 switch (sa->sa_family) {
167 return ntohs(((struct sockaddr_in *)sa)->sin_port);
169 return ntohs(((struct sockaddr_in6 *)sa)->sin6_port);
/linux-master/fs/ubifs/
H A Ddebug.c2328 struct ubifs_scan_node *sa, *sb; local
2338 sa = container_of(cur, struct ubifs_scan_node, list);
2341 if (sa->type != UBIFS_DATA_NODE) {
2342 ubifs_err(c, "bad node type %d", sa->type);
2343 ubifs_dump_node(c, sa->node, c->leb_size - sa->offs);
2352 inuma = key_inum(c, &sa->key);
2363 blka = key_block(c, &sa->key);
2379 ubifs_dump_node(c, sa->node, c->leb_size - sa
2395 struct ubifs_scan_node *sa, *sb; local
[all...]
H A Dgc.c110 struct ubifs_scan_node *sa, *sb; local
116 sa = list_entry(a, struct ubifs_scan_node, list);
119 ubifs_assert(c, key_type(c, &sa->key) == UBIFS_DATA_KEY);
121 ubifs_assert(c, sa->type == UBIFS_DATA_NODE);
124 inuma = key_inum(c, &sa->key);
128 unsigned int blka = key_block(c, &sa->key);
154 struct ubifs_scan_node *sa, *sb; local
160 sa = list_entry(a, struct ubifs_scan_node, list);
163 ubifs_assert(c, key_type(c, &sa->key) != UBIFS_DATA_KEY &&
165 ubifs_assert(c, sa
[all...]
/linux-master/fs/udf/
H A Ddirectory.c493 struct short_ad *sa; local
503 sa = (struct short_ad *)ptr;
504 if (sa->extLength == 0)
510 return sa;
/linux-master/fs/xfs/scrub/
H A Dagheader.c49 error = xchk_ag_init_existing(sc, agno, &sc->sa);
59 /* scrub teardown will take care of sc->sa for us */
383 struct xfs_agf *agf = sc->sa.agf_bp->b_addr;
387 if (!sc->sa.bno_cur)
390 error = xfs_alloc_query_all(sc->sa.bno_cur,
392 if (!xchk_should_check_xref(sc, &error, &sc->sa.bno_cur))
395 xchk_block_xref_set_corrupt(sc, sc->sa.agf_bp);
403 struct xfs_agf *agf = sc->sa.agf_bp->b_addr;
409 if (!sc->sa.cnt_cur)
413 error = xfs_alloc_lookup_le(sc->sa
[all...]
H A Dagheader_repair.c120 if (!xfs_verify_agbno(sc->sa.pag, agbno))
144 return xfs_verify_agbno(sc->sa.pag, fab->root) &&
204 struct xfs_perag *pag = sc->sa.pag;
263 cur = xfs_bnobt_init_cursor(mp, sc->tp, agf_bp, sc->sa.pag);
276 cur = xfs_cntbt_init_cursor(mp, sc->tp, agf_bp, sc->sa.pag);
284 cur = xfs_rmapbt_init_cursor(mp, sc->tp, agf_bp, sc->sa.pag);
297 sc->sa.pag);
328 pag = sc->sa.pag;
387 XFS_AG_DADDR(mp, sc->sa.pag->pag_agno,
404 error = xfs_alloc_read_agfl(sc->sa
[all...]
H A Dalloc.c69 pcur = &sc->sa.cnt_cur;
71 pcur = &sc->sa.bno_cur;
163 cur = sc->sa.bno_cur;
166 cur = sc->sa.cnt_cur;
186 if (!sc->sa.bno_cur || xchk_skip_xref(sc->sm))
189 error = xfs_alloc_has_records(sc->sa.bno_cur, agbno, len, &outcome);
190 if (!xchk_should_check_xref(sc, &error, &sc->sa.bno_cur))
193 xchk_btree_xref_set_corrupt(sc, sc->sa.bno_cur, 0);
H A Dalloc_repair.c141 busy_gen = READ_ONCE(sc->sa.pag->pagb_gen);
142 if (xfs_extent_busy_list_empty(sc->sa.pag))
145 return xfs_extent_busy_flush(sc->tp, sc->sa.pag, busy_gen, 0);
157 if (xfs_alloc_check_irec(sc->sa.pag, rec) != NULL)
161 error = xfs_ialloc_has_inodes_at_extent(sc->sa.ino_cur,
169 if (sc->sa.refc_cur) {
170 error = xfs_refcount_has_records(sc->sa.refc_cur,
178 error = xfs_refcount_has_records(sc->sa.refc_cur,
213 trace_xrep_abt_found(sc->mp, sc->sa.pag->pag_agno, &arec);
367 struct xfs_agf *agf = sc->sa
[all...]
H A Dbmap.c174 error = xfs_rmap_lookup_le_range(info->sc->sa.rmap_cur, agbno,
177 error = xfs_rmap_lookup_le(info->sc->sa.rmap_cur, agbno,
180 if (!xchk_should_check_xref(info->sc, &error, &info->sc->sa.rmap_cur))
200 if (!info->sc->sa.rmap_cur || xchk_skip_xref(info->sc->sm))
267 if (!info->sc->sa.rmap_cur || xchk_skip_xref(info->sc->sm))
339 error = xchk_ag_init_existing(info->sc, agno, &info->sc->sa);
383 xchk_ag_free(info->sc, &info->sc->sa);
H A Dbmap_repair.c108 error = xfs_refcount_find_shared(sc->sa.refc_cur, agbno, blockcount,
214 error = xfs_alloc_has_records(sc->sa.bno_cur, rec->rm_startblock,
222 error = xfs_ialloc_has_inodes_at_extent(sc->sa.ino_cur,
355 error = xrep_ag_init(sc, pag, &sc->sa);
359 error = xfs_rmap_query_all(sc->sa.rmap_cur, xrep_bmap_walk_rmap, rb);
360 xchk_ag_free(sc, &sc->sa);
H A Dbtree.c384 * sc->sa so that we can check for the presence of an ownership record
389 error = xchk_ag_init_existing(bs->sc, agno, &bs->sc->sa);
397 * The bnobt scrubber aliases bs->cur to bs->sc->sa.bno_cur, so we
401 if (!bs->sc->sa.bno_cur && xfs_btree_is_bno(bs->cur->bc_ops))
405 if (!bs->sc->sa.rmap_cur && xfs_btree_is_rmap(bs->cur->bc_ops))
410 xchk_ag_free(bs->sc, &bs->sc->sa);
H A Dcommon.c446 struct xchk_ag *sa)
450 error = xfs_ialloc_read_agi(sa->pag, sc->tp, 0, &sa->agi_bp);
454 error = xfs_alloc_read_agf(sa->pag, sc->tp, 0, &sa->agf_bp);
469 struct xchk_ag *sa = &sc->sa; local
472 ASSERT(sa->pag != NULL);
473 ASSERT(sa->agi_bp == NULL);
474 ASSERT(sa
444 xchk_perag_read_headers( struct xfs_scrub *sc, struct xchk_ag *sa) argument
544 xchk_ag_read_headers( struct xfs_scrub *sc, xfs_agnumber_t agno, struct xchk_ag *sa) argument
561 xchk_ag_btcur_free( struct xchk_ag *sa) argument
587 xchk_ag_btcur_init( struct xfs_scrub *sc, struct xchk_ag *sa) argument
642 xchk_ag_free( struct xfs_scrub *sc, struct xchk_ag *sa) argument
670 xchk_ag_init( struct xfs_scrub *sc, xfs_agnumber_t agno, struct xchk_ag *sa) argument
[all...]
H A Dcommon.h110 void xchk_ag_free(struct xfs_scrub *sc, struct xchk_ag *sa);
112 struct xchk_ag *sa);
124 struct xchk_ag *sa)
126 int error = xchk_ag_init(sc, agno, sa);
132 struct xchk_ag *sa);
133 void xchk_ag_btcur_free(struct xchk_ag *sa);
134 void xchk_ag_btcur_init(struct xfs_scrub *sc, struct xchk_ag *sa);
230 (sc)->sa.pag ? (sc)->sa.pag->pag_agno : (sc)->sm->sm_agno, \
121 xchk_ag_init_existing( struct xfs_scrub *sc, xfs_agnumber_t agno, struct xchk_ag *sa) argument
H A Dcow_repair.c253 error = xrep_ag_init(sc, pag, &sc->sa);
261 error = xfs_refcount_query_range(sc->sa.refc_cur, &rc_low, &rc_high,
271 error = xfs_refcount_query_range(sc->sa.refc_cur, &rc_low, &rc_high,
290 error = xfs_rmap_query_range(sc->sa.rmap_cur, &rm_low, &rm_high,
308 xchk_ag_free(sc, &sc->sa);
H A Dfscounters.c267 error = xchk_ag_init_existing(sc, agno, &sc->sa);
271 error = xfs_btree_count_blocks(sc->sa.bno_cur, &blocks);
276 error = xfs_btree_count_blocks(sc->sa.cnt_cur, &blocks);
282 xchk_ag_free(sc, &sc->sa);
H A Dialloc.c73 struct xfs_btree_cur *cur = sc->sa.fino_cur;
144 if (!sc->sa.fino_cur || xchk_skip_xref(sc->sm))
158 if (!xchk_should_check_xref(sc, &error, &sc->sa.fino_cur))
176 struct xfs_btree_cur *cur = sc->sa.ino_cur;
232 if (!sc->sa.ino_cur || xchk_skip_xref(sc->sm))
246 if (!xchk_should_check_xref(sc, &error, &sc->sa.ino_cur))
659 if (!sc->sa.ino_cur || !sc->sa.rmap_cur ||
660 (xfs_has_finobt(sc->mp) && !sc->sa.fino_cur) ||
665 error = xfs_btree_count_blocks(sc->sa
[all...]
H A Dialloc_repair.c151 xfs_agnumber_t agno = ri->sc->sa.pag->pag_agno;
191 if (xfs_inobt_check_irec(ri->sc->sa.pag, &ri->rie) != NULL)
197 trace_xrep_ibt_found(ri->sc->mp, ri->sc->sa.pag->pag_agno, &ri->rie);
310 imap.im_blkno = XFS_AGB_TO_DADDR(mp, sc->sa.pag->pag_agno, cluster_bno);
351 if (!xfs_verify_agbext(sc->sa.pag, agbno, len))
379 if (!xfs_verify_agino(sc->sa.pag, agino))
383 if (!xfs_verify_agino(sc->sa.pag, agino))
387 error = xfs_alloc_has_records(sc->sa.bno_cur, agbno, len, &outcome);
402 if (!xfs_verify_agbext(ri->sc->sa.pag, rec->rm_startblock,
426 trace_xrep_ibt_walk_rmap(mp, ri->sc->sa
[all...]
H A Dinode.c615 if (!sc->sa.fino_cur || xchk_skip_xref(sc->sm))
624 error = xfs_inobt_lookup(sc->sa.fino_cur, agino, XFS_LOOKUP_LE,
626 if (!xchk_should_check_xref(sc, &error, &sc->sa.fino_cur) ||
630 error = xfs_inobt_get_rec(sc->sa.fino_cur, &rec, &has_record);
631 if (!xchk_should_check_xref(sc, &error, &sc->sa.fino_cur) ||
644 xchk_btree_xref_set_corrupt(sc, sc->sa.fino_cur, 0);
698 error = xchk_ag_init_existing(sc, agno, &sc->sa);
710 xchk_ag_free(sc, &sc->sa);
H A Dnewbt.c60 free = sc->sa.pag->pagf_freeblks;
61 sz = xfs_ag_block_count(sc->mp, sc->sa.pag->pag_agno);
208 if (agno == sc->sa.pag->pag_agno &&
212 xnr->alloc_hint = XFS_AGB_TO_FSB(sc->mp, sc->sa.pag->pag_agno,
226 ASSERT(sc->sa.pag != NULL);
258 if (agno != sc->sa.pag->pag_agno) {
259 ASSERT(agno == sc->sa.pag->pag_agno);
263 error = xrep_newbt_add_blocks(xnr, sc->sa.pag, &args);
H A Dreap.c126 error = xfs_rmap_alloc(sc->tp, sc->sa.agf_bp, sc->sa.pag, agbno, 1,
132 error = xfs_alloc_read_agfl(sc->sa.pag, sc->tp, &agfl_bp);
136 error = xfs_alloc_put_freelist(sc->sa.pag, sc->tp, sc->sa.agf_bp,
140 xfs_extent_busy_insert(sc->tp, sc->sa.pag, agbno, 1,
264 struct xfs_perag *pag = sc->sa.pag;
266 xfs_agnumber_t agno = sc->sa.pag->pag_agno;
314 trace_xreap_agextent_binval(sc->sa.pag, agbno, *aglenp);
341 cur = xfs_rmapbt_init_cursor(sc->mp, sc->tp, sc->sa
[all...]
H A Drefcount.c302 if (!sc->sa.rmap_cur || xchk_skip_xref(sc->sm))
312 error = xfs_rmap_query_range(sc->sa.rmap_cur, &low, &high,
314 if (!xchk_should_check_xref(sc, &error, &sc->sa.rmap_cur))
319 trace_xchk_refcount_incorrect(sc->sa.pag, irec, refchk.seen);
320 xchk_btree_xref_set_corrupt(sc, sc->sa.rmap_cur, 0);
389 if (bno <= rrc->next_unshared_agbno || !sc->sa.rmap_cur ||
398 error = xfs_rmap_query_range(sc->sa.rmap_cur, &low, &high,
401 xchk_btree_xref_set_corrupt(sc, sc->sa.rmap_cur, 0);
403 xchk_should_check_xref(sc, &error, &sc->sa.rmap_cur);
497 if (!sc->sa
[all...]
H A Drefcount_repair.c144 if (xfs_refcount_check_irec(sc->sa.pag, rec) != NULL)
148 error = xfs_alloc_has_records(sc->sa.bno_cur, rec->rc_startblock,
156 error = xfs_ialloc_has_inodes_at_extent(sc->sa.ino_cur,
192 trace_xrep_refc_found(sc->sa.pag, &irec);
239 struct xfs_btree_cur *cur = rr->sc->sa.rmap_cur;
311 uint32_t sa, sb; local
313 sa = xrep_refc_encode_startblock(ap);
316 if (sa > sb)
318 if (sa < sb)
395 error = xfs_btree_decrement(sc->sa
[all...]
H A Drepair.c63 xchk_ag_btcur_free(&sc->sa);
161 if (sc->sa.agi_bp) {
162 xfs_ialloc_log_agi(sc->tp, sc->sa.agi_bp, XFS_AGI_MAGICNUM);
163 xfs_trans_bhold(sc->tp, sc->sa.agi_bp);
166 if (sc->sa.agf_bp) {
167 xfs_alloc_log_agf(sc->tp, sc->sa.agf_bp, XFS_AGF_MAGICNUM);
168 xfs_trans_bhold(sc->tp, sc->sa.agf_bp);
182 if (sc->sa.agi_bp)
183 xfs_trans_bjoin(sc->tp, sc->sa.agi_bp);
184 if (sc->sa
832 xrep_ag_btcur_init( struct xfs_scrub *sc, struct xchk_ag *sa) argument
933 xrep_ag_init( struct xfs_scrub *sc, struct xfs_perag *pag, struct xchk_ag *sa) argument
[all...]
H A Drepair.h106 void xrep_ag_btcur_init(struct xfs_scrub *sc, struct xchk_ag *sa);
108 struct xchk_ag *sa);

Completed in 564 milliseconds

<<111213141516171819