2N/A * Copyright (c) 2008, 2012, Oracle and/or its affiliates. All rights reserved. 2N/A * BSD 3 Clause License 2N/A * Copyright (c) 2007, The Storage Networking Industry Association. 2N/A * Redistribution and use in source and binary forms, with or without 2N/A * modification, are permitted provided that the following conditions 2N/A * - Redistributions of source code must retain the above copyright 2N/A * notice, this list of conditions and the following disclaimer. 2N/A * - Redistributions in binary form must reproduce the above copyright 2N/A * notice, this list of conditions and the following disclaimer in 2N/A * the documentation and/or other materials provided with the 2N/A * - Neither the name of The Storage Networking Industry Association (SNIA) 2N/A * nor the names of its contributors may be used to endorse or promote 2N/A * products derived from this software without specific prior written 2N/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 2N/A * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 2N/A * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 2N/A * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 2N/A * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 2N/A * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 2N/A * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 2N/A * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 2N/A * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 2N/A * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 2N/A * POSSIBILITY OF SUCH DAMAGE. 2N/A/* ndmp library APIs */ 2N/A * the first door call is to get the device count 2N/A * which will be used to calculate the door buffer size 2N/A /* number of devices */ 2N/A /* get the number of devices available */ 2N/A /* calloc to ensure NULL pointers in allocated struct */ 2N/A /* Free all allocations if any failed */ 2N/A /* Free all allocations if anything failed */ 2N/A /* number of sessions */ 2N/A * Now setup the door again, this time 2N/A * with the intention of getting the session 2N/A * If we failed because of space constraints 2N/A * then reevaluate and give it another try, 2N/A * but only if the number of sessions actually changed 2N/A * between our previous call and now. If they are 2N/A * equal, then retrying is fruitless. 2N/A * If the door call was successful then 2N/A * no need to continue to retry. Break out 2N/A /* number of sessions */ 2N/A /* calloc to ensure NULL pointers in allocated struct */ 2N/A /* connection common info */ 2N/A * scsi and tape data are same for all version, 2N/A /* connection common scsi info. */ 2N/A /* connection common tape info. */ 2N/A /* all the V2 mover data are same as V3/V4 */ 2N/A /* connection common data info */ 2N/A /* calloc to ensure NULL pointers in allocated struct */ 2N/A /* Read V2 data info */ 2N/A /* calloc to ensure NULL pointers in allocated struct */ 2N/A /* calloc to ensure NULL pointers in allocated struct */ 2N/A * Protect against dereferencing a null pointer in any of the following code. 2N/A * If *sinfopp == NULL, assume that everything was already freed previously. 2N/A /* Open channel to NDMP service */ 2N/A * No matter what, we don't allow our 2N/A * door size to be less than NDMP_DOOR_SIZE 2N/A * If it is an opcode that can elicit a variant 2N/A * response in size, tell the door callee 2N/A * how much memory to alloc when forming the