Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 29 for allocated (0.16 sec)

  1. internal/s3select/csv/reader.go

    		if r.err != nil {
    			return nil, r.err
    		}
    		// Move to next block
    		item, ok := <-r.queue
    		if !ok {
    			r.err = io.EOF
    			return nil, r.err
    		}
    		//nolint:staticcheck // SA6002 Using pointer would allocate more since we would have to copy slice header before taking a pointer.
    		r.csvDstPool.Put(r.current)
    		r.current = <-item.dst
    		r.err = item.err
    		r.recordsRead = 0
    	}
    	csvRecord := r.current[r.recordsRead]
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Thu Feb 22 06:26:06 GMT 2024
    - 8.9K bytes
    - Viewed (0)
  2. cmd/crossdomain-xml-handler.go

    // along with this program.  If not, see <http://www.gnu.org/licenses/>.
    
    package cmd
    
    import "net/http"
    
    // Standard cross domain policy information located at https://s3.amazonaws.com/crossdomain.xml
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Mon Mar 18 06:42:40 GMT 2024
    - 2.2K bytes
    - Viewed (0)
  3. cmd/metacache-entries.go

    	for i, entry := range m {
    		if entry.name != "" {
    			n++
    			if first == nil {
    				first = &m[i]
    			}
    		}
    	}
    	return first, n
    }
    
    // names will return all names in order.
    // Since this allocates it should not be used in critical functions.
    func (m metaCacheEntries) names() []string {
    	res := make([]string, 0, len(m))
    	for _, obj := range m {
    		res = append(res, obj.name)
    	}
    	return res
    }
    
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Fri Apr 19 16:43:43 GMT 2024
    - 23.2K bytes
    - Viewed (0)
  4. cmd/bucket-replication.go

    	}
    
    	resyncStatus := ResyncFailed
    	defer func() {
    		s.markStatus(resyncStatus, opts, objectAPI)
    		globalSiteResyncMetrics.incBucket(opts, resyncStatus)
    		s.workerCh <- struct{}{}
    	}()
    	// Allocate new results channel to receive ObjectInfo.
    	objInfoCh := make(chan ObjectInfo)
    	cfg, err := getReplicationConfig(ctx, opts.bucket)
    	if err != nil {
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Wed May 01 01:09:56 GMT 2024
    - 112.2K bytes
    - Viewed (1)
  5. cmd/erasure-multipart.go

    	if err != nil {
    		return pi, toObjectErr(err, bucket, object)
    	}
    
    	// Fetch buffer for I/O, returns from the pool if not allocates a new one and returns.
    	var buffer []byte
    	switch size := data.Size(); {
    	case size == 0:
    		buffer = make([]byte, 1) // Allocate at least a byte to reach EOF
    	case size == -1:
    		if size := data.ActualSize(); size > 0 && size < fi.Erasure.BlockSize {
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Sun Apr 28 17:53:50 GMT 2024
    - 43K bytes
    - Viewed (0)
  6. internal/kms/context.go

    // is based on the un-escaped keys. It never returns an error.
    func (c Context) MarshalText() ([]byte, error) {
    	if len(c) == 0 {
    		return []byte{'{', '}'}, nil
    	}
    
    	// Pre-allocate a buffer - 128 bytes is an arbitrary
    	// heuristic value that seems like a good starting size.
    	b := bytes.NewBuffer(make([]byte, 0, 128))
    	if len(c) == 1 {
    		for k, v := range c {
    			b.WriteString(`{"`)
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Sun Jan 02 17:15:06 GMT 2022
    - 6K bytes
    - Viewed (0)
  7. internal/s3select/json/preader.go

    		if r.err != nil {
    			return nil, r.err
    		}
    		// Move to next block
    		item, ok := <-r.queue
    		if !ok {
    			r.err = io.EOF
    			return nil, r.err
    		}
    		//nolint:staticcheck // SA6002 Using pointer would allocate more since we would have to copy slice header before taking a pointer.
    		r.kvDstPool.Put(r.current)
    		r.current = <-item.dst
    		r.err = item.err
    		r.recordsRead = 0
    	}
    	kvRecord := r.current[r.recordsRead]
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Sun Mar 05 04:57:35 GMT 2023
    - 6.4K bytes
    - Viewed (0)
  8. internal/crypto/metadata.go

    	}
    	if _, ok := metadata[MetaContext]; ok {
    		return nil, true
    	}
    	return nil, false
    }
    
    // CreateMultipartMetadata adds the multipart flag entry to metadata
    // and returns modified metadata. It allocates a new metadata map if
    // metadata is nil.
    func CreateMultipartMetadata(metadata map[string]string) map[string]string {
    	if metadata == nil {
    		return map[string]string{MetaMultipart: ""}
    	}
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Thu Jan 18 07:03:17 GMT 2024
    - 6.2K bytes
    - Viewed (0)
  9. cmd/metacache-set.go

    	Replication replicationConfig `msg:"-"`
    
    	// StopDiskAtLimit will stop listing on each disk when limit number off objects has been returned.
    	StopDiskAtLimit bool
    
    	// pool and set of where the cache is located.
    	pool, set int
    }
    
    func init() {
    	gob.Register(listPathOptions{})
    }
    
    func (o *listPathOptions) setBucketMeta(ctx context.Context) {
    	lc, _ := globalLifecycleSys.Get(o.Bucket)
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Wed May 01 17:59:08 GMT 2024
    - 30.4K bytes
    - Viewed (0)
  10. docs/iam/opa.md

    # OPA Quickstart Guide [![Slack](https://slack.minio.io/slack?type=svg)](https://slack.minio.io)
    
    OPA is a lightweight general-purpose policy engine that can be co-located with MinIO server, in this document we talk about how to use OPA HTTP API to authorize requests. It can be used with any type of credentials (STS based like OpenID or LDAP, regular IAM users or service accounts).
    
    OPA is enabled through MinIO's Access Management Plugin feature.
    
    ## Get started
    
    Plain Text
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Sun Jul 17 15:43:14 GMT 2022
    - 2.3K bytes
    - Viewed (0)
Back to top