meta_sp.c revision d7cd82522afdd890a66c7600b499590ad44e84bd
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License (the "License").
* You may not use this file except in compliance with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2006 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* Just in case we're not in a build environment, make sure that
* TEXT_DOMAIN gets set to something.
*/
#if !defined(TEXT_DOMAIN)
#define TEXT_DOMAIN "SYS_TEST"
#endif
/*
* soft partition operations
*
* Soft Partitions provide a virtual disk mechanism which is used to
* divide a large volume into many small pieces, each appearing as a
* separate device. A soft partition consists of a series of extents,
* each having an offset and a length. The extents are logically
* contiguous, so where the first extent leaves off the second extent
* picks up. Which extent a given "virtual offset" belongs to is
* dependent on the size of all the previous extents in the soft
* partition.
*
* Soft partitions are represented in memory by an extent node
* (sp_ext_node_t) which contains all of the information necessary to
* create a unit structure and update the on-disk format, called
* "watermarks". These extent nodes are typically kept in a doubly
* linked list and are manipulated by list manipulation routines. A
* list of extents may represent all of the soft partitions on a volume,
* a single soft partition, or perhaps just a set of extents that need
* depending on which compare function is used. Most of the routines
* require the list be sorted by offset to work, and that's the typical
* configuration.
*
* In order to do an allocation, knowledge of all soft partitions on the
* volume is required. Then free space is determined from the space
* that is not allocated, and new allocations can be made from the free
* space. Once the new allocations are made, a unit structure is created
* and the watermarks are updated. The status is then changed to "okay"
* on the unit structure to commit the transaction. If updating the
* watermarks fails, the unit structure is in an intermediate state and
* the driver will not allow access to the device.
*
* A typical sequence of events is:
* 1. Fetch the list of names for all soft partitions on a volume
* meta_sp_get_by_component()
* 2. Construct an extent list from the name list
* meta_sp_extlist_from_namelist()
* 3. Fill the gaps in the extent list with free extents
* meta_sp_list_freefill()
* 4. Allocate from the free extents
* meta_sp_alloc_by_len()
* meta_sp_alloc_by_list()
* 5. Create the unit structure from the extent list
* meta_sp_createunit()
* meta_sp_updateunit()
* 6. Write out the watermarks
* meta_sp_update_wm()
* 7. Set the status to "Okay"
* meta_sp_setstatus()
*
*/
#include <stdio.h>
#include <meta.h>
#include "meta_repartition.h"
#include <strings.h>
extern int md_in_daemon;
typedef struct sp_ext_node {
/* extent flags */
#define EXTFLG_UPDATE (1)
/* Extent node compare function for list sorting */
/* Function Prototypes */
/* Debugging Functions */
static void meta_sp_debug(char *format, ...);
/* Misc Support Functions */
md_error_t *ep);
/* Extent List Manipulation Functions */
/* Extent List Query Functions */
md_error_t *ep);
/* Extent Allocation Functions */
/* Extent List Population Functions */
/* Print (metastat) Functions */
/* Watermark Manipulation Functions */
md_error_t *ep);
/* Unit Structure Manipulation Functions */
md_error_t *ep);
/* Reset (metaclear) Functions */
/* Recovery (metarecover) Functions */
static void meta_sp_display_exthdr(void);
mdname_t **, md_error_t *);
/*
* Private Constants
*/
static const int FORCE_RELOAD_CACHE = 1;
static const uint_t NO_SEQUENCE_NUMBER = 0;
static const int ONE_SOFT_PARTITION = 1;
#define TEST_SOFT_PARTITION_NAMEP NULL
#define TEST_SETNAMEP NULL
#define EXCLUDE_WM (1)
#define INCLUDE_WM (0)
#define SP_UNALIGNED (0LL)
/*
* **************************************************************************
* Debugging Functions *
* **************************************************************************
*/
/*PRINTFLIKE1*/
static void
meta_sp_debug(char *format, ...)
{
static int debug;
static int debug_set = 0;
if (!debug_set) {
debug_set = 1;
}
if (debug) {
}
}
static void
{
int i;
return;
/* print the common fields we know about */
/* sp-specific fields */
/* print extent information */
for (i = 0; i < mp->un_numexts; i++) {
}
}
/*
* FUNCTION: meta_sp_parsesize()
* INPUT: s - the string to parse
* OUTPUT: *szp - disk block count (0 for "all")
* RETURNS: -1 for error, 0 for success
* PURPOSE: parses the command line parameter that specifies the
* requested size of a soft partition. The input string
* is either the literal "all" or a numeric value
* followed by a single character, b for disk blocks, k
* for kilobytes, m for megabytes, g for gigabytes, or t
* for terabytes. p for petabytes and e for exabytes
* have been added as undocumented features for future
* expansion. For example, 100m is 100 megabytes, while
* 50g is 50 gigabytes. All values are rounded up to the
* nearest block size.
*/
int
{
return (-1);
}
/* Check for literal "all" */
if (strcasecmp(s, "all") == 0) {
*szp = 0;
return (0);
}
return (meta_sp_parsesizestring(s, szp));
}
/*
* FUNCTION: meta_sp_parsesizestring()
* INPUT: s - the string to parse
* OUTPUT: *szp - disk block count
* RETURNS: -1 for error, 0 for success
* PURPOSE: parses a string that specifies size. The input string is a
* numeric value followed by a single character, b for disk blocks,
* k for kilobytes, m for megabytes, g for gigabytes, or t for
* terabytes. p for petabytes and e for exabytes have been added
* as undocumented features for future expansion. For example,
* 100m is 100 megabytes, while 50g is 50 gigabytes. All values
* are rounded up to the nearest block size.
*/
static int
{
sp_ext_length_t len = 0;
char len_type[2];
return (-1);
}
/*
* make sure block offset does not overflow 2^64 bytes.
*/
return (-1);
switch (len_type[0]) {
case 'B':
case 'b':
break;
case 'K':
case 'k':
break;
case 'M':
case 'm':
break;
case 'g':
case 'G':
break;
case 't':
case 'T':
DEV_BSIZE));
break;
case 'p':
case 'P':
DEV_BSIZE));
break;
case 'e':
case 'E':
DEV_BSIZE));
break;
default:
/* error */
return (-1);
}
return (0);
}
/*
* FUNCTION: meta_sp_setgeom()
* INPUT: np - the underlying device to setup geometry for
* compnp - the underlying device to setup geometry for
* mp - the unit structure to set the geometry for
* OUTPUT: ep - return error pointer
* RETURNS: int - -1 if error, 0 otherwise
* PURPOSE: establishes geometry information for a device
*/
static int
)
{
return (-1);
return (-1);
return (0);
}
/*
* FUNCTION: meta_sp_setstatus()
* INPUT: sp - the set name for the devices to set the status on
* minors - an array of minor numbers of devices to set status on
* num_units - number of entries in the array
* status - status value to set all units to
* OUTPUT: ep - return error pointer
* RETURNS: int - -1 if error, 0 success
* PURPOSE: sets the status of one or more soft partitions to the
* requested value
*/
int
int num_units,
)
{
/* update status of all soft partitions to the status passed in */
NULL) != 0) {
return (-1);
}
return (0);
}
/*
* FUNCTION: meta_get_sp_names()
* INPUT: sp - the set name to get soft partitions from
* options - options from the command line
* OUTPUT: nlpp - list of all soft partition names
* ep - return error pointer
* RETURNS: int - -1 if error, 0 success
* PURPOSE: returns a list of all soft partitions in the metadb
* for all devices in the specified set
*/
int
mdnamelist_t **nlpp,
int options,
)
{
}
/*
* FUNCTION: meta_get_by_component()
* INPUT: sp - the set name to get soft partitions from
* compnp - the name of the device containing the soft
* partitions that will be returned
* force - 0 - reads cached namelist if available,
* 1 - reloads cached namelist, frees old namelist
* OUTPUT: nlpp - list of all soft partition names
* ep - return error pointer
* RETURNS: int - -1 error, otherwise the number of soft partitions
* found on the component (0 = none found).
* PURPOSE: returns a list of all soft partitions on a given device
* from the metadb information
*/
static int
mdnamelist_t **nlpp,
int force,
)
{
static int cached_count = 0; /* cached count */
int count = 0; /* count of sp's */
int err;
/* return a copy of the cached list */
return (cached_count);
}
/* free the cache and reset values to zeros to prepare for a new list */
cached_count = 0;
cached_list = NULL;
/* get all the softpartitions first of all */
return (-1);
/*
* Now for each sp, see if it resides on the component we
* are interested in, if so then add it to our list
*/
/* get the unit structure */
continue;
/*
* If the current soft partition is not on the same
* component, continue the search. If it is on the same
* component, add it to our namelist.
*/
if (err <= 0) {
/* not on the same device, check the next one */
continue;
}
/* it's on the same drive */
/*
* Check for overlapping partitions if the component is not
* a metadevice.
*/
/*
* if they're on the same drive, neither
* should be a metadevice if one isn't
*/
continue;
/* in this case it's not an error for them to overlap */
mdclrerror(ep);
}
/* Component is on the same device, add to the used list */
curnp);
++count;
++cached_count;
}
return (count);
out:
return (-1);
}
/*
* FUNCTION: meta_sp_get_default_alignment()
* INPUT: sp - the pertinent set name
* compnp - the name of the underlying component
* OUTPUT: ep - return error pointer
* RETURNS: sp_ext_length_t =0: no default alignment
* >0: default alignment
* PURPOSE: returns the default alignment for soft partitions to
* be built on top of the specified component or
* metadevice
*/
static sp_ext_length_t
)
{
char *mname;
/*
* We treat raw devices as opaque, and assume nothing about
* their alignment requirements.
*/
if (!metaismeta(compnp))
return (SP_UNALIGNED);
/*
* We already know it's a metadevice from the previous test;
* metagetmiscname() will tell us which metadevice type we
* have
*/
goto out;
/*
* For a mirror, we want to deal with the stripe that is the
* primary side. If it happens to be asymmetrically
* configured, there is no simple way to fake a universal
* alignment. There's a chance that the least common
* denominator of the set of interlaces from all stripes of
* all submirrors would do it, but nobody that really cared
* that much about this issue would create an asymmetric
* config to start with.
*
* If the component underlying the soft partition is a mirror,
* then at the exit of this loop, compnp will have been
* updated to describe the first active submirror.
*/
int smi;
goto out;
continue;
goto out;
break;
}
goto out;
}
/*
* Handle stripes and submirrors identically; just return the
* interlace of the first row.
*/
goto out;
goto out;
}
/*
* Raid is even more straightforward; the interlace applies to
* the entire device.
*/
goto out;
goto out;
}
/*
* If we have arrived here with the alignment still not set,
* then we expect the error to have been set by one of the
* routines we called. If neither is the case, something has
* really gone wrong above. (Probably the submirror walk
* failed to produce a valid submirror, but that would be
* really bad...)
*/
out:
meta_sp_debug("meta_sp_get_default_alignment: miscname %s, "
}
return (a);
}
/*
* FUNCTION: meta_check_insp()
* INPUT: sp - the set name for the device to check
* np - the name of the device to check
* slblk - the starting offset of the device to check
* nblks - the number of blocks in the device to check
* OUTPUT: ep - return error pointer
* RETURNS: int - 0 - device contains soft partitions
* -1 - device does not contain soft partitions
* PURPOSE: determines whether a device contains any soft partitions
*/
/* ARGSUSED */
int
)
{
int count;
int rval;
/* check set pointer */
/*
* Get a list of the soft partitions that currently reside on
* the component. We should ALWAYS force reload the cache,
* because if we're using the md.tab, we must rebuild
* the list because it won't contain the previous (if any)
* soft partition.
*/
/* find all soft partitions on the component */
if (count == -1) {
rval = -1;
} else if (count > 0) {
} else {
rval = 0;
}
return (rval);
}
/*
* **************************************************************************
* Extent List Manipulation Functions *
* **************************************************************************
*/
/*
* FUNCTION: meta_sp_cmp_by_nameseq()
* INPUT: e1 - first node to compare
* e2 - second node to compare
* OUTPUT: none
* RETURNS: int - =0 - nodes are equal
* <0 - e1 should go before e2
* >0 - e1 should go after e2
* PURPOSE: used for sorted list inserts to build a list sorted by
* name first and sequence number second.
*/
static int
{
int rval;
return (1);
return (-1);
return (rval);
/* the names are equal, compare sequence numbers */
return (1);
return (-1);
/* sequence numbers are also equal */
return (0);
}
/*
* FUNCTION: meta_sp_cmp_by_offset()
* INPUT: e1 - first node to compare
* e2 - second node to compare
* OUTPUT: none
* RETURNS: int - =0 - nodes are equal
* <0 - e1 should go before e2
* >0 - e1 should go after e2
* PURPOSE: used for sorted list inserts to build a list sorted by offset
*/
static int
{
return (1);
return (-1);
/* offsets are equal */
return (0);
}
/*
* FUNCTION: meta_sp_list_insert()
* INPUT: sp - the set name for the device the node belongs to
* np - the name of the device the node belongs to
* head - the head of the list, must be NULL for empty list
* offset - the physical offset of this extent in sectors
* length - the length of this extent in sectors
* type - the type of the extent being inserted
* seq - the sequence number of the extent being inserted
* flags - extent flags (eg. whether it needs to be updated)
* compare - the compare function to use
* OUTPUT: head - points to the new head if a node was inserted
* at the beginning
* RETURNS: void
* PURPOSE: inserts an extent node into a sorted doubly linked list.
* The sort order is determined by the compare function.
* Memory is allocated for the node in this function and it
* is up to the caller to free it, possibly using
* meta_sp_list_free(). If a node is inserted at the
* beginning of the list, the head pointer is updated to
* point to the new first node.
*/
static void
)
{
/* Don't bother adding zero length nodes */
return;
/* allocate and fill in new ext_node */
/* first node in the list */
/* the first node has a bigger offset, so insert before it */
} else {
/*
* find the next node whose offset is greater than
* the one we want to insert, or the end of the list.
*/
;
/* link the new node in after the current node */
}
}
/*
* FUNCTION: meta_sp_list_free()
* INPUT: head - the head of the list, must be NULL for empty list
* OUTPUT: head - points to NULL on return
* RETURNS: void
* PURPOSE: walks a double linked extent list and frees each node
*/
static void
{
while (ext) {
}
}
/*
* FUNCTION: meta_sp_list_remove()
* INPUT: head - the head of the list, must be NULL for empty list
* ext - the extent to remove, must be a member of the list
* OUTPUT: head - points to the new head of the list
* RETURNS: void
* PURPOSE: unlinks the node specified by ext from the list and
* frees it, possibly moving the head pointer forward if
* the head is the node being removed.
*/
static void
{
}
/*
* FUNCTION: meta_sp_list_size()
* INPUT: head - the head of the list, must be NULL for empty list
* exttype - the type of the extents to sum
* exclude_wm - subtract space for extent headers from total
* OUTPUT: none
* RETURNS: sp_ext_length_t - the sum of all of the lengths
* PURPOSE: sums the lengths of all extents in the list matching the
* specified type. This could be used for computing the
* amount of free or used space, for example.
*/
static sp_ext_length_t
{
((exclude_wm) ? MD_SP_WMSIZE : 0);
return (size);
}
/*
* FUNCTION: meta_sp_list_find()
* INPUT: head - the head of the list, must be NULL for empty list
* offset - the offset contained by the node to find
* OUTPUT: none
* RETURNS: sp_ext_node_t * - the node containing the requested offset
* or NULL if no such nodes were found.
* PURPOSE: finds a node in a list containing the requested offset
* (inclusive). If multiple nodes contain this offset then
* only the first will be returned, though typically these
* lists are managed with non-overlapping nodes.
*
* *The list MUST be sorted by offset for this function to work.*
*/
static sp_ext_node_t *
)
{
/* check if the offset lies within this extent */
/*
* the requested extent should always be a
* subset of an extent in the list.
*/
return (ext);
}
}
return (NULL);
}
/*
* FUNCTION: meta_sp_list_freefill()
* INPUT: head - the head of the list, must be NULL for empty list
* size - the size of the volume this extent list is
* representing
* OUTPUT: head - the new head of the list
* RETURNS: void
* PURPOSE: finds gaps in the extent list and fills them with a free
* node. If there is a gap at the beginning the head
* pointer will be changed to point to the new free node.
* If there is free space at the end, the last free extent
* will extend all the way out to the size specified.
*
* *The list MUST be sorted by offset for this function to work.*
*/
static void
)
{
EXTTYP_FREE, 0, 0, meta_sp_cmp_by_offset);
}
/* pad inverse list out to the end */
EXTTYP_FREE, 0, 0, meta_sp_cmp_by_offset);
if (getenv(META_SP_DEBUG)) {
meta_sp_debug("meta_sp_list_freefill: Extent list with "
"holes freefilled:\n");
}
}
/*
* FUNCTION: meta_sp_list_dump()
* INPUT: head - the head of the list, must be NULL for empty list
* OUTPUT: none
* RETURNS: void
* PURPOSE: dumps the entire extent list to stdout for easy debugging
*/
static void
{
meta_sp_debug("meta_sp_list_dump: dumping extent list:\n");
"Addr", "Seq#", "Type", "Offset", "Length", "Flags", "Prev",
"Next");
else
case EXTTYP_ALLOC:
break;
case EXTTYP_FREE:
break;
case EXTTYP_END:
break;
case EXTTYP_RESERVED:
break;
default:
break;
}
meta_sp_debug("%10llu %10llu %5u %10p %10p\n",
}
meta_sp_debug("\n");
}
/*
* FUNCTION: meta_sp_list_overlaps()
* INPUT: head - the head of the list, must be NULL for empty list
* OUTPUT: none
* RETURNS: int - 1 if extents overlap, 0 if ok
* PURPOSE: checks a list for overlaps. The list MUST be sorted by
* offset for this function to work properly.
*/
static int
{
return (1);
}
return (0);
}
/*
* **************************************************************************
* Extent Allocation Functions *
* **************************************************************************
*/
/*
* FUNCTION: meta_sp_alloc_by_ext()
* INPUT: sp - the set name for the device the node belongs to
* np - the name of the device the node belongs to
* head - the head of the list, must be NULL for empty list
* free_ext - the free extent being allocated from
* alloc_offset - the offset of the allocation
* alloc_len - the length of the allocation
* seq - the sequence number of the allocation
* OUTPUT: head - the new head pointer
* RETURNS: void
* PURPOSE: allocates a portion of the free extent free_ext. The
* allocated portion starts at alloc_offset and is
* alloc_length long. Both (alloc_offset) and (alloc_offset +
* alloc_length) must be contained within the free extent.
*
* The free extent is split into as many as 3 pieces - a
* free extent containing [ free_offset .. alloc_offset ), an
* allocated extent containing the range [ alloc_offset ..
* alloc_end ], and another free extent containing the
* range ( alloc_end .. free_end ]. If either of the two
* new free extents would be zero length, they are not created.
*
* Finally, the original free extent is removed. All newly
* created extents have the EXTFLG_UPDATE flag set.
*/
static void
)
{
/* allocated extent must be a subset of the free extent */
if (free_offset < alloc_offset) {
}
}
if (getenv(META_SP_DEBUG)) {
meta_sp_debug("meta_sp_alloc_by_ext: extent list:\n");
}
}
/*
* FUNCTION: meta_sp_alloc_by_len()
* INPUT: sp - the set name for the device the node belongs to
* np - the name of the device the node belongs to
* head - the head of the list, must be NULL for empty list
* *lp - the requested length to allocate
* last_off - the last offset already allocated.
* alignment - the desired extent alignmeent
* OUTPUT: head - the new head pointer
* *lp - the length allocated
* RETURNS: int - -1 if error, the number of new extents on success
* PURPOSE: allocates extents from free space to satisfy the requested
* length. If requested length is zero, allocates all
* remaining free space. This function provides the meat
* of the extent allocation algorithm. Allocation is a
* three tier process:
*
* 1. If last_off is nonzero and there is free space following
* that node, then it is extended to allocate as much of that
* free space as possible. This is useful for metattach.
* 2. If a free extent can be found to satisfy the remaining
* requested space, then satisfy the rest of the request
* from that extent.
* 3. Start allocating space from any remaining free extents until
* the remainder of the request is satisified.
*
* If alignment is non-zero, then every extent modified
* or newly allocated will be aligned modulo alignment,
* with a length that is an integer multiple of
* alignment.
*
* The EXTFLG_UPDATE flag is set for all nodes (free and
* allocated) that require updated watermarks.
*
* This algorithm may have a negative impact on fragmentation
* in pathological cases and may be improved if it turns out
* to be a problem. This may be exacerbated by particularly
* large alignments.
*
* NOTE: It's confusing, so it demands an explanation:
* - len is used to represent requested data space; it
* does not include room for a watermark. On each full
* or partial allocation, len will be decremented by
* alloc_len (see next paragraph) until it reaches
* zero.
* - alloc_len is used to represent data space allocated
* from a particular extent; it does not include space
* for a watermark. In the rare event that a_length
* (see next paragraph) is equal to MD_SP_WMSIZE,
* alloc_len will be zero and the resulting MD_SP_WMSIZE
* fragment of space will be utterly unusable.
* - a_length is used to represent all space to be
* allocated from a particular extent; it DOES include
* space for a watermark.
*/
static int
)
{
/* We're DOA if we can't read *lp */
/*
* Process the nominal case first: we've been given an actual
* size argument, rather than the literal "all"
*/
if (len != 0) {
/*
* Short circuit the check for free space. This may
* tell us we have enough space when we really don't
* because each extent loses space to a watermark, but
* it will always tell us there isn't enough space
* correctly. Worst case we do some extra work.
*/
return (-1);
/*
* First see if we can extend the last extent for an
* attach.
*/
int align = 0;
/*
* The offset test reflects the
* inclusion of the watermark in the extent
*/
alignment) == 0);
/*
* If we decided not to align here, we should
* also reset "alignment" so we don't bother
* later, either.
*/
if (!align) {
alignment = 0;
}
/*
* If a free extent follows our last allocated
* extent, then remove the last allocated
* extent and increase the size of the free
* extent to overlap it, then allocate the
* total space from the new free extent.
*/
/* No watermark space needed */
}
if (alloc_len > 0) {
free_ext->ext_offset -=
free_ext->ext_length +=
last_seq);
/*
* now remove the original allocated
* node. We may have overlapping
* extents for a short time before
* this node is removed.
*/
}
}
last_seq++;
}
goto out;
/*
* Next, see if we can find a single allocation for
* the remainder. This may make fragmentation worse
* in some cases, but there's no good way to allocate
* that doesn't have a highly fragmented corner case.
*/
continue;
/*
* The length test should include space for
* the watermark
*/
if (alignment > 0) {
/*
* Shortcut for extents that have been
* previously added to pad out the
* data space
*/
continue;
}
/*
* Round up so the data space begins
* on a properly aligned boundary.
*/
/*
* This is only necessary in case the
* watermark size is ever greater than
* one. It'll never happen, of
* course; we'll get rid of watermarks
* before we make 'em bigger.
*/
}
/*
* Adjust the length to account for
* the space lost above (if any)
*/
a_length -=
}
numexts++;
break;
}
}
goto out;
/*
* If the request could not be satisfied by extending
* the last extent or by a single extent, then put
* multiple smaller extents together until the request
* is satisfied.
*/
continue;
if (alignment > 0) {
/*
* Shortcut for extents that have been
* previously added to pad out the
* data space
*/
continue;
}
/*
* Round up so the data space begins
* on a properly aligned boundary.
*/
/*
* This is only necessary in case the
* watermark size is ever greater than
* one. It'll never happen, of
* course; we'll get rid of watermarks
* before we make 'em bigger.
*/
}
/*
* Adjust the length to account for
* the space lost above (if any)
*/
a_length -=
/*
* Adjust the length to be properly
* aligned if it is NOT to be the
* last extent in the soft partition.
*/
a_length -=
(a_length - MD_SP_WMSIZE)
% alignment;
}
if (alloc_len == 0)
continue;
/*
* meta_sp_alloc_by_ext() expects the
* allocation length to include the watermark
* size, which is why we don't simply pass in
* alloc_len here.
*/
last_seq);
numexts++;
last_seq++;
}
/*
* If there was not enough space we can throw it all
* away since no real work has been done yet.
*/
if (len != 0) {
return (-1);
}
}
/*
* Otherwise, the literal "all" was specified: allocate all
* available free space. Don't bother with alignment.
*/
else {
/* First, extend the last extent if this is a grow */
/*
* If a free extent follows our last allocated
* extent, then remove the last allocated
* extent and increase the size of the free
* extent to overlap it, then allocate the
* total space from the new free extent.
*/
free_ext->ext_offset -=
free_ext->ext_length +=
last_seq);
/*
* now remove the original allocated
* node. We may have overlapping
* extents for a short time before
* this node is removed.
*/
}
last_seq++;
}
/* Next, grab all remaining free space */
if (alloc_len == 0)
continue;
/*
* meta_sp_alloc_by_ext() expects the
* allocation length to include the
* watermark size, which is why we
* don't simply pass in alloc_len
* here.
*/
last_seq);
numexts++;
last_seq++;
}
}
}
out:
if (getenv(META_SP_DEBUG)) {
meta_sp_debug("meta_sp_alloc_by_len: Extent list after "
"allocation:\n");
}
if (*lp == 0) {
/*
* Make sure the callers hit a no space error if we
* didn't actually find anything.
*/
if (len == 0) {
return (-1);
}
}
return (numexts);
}
/*
* FUNCTION: meta_sp_alloc_by_list()
* INPUT: sp - the set name for the device the node belongs to
* np - the name of the device the node belongs to
* head - the head of the list, must be NULL for empty list
* oblist - an extent list containing requested nodes to allocate
* OUTPUT: head - the new head pointer
* RETURNS: int - -1 if error, the number of new extents on success
* PURPOSE: allocates extents from free space to satisfy the requested
* extent list. This is primarily used for the -o/-b options
* where the user may specifically request extents to allocate.
* Each extent in the oblist must be a subset (inclusive) of a
* free extent and may not overlap each other. This
* function sets the EXTFLG_UPDATE flag for each node that
* requires a watermark update after allocating.
*/
static int
)
{
/* Make sure the allocation is within the free extent */
return (-1);
numexts++;
}
if (getenv(META_SP_DEBUG)) {
meta_sp_debug("meta_sp_alloc_by_list: Extent list after "
"allocation:\n");
}
return (numexts);
}
/*
* **************************************************************************
* Extent List Population Functions *
* **************************************************************************
*/
/*
* FUNCTION: meta_sp_extlist_from_namelist()
* INPUT: sp - the set name for the device the node belongs to
* spnplp - the namelist of soft partitions to build a list from
* OUTPUT: extlist - the extent list built from the SPs in the namelist
* ep - return error pointer
* RETURNS: int - -1 if error, 0 on success
* PURPOSE: builds an extent list representing the soft partitions
* specified in the namelist. Each extent in each soft
* partition is added to the list with the type EXTTYP_ALLOC.
* The EXTFLG_UPDATE flag is not set on any nodes. Each
* extent in the list includes the space occupied by the
* watermark, which is not included in the unit structures.
*/
static int
)
{
int extn;
/*
* Now go through the soft partitions and add a node to the used
* list for each allocated extent.
*/
/* get the unit structure */
return (-1);
/*
* subtract from offset and add to the length
* to account for the watermark, which is not
* contained in the extents in the unit structure.
*/
}
}
return (0);
}
/*
* FUNCTION: meta_sp_extlist_from_wm()
* INPUT: sp - the set name for the device the node belongs to
* compnp - the name of the device to scan watermarks on
* OUTPUT: extlist - the extent list built from the SPs in the namelist
* ep - return error pointer
* RETURNS: int - -1 if error, 0 on success
* PURPOSE: builds an extent list representing the soft partitions
* specified in the namelist. Each extent in each soft
* partition is added to the list with the type EXTTYP_ALLOC.
* The EXTFLG_UPDATE flag is not set on any nodes. Each
* extent in the list includes the space occupied by the
* watermark, which is not included in the unit structures.
*/
static int
)
{
int init = 0;
if (!metaislocalset(sp)) {
return (-1);
}
return (-1);
for (;;) {
return (-1);
}
/* get the set and name pointers */
return (-1);
}
}
/*
* For the MN set, meta_init_make_device needs to
* be run on all the nodes so the entries for the
* softpart device name and its comp can be created
* in the same order in the replica namespace. If
* we have it run on mdmn_do_iocset then the mddbs
* will be out of sync between master node and slave
* nodes.
*/
int result;
int message_size;
message_size = sizeof (*send_params) +
ep);
if (resp->mmr_exitval != 0) {
return (-1);
}
}
if (result != 0)
return (-1);
} else {
return (-1);
}
init = 1;
}
}
if (init) {
}
}
return (-1);
}
}
/* insert watermark into extent list */
/* if we see the end watermark, we're done */
break;
/* clear out set and name pointers for next iteration */
}
return (0);
}
/*
* **************************************************************************
* Print (metastat) Functions *
* **************************************************************************
*/
/*
* FUNCTION: meta_sp_short_print()
* INPUT: msp - the unit structure to display
* fp - the file pointer to send output to
* options - print options from the command line processor
* OUTPUT: ep - return error pointer
* RETURNS: int - -1 if error, 0 on success
* PURPOSE: display a short report of the soft partition in md.tab
* form, primarily used for metastat -p.
*/
static int
char *fname,
)
{
int extn;
if (options & PRINT_LARGEDEVICES) {
return (0);
}
return (0);
}
/* print name and -p */
/* print the component */
/*
* Always print the full path name
*/
/* print out each extent */
}
/* success */
return (0);
}
/*
* FUNCTION: meta_sp_status_to_name()
* INPUT: xsp_status - the status value to convert to a string
* tstate - transient errored device state. If set the
* device is Unavailable
* OUTPUT: none
* RETURNS: char * - a pointer to the string representing the status value
* PURPOSE: return an internationalized string representing the
* status value for a soft partition. The strings are
* strdup'd and must be freed by the caller.
*/
static char *
)
{
/*
* Check to see if we have MD_INACCESSIBLE set. This is the only valid
* value for an 'Unavailable' return. tstate can be set because of
* other multi-node reasons (e.g. ABR being set)
*/
if (tstate & MD_INACCESSIBLE) {
}
switch (xsp_status) {
case MD_SP_CREATEPEND:
break;
case MD_SP_GROWPEND:
break;
case MD_SP_DELPEND:
break;
case MD_SP_OK:
break;
case MD_SP_ERR:
break;
case MD_SP_RECOVER:
break;
}
return (rval);
}
/*
* FUNCTION: meta_sp_report()
* INPUT: sp - the set name for the unit being displayed
* msp - the unit structure to display
* nlpp - pass back the large devs
* fp - the file pointer to send output to
* options - print options from the command line processor
* OUTPUT: ep - return error pointer
* RETURNS: int - -1 if error, 0 on success
* PURPOSE: print a full report of the device specified
*/
static int
mdnamelist_t **nlpp,
char *fname,
)
{
char *status;
char *devid = "";
int len;
if (options & PRINT_LARGEDEVICES) {
return (0);
} else {
return (-1);
}
}
return (0);
} else {
return (-1);
}
}
if (options & PRINT_HEADER) {
}
/* Determine if device is available before displaying status */
return (-1);
}
/* print out "State" to be consistent with other metadevices */
if (tstate & MD_ABR_CAP) {
" State: %s - Application Based Recovery (ABR)\n"),
}
} else {
}
}
/* print component details */
int has_mddb;
char *has_mddb_str;
/* print header */
/*
* Building a format string on the fly that will
* be used in (f)printf. This allows the length
* of the ctd to vary from small to large without
* looking horrible.
*/
len += 2;
"\t%-*.*s %-12.12s %-5.5s %s\n",
}
/* get info */
return (-1);
return (-1);
if (has_mddb)
else
/* populate the key in the name_p structure */
return (-1);
}
/* determine if devid does NOT exist */
if (options & PRINT_DEVID) {
else {
}
}
/* print info */
/*
* This allows the length
* of the ctd to vary from small to large without
* looking horrible.
*/
}
}
/* print the headers */
/* print out each extent */
/* If PRINT_TIMES option is ever supported, add output here */
}
/* separate records with a newline */
return (0);
}
/*
* FUNCTION: meta_sp_print()
* INPUT: sp - the set name for the unit being displayed
* np - the name of the device to print
* fname - ??? not used
* fp - the file pointer to send output to
* options - print options from the command line processor
* OUTPUT: ep - return error pointer
* RETURNS: int - -1 if error, 0 on success
* PURPOSE: print a full report of the device specified by metastat.
* This is the main entry point for printing.
*/
int
mdnamelist_t **nlpp,
char *fname,
)
{
int rval = 0;
/* should always have the same set */
/* print all the soft partitions */
mdnamelist_t *p;
int cnt;
return (-1);
else if (cnt == 0)
return (0);
/* recusively print them out */
/*
* one problem with the rval of -1 here is that
* the error gets "lost" when the next device is
* printed, but we want to print them all anyway.
*/
}
/* clean up, return success */
return (rval);
}
/* get the unit structure */
return (-1);
/* check for parented */
if ((! (options & PRINT_SUBDEVS)) &&
return (0);
}
/* print appropriate detail */
if (options & PRINT_SHORT) {
return (-1);
} else {
return (-1);
}
/*
* Print underlying metadevices if they are parented to us and
* if the info for the underlying metadevice has not been printed.
*/
/* get the unit structure for the subdevice */
return (-1);
/* If info not already printed, recurse */
return (-1);
}
}
}
return (0);
}
/*
* **************************************************************************
* Watermark Manipulation Functions *
* **************************************************************************
*/
/*
* FUNCTION: meta_sp_get_start()
* INPUT: sp - the operating set
* np - device upon which the sp is being built
* OUTPUT: ep - return error pointer
* RETURNS: daddr_t - -1 if error, otherwise the start block
* PURPOSE: Encapsulate the determination of the start block of the
* device upon which the sp is built or being built.
* This is done to hide the ugliness of the algorithm. In
* the case where a sp is being built upon a stripe of > 1
* TB that is made up of a set of disks in which the first
* has a VTOC label the result returned from the call to
* metagetstart is incorrect. The reason being that a > 1
* TB metadevice will manufacture an EFI label in which the
* start address is zero. This is irrespective of the underlying
* devices. The long term fix for this is to fix
* meta_efi_to_mdvtoc and meta_efi_to mdgeom so that they return
* values that are indicative of the first underlying device in
* metadevice.
*/
static diskaddr_t
)
{
/*
* In the case that the device upon which the sp is being
* created is a metadevice then ensure that in the case that
* the first underlying device has a vtoc label that it is
* not overwritten with a watermark by setting the start block
* to point just past the vtoc label
*/
}
return (start_block);
}
/*
* FUNCTION: meta_sp_update_wm()
* INPUT: sp - the operating set
* msp - a pointer to the XDR unit structure
* extlist - the extent list specifying watermarks to update
* OUTPUT: ep - return error pointer
* RETURNS: int - -1 if error, 0 on success
* PURPOSE: steps backwards through the extent list updating
* watermarks for all extents with the EXTFLG_UPDATE flag
* set. Writing the watermarks guarantees consistency when
* extents must be broken into pieces since the original
* watermark will be the last to be updated, and will be
* changed to point to a new watermark that is already
* known to be consistent. If one of the writes fails, the
* original watermark stays intact and none of the changes
* are realized.
*/
static int
)
{
int update_count = 0;
int rval = 0;
if (getenv(META_SP_DEBUG)) {
meta_sp_debug("meta_sp_update_wm: Updating watermarks:\n");
}
/*
* find the last node so we can write the watermarks backwards
* and count watermarks to update so we can allocate space
*/
update_count++;
}
}
}
wmp = watermarks =
/* update watermark */
/* fill in the volume name and set name */
else
else
/* Generate the checksum */
wmp->wm_checksum = 0;
/* record the extent offset */
/* Advance the placeholders */
}
}
rval = -1;
goto out;
}
rval = -1;
goto out;
}
out:
return (rval);
}
/*
* FUNCTION: meta_sp_clear_wm()
* INPUT: sp - the operating set
* msp - the unit structure for the soft partition to clear
* OUTPUT: ep - return error pointer
* RETURNS: int - -1 if error, 0 on success
* PURPOSE: steps through the extents for a soft partition unit and
* creates an extent list designed to mark all of the
* watermarks for those extents as free. The extent list
* is then passed to meta_sp_update_wm() to actually write
* the watermarks out.
*/
static int
)
{
uint_t i;
int rval = 0;
/* for each watermark must set the flag to SP_FREE */
for (i = 0; i < numexts; i++) {
}
/* update watermarks */
return (rval);
}
/*
* FUNCTION: meta_sp_read_wm()
* INPUT: sp - setname for component
* compnp - mdname_t for component
* offset - the offset of the watermark to read (sectors)
* OUTPUT: wm - the watermark structure to read into
* ep - return error pointer
* RETURNS: int - -1 if error, 0 on success
* PURPOSE: seeks out to the requested offset and reads a watermark.
* It then verifies that the magic number is correct and
* that the checksum is valid, returning an error if either
* is wrong.
*/
static int
)
{
/*
* make sure block offset does not overflow 2^64 bytes and it's a
* multiple of the block size.
*/
/* LINTED */
"Extent header read failed, block %llu.\n"), offset);
}
/* make sure magic number is correct */
"found incorrect magic number %x, expected %x.\n"),
/*
* Pass NULL for the device name as we don't have
* valid watermark contents.
*/
}
"found incorrect checksum %x.\n"),
wm->wm_checksum);
}
return (0);
}
/*
* **************************************************************************
* Query Functions
* **************************************************************************
*/
/*
* IMPORTANT NOTE: This is a static function that assumes that
* its input parameters have been checked and
* have valid values that lie within acceptable
* ranges.
*
* FUNCTION: meta_sp_enough_space()
* INPUT: desired_number_of_sps - the number of soft partitions desired;
* must be > 0
* desired_sp_size - the desired soft partition size in blocks;
* must be > 0
* extent_listpp - a reference to a reference to an extent
* list that lists the extents on a device;
* must be a reference to a reference to a
* valid extent list
* alignment - the desired data space alignment for the sp's
* OUTPUT: boolean_t return value
* RETURNS: boolean_t - B_TRUE if there's enough space in the extent
* list to create the desired soft partitions,
* B_FALSE if there's not enough space
* PURPOSE: determines whether there's enough free space in an extent
* list to allow creation of a set of soft partitions
*/
static boolean_t
)
{
int number_of_sps;
number_of_sps = 0;
while ((enough_space == B_TRUE) &&
/*
* Use the extent allocation algorithm implemented by
* meta_sp_alloc_by_len() to test whether the free
* extents in the extent list referenced by *extent_listpp
* contain enough space to accomodate a soft partition
* of size desired_ext_length.
*
* Repeat the test <desired_number_of_sps> times
* or until it fails, whichever comes first,
* each time allocating the extents required to
* create the soft partition without actually
* creating the soft partition.
*/
if (number_of_extents_used == -1) {
} else {
}
}
return (enough_space);
}
/*
* IMPORTANT NOTE: This is a static function that calls other functions
* that check its mdsetnamep and device_mdnamep
* input parameters, but expects extent_listpp to
* be a initialized to a valid address to which
* it can write a reference to the extent list that
* it creates.
*
* FUNCTION: meta_sp_get_extent_list()
* INPUT: mdsetnamep - a reference to the mdsetname_t structure
* for the set containing the device for
* which the extents are to be listed
* device_mdnamep - a reference to the mdname_t structure
* for the device for which the extents
* are to be listed
* OUTPUT: *extent_listpp - a reference to the extent list for
* the device; NULL if the function fails
* *ep - the libmeta error encountered, if any
* RETURNS: boolean_t - B_TRUE if the function call was successful,
* B_FALSE if not
* PURPOSE: gets the extent list for a device
*/
static boolean_t
)
{
*extent_listpp = NULL;
ep);
if (getenv(META_SP_DEBUG)) {
}
return (B_FALSE);
}
if (device_size_in_blocks == MD_DISKADDR_ERROR) {
if (getenv(META_SP_DEBUG)) {
"meta_sp_get_extent_list:metagetsize");
}
return (B_FALSE);
}
/*
* Sanity check: the start block will have skipped an integer
* number of cylinders, C. C will usually be zero. If (C > 0),
* and the disk slice happens to only be C cylinders in total
* size, we'll fail this check.
*/
if (device_size_in_blocks <=
return (B_FALSE);
}
/*
* After this point, we will have allocated resources, so any
* failure returns must be through the supplied "fail" label
* to properly deallocate things.
*/
/*
* Create an empty extent list that starts one watermark past
* the start block of the device and ends one watermark before
* the end of the device.
*/
/*
* Get the list of soft partitions that are already on the
* device.
*/
if (getenv(META_SP_DEBUG)) {
"meta_sp_get_extent_list:meta_sp_get_by_component");
}
goto fail;
}
if (sp_name_listp != NULL) {
/*
* If there are soft partitions on the device, add the
* extents used in them to the extent list.
*/
if (getenv(META_SP_DEBUG)) {
"meta_sp_extlist_from_namelist");
}
goto fail;
}
}
/*
* Add free extents to the extent list to represent
* the remaining regions of free space on the
* device.
*/
return (B_TRUE);
fail:
if (sp_name_listp != NULL) {
}
if (*extent_listpp != NULL) {
/*
* meta_sp_list_free sets *extent_listpp to NULL.
*/
}
return (B_FALSE);
}
/*
* IMPORTANT NOTE: This is a static function that calls other functions
* that check its mdsetnamep and mddrivenamep
* input parameters, but expects extent_listpp to
* be a initialized to a valid address to which
* it can write a reference to the extent list that
* it creates.
*
* FUNCTION: meta_sp_get_extent_list_for_drive()
* INPUT: mdsetnamep - a reference to the mdsetname_t structure
* for the set containing the drive for
* which the extents are to be listed
* mddrivenamep - a reference to the mddrivename_t structure
* for the drive for which the extents
* are to be listed
* OUTPUT: *extent_listpp - a reference to the extent list for
* the drive; NULL if the function fails
* RETURNS: boolean_t - B_TRUE if the function call was successful,
* B_FALSE if not
* PURPOSE: gets the extent list for a drive when the entire drive
* is to be soft partitioned
*/
static boolean_t
)
{
int repartition_options;
int return_value;
*extent_listpp = NULL;
&mderror);
}
repartition_options = 0;
&mderror);
if (return_value != 0) {
}
}
if (return_value != 0) {
}
}
}
}
/*
* Create an extent list that starts with
* a reserved extent that ends at the start
* of the usable space on slice zero of the
* proposed VTOC, ends with an extent that
* reserves space for a watermark at the end
* of slice zero, and contains a single free
* extent that occupies the rest of the space
* on the slice.
*
* NOTE:
*
* Don't use metagetstart() or metagetsize() to
* find the usable space. They query the mdname_t
* structure that represents an actual device to
* determine the amount of space on the device that
* contains metadata and the total amount of space
* on the device. Since this function creates a
* proposed extent list that doesn't reflect the
* state of an actual device, there's no mdname_t
* structure to be queried.
*
* When a drive is reformatted to prepare for
* soft partitioning, all of slice seven is
* reserved for metadata, all of slice zero is
* available for soft partitioning, and all other
* slices on the drive are empty. The proposed
* extent list for the drive therefore contains
* only three extents: a reserved extent that ends
* at the start of the usable space on slice zero,
* a single free extent that occupies all the usable
* space on slice zero, and an ending extent that
* reserves space for a watermark at the end of
* slice zero.
*/
}
return (can_use);
}
/*
* FUNCTION: meta_sp_can_create_sps()
* INPUT: mdsetnamep - a reference to the mdsetname_t structure
* for the set containing the device for
* which the extents are to be listed
* mdnamep - a reference to the mdname_t of the device
* on which the soft parititions are to be created
* number_of_sps - the desired number of soft partitions
* sp_size - the desired soft partition size
* OUTPUT: boolean_t return value
* RETURNS: boolean_t - B_TRUE if the soft partitionns can be created,
* B_FALSE if not
* PURPOSE: determines whether a set of soft partitions can be created
* on a device
*/
int number_of_sps,
)
{
if ((number_of_sps > 0) && (sp_size > 0)) {
&extent_listp, &mde);
} else {
}
/*
* We don't really care about an error return from the
* alignment call; that will just result in passing zero,
* which will be interpreted as no alignment.
*/
}
return (succeeded);
}
/*
* FUNCTION: meta_sp_can_create_sps_on_drive()
* INPUT: mdsetnamep - a reference to the mdsetname_t structure
* for the set containing the drive for
* which the extents are to be listed
* mddrivenamep - a reference to the mddrivename_t of the drive
* on which the soft parititions are to be created
* number_of_sps - the desired number of soft partitions
* sp_size - the desired soft partition size
* OUTPUT: boolean_t return value
* RETURNS: boolean_t - B_TRUE if the soft partitionns can be created,
* B_FALSE if not
* PURPOSE: determines whether a set of soft partitions can be created
* on a drive if the entire drive is soft partitioned
*/
int number_of_sps,
)
{
if ((number_of_sps > 0) && (sp_size > 0)) {
&extent_listp);
} else {
}
/*
* We don't care about alignment on the space call because
* we're specifically dealing with a drive, which will have no
* inherent alignment.
*/
}
return (succeeded);
}
/*
* FUNCTION: meta_sp_get_free_space()
* INPUT: mdsetnamep - a reference to the mdsetname_t structure
* for the set containing the device for
* which the free space is to be returned
* mdnamep - a reference to the mdname_t of the device
* for which the free space is to be returned
* OUTPUT: blkcnt_t return value
* RETURNS: blkcnt_t - the number of blocks of free space on the device
* PURPOSE: returns the number of blocks of free space on a device
*/
)
{
extent_listp = NULL;
free_blocks = 0;
&extent_listp, &mde);
/*
* Subtract a safety margin for watermarks when
* computing the number of blocks available for
* use. The actual number of watermarks can't
* be calculated without knowing the exact numbers
* and sizes of both the free extents and the soft
* partitions to be created. The calculation is
* highly complex and error-prone even if those
* quantities are known. The approximate value
* 10 * MD_SP_WMSIZE is within a few blocks of the
* correct value in all practical cases.
*/
} else {
free_blocks = 0;
}
} else {
mdclrerror(&mde);
}
return (free_blocks);
}
/*
* FUNCTION: meta_sp_get_free_space_on_drive()
* INPUT: mdsetnamep - a reference to the mdsetname_t structure
* for the set containing the drive for
* which the free space is to be returned
* mddrivenamep - a reference to the mddrivename_t of the drive
* for which the free space is to be returned
* OUTPUT: blkcnt_t return value
* RETURNS: blkcnt_t - the number of blocks of free space on the drive
* PURPOSE: returns the number of blocks of space usable for soft
* partitions on an entire drive, if the entire drive is
* soft partitioned
*/
)
{
extent_listp = NULL;
free_blocks = 0;
/*
* Subtract a safety margin for watermarks when
* computing the number of blocks available for
* use. The actual number of watermarks can't
* be calculated without knowing the exact numbers
* and sizes of both the free extents and the soft
* partitions to be created. The calculation is
* highly complex and error-prone even if those
* quantities are known. The approximate value
* 10 * MD_SP_WMSIZE is within a few blocks of the
* correct value in all practical cases.
*/
} else {
free_blocks = 0;
}
}
return (free_blocks);
}
/*
* FUNCTION: meta_sp_get_number_of_possible_sps()
* INPUT: mdsetnamep - a reference to the mdsetname_t structure
* for the set containing the device for
* which the number of possible soft partitions
* is to be returned
* mdnamep - a reference to the mdname_t of the device
* for which the number of possible soft partitions
* is to be returned
* OUTPUT: int return value
* RETURNS: int - the number of soft partitions of the desired size
* that can be created on the device
* PURPOSE: returns the number of soft partitions of a given size
* that can be created on a device
*/
int
)
{
extent_listp = NULL;
if (sp_size > 0) {
mdclrerror(&mde);
} else {
}
}
/*
* Keep allocating space from the extent list
* for soft partitions of the desired size until
* there's not enough free space left in the list
* for another soft partiition of that size.
* Add one to the number of possible soft partitions
* for each soft partition for which there is
* enough free space left.
*/
}
}
if (extent_listp != NULL) {
}
return (number_of_possible_sps);
}
/*
* FUNCTION: meta_sp_get_number_of_possible_sps_on_drive()
* INPUT: mdsetnamep - a reference to the mdsetname_t structure
* for the set containing the drive for
* which the number of possible soft partitions
* is to be returned
* mddrivenamep - a reference to the mddrivename_t of the drive
* for which the number of possible soft partitions
* is to be returned
* sp_size - the size in blocks of the proposed soft partitions
* OUTPUT: int return value
* RETURNS: int - the number of soft partitions of the desired size
* that can be created on the drive
* PURPOSE: returns the number of soft partitions of a given size
* that can be created on a drive, if the entire drive is
* soft partitioned
*/
int
)
{
extent_listp = NULL;
if (sp_size > 0) {
} else {
}
/*
* Keep allocating space from the extent list
* for soft partitions of the desired size until
* there's not enough free space left in the list
* for another soft partition of that size.
* Add one to the number of possible soft partitions
* for each soft partition for which there is
* enough free space left.
*
* Since it's a drive, not a metadevice, make no
* assumptions about alignment.
*/
}
}
if (extent_listp != NULL) {
}
return (number_of_possible_sps);
}
/*
* FUNCTION: meta_sp_get_possible_sp_size()
* INPUT: mdsetnamep - a reference to the mdsetname_t structure
* for the set containing the device for
* which the possible soft partition size
* is to be returned
* mdnamep - a reference to the mdname_t of the device
* for which the possible soft partition size
* is to be returned
* number_of_sps - the desired number of soft partitions
* OUTPUT: blkcnt_t return value
* RETURNS: blkcnt_t - the possible soft partition size in blocks
* PURPOSE: returns the maximum possible size of each of a given number of
* soft partitions of equal size that can be created on a device
*/
int number_of_sps
)
{
sp_size = 0;
if (number_of_sps > 0) {
/*
* To compensate for space that may have been
* occupied by watermarks, reduce sp_size by a
* number of blocks equal to the number of soft
* partitions desired, and test again to see
* whether the desired number of soft partitions
* can be created.
*/
}
if (sp_size < 0) {
sp_size = 0;
}
}
return (sp_size);
}
/*
* FUNCTION: meta_sp_get_possible_sp_size_on_drive()
* INPUT: mdsetnamep - a reference to the mdsetname_t structure
* for the set containing the drive for
* which the possible soft partition size
* is to be returned
* mddrivenamep - a reference to the mddrivename_t of the drive
* for which the possible soft partition size
* is to be returned
* number_of_sps - the desired number of soft partitions
* OUTPUT: blkcnt_t return value
* RETURNS: blkcnt_t - the possible soft partition size in blocks
* PURPOSE: returns the maximum possible size of each of a given number of
* soft partitions of equal size that can be created on a drive
* if the entire drive is soft partitioned
*/
int number_of_sps
)
{
sp_size = 0;
if (number_of_sps > 0) {
/*
* To compensate for space that may have been
* occupied by watermarks, reduce sp_size by a
* number of blocks equal to the number of soft
* partitions desired, and test again to see
* whether the desired number of soft partitions
* can be created.
*/
}
if (sp_size < 0) {
sp_size = 0;
}
}
return (sp_size);
}
/*
* **************************************************************************
* Unit Structure Manipulation Functions *
* **************************************************************************
*/
/*
* FUNCTION: meta_sp_fillextarray()
* INPUT: mp - the unit structure to fill
* extlist - the list of extents to fill with
* OUTPUT: none
* RETURNS: void
* PURPOSE: fills in the unit structure extent list with the extents
* specified by extlist. Only extents in extlist with the
* EXTFLG_UPDATE flag are changed in the unit structure,
* and the index into the unit structure is the sequence
* number in the extent list. After all of the nodes have
* been updated the virtual offsets in the unit structure
* are updated to reflect the new lengths.
*/
static void
)
{
int i;
/* go through the allocation list and fill in our unit structure */
}
}
for (i = 0; i < mp->un_numexts; i++) {
}
}
/*
* FUNCTION: meta_sp_createunit()
* INPUT: np - the name of the device to create a unit structure for
* compnp - the name of the device the soft partition is on
* extlist - the extent list to populate the new unit with
* numexts - the number of extents in the extent list
* len - the total size of the soft partition (sectors)
* status - the initial status of the unit structure
* OUTPUT: ep - return error pointer
* RETURNS: mp_unit_t * - the new unit structure.
* PURPOSE: allocates and fills in a new soft partition unit
* structure to be passed to the soft partitioning driver
* for creation.
*/
static mp_unit_t *
int numexts,
)
{
/* fill in fields in common unit structure */
/* set up geometry */
/* if we're building on metadevice we can't parent */
if (metaismeta(compnp))
else
/* fill soft partition-specific fields */
/* mdname_t start_blk field is not 64-bit! */
/* fill in the extent array */
return (mp);
}
/*
* FUNCTION: meta_sp_updateunit()
* INPUT: np - name structure for the metadevice being updated
* old_un - the original unit structure that is being updated
* extlist - the extent list to populate the new unit with
* grow_len - the amount by which the partition is being grown
* numexts - the number of extents in the extent list
* ep - return error pointer
* OUTPUT: none
* RETURNS: mp_unit_t * - the updated unit structure
* PURPOSE: allocates and fills in a new soft partition unit structure to
* be passed to the soft partitioning driver for creation. The
* old unit structure is first copied in, and then the updated
* extents are changed in the new unit structure. This is
* typically used when the size of an existing unit is changed.
*/
static mp_unit_t *
int numexts,
)
{
/* allocate new unit structure and copy in old unit */
/* update size and geometry information */
0, ep) != 0) {
return (NULL);
}
/* update extent information */
return (new_un);
}
/*
* FUNCTION: meta_get_sp()
* INPUT: sp - the set name for the device to get
* np - the name of the device to get
* OUTPUT: ep - return error pointer
* RETURNS: md_sp_t * - the XDR unit structure for the soft partition
* PURPOSE: interface to the rest of libmeta for fetching a unit structure
* for the named device. Just a wrapper for meta_get_sp_common().
*/
md_sp_t *
)
{
}
/*
* FUNCTION: meta_get_sp_common()
* INPUT: sp - the set name for the device to get
* np - the name of the device to get
* fast - whether to use the cache or not (NOT IMPLEMENTED!)
* OUTPUT: ep - return error pointer
* RETURNS: md_sp_t * - the XDR unit structure for the soft partition,
* NULL if np is not a soft partition
* PURPOSE: common routine for fetching a soft partition unit structure
*/
md_sp_t *
int fast,
)
{
char *miscname;
int i;
/* must have set */
/* short circuit */
return (NULL);
}
/* get miscname and unit */
return (NULL);
return (NULL);
}
return (NULL);
/* allocate soft partition */
/* get the common information */
/* get soft partition information */
goto out;
/*
* Fill in the key and the start block. Note that the start
* block in the unit structure is 64 bits but the name pointer
* only supports 32 bits.
*/
/* fill in status field */
/* allocate the extents */
/* do the extents for this soft partition */
for (i = 0; i < mp->un_numexts; i++) {
}
/* cleanup, return success */
return (msp);
out:
/* clean up and return error */
return (NULL);
}
/*
* FUNCTION: meta_init_sp()
* INPUT: spp - the set name for the new device
* argc - the remaining argument count for the metainit cmdline
* argv - the remainder of the unparsed command line
* options - global options parsed by metainit
* OUTPUT: ep - return error pointer
* RETURNS: int - -1 failure, 0 success
* PURPOSE: provides the command line parsing and name management overhead
* for creating a new soft partition. Ultimately this calls
* meta_create_sp() which does the real work of allocating space
* for the new soft partition.
*/
int
mdsetname_t **spp,
int argc,
char *argv[],
)
{
int c;
int old_optind;
int rval = -1;
int oflag;
int failed;
/* expect sp name, -p, optional -e, compname, and size parameters */
/* grab soft partition name */
goto out;
/* see if it exists already */
goto out;
goto out;
} else {
mdclrerror(ep);
}
if (argc == 0)
goto syntax;
/* grab -p */
goto syntax;
if (argc == 0)
goto syntax;
/* see if -e is there */
/* use the whole disk */
}
if (argc == 0)
goto syntax;
/* get component name */
if (options & MDCMD_USE_WHOLE_DISK) {
goto out;
}
goto out;
}
goto out;
}
if (!(options & MDCMD_NOLOCK)) {
/* grab set lock */
goto out;
goto out;
}
/* allocate the soft partition */
/* setup common */
if (argc == 0) {
goto syntax;
}
if (*argv[0] == '-') {
/*
* parse any other command line options, this includes
* the recovery options -o and -b. The special thing
* with these options is that the len needs to be
* kept track of otherwise when the geometry of the
* "device" is built it will create an invalid geometry
*/
old_optind = optind = 0;
opterr = 0;
oflag = 0;
seq = 0;
failed = 0;
switch (c) {
case 'A': /* data alignment */
&alignment) == -1) {
failed = 1;
}
break;
case 'o': /* offset in the partition */
if (oflag == 1) {
failed = 1;
} else {
if (tmp_size <= 0) {
failed = 1;
} else {
oflag = 1;
options |= MDCMD_DIRECT;
}
}
break;
case 'b': /* number of blocks */
if (oflag == 0) {
failed = 1;
} else {
if (tmp_size <= 0) {
failed = 1;
} else {
oflag = 0;
/* we have a pair of values */
seq++, EXTFLG_UPDATE,
}
}
break;
default:
argc -= old_optind;
argv += old_optind;
goto options;
}
if (failed) {
argc -= old_optind;
argv += old_optind;
goto syntax;
}
old_optind = optind;
}
/*
* Must have matching pairs of -o and -b flags
*/
if (oflag != 0)
goto syntax;
/*
* Can't specify both layout (indicated indirectly by
* len being set by thye -o/-b cases above) AND
* alignment
*/
goto syntax;
/*
* sanity check the allocation list
*/
goto syntax;
}
if (argc == 0)
goto syntax;
goto syntax;
}
/* we should be at the end */
if (argc != 0)
goto syntax;
/* create soft partition */
goto out;
rval = 0;
/* let em know */
if (options & MDCMD_PRINT) {
"%s: Soft Partition is setup\n"),
devname);
}
goto out;
/* syntax error */
goto out;
/* options error */
goto out;
out:
}
}
return (rval);
}
/*
* FUNCTION: meta_free_sp()
* INPUT: msp - the soft partition unit to free
* OUTPUT: none
* RETURNS: void
* PURPOSE: provides an interface from the rest of libmeta for freeing a
* soft partition unit
*/
void
{
}
/*
* FUNCTION: meta_sp_issp()
* INPUT: sp - the set name to check
* np - the name to check
* OUTPUT: ep - return error pointer
* RETURNS: int - 0 means sp,np is a soft partition
* 1 means sp,np is not a soft partition
* PURPOSE: determines whether the given device is a soft partition
* device. This is called by other metadevice check routines.
*/
int
)
{
return (1);
return (0);
}
/*
* FUNCTION: meta_check_sp()
* INPUT: sp - the set name to check
* msp - the unit structure to check
* options - creation options
* OUTPUT: repart_options - options to be passed to
* meta_repartition_drive()
* ep - return error pointer
* RETURNS: int - 0 ok to create on this component
* -1 error or not ok to create on this component
* PURPOSE: Checks to determine whether the rules for creation of
* soft partitions allow creation of a soft partition on
* the device described by the mdname_t structure referred
* to by msp->compnamep.
*
* NOTE: Does NOT check to determine whether the extents
* described in the md_sp_t structure referred to by
* msp will fit on the device described by the mdname_t
* structure located at msp->compnamep.
*/
static int
int *repart_options,
)
{
/* make sure it is in the set */
return (-1);
if ((options & MDCMD_USE_WHOLE_DISK) != 0) {
/*
* check to make sure we can partition this drive.
* we cannot continue if any of the following are
* true:
* The drive is a metadevice.
* The drive contains a mounted slice.
* The drive contains a slice being swapped to.
* The drive contains slices which are part of other
* metadevices.
* The drive contains a metadb.
*/
if (metaismeta(compnp))
/*
* ensure that we have slice 0 since the disk will be
* repartitioned in the USE_WHOLE_DISK case. this check
* is redundant unless the user incorrectly specifies a
* a fully qualified drive AND slice name (i.e.,
* recognized as a drive name by the metaname code.
*/
return (-1);
return (-1);
/* only check if the slice really exists */
continue;
return (-1);
/* check to ensure that it is not already in use */
if (meta_check_inuse(sp,
return (-1);
}
/*
* Up to this point, tests are applied to all
* slices uniformly.
*/
/*
* Tests inside the body of this
* conditional are applied only to
* slice seven.
*/
return (-1);
/*
* For slice seven, a metadb is NOT an
* automatic failure. It merely means
* that we're not allowed to muck
* about with the partitioning of that
* slice. We indicate this by masking
* in the MD_REPART_LEAVE_REP flag.
*/
NULL);
*repart_options |=
}
/*
* Skip the remaining tests for slice
* seven
*/
continue;
}
/*
* Tests below this point will be applied to
* all slices EXCEPT for the replica slice.
*/
/* check if component is in a metadevice */
-1, ep) != 0)
return (-1);
/* check to see if component has a metadb */
}
/*
* This should be all of the testing necessary when
* the MDCMD_USE_WHOLE_DISK flag is set; the rest of
* meta_check_sp() is oriented towards component
* arguments instead of disks.
*/
goto meta_check_sp_ok;
}
/* check to ensure that it is not already in use */
return (-1);
}
/*
* The component can have one or more soft partitions on it
* already, but can't be part of any other type of metadevice,
* so if it is used for a metadevice, but the metadevice
* isn't a soft partition, return failure.
*/
return (-1);
}
} else { /* handle metadevices */
/* get underlying unit & check capabilities */
return (-1);
}
mdclrerror(ep);
return (0);
}
/*
* FUNCTION: meta_create_sp()
* INPUT: sp - the set name to create in
* msp - the unit structure to create
* oblist - an optional list of requested extents (-o/-b options)
* options - creation options
* alignment - data alignment
* OUTPUT: ep - return error pointer
* RETURNS: int - 0 success, -1 error
* PURPOSE: does most of the work for creating a soft partition. If
* metainit -p -e was used, first partition the drive. Then
* create an extent list based on the existing soft partitions
* and assume all space not used by them is free. Storage for
* the new soft partition is allocated from the free extents
* based on the length specified on the command line or the
* oblist passed in. The unit structure is then committed and
* the watermarks are updated. Finally, the status is changed to
* Okay and the process is complete.
*/
static int
)
{
int rval = -1;
int numexts = 0; /* number of extents */
int count = 0;
int committed = 0;
int repart_options = MD_REPART_FORCE;
int create_flag = MD_CRO_32BIT;
int comp_is_mirror = 0;
/* validate soft partition */
return (-1);
if ((options & MDCMD_USE_WHOLE_DISK) != 0) {
if ((options & MDCMD_DOIT) != 0) {
if (meta_repartition_drive(sp,
NULL, /* Don't return the VTOC */
ep) != 0)
return (-1);
} else {
/*
* If -n and -e are both specified, it doesn't make
* sense to continue without actually partitioning
* the drive.
*/
return (0);
}
}
/* populate the start_blk field of the component name */
rval = -1;
goto out;
}
if (options & MDCMD_DOIT) {
/* store name in namespace */
rval = -1;
goto out;
}
}
/*
* Get a list of the soft partitions that currently reside on
* the component. We should ALWAYS force reload the cache,
* because if this is a single creation, there will not BE a
* cached list, and if we're using the md.tab, we must rebuild
* the list because it won't contain the previous (if any)
* soft partition.
*/
if (count < 0) {
/* error occured */
rval = -1;
goto out;
}
/*
* get the size of the underlying device. if the size is smaller
* than or equal to the watermark size, we know there isn't
* enough space.
*/
rval = -1;
goto out;
} else if (comp_size <= MD_SP_WMSIZE) {
rval = -1;
goto out;
}
/*
* seed extlist with reserved space at the beginning of the volume and
* enough space for the end watermark. The end watermark always gets
* updated, but if the underlying device changes size it may not be
* pointed to until the extent before it is updated. Since the
* end of the reserved space is where the first watermark starts,
* the reserved extent should never be marked for updating.
*/
rval = -1;
goto out;
}
if (getenv(META_SP_DEBUG)) {
meta_sp_debug("meta_create_sp: list of used extents:\n");
}
/* get extent list from -o/-b options or from free space */
if (options & MDCMD_DIRECT) {
if (getenv(META_SP_DEBUG)) {
meta_sp_debug("meta_create_sp: Dumping -o/-b list:\n");
}
if (numexts == -1) {
rval = -1;
goto out;
}
} else {
if (numexts == -1) {
rval = -1;
goto out;
}
}
/* create soft partition */
/* if we're not doing anything (metainit -n), return success */
if (! (options & MDCMD_DOIT)) {
rval = 0; /* success */
goto out;
}
if (create_flag == MD_CRO_64BIT) {
} else {
}
if (getenv(META_SP_DEBUG)) {
meta_sp_debug("meta_create_sp: printing unit structure\n");
}
/*
* Check to see if we're trying to create a partition on a mirror. If so
* we may have to enforce an ownership change before writing the
* watermark out.
*/
if (metaismeta(compnp)) {
char *miscname;
else
comp_is_mirror = 0;
} else {
comp_is_mirror = 0;
}
/*
* For a multi-node environment we have to ensure that the master
* node owns an underlying mirror before we issue the MD_IOCSET ioctl.
* If the master does not own the device we will deadlock as the
* implicit write of the watermarks (in sp_ioctl.c) will cause an
* ownership change that will block as the MD_IOCSET is still in
* progress. To close this window we force an owner change to occur
* before issuing the MD_IOCSET. We cannot simply open the device and
* write to it as this will only work for the first soft-partition
* creation.
*/
rval = -1;
goto out;
}
rval = -1;
goto out;
} else {
if (rval == -1)
goto out;
}
}
}
/* first phase of commit. */
rval = -1;
goto out;
}
/* we've successfully committed the record */
committed = 1;
/* write watermarks */
rval = -1;
goto out;
}
/*
* Allow mirror ownership to change. If we don't succeed in this
* ioctl it isn't fatal, but the cluster will probably hang fairly
* soon as the mirror owner won't change. However, we have
* successfully written the watermarks out to the device so the
* softpart creation has succeeded
*/
if (ownpar) {
}
/* second phase of commit, set status to MD_SP_OK */
rval = -1;
goto out;
}
rval = 0;
out:
if (ownpar)
return (rval);
}
/*
* **************************************************************************
* Reset (metaclear) Functions *
* **************************************************************************
*/
/*
* FUNCTION: meta_sp_reset_common()
* INPUT: sp - the set name of the device to reset
* np - the name of the device to reset
* msp - the unit structure to reset
* options - metaclear options
* OUTPUT: ep - return error pointer
* RETURNS: int - 0 success, -1 error
* PURPOSE: "resets", or more accurately deletes, the soft partition
* specified. First the state is set to "deleting" and then the
* watermarks are all cleared out. Once the watermarks have been
* updated, the unit structure is deleted from the metadb.
*/
static int
)
{
char *miscname;
int rval = -1;
int is_open = 0;
/* make sure that nobody owns us */
/* make sure that the soft partition isn't open */
return (-1);
else if (is_open)
/* get miscname */
return (-1);
/* fill in reset params */
/*
* clear soft partition - phase one.
* place the soft partition into the "delete pending" state.
*/
return (-1);
/*
* Now clear the watermarks. If the force flag is specified,
* ignore any errors writing the watermarks and delete the unit
* structure anyway. An error may leave the on-disk format in a
* corrupt state. If force is not specified and we fail here,
* the soft partition will remain in the "delete pending" state.
*/
((options & MDCMD_FORCE) == 0))
goto out;
/*
* clear soft partition - phase two.
* the driver removes the soft partition from the metadb and
* zeros out incore version.
*/
goto out;
}
rval = 0; /* success */
if (options & MDCMD_PRINT) {
"%s: Soft Partition is cleared\n"),
}
/*
* if told to recurse and on a metadevice, then attempt to
* clear the subdevices. Indicate failure if the clear fails.
*/
if ((options & MDCMD_RECURSE) &&
rval = -1;
out:
return (rval);
}
/*
* FUNCTION: meta_sp_reset()
* INPUT: sp - the set name of the device to reset
* np - the name of the device to reset
* options - metaclear options
* OUTPUT: ep - return error pointer
* RETURNS: int - 0 success, -1 error
* PURPOSE: provides the entry point to the rest of libmeta for deleting a
* soft partition. If np is NULL, then soft partitions are
* all deleted at the current level and then recursively deleted.
* Otherwise, if a name is specified either directly or as a
* result of a recursive operation, it deletes only that name.
* Since something sitting under a soft partition may be parented
* to it, we have to reparent that other device to another soft
* partition on the same component if we're deleting the one it's
* parented to.
*/
int
)
{
int rval = -1;
int num_sp;
/*
* meta_reset_all sets MDCMD_RECURSE, but this behavior
* is incorrect for soft partitions. We want to clear
* all soft partitions at a particular level in the
* metadevice stack before moving to the next level.
* Thus, we clear MDCMD_RECURSE from the options.
*/
options &= ~MDCMD_RECURSE;
/* for each soft partition */
rval = 0;
rval = -1;
rval = -1;
break;
}
/*
* meta_reset_all calls us twice to get soft
* partitions at the top and bottom of the stack.
* thus, if we have a parent, we'll get deleted
* on the next call.
*/
continue;
/*
* If this is a multi-node set, we send a series
* of individual metaclear commands.
*/
rval = -1;
break;
}
} else {
rval = -1;
break;
}
}
}
/* cleanup return status */
return (rval);
}
/* check the name */
return (-1);
/* get the unit structure */
return (-1);
/* clear out reset parameters */
/* get sp's on this component */
/* no sp's on this device. error! */
return (-1);
else if (num_sp == 1)
/* last sp on this device, so we deparent */
else {
/* have to reparent this metadevice */
continue;
/*
* this isn't the softpart we are deleting,
* so use this device as the new parent.
*/
break;
}
}
}
return (-1);
return (0);
}
/*
* FUNCTION: meta_sp_reset_component()
* INPUT: sp - the set name of the device to reset
* name - the string name of the device to reset
* options - metaclear options
* OUTPUT: ep - return error pointer
* RETURNS: int - 0 success, -1 error
* PURPOSE: provides the ability to delete all soft partitions on a
* specified device (metaclear -p). It first gets all of the
* soft partitions on the component and then deletes each one
* individually.
*/
int
char *name,
)
{
int count;
return (-1);
/* If we're starting out with no soft partitions, it's an error */
if (count == 0)
else if (count < 0)
return (-1);
/*
* clear all soft partitions on this component.
* NOTE: we reparent underlying metadevices as we go so that
* things stay sane. Also, if we encounter an error, we stop
* and go no further in case recovery might be needed.
*/
/* clear out reset parameters */
/* check the name */
return (-1);
}
/* get the unit structure */
return (-1);
}
if (metaismeta(compnp)) {
else
}
/* clear soft partition */
return (-1);
}
}
return (0);
}
/*
* **************************************************************************
* Grow (metattach) Functions *
* **************************************************************************
*/
/*
* FUNCTION: meta_sp_attach()
* INPUT: sp - the set name of the device to attach to
* np - the name of the device to attach to
* addsize - the unparsed string holding the amount of space to add
* options - metattach options
* alignment - data alignment
* OUTPUT: ep - return error pointer
* RETURNS: int - 0 success, -1 error
* PURPOSE: grows a soft partition by reading in the existing unit
* structure and setting its state to Growing, allocating more
* space (similar to meta_create_sp()), updating the watermarks,
* and then writing out the new unit structure in the Okay state.
*/
int
char *addsize,
)
{
int numexts;
int count;
/* should have the same set */
/* check name */
return (-1);
}
return (-1);
/* make sure we don't have a parent */
}
if (getenv(META_SP_DEBUG)) {
meta_sp_debug("meta_sp_attach: Unit structure before new "
"space:\n");
}
/*
* NOTE: the fast option to metakeyname is 0 as opposed to 1
* If this was not the case we would suffer the following
* assertion failure:
* Assertion failed: type1 != MDT_FAST_META && type1 != MDT_FAST_COMP
* file meta_check.x, line 315
* I guess this is because we have not "seen" this drive before
* and hence hit the failure - this is of course the attach routine
*/
return (-1);
}
/* metakeyname does not fill in the key. */
/* work out the space on the component that we are dealing with */
/*
* see if the component has been soft partitioned yet, or if an
* error occurred.
*/
if (count == 0) {
} else if (count < 0) {
return (-1);
}
/*
* seed extlist with reserved space at the beginning of the volume and
* enough space for the end watermark. The end watermark always gets
* updated, but if the underlying device changes size it may not be
* pointed to until the extent before it is updated. Since the
* end of the reserved space is where the first watermark starts,
* the reserved extent should never be marked for updating.
*/
return (-1);
}
EXTTYP_RESERVED, 0, 0, meta_sp_cmp_by_offset);
return (-1);
}
if (getenv(META_SP_DEBUG)) {
meta_sp_debug("meta_sp_attach: list of used extents:\n");
}
if (numexts == -1) {
}
/* allocate new unit structure and copy in old unit */
return (-1);
}
/* If running in dryrun mode (-n option), we're done here */
if ((options & MDCMD_DOIT) == 0) {
if (options & MDCMD_PRINT) {
"%s: Soft Partition would grow\n"),
}
return (0);
}
if (getenv(META_SP_DEBUG)) {
meta_sp_debug("meta_sp_attach: updated unit structure:\n");
}
} else {
}
return (-1);
}
/* update all watermarks */
return (-1);
return (-1);
/* second phase of commit, set status to MD_SP_OK */
return (-1);
if (options & MDCMD_PRINT) {
"%s: Soft Partition has been grown\n"),
}
return (0);
}
/*
* **************************************************************************
* Recovery (metarecover) Functions *
* **************************************************************************
*/
/*
* FUNCTION: meta_recover_sp()
* INPUT: sp - the name of the set we are recovering on
* compnp - name pointer for device we are recovering on
* argc - argument count
* argv - left over arguments not parsed by metarecover command
* options - metarecover options
* OUTPUT: ep - return error pointer
* RETURNS: int - 0 - success, -1 - error
* PURPOSE: parse soft partitioning-specific metarecover options and
* dispatch to the appropriate function to handle recovery.
*/
int
int argc,
char *argv[],
)
{
if (argc > 1) {
return (-1);
}
/*
* For a MN set, this operation must be performed on the master
* as it is responsible for maintaining the watermarks
*/
if (!metaislocalset(sp)) {
return (-1);
return (-1);
}
}
if (argc == 0) {
/*
* if no additional arguments are passed, metarecover should
* validate both on-disk and metadb structures as well as
* checking that both are consistent with each other
*/
return (-1);
return (-1);
return (-1);
/*
* Ensure that there is no existing valid record for this
* soft-partition. If there is we have nothing to do.
*/
return (-1);
/* validate and recover from on-disk structures */
return (-1);
return (-1);
/* validate and recover from metadb structures */
return (-1);
return (-1);
} else {
/* syntax error */
return (-1);
}
return (0);
}
/*
* FUNCTION: meta_sp_display_exthdr()
* INPUT: none
* OUTPUT: none
* RETURNS: void
* PURPOSE: print header line for sp_ext_node_t information. to be used
* in conjunction with meta_sp_display_ext().
*/
static void
meta_sp_display_exthdr(void)
{
(void) printf("%20s %5s %7s %20s %20s\n",
}
/*
* FUNCTION: meta_sp_display_ext()
* INPUT: ext - extent to display
* OUTPUT: none
* RETURNS: void
* PURPOSE: print selected fields from sp_ext_node_t.
*/
static void
{
/* print extent information */
else
case EXTTYP_ALLOC:
break;
case EXTTYP_FREE:
break;
case EXTTYP_RESERVED:
break;
case EXTTYP_END:
break;
default:
break;
}
}
/*
* FUNCTION: meta_sp_checkseq()
* INPUT: extlist - list of extents to be checked
* OUTPUT: none
* RETURNS: int - 0 - success, -1 - error
* PURPOSE: check soft partition sequence numbers. this function assumes
* that a list of extents representing 1 or more soft partitions
* is passed in sorted in sequence number order. within a
* single soft partition, there may not be any missing or
* duplicate sequence numbers.
*/
static int
{
continue;
"%s: sequence numbers are "
"incorrect: %d should be %d\n"),
return (-1);
}
}
return (0);
}
/*
* FUNCTION: meta_sp_resolve_name_conflict()
* INPUT: sp - name of set we're are recovering in.
* old_np - name pointer of soft partition we found on disk.
* OUTPUT: new_np - name pointer for new soft partition name.
* ep - error pointer returned.
* RETURNS: int - 0 - name not replace, 1 - name replaced, -1 - error
* PURPOSE: Check to see if the name of one of the soft partitions we found
* on disk already exists in the metadb. If so, prompt for a new
* name. In addition, we keep a static array of names that
* will be recovered from this device since these names don't
* exist in the configuration at this point but cannot be
* recovered more than once.
*/
static int
)
{
char yesno[255];
char *yes;
char newname[MD_SP_MAX_DEVNAME_PLUS_1];
int nunits;
static int *used_names = NULL;
if (used_names == NULL) {
return (-1);
}
/* see if it exists already */
return (-1);
else {
mdclrerror(ep);
return (0);
}
}
/* name exists, ask the user for a new one */
"WARNING: A soft partition named %s was found in the extent\n"
"headers, but this name already exists in the metadb "
"configuration.\n"
"In order to continue recovery you must supply\n"
return (-1);
}
/* get the new name */
for (;;) {
"for this soft partition (dXXXX) "));
/* remove newline character */
if (!(is_metaname(newname)) ||
"Invalid metadevice name\n"));
continue;
}
"Invalid metadevice name\n"));
continue;
}
/* make sure the name isn't already being used */
"That name already exists\n"));
continue;
return (-1);
break;
}
/* got a new name, place in used array and return */
mdclrerror(ep);
return (1);
}
/*
* FUNCTION: meta_sp_validate_wm()
* INPUT: sp - set name we are recovering in
* compnp - name pointer for device we are recovering from
* options - metarecover options
* OUTPUT: ep - error pointer returned
* RETURNS: int - 0 - success, -1 - error
* PURPOSE: validate and display watermark configuration. walk the
* on-disk watermark structures and validate the information
* found within. since a watermark configuration is
* "self-defining", the act of traversing the watermarks
* is part of the validation process.
*/
static int
)
{
int num_sps = 0;
int rval;
if ((options & MDCMD_VERBOSE) != 0)
"Verifying on-disk structures on %s.\n"),
/*
* for each watermark, build an ext_node, place on list.
*/
if ((options & MDCMD_VERBOSE) != 0) {
/* print out what we found */
"No extent headers found on %s.\n"),
else {
"The following extent headers were found on %s.\n"),
}
}
if (rval < 0) {
"%s: On-disk structures invalid or "
"no soft partitions found.\n"),
return (-1);
}
/* count number of soft partitions */
continue;
num_sps++;
}
if ((options & MDCMD_VERBOSE) != 0)
"Found %d soft partition(s) on %s.\n"), num_sps,
if (num_sps == 0) {
}
/* check sequence numbers */
if ((options & MDCMD_VERBOSE) != 0)
"Checking sequence numbers.\n"));
if (meta_sp_checkseq(extlist) != 0)
return (0);
}
/*
* FUNCTION: meta_sp_validate_unit()
* INPUT: sp - name of set we are recovering in
* compnp - name of component we are recovering from
* options - metarecover options
* OUTPUT: ep - error pointer returned
* RETURNS: int - 0 - success, -1 - error
* PURPOSE: validate and display metadb configuration. begin by getting
* all soft partitions built on the specified component. get
* the unit structure for each one and validate the fields within.
*/
static int
)
{
int count;
if ((options & MDCMD_VERBOSE) != 0)
"%s: Validating soft partition metadb entries.\n"),
return (-1);
/* get all soft partitions on component */
if (count == 0) {
} else if (count < 0) {
return (-1);
}
/* Now go through the soft partitions and check each one */
/* get the unit structure */
return (-1);
/* verify generic unit structure parameters */
if ((options & MDCMD_VERBOSE) != 0)
"\nVerifying device %s.\n"),
/*
* MD_SP_LAST is an invalid state and is always the
* highest numbered.
*/
"%s: status value %u is out of range.\n"),
} else if ((options & MDCMD_VERBOSE) != 0) {
return (-1);
}
"%s: Status \"%s\" is valid.\n"),
tstate & MD_DEV_ERRORED));
}
/* Now verify each extent */
if ((options & MDCMD_VERBOSE) != 0)
(void) printf("%14s %21s %21s %21s\n",
if ((options & MDCMD_VERBOSE) != 0)
(void) printf("%14u %21llu %21llu %21llu\n",
"%s: virtual offset for extent %u "
"is inconsistent, expected %llu, "
}
/* make sure extent does not drop off the end */
"%s: extent %u at offset %llu, "
"length %llu exceeds the size of the "
}
}
}
if (options & MDCMD_PRINT) {
"%s: Soft Partition metadb configuration is valid\n"),
}
return (0);
}
/*
* FUNCTION: meta_sp_validate_wm_and_unit()
* INPUT: sp - name of set we are recovering in
* compnp - name of device we are recovering from
* options - metarecover options
* OUTPUT: ep - error pointer returned
* RETURNS: int - 0 - success, -1 error
* PURPOSE: cross-validate and display watermarks and metadb records.
* get both the unit structures for the soft partitions built
* on the specified component and the watermarks found on that
* component and check to make sure they are consistent with
* each other.
*/
static int
)
{
int count;
int rval = 0;
/* get unit structure list */
if (count <= 0)
return (-1);
return (-1);
}
meta_sp_cmp_by_offset, ep) < 0) {
return (-1);
}
if (getenv(META_SP_DEBUG)) {
meta_sp_debug("meta_sp_validate_wm_and_unit: unit list:\n");
meta_sp_debug("meta_sp_validate_wm_and_unit: wm list:\n");
}
/*
* step through both lists and compare allocated nodes. Free
* nodes and end watermarks may differ between the two but
* that's generally ok, and if they're wrong will typically
* cause misplaced allocated extents.
*/
if (verbose)
/* find next allocated extents in each list */
break;
if (verbose) {
"Metadb extent:\n"));
"Extent header extent:\n"));
(void) printf("\n");
}
rval = -1;
/*
* if the offsets aren't equal, only increment the
* lowest one in hopes of getting the lists back in sync.
*/
}
/*
* if both lists aren't at the end then there are extra
* allocated nodes in one of them.
*/
"%s: extent headers contain allocations not in "
rval = -1;
}
"%s: metadb contains allocations not in the extent "
rval = -1;
}
if (options & MDCMD_PRINT) {
if (rval == 0) {
"%s: Soft Partition metadb matches extent "
} else {
"%s: Soft Partition metadb does not match extent "
}
}
return (rval);
}
/*
* FUNCTION: meta_sp_validate_exts()
* INPUT: compnp - name pointer for device we are recovering from
* wmext - extent node representing watermark
* unitext - extent node from unit structure
* OUTPUT: ep - return error pointer
* RETURNS: int - 0 - succes, mdmderror return code - error
* PURPOSE: Takes two extent nodes and checks them against each other.
* offset, length, sequence number, set, and name are compared.
*/
static int
)
{
"%s: unit structure and extent header offsets differ.\n"),
}
"%s: unit structure and extent header lengths differ.\n"),
}
"%s: unit structure and extent header sequence numbers "
}
"%s: unit structure and extent header types differ.\n"),
}
/*
* If one has a set pointer and the other doesn't, error.
* If both extents have setnames, then make sure they match
* If both are NULL, it's ok, they match.
*/
"%s: unit structure and extent header set values "
}
"%s: unit structure and extent header set names "
}
}
/*
* If one has a name pointer and the other doesn't, error.
* If both extents have names, then make sure they match
* If both are NULL, it's ok, they match.
*/
"%s: unit structure and extent header name values "
}
"%s: unit structure and extent header names "
}
}
return (0);
}
/*
* FUNCTION: update_sp_status()
* INPUT: sp - name of set we are recovering in
* minors - pointer to an array of soft partition minor numbers
* num_sps - number of minor numbers in array
* status - new status to be applied to all soft parts in array
* mn_set - set if current set is a multi-node set
* OUTPUT: ep - return error pointer
* RETURNS: int - 0 - success, -1 - error
* PURPOSE: update status of soft partitions to new status. minors is an
* array of minor numbers to apply the new status to.
* If mn_set is set, a message is sent to all nodes in the
* cluster to update the status locally.
*/
static int
int num_sps,
)
{
int i;
int err = 0;
if (mn_set) {
int result;
for (i = 0; i < num_sps; i++) {
(char *)&sp_setstat_params,
sizeof (sp_setstat_params),
if (resp->mmr_exitval != 0)
err = -1;
}
if (result != 0) {
err = -1;
}
}
} else {
err = -1;
}
if (err < 0) {
"Error updating status on recovered soft "
"partitions.\n"));
}
return (err);
}
/*
* FUNCTION: meta_sp_recover_from_wm()
* INPUT: sp - name of set we are recovering in
* compnp - name pointer for component we are recovering from
* options - metarecover options
* OUTPUT: ep - return error pointer
* RETURNS: int - 0 - success, -1 - error
* PURPOSE: update metadb records to match watermarks. begin by getting
* an extlist representing all soft partitions on the component.
* then build a unit structure for each soft partition.
* notify user of changes, then commit each soft partition to
* the metadb one at a time in the "recovering" state. update
* any watermarks that may need it (to reflect possible name
* changes), and, finally, set the status of all recovered
* partitions to the "OK" state at once.
*/
static int
)
{
int err = 0;
int not_recovered = 0;
int committed = 0;
int new_name;
char yesno[255];
char *yes;
int comp_is_mirror = 0;
/*
* if this component appears in another metadevice already, do
* NOT recover from it.
*/
return (-1);
/* set flag if dealing with a MN set */
if (!metaislocalset(sp)) {
return (-1);
}
if (MD_MNSET_DESC(sd))
mn_set = 1;
}
/*
* for each watermark, build an ext_node, place on list.
*/
meta_sp_cmp_by_nameseq, ep) < 0)
/* count number of soft partitions */
continue;
num_sps++;
}
/* allocate array of unit structure pointers */
/*
* build unit structures from list of ext_nodes.
*/
numexts++;
continue;
/*
* if we made it here, we are at a soft partition
* boundary in the list.
*/
if (getenv(META_SP_DEBUG)) {
meta_sp_debug("meta_recover_from_wm: dumping wm "
"list:\n");
}
err = 1;
goto out;
} else if (new_name) {
/*
* insert into the update list for
* watermark update.
*/
}
}
if (options & MDCMD_DOIT) {
/* store name in namespace */
if (mn_set) {
/* send message to all nodes to return key */
int result;
int message_size;
message_size = sizeof (*send_params) +
ep);
if (resp->mmr_exitval >= 0) {
} else {
err = 1;
goto out;
}
}
if (result != 0) {
err = 1;
goto out;
}
} else {
ep) != 0) {
err = 1;
goto out;
}
}
}
/* create the unit structure */
if ((mp = meta_sp_createunit(
err = 1;
goto out;
}
if (getenv(META_SP_DEBUG)) {
meta_sp_debug("meta_sp_recover_from_wm: "
"printing newly created unit structure");
}
/* place in unit structure array */
/* free sp_list */
numexts = 0;
}
/* display configuration updates */
"The following soft partitions were found and will be added to\n"
"your metadevice configuration.\n"));
(void) printf("%5s %15s %18s\n",
for (i = 0; i < num_sps; i++) {
}
if (!(options & MDCMD_DOIT)) {
not_recovered = 1;
goto out;
}
/* ask user for confirmation */
"WARNING: You are about to add one or more soft partition\n"
"metadevices to your metadevice configuration. If there\n"
"appears to be an error in the soft partition(s) displayed\n"
"above, do NOT proceed with this recovery operation.\n"));
not_recovered = 1;
goto out;
}
/* commit records one at a time */
for (i = 0; i < num_sps; i++) {
} else {
}
/*
* If this is an MN set, send the MD_IOCSET ioctl to all nodes
*/
if (mn_set) {
int result;
int mess_size;
/*
* Calculate message size. md_mn_msg_iocset_t only
* contains one extent, so increment the size to
* include all extents
*/
mess_size = sizeof (send_params) -
sizeof (mp_ext_t) +
ep);
if (resp->mmr_exitval != 0)
err = 1;
}
if (result != 0) {
err = 1;
}
} else {
err = 1;
}
}
if (err == 1) {
"%s: Error committing record to metadb.\n"),
goto out;
}
/* note that we've committed a record */
if (!committed)
committed = 1;
/* update any watermarks that need it */
if (update_list != NULL) {
/*
* Check to see if we're trying to create a partition
* on a mirror. If so we may have to enforce an
* ownership change before writing the watermark out.
*/
if (metaismeta(compnp)) {
char *miscname;
MD_MIRROR) == 0);
else
comp_is_mirror = 0;
}
/*
* If this is a MN set and the component is a mirror,
* change ownership to this node in order to write the
* watermarks
*/
if (mn_set && comp_is_mirror) {
err = 1;
goto out;
} else {
if (err != 0)
goto out;
}
}
err = 1;
"%s: Error updating extent headers.\n"),
goto out;
}
err = 1;
"%s: Error updating extent headers "
goto out;
}
}
/*
* If we have changed ownership earlier and prevented any
* ownership changes, we can now allow ownership changes
* again.
*/
if (ownpar) {
}
}
/* update status of all soft partitions to OK */
for (i = 0; i < num_sps; i++)
if (err != 0)
goto out;
if (options & MDCMD_PRINT)
"Soft Partitions recovered from device.\n"),
out:
/* free memory */
if (update_list != NULL)
for (i = 0; i < num_sps; i++)
}
/*
* if we haven't committed any softparts, either because of an
* error or because the user decided not to proceed, delete
* namelist key for the component
*/
if (mn_set) {
mdnamelist_t *p;
(char *)&send_params, sizeof (send_params),
}
}
} else {
}
}
if (err)
if (not_recovered)
if (options & MDCMD_PRINT)
"Soft Partitions NOT recovered from device.\n"),
return (0);
}
/*
* FUNCTION: meta_sp_recover_from_unit()
* INPUT: sp - name of set we are recovering in
* compnp - name of component we are recovering from
* options - metarecover options
* OUTPUT: ep - return error pointer
* RETURNS: int - 0 - success, -1 - error
* PURPOSE: update watermarks to match metadb records. begin by getting
* a namelist representing all soft partitions on the specified
* component. then, build an extlist representing the soft
* partitions, filling in the freespace extents. notify user
* of changes, place all soft partitions into the "recovering"
* state and update the watermarks. finally, return all soft
* partitions to the "OK" state.
*/
static int
)
{
int count;
char yesno[255];
char *yes;
int rval = 0;
int i;
if (count <= 0)
return (-1);
/* set flag if dealing with a MN set */
if (!metaislocalset(sp)) {
return (-1);
}
if (MD_MNSET_DESC(sd))
mn_set = 1;
}
/*
* Save the XDR unit structure for one of the soft partitions;
* we'll use this later to provide metadevice context to
* update the watermarks so the device can be resolved by
* devid instead of dev_t.
*/
return (-1);
}
return (-1);
}
EXTTYP_RESERVED, 0, 0, meta_sp_cmp_by_offset);
return (-1);
}
if ((options & MDCMD_VERBOSE) != 0) {
"Updating extent headers on device %s from metadb.\n\n"),
"The following extent headers will be written:\n"));
}
/* mark every node for updating except the reserved space */
/* print extent information */
if ((options & MDCMD_VERBOSE) != 0)
}
}
/* request verification and then update all watermarks */
if ((options & MDCMD_DOIT) != 0) {
"\nWARNING: You are about to overwrite portions of %s\n"
"with soft partition metadata. The extent headers will be\n"
"written to match the existing metadb configuration. If\n"
"the device was not previously setup with this\n"
"configuration, data loss may result.\n\n"),
/* place soft partitions into recovering state */
}
rval = -1;
goto out;
}
/* update the watermarks */
rval = -1;
goto out;
}
if (options & MDCMD_PRINT) {
"Soft Partitions recovered from metadb\n"),
}
/* return soft partitions to the OK state */
rval = -1;
goto out;
}
rval = 0;
goto out;
}
}
if (options & MDCMD_PRINT) {
"%s: Soft Partitions NOT recovered from metadb\n"),
}
out:
return (rval);
}
/*
* FUNCTION: meta_sp_update_abr()
* INPUT: sp - name of set we are recovering in
* OUTPUT: ep - return error pointer
* RETURNS: int - 0 - success, -1 - error
* PURPOSE: update the ABR state for all soft partitions in the set. This
* is called when joining a set. It sends a message to the master
* node for each soft partition to get the value of tstate and
* then sets ABR ,if required, by opening the sp, setting ABR
* and then closing the sp. This approach is taken rather that
* just issuing the MD_MN_SET_CAP ioctl, in order to deal with
* the case when we have another node simultaneously unsetting ABR.
*/
int
)
{
mdnamelist_t *p;
char fname[MAXPATHLEN];
return (-1);
}
/* Exit if no soft partitions in this set */
return (0);
/* For each soft partition */
/* check if this is a top level metadevice */
goto out;
continue;
}
/* Get tstate from Master */
ep);
if (np) {
}
continue;
}
/* If not set on the master, nothing to do */
if (!(tstate & MD_ABR_CAP))
continue;
"Could not open device %s"), fname);
continue;
}
/* Set ABR state */
continue;
}
goto out;
}
}
return (0);
out:
return (-1);
}
/*
* FUNCTION: meta_mn_sp_update_abr()
* INPUT: arg - Given set.
* PURPOSE: update the ABR state for all soft partitions in the set by
* forking a process to call meta_sp_update_abr()
* This function is only called via rpc.metad when adding a node
* to a set, ie this node is beong joined to the set by another
* node.
*/
void *
meta_mn_sp_update_abr(void *arg)
{
int fval;
/* should have a set */
return (NULL);
}
return (NULL);
}
/* fork a process */
/*
* md_daemonize will fork off a process. The is the
* parent or error.
*/
if (fval > 0) {
return (NULL);
}
return (NULL);
}
/*
* Child process should never return back to rpc.metad, but
* should exit.
* Flush all internally cached data inherited from parent process
* since cached data will be cleared when parent process RPC request
* has completed (which is possibly before this child process
* can complete).
* Child process can retrieve and cache its own copy of data from
* rpc.metad that won't be changed by the parent process.
*
* Reset md_in_daemon since this child will be a client of rpc.metad
* not part of the rpc.metad daemon itself.
* md_in_daemon is used by rpc.metad so that libmeta can tell if
* this thread is rpc.metad or any other thread. (If this thread
* was rpc.metad it could use some short circuit code to get data
* directly from rpc.metad instead of doing an RPC call to rpc.metad).
*/
md_in_daemon = 0;
}
/*
*/
(void) close(0);
(void) close(1);
(void) close(2);
/*NOTREACHED*/
return (NULL);
}