}

                this.fp += n;
                len -= n;
                if (response != null) {
                    response.adjustOffset(n);
                }

            } while (len > effectiveBlockSize && n == r);

            // Optimization: Continue reading if we have small remaining data and got full blocks

                    return (int) (this.fp - start > 0L ? this.fp - start : -1);
                }
                this.fp += n;
                len -= n;
                off += n;
                response.adjustOffset(n);
            } while (len > 0 && n == r);

            return (int) (this.fp - start);
        } catch (final CIFSException e) {
            throw SmbException.wrap(e);
        }
    }