- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 21 for elfhash (0.16 sec)
-
src/cmd/link/internal/ld/elf.go
} func elfwritehdr(out *OutBuf) uint32 { if elf64 { return elf64writehdr(out) } return elf32writehdr(out) } /* Taken directly from the definition document for ELF64. */ func elfhash(name string) uint32 { var h uint32 for i := 0; i < len(name); i++ { h = (h << 4) + uint32(name[i]) if g := h & 0xf0000000; g != 0 { h ^= g >> 24 } h &= 0x0fffffff } return h }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 13:29:54 UTC 2024 - 63.6K bytes - Viewed (0) -
src/crypto/rsa/rsa.go
// crypto.Decrypter interface. type OAEPOptions struct { // Hash is the hash function that will be used when generating the mask. Hash crypto.Hash // MGFHash is the hash function used for MGF1. // If zero, Hash is used instead. MGFHash crypto.Hash // Label is an arbitrary byte string that must be equal to the value // used when encrypting. Label []byte } var (
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:11:18 UTC 2024 - 23.4K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb1/com/SmbComSessionSetupAndX.java
System.arraycopy(this.blob, 0, dst, dstIndex, this.blob.length); dstIndex += this.blob.length; } else { System.arraycopy(this.lmHash, 0, dst, dstIndex, this.lmHash.length); dstIndex += this.lmHash.length; System.arraycopy(this.ntHash, 0, dst, dstIndex, this.ntHash.length); dstIndex += this.ntHash.length;
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Sun Mar 17 10:20:23 UTC 2019 - 8.8K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/SmbComSessionSetupAndX.java
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Fri Mar 22 21:10:40 UTC 2019 - 7.3K bytes - Viewed (0) -
platforms/jvm/language-java/src/integTest/groovy/org/gradle/api/tasks/javadoc/JavadocWorkAvoidanceIntegrationTest.groovy
def oldHash = bJar.md5Hash when: // Timestamps in the jar have a 2-second precision, so we need to see a different jar before continuing ConcurrentTestUtil.poll(6) { // cleaning b and rebuilding will cause b.jar to be different succeeds(":b:clean") succeeds(":a:javadoc") assert oldHash != bJar.md5Hash } then:
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 01 03:07:53 UTC 2023 - 8.5K bytes - Viewed (0) -
src/crypto/internal/boring/rsa.go
} func DecryptRSAOAEP(h, mgfHash hash.Hash, priv *PrivateKeyRSA, ciphertext, label []byte) ([]byte, error) { return cryptRSA(priv.withKey, C.GO_RSA_PKCS1_OAEP_PADDING, h, mgfHash, label, 0, 0, decryptInit, decrypt, ciphertext) } func EncryptRSAOAEP(h, mgfHash hash.Hash, pub *PublicKeyRSA, msg, label []byte) ([]byte, error) { return cryptRSA(pub.withKey, C.GO_RSA_PKCS1_OAEP_PADDING, h, mgfHash, label, 0, 0, encryptInit, encrypt, msg) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 23:38:03 UTC 2024 - 12K bytes - Viewed (0) -
subprojects/core/src/test/groovy/org/gradle/api/internal/changedetection/state/CachingFileHasherTest.groovy
def cache = Mock(IndexedCache) def cacheAccess = Mock(CrossBuildFileHashCache) def timeStampInspector = Mock(FileTimeStampInspector) def hash = TestHashCodes.hashCodeFrom(0x0123) def oldHash = TestHashCodes.hashCodeFrom(0x0321) def file = tmpDir.createFile("testfile") def fileSystem = TestFiles.fileSystem() def statisticsCollector = Mock(FileHasherStatistics.Collector) CachingFileHasher hasher
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Jan 10 13:47:15 UTC 2023 - 6.3K bytes - Viewed (0) -
src/crypto/internal/boring/notboring.go
} func VerifyECDSA(pub *PublicKeyECDSA, hash []byte, sig []byte) bool { panic("boringcrypto: not available") } type PublicKeyRSA struct{ _ int } type PrivateKeyRSA struct{ _ int } func DecryptRSAOAEP(h, mgfHash hash.Hash, priv *PrivateKeyRSA, ciphertext, label []byte) ([]byte, error) { panic("boringcrypto: not available") } func DecryptRSAPKCS1(priv *PrivateKeyRSA, ciphertext []byte) ([]byte, error) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jan 26 22:52:27 UTC 2024 - 4.9K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/mod/sumdb/tlog/tlog.go
// The proof must not have any unnecessary hashes. if len(p) != 0 { return Hash{}, errProofFailed } return leafHash, nil } if len(p) == 0 { return Hash{}, errProofFailed } k, _ := maxpow2(hi - lo) if n < lo+k { th, err := runRecordProof(p[:len(p)-1], lo, lo+k, n, leafHash) if err != nil { return Hash{}, err } return NodeHash(th, p[len(p)-1]), nil } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jul 12 20:38:21 UTC 2023 - 17.9K bytes - Viewed (0) -
src/internal/concurrent/hashtriemap.go
func (ht *HashTrieMap[K, V]) expand(oldEntry, newEntry *entry[K, V], newHash uintptr, hashShift uint, parent *indirect[K, V]) *node[K, V] { // Check for a hash collision. oldHash := ht.keyHash(unsafe.Pointer(&oldEntry.key), ht.seed) if oldHash == newHash { // Store the old entry in the new entry's overflow list, then store // the new entry. newEntry.overflow.Store(oldEntry) return &newEntry.node }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 16:01:55 UTC 2024 - 11.8K bytes - Viewed (0)