Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for numReferrals (0.07 sec)

  1. src/main/java/jcifs/internal/dfs/DfsReferralResponseBuffer.java

        private int pathConsumed;
        private int numReferrals;
        private int tflags;
        private Referral[] referrals;
    
    
        /**
         * @return the pathConsumed
         */
        public final int getPathConsumed () {
            return this.pathConsumed;
        }
    
    
        /**
         * @return the numReferrals
         */
        public final int getNumReferrals () {
            return this.numReferrals;
        }
    
    
        /**
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sun Jul 01 13:12:10 UTC 2018
    - 2.6K bytes
    - Viewed (0)
  2. src/main/java/jcifs/smb1/smb1/Trans2GetDfsReferralResponse.java

            if((flags2 & FLAGS2_UNICODE) != 0) {
                pathConsumed /= 2;
            }
            numReferrals = readInt2( buffer, bufferIndex );
            bufferIndex += 2;
            flags = readInt2( buffer, bufferIndex );
            bufferIndex += 4;
    
            referrals = new Referral[numReferrals];
            for (int ri = 0; ri < numReferrals; ri++) {
                referrals[ri] = new Referral();
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Fri Mar 22 21:10:40 UTC 2019
    - 5K bytes
    - Viewed (0)
  3. src/main/java/jcifs/smb1/smb1/SmbTransport.java

            Trans2GetDfsReferralResponse resp = new Trans2GetDfsReferralResponse();
            ipc.send( new Trans2GetDfsReferral( path ), resp );
    
            if (resp.numReferrals == 0) {
                return null;
            } else if (rn == 0 || resp.numReferrals < rn) {
                rn = resp.numReferrals;
            }
    
            DfsReferral dr = new DfsReferral();
    
            String[] arr = new String[4];
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Fri Mar 22 21:10:40 UTC 2019
    - 31.2K bytes
    - Viewed (0)
Back to top