test/jdk/sun/security/krb5/MicroTime.java
author jboes
Fri, 08 Nov 2019 11:15:16 +0000
changeset 59029 3786a0962570
parent 47216 71c04702a3d5
permissions -rw-r--r--
8232853: AuthenticationFilter.Cache::remove may throw ConcurrentModificationException Summary: Change implementation to use iterator instead of plain LinkedList Reviewed-by: dfuchs, vtewari

/*
 * Copyright (c) 2010, 2013, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */
/*
 * @test
 * @bug 6882687 8011124
 * @summary KerberosTime too imprecise
 * @modules java.security.jgss/sun.security.krb5.internal
 */

import sun.security.krb5.internal.KerberosTime;

public class MicroTime {
    public static void main(String[] args) throws Exception {
        // We count how many different KerberosTime values
        // can be acquired within one second.
        KerberosTime t1 = KerberosTime.now();
        KerberosTime last = t1;
        int count = 0;
        while (true) {
            KerberosTime t2 = KerberosTime.now();
            if (t2.getTime() - t1.getTime() > 1000) break;
            if (!last.equals(t2)) {
                last = t2;
                count++;
            }
        }
        // We believe a nice KerberosTime can at least tell the
        // difference of 100 musec.
        if (count < 10000) {
            throw new Exception("What? only " + (1000000/count) +
                    " musec precision?");
        }
    }
}