- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 602 for mask1 (0.04 sec)
-
src/cmd/compile/internal/ssa/regalloc.go
} // allocReg chooses a register from the set of registers in mask. // If there is no unused register, a Value will be kicked out of // a register to make room. func (s *regAllocState) allocReg(mask regMask, v *Value) register { if v.OnWasmStack { return noRegister } mask &= s.allocatable mask &^= s.nospill if mask == 0 { s.f.Fatalf("no register available for %s", v.LongString()) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 17:49:56 UTC 2023 - 87.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/RegularImmutableBiMap.java
V value = entry.getValue(); checkEntryNotNull(key, value); int keyHash = key.hashCode(); int valueHash = value.hashCode(); int keyBucket = Hashing.smear(keyHash) & mask; int valueBucket = Hashing.smear(valueHash) & mask; ImmutableMapEntry<K, V> nextInKeyBucket = keyTable[keyBucket]; ImmutableMapEntry<K, V> nextInValueBucket = valueTable[valueBucket]; try {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/base/SmallCharMatcher.java
index = (index + 1) & mask; } } return new SmallCharMatcher(table, filter, containsZero, description); } @Override public boolean matches(char c) { if (c == 0) { return containsZero; } if (!checkFilter(c)) { return false; } int mask = table.length - 1; int startingIndex = smear(c) & mask; int index = startingIndex;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 4.5K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/ACE.java
* and access mask of each ACE. If the SID matches, the allow/deny flags * and access mask are considered. If the ACE is a "deny" * ACE and <i>any</i> of the desired access bits match bits in the access * mask of the ACE, the whole access check fails. If the ACE is an "allow" * ACE and <i>all</i> of the bits in the desired access bits match bits in * the access mask of the ACE, the access check is successful. Otherwise,
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Fri Mar 22 21:10:40 UTC 2019 - 7.2K bytes - Viewed (0) -
src/runtime/export_unix_test.go
//go:build unix package runtime import "unsafe" var NonblockingPipe = nonblockingPipe var Fcntl = fcntl var Closeonexec = closeonexec func sigismember(mask *sigset, i int) bool { clear := *mask sigdelset(&clear, i) return clear != *mask } func Sigisblocked(i int) bool { var sigmask sigset sigprocmask(_SIG_SETMASK, nil, &sigmask) return sigismember(&sigmask, i) } type M = m
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 20 21:27:51 UTC 2023 - 2.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/RegularImmutableSet.java
// 'and' with an int to get a valid table index. private final transient int mask; RegularImmutableSet(Object[] elements, int hashCode, @Nullable Object[] table, int mask) { this.elements = elements; this.hashCode = hashCode; this.table = table; this.mask = mask; } @Override public boolean contains(@CheckForNull Object target) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 3.9K bytes - Viewed (0) -
src/main/java/jcifs/ACE.java
* and access mask of each ACE. If the SID matches, the allow/deny flags * and access mask are considered. If the ACE is a "deny" * ACE and <i>any</i> of the desired access bits match bits in the access * mask of the ACE, the whole access check fails. If the ACE is an "allow" * ACE and <i>all</i> of the bits in the desired access bits match bits in * the access mask of the ACE, the access check is successful. Otherwise,
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Sun Jul 01 13:12:10 UTC 2018 - 6.5K bytes - Viewed (0) -
pkg/volume/volume_linux_test.go
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Apr 03 19:34:37 UTC 2023 - 12.1K bytes - Viewed (0) -
src/main/java/jcifs/pac/PacDataInputStream.java
this.dis = new DataInputStream(in); this.size = in.available(); } public void align ( int mask ) throws IOException { int position = this.size - this.dis.available(); int shift = position & mask - 1; if ( mask != 0 && shift != 0 ) this.dis.skip(mask - shift); } public int available () throws IOException { return this.dis.available(); }
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Sat Jul 21 21:19:58 UTC 2018 - 5.1K bytes - Viewed (0) -
src/math/frexp.go
// special cases switch { case f == 0: return f, 0 // correctly return -0 case IsInf(f, 0) || IsNaN(f): return f, 0 } f, exp = normalize(f) x := Float64bits(f) exp += int((x>>shift)&mask) - bias + 1 x &^= mask << shift x |= (-1 + bias) << shift frac = Float64frombits(x) return
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 929 bytes - Viewed (0)