}

	l.mutex.Lock()
	defer l.mutex.Unlock()
	var locksHeld int64
	if locksHeld, reply = l.lockMap[args.Resources[0]]; !reply { // No lock is held on the given name
		return false, fmt.Errorf("Unlock attempted on an unlocked entity: %s", args.Resources[0])
	}
	if reply = locksHeld == WriteLock; !reply { // Unless it is a write lock

# ILM Tiering Design [![slack](https://slack.min.io/slack?type=svg)](https://slack.min.io) [![Docker Pulls](https://img.shields.io/docker/pulls/minio/minio.svg?maxAge=604800)](https://hub.docker.com/r/minio/minio/)

Lifecycle transition functionality provided in [bucket lifecycle guide](https://github.com/minio/minio/master/docs/bucket/lifecycle/README.md) allows tiering of content from MinIO object store to public clouds or other MinIO clusters.

        "The process cannot access the file because it is being used by another process.",
        "The process cannot access the file because another process has locked a portion of the file.", "The disk is full.",
        "A duplicate name exists on the network.", "The network name cannot be found.", "ERRnomoreconn.", "The file exists.",

        "The process cannot access the file because it is being used by another process.",
        "The process cannot access the file because another process has locked a portion of the file.",
        "The disk is full.",
        "A duplicate name exists on the network.",
        "The network name cannot be found.",
        "ERRnomoreconn.",
        "The file exists.",

	"I'm a teapot":                    http.StatusTeapot,
	"Misdirected Request":             http.StatusMisdirectedRequest,
	"Unprocessable Entity":            http.StatusUnprocessableEntity,
	"Locked":                          http.StatusLocked,
	"Failed Dependency":               http.StatusFailedDependency,
	"Too Early":                       http.StatusTooEarly,

			if i.debug {
				if obj.VersionID != "" {
					console.Debugf(applyVersionActionsLogPrefix+" lifecycle: %s v(%s) is locked, not deleting\n", obj.Name, obj.VersionID)
				} else {
					console.Debugf(applyVersionActionsLogPrefix+" lifecycle: %s is locked, not deleting\n", obj.Name)
				}
			}
			// add this version back to remaining versions for
			// subsequent lifecycle policy applications

             * thread.wait( timeout ) cannot reaquire the lock and
             * return which would render the timeout effectively useless.
             */
            doConnect();
        } catch( Exception ex ) {
            ex0 = ex; // Defer to below where we're locked
            return;
        } finally {
            synchronized (run_thread) {

        "The user must change his password before he logs on the first time.", "The object was not found.",
        "The referenced account is currently locked out and may not be logged on to.", "Connection refused",
        "The remote system is not reachable by the transport.", "The layered file system driver for this I/O tag did not handle it when needed.",

# Heap new generation
#FESS_HEAP_NEWSIZE=

# max direct memory
#FESS_DIRECT_SIZE=

# Additional Java OPTS
#FESS_JAVA_OPTS=

# Maximum number of open files
MAX_OPEN_FILES=65535

# Maximum amount of locked memory
#MAX_LOCKED_MEMORY=

# Fess log directory
LOG_DIR=${packaging.fess.log.dir}

# Fess data directory
DATA_DIR=${packaging.fess.var.dir}

# Fess configuration directory

   * needed.
   *
   * A single spinlock ("busy") is used for initializing and
   * resizing the table, as well as populating slots with new Cells.
   * There is no need for a blocking lock; when the lock is not
   * available, threads try other slots (or the base).  During these
   * retries, there is increased contention and reduced locality,
   * which is still better than alternatives.
   *