0N/A/*
2362N/A * Copyright (c) 2000, 2007, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
2362N/A * published by the Free Software Foundation. Oracle designates this
0N/A * particular file as subject to the "Classpath" exception as provided
2362N/A * by Oracle in the LICENSE file that accompanied this code.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/A
0N/A/*
0N/A *
0N/A * (C) Copyright IBM Corp. 1999 All Rights Reserved.
0N/A * Copyright 1997 The Open Group Research Institute. All rights reserved.
0N/A */
0N/A
0N/Apackage sun.security.krb5.internal;
0N/A
0N/Aimport sun.security.krb5.Confounder;
0N/A
0N/Apublic class LocalSeqNumber implements SeqNumber {
0N/A private int lastSeqNumber;
0N/A
0N/A public LocalSeqNumber() {
0N/A randInit();
0N/A }
0N/A
0N/A public LocalSeqNumber(int start) {
0N/A init(start);
0N/A }
0N/A
0N/A public LocalSeqNumber(Integer start) {
0N/A init(start.intValue());
0N/A }
0N/A
0N/A public synchronized void randInit() {
0N/A /*
0N/A * Sequence numbers fall in the range 0 through 2^32 - 1 and wrap
0N/A * to zero following the value 2^32 - 1.
0N/A * Previous implementations used signed sequence numbers.
0N/A * Workaround implementation incompatibilities by not generating
0N/A * initial sequence numbers greater than 2^30, as done
0N/A * in MIT distribution.
0N/A */
0N/A // get the random confounder
0N/A byte[] data = Confounder.bytes(4);
0N/A data[0] = (byte)(data[0] & 0x3f);
0N/A int result = ((data[3] & 0xff) |
0N/A ((data[2] & 0xff) << 8) |
0N/A ((data[1] & 0xff) << 16) |
0N/A ((data[0] & 0xff) << 24));
0N/A if (result == 0) {
0N/A result = 1;
0N/A }
0N/A lastSeqNumber = result;
0N/A }
0N/A
0N/A public synchronized void init(int start) {
0N/A lastSeqNumber = start;
0N/A }
0N/A
0N/A public synchronized int current() {
0N/A return lastSeqNumber;
0N/A }
0N/A
0N/A public synchronized int next() {
0N/A return lastSeqNumber + 1;
0N/A }
0N/A
0N/A public synchronized int step() {
0N/A return ++lastSeqNumber;
0N/A }
0N/A
0N/A}