Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 19 for srcbuf (0.19 sec)

  1. src/crypto/aes/gcm_s390x.go

    	// buffer for counter values.
    	var ctrbuf, srcbuf [2048]byte
    	for len(src) >= 16 {
    		siz := len(src)
    		if len(src) > len(ctrbuf) {
    			siz = len(ctrbuf)
    		}
    		siz &^= 0xf // align siz to 16-bytes
    		copy(srcbuf[:], src[:siz])
    		cryptBlocksGCM(g.block.function, g.block.key, dst[:siz], srcbuf[:siz], ctrbuf[:], cnt)
    		src = src[siz:]
    		dst = dst[siz:]
    	}
    	if len(src) > 0 {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 13 18:57:38 UTC 2024
    - 11.3K bytes
    - Viewed (0)
  2. cmd/object-api-utils_test.go

    			}
    
    			var decBuf bytes.Buffer
    			decRdr := s2.NewReader(&rdrBuf)
    			_, err = io.Copy(&decBuf, decRdr)
    			if err != nil {
    				t.Fatal(err)
    			}
    
    			if !bytes.Equal(tt.data, decBuf.Bytes()) {
    				t.Errorf("roundtrip failed\n\t%q\n\t%q", tt.data, decBuf.Bytes())
    			}
    		})
    	}
    }
    
    func Test_pathNeedsClean(t *testing.T) {
    	type pathTest struct {
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Fri May 24 23:05:23 UTC 2024
    - 23.4K bytes
    - Viewed (0)
  3. src/runtime/tracestack.go

    	} else if len(pcBuf) > 0 && pcBuf[0] == logicalStackSentinel {
    		// pcBuf contains logical rather than inlined frames, skip has already been
    		// applied, just return it without the sentinel value in pcBuf[0].
    		return copy(dst, pcBuf[1:])
    	}
    
    	var (
    		n          int
    		lastFuncID = abi.FuncIDNormal
    		skip       = pcBuf[0]
    		// skipOrAdd skips or appends retPC to newPCBuf and returns true if more
    		// pcs can be added.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue May 21 14:38:56 UTC 2024
    - 11K bytes
    - Viewed (0)
  4. src/cmd/internal/obj/x86/seh.go

    	"fmt"
    	"math"
    )
    
    type sehbuf struct {
    	ctxt *obj.Link
    	data []byte
    	off  int
    }
    
    func newsehbuf(ctxt *obj.Link, nodes uint8) sehbuf {
    	// - 8 bytes for the header
    	// - 2 bytes for each node
    	// - 2 bytes in case nodes is not even
    	size := 8 + nodes*2
    	if nodes%2 != 0 {
    		size += 2
    	}
    	return sehbuf{ctxt, make([]byte, size), 0}
    }
    
    func (b *sehbuf) write8(v uint8) {
    	b.data[b.off] = v
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 14:41:10 UTC 2024
    - 4.6K bytes
    - Viewed (0)
  5. src/encoding/hex/hex_test.go

    			}
    
    			dec := NewDecoder(&buf)
    			var decBuf bytes.Buffer
    			w := struct{ io.Writer }{&decBuf} // io.Writer only; not io.ReaderFrom
    			if _, err := io.CopyBuffer(w, dec, make([]byte, 7)); err != nil || decBuf.Len() != len(input) {
    				t.Errorf("decoder.Read(%q*%d) = (%d, %v), want (%d, nil)", test.enc, multiplier, decBuf.Len(), err, len(input))
    			}
    
    			if !bytes.Equal(decBuf.Bytes(), input) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 08 19:30:23 UTC 2024
    - 7.9K bytes
    - Viewed (0)
  6. tensorflow/compiler/mlir/lite/python/converter_python_api.cc

        for (int i = 0; i < PyList_GET_SIZE(py_denylist); ++i) {
          PyObject* value = PyList_GetItem(py_denylist, i);
          char* str_buf;
          Py_ssize_t length;
          if (ConvertFromPyString(value, &str_buf, &length) == -1) {
            return -1;
          }
          string_set->emplace(str_buf, length);
        }
      }
      if (PySet_Check(py_denylist)) {
        auto* tmp = PySet_New(py_denylist);
        while (PySet_GET_SIZE(tmp)) {
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Wed Jun 12 23:15:24 UTC 2024
    - 19.2K bytes
    - Viewed (0)
  7. src/internal/trace/trace_test.go

    		// and stderr is an expectation in string format.
    		var traceBuf, errBuf bytes.Buffer
    		cmd.Stdout = &traceBuf
    		cmd.Stderr = &errBuf
    		// Run the program.
    		if err := cmd.Run(); err != nil {
    			if errBuf.Len() != 0 {
    				t.Logf("stderr: %s", string(errBuf.Bytes()))
    			}
    			t.Fatal(err)
    		}
    		tb := traceBuf.Bytes()
    
    		// Test the trace and the parser.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 17 18:48:18 UTC 2024
    - 18.5K bytes
    - Viewed (0)
  8. src/main/java/org/codelibs/fess/helper/ViewHelper.java

                hlQueries[i] = highlightTagPre + queries[i] + highlightTagPost;
            }
            while (m.find()) {
                segBuf.setLength(0);
                m.appendReplacement(segBuf, StringUtil.EMPTY);
                String segment = segBuf.toString();
                for (int i = 0; i < queries.length; i++) {
    Registered: Wed Jun 12 13:08:18 UTC 2024
    - Last Modified: Thu May 30 06:58:45 UTC 2024
    - 40.2K bytes
    - Viewed (0)
  9. src/runtime/mprof.go

    	// pcbuf which is usually given to us by our caller. When it's not, we have
    	// to allocate one here. This will only happen for goroutines that were in a
    	// syscall when the goroutine profile started or for goroutines that manage
    	// to execute before we finish iterating over all the goroutines.
    	if pcbuf == nil {
    		pcbuf = makeProfStack()
    	}
    
    	var u unwinder
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 17:57:37 UTC 2024
    - 53.3K bytes
    - Viewed (0)
  10. src/runtime/traceback.go

    		return 0
    	}
    
    	ctxt := u.g.ptr().cgoCtxt[u.cgoCtxt]
    	u.cgoCtxt--
    	cgoContextPCs(ctxt, pcBuf)
    	for i, pc := range pcBuf {
    		if pc == 0 {
    			return i
    		}
    	}
    	return len(pcBuf)
    }
    
    // tracebackPCs populates pcBuf with the return addresses for each frame from u
    // and returns the number of PCs written to pcBuf. The returned PCs correspond
    // to "logical frames" rather than "physical frames"; that is if A is inlined
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 29 16:25:21 UTC 2024
    - 55.1K bytes
    - Viewed (0)
Back to top