001/* 002 * Licensed to the Apache Software Foundation (ASF) under one 003 * or more contributor license agreements. See the NOTICE file 004 * distributed with this work for additional information 005 * regarding copyright ownership. The ASF licenses this file 006 * to you under the Apache License, Version 2.0 (the 007 * "License"); you may not use this file except in compliance 008 * with the License. You may obtain a copy of the License at 009 * 010 * http://www.apache.org/licenses/LICENSE-2.0 011 * 012 * Unless required by applicable law or agreed to in writing, software 013 * distributed under the License is distributed on an "AS IS" BASIS, 014 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 015 * See the License for the specific language governing permissions and 016 * limitations under the License. 017 */ 018package org.apache.hadoop.hbase.procedure2; 019 020import static org.junit.jupiter.api.Assertions.assertFalse; 021import static org.junit.jupiter.api.Assertions.assertTrue; 022 023import java.util.HashMap; 024import java.util.Map; 025import org.apache.hadoop.hbase.procedure2.ProcedureTestingUtility.NoopProcedure; 026import org.apache.hadoop.hbase.testclassification.MasterTests; 027import org.apache.hadoop.hbase.testclassification.SmallTests; 028import org.junit.jupiter.api.Tag; 029import org.junit.jupiter.api.Test; 030 031@Tag(MasterTests.TAG) 032@Tag(SmallTests.TAG) 033public class TestLockAndQueue { 034 035 @Test 036 public void testHasLockAccess() { 037 Map<Long, NoopProcedure<Void>> procMap = new HashMap<>(); 038 for (long i = 1; i <= 10; i++) { 039 NoopProcedure<Void> proc = new NoopProcedure<>(); 040 proc.setProcId(i); 041 if (i > 1) { 042 proc.setParentProcId(i - 1); 043 proc.setRootProcId(1); 044 } 045 procMap.put(i, proc); 046 } 047 LockAndQueue laq = new LockAndQueue(procMap::get); 048 for (long i = 1; i <= 10; i++) { 049 assertFalse(laq.hasLockAccess(procMap.get(i))); 050 } 051 for (long i = 1; i <= 10; i++) { 052 NoopProcedure<Void> procHasLock = procMap.get(i); 053 laq.tryExclusiveLock(procHasLock); 054 for (long j = 1; j < i; j++) { 055 assertFalse(laq.hasLockAccess(procMap.get(j))); 056 } 057 for (long j = i; j <= 10; j++) { 058 assertTrue(laq.hasLockAccess(procMap.get(j))); 059 } 060 laq.releaseExclusiveLock(procHasLock); 061 } 062 } 063}