Lines Matching refs:dfp
107 xfs_dir2_data_free_t *dfp; /* bestfree entry */
196 fa = xfs_dir2_data_freefind_verify(hdr, bf, dup, &dfp);
199 if (dfp) {
200 i = (int)(dfp - bf);
464 struct xfs_dir2_data_free *dfp;
477 for (dfp = &bf[0]; dfp < &bf[XFS_DIR2_DATA_FD_COUNT]; dfp++) {
478 if (!dfp->offset) {
479 if (dfp->length)
486 if (be16_to_cpu(dfp->offset) == off) {
488 if (dfp->length != dup->length)
490 } else if (be16_to_cpu(dfp->offset) > off) {
492 be16_to_cpu(dfp->offset))
495 if (be16_to_cpu(dfp->offset) +
496 be16_to_cpu(dfp->length) > off)
500 be16_to_cpu(dfp->length) < be16_to_cpu(dup->length))
502 if (dfp > &bf[0] &&
503 be16_to_cpu(dfp[-1].length) < be16_to_cpu(dfp[0].length))
522 xfs_dir2_data_free_t *dfp; /* bestfree entry */
537 for (dfp = &bf[0]; dfp < &bf[XFS_DIR2_DATA_FD_COUNT]; dfp++) {
538 if (!dfp->offset)
540 if (be16_to_cpu(dfp->offset) == off)
541 return dfp;
555 struct xfs_dir2_data_free *dfp, /* bestfree table pointer */
572 if (be16_to_cpu(new.length) > be16_to_cpu(dfp[0].length)) {
573 dfp[2] = dfp[1];
574 dfp[1] = dfp[0];
575 dfp[0] = new;
577 return &dfp[0];
579 if (be16_to_cpu(new.length) > be16_to_cpu(dfp[1].length)) {
580 dfp[2] = dfp[1];
581 dfp[1] = new;
583 return &dfp[1];
585 if (be16_to_cpu(new.length) > be16_to_cpu(dfp[2].length)) {
586 dfp[2] = new;
588 return &dfp[2];
600 struct xfs_dir2_data_free *dfp, /* bestfree entry pointer */
612 if (dfp == &bf[0]) {
619 else if (dfp == &bf[1])
625 ASSERT(dfp == &bf[2]);
844 xfs_dir2_data_free_t *dfp; /* bestfree pointer */
897 dfp = xfs_dir2_data_freefind(hdr, bf, prevdup);
916 * dfp and dfp2 (don't know which is which), and
920 ASSERT(dfp && dfp2);
921 if (dfp == &bf[1]) {
922 dfp = &bf[0];
923 ASSERT(dfp2 == dfp);
927 xfs_dir2_data_freeremove(hdr, bf, dfp, needlogp);
931 dfp = xfs_dir2_data_freeinsert(hdr, bf, prevdup,
933 ASSERT(dfp == &bf[0]);
934 ASSERT(dfp->length == prevdup->length);
935 ASSERT(!dfp[1].length);
936 ASSERT(!dfp[2].length);
943 dfp = xfs_dir2_data_freefind(hdr, bf, prevdup);
953 if (dfp) {
954 xfs_dir2_data_freeremove(hdr, bf, dfp, needlogp);
969 dfp = xfs_dir2_data_freefind(hdr, bf, postdup);
981 if (dfp) {
982 xfs_dir2_data_freeremove(hdr, bf, dfp, needlogp);
1037 struct xfs_dir2_data_free *dfp,
1040 if (dfp == NULL)
1042 if (dfp->length != newdup->length)
1044 if (be16_to_cpu(dfp->offset) != (char *)newdup - (char *)hdr)
1063 xfs_dir2_data_free_t *dfp; /* bestfree pointer */
1082 dfp = xfs_dir2_data_freefind(hdr, bf, dup);
1083 ASSERT(dfp || oldlen <= be16_to_cpu(bf[2].length));
1096 if (dfp) {
1099 xfs_dir2_data_freeremove(hdr, bf, dfp,
1117 if (dfp) {
1118 xfs_dir2_data_freeremove(hdr, bf, dfp, needlogp);
1119 dfp = xfs_dir2_data_freeinsert(hdr, bf, newdup,
1121 fa = xfs_dir2_data_check_new_free(hdr, dfp, newdup);
1129 needscan = dfp == &bf[2];
1145 if (dfp) {
1146 xfs_dir2_data_freeremove(hdr, bf, dfp, needlogp);
1147 dfp = xfs_dir2_data_freeinsert(hdr, bf, newdup,
1149 fa = xfs_dir2_data_check_new_free(hdr, dfp, newdup);
1157 needscan = dfp == &bf[2];
1184 if (dfp) {
1187 xfs_dir2_data_freeremove(hdr, bf, dfp,