001/* ***** BEGIN LICENSE BLOCK ***** 002 * Version: MPL 1.1/GPL 2.0/LGPL 2.1 003 * 004 * The contents of this file are subject to the Mozilla Public License Version 005 * 1.1 (the "License"); you may not use this file except in compliance with 006 * the License. You may obtain a copy of the License at 007 * http://www.mozilla.org/MPL/ 008 * 009 * Software distributed under the License is distributed on an "AS IS" basis, 010 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License 011 * for the specific language governing rights and limitations under the 012 * License. 013 * 014 * The Original Code is part of dcm4che, an implementation of DICOM(TM) in 015 * Java(TM), hosted at https://github.com/gunterze/dcm4che. 016 * 017 * The Initial Developer of the Original Code is 018 * Agfa Healthcare. 019 * Portions created by the Initial Developer are Copyright (C) 2011 020 * the Initial Developer. All Rights Reserved. 021 * 022 * Contributor(s): 023 * See @authors listed below 024 * 025 * Alternatively, the contents of this file may be used under the terms of 026 * either the GNU General Public License Version 2 or later (the "GPL"), or 027 * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), 028 * in which case the provisions of the GPL or the LGPL are applicable instead 029 * of those above. If you wish to allow use of your version of this file only 030 * under the terms of either the GPL or the LGPL, and not to allow others to 031 * use your version of this file under the terms of the MPL, indicate your 032 * decision by deleting the provisions above and replace them with the notice 033 * and other provisions required by the GPL or the LGPL. If you do not delete 034 * the provisions above, a recipient may use your version of this file under 035 * the terms of any one of the MPL, the GPL or the LGPL. 036 * 037 * ***** END LICENSE BLOCK ***** */ 038 039package org.dcm4che3.net; 040 041import java.io.IOException; 042 043import org.dcm4che3.data.Tag; 044import org.dcm4che3.data.Attributes; 045 046/** 047 * @author Gunter Zeilinger <gunterze@gmail.com> 048 * 049 */ 050public class FutureDimseRSP extends DimseRSPHandler implements DimseRSP { 051 052 private static class Entry { 053 final Attributes command; 054 final Attributes dataset; 055 Entry next; 056 057 public Entry(Attributes command, Attributes dataset) { 058 this.command = command; 059 this.dataset = dataset; 060 } 061 } 062 063 private Entry entry = new Entry(null, null); 064 private boolean finished; 065 private int autoCancel; 066 private IOException ex; 067 068 public FutureDimseRSP(int msgID) { 069 super(msgID); 070 } 071 072 @Override 073 public synchronized void onDimseRSP(Association as, Attributes cmd, 074 Attributes data) { 075 super.onDimseRSP(as, cmd, data); 076 Entry last = entry; 077 while (last.next != null) 078 last = last.next; 079 080 last.next = new Entry(cmd, data); 081 if (Status.isPending(cmd.getInt(Tag.Status, 0))) { 082 if (autoCancel > 0 && --autoCancel == 0) 083 try { 084 super.cancel(as); 085 } catch (IOException e) { 086 ex = e; 087 } 088 } else { 089 finished = true; 090 } 091 notifyAll(); 092 } 093 094 @Override 095 public synchronized void onClose(Association as) { 096 super.onClose(as); 097 if (!finished) { 098 ex = as.getException(); 099 if (ex == null) 100 ex = new IOException("Association to " + as.getRemoteAET() 101 + " released before receive of outstanding DIMSE RSP"); 102 notifyAll(); 103 } 104 } 105 106 public final void setAutoCancel(int autoCancel) { 107 this.autoCancel = autoCancel; 108 } 109 110 @Override 111 public void cancel(Association a) throws IOException { 112 if (ex != null) 113 throw ex; 114 if (!finished) 115 super.cancel(a); 116 } 117 118 public final Attributes getCommand() { 119 return entry.command; 120 } 121 122 public final Attributes getDataset() { 123 return entry.dataset; 124 } 125 126 public synchronized boolean next() throws IOException, InterruptedException { 127 if (entry.next == null) { 128 if (finished) 129 return false; 130 131 while (entry.next == null && ex == null) 132 wait(); 133 134 if (ex != null) 135 throw ex; 136 } 137 entry = entry.next; 138 return true; 139 } 140}