Home
last modified time | relevance | path

Searched refs:bitshift (Results 1 – 25 of 1257) sorted by relevance

12345678910>>...51

/dports/math/octave/octave-6.4.0/scripts/general/
H A Dbitcmp.m88 %! A = bitshift (Bmax,-2);
89 %! assert (bitcmp (A,Amax),bitor (bitshift (1,Amax-1), bitshift (1,Amax-2)));
95 %! A = bitshift (Bmax,-2);
96 %! assert (bitcmp (A,Amax),bitor (bitshift (single (1),Amax-1), bitshift (single (1),Amax-2)));
102 %! A = bitshift (Bmax,-2);
103 %! assert (bitcmp (A,Amax),bitor (bitshift (uint8 (1),Amax-1), bitshift (uint8 (1),Amax-2)));
109 %! A = bitshift (Bmax,-2);
110 %! assert (bitcmp (A,Amax),bitor (bitshift (uint16 (1),Amax-1), bitshift (uint16 (1),Amax-2)));
116 %! A = bitshift (Bmax,-2);
117 %! assert (bitcmp (A,Amax),bitor (bitshift (uint32 (1),Amax-1), bitshift (uint32 (1),Amax-2)));
[all …]
/dports/devel/php-ice37/ice-3.7.2/matlab/lib/+IceInternal/
H A DProtocol.m7 FLAG_HAS_TYPE_ID_STRING = bitshift(uint8(1), 0)
8 FLAG_HAS_TYPE_ID_INDEX = bitshift(uint8(1), 1)
9 FLAG_HAS_TYPE_ID_COMPACT = bitor(bitshift(uint8(1), 0), bitshift(uint8(1), 1))
10 FLAG_HAS_OPTIONAL_MEMBERS = bitshift(uint8(1), 2)
11 FLAG_HAS_INDIRECTION_TABLE = bitshift(uint8(1), 3)
12 FLAG_HAS_SLICE_SIZE = bitshift(uint8(1), 4)
13 FLAG_IS_LAST_SLICE = bitshift(uint8(1), 5)
/dports/devel/ice37/ice-3.7.2/matlab/lib/+IceInternal/
H A DProtocol.m7 FLAG_HAS_TYPE_ID_STRING = bitshift(uint8(1), 0)
8 FLAG_HAS_TYPE_ID_INDEX = bitshift(uint8(1), 1)
9 FLAG_HAS_TYPE_ID_COMPACT = bitor(bitshift(uint8(1), 0), bitshift(uint8(1), 1))
10 FLAG_HAS_OPTIONAL_MEMBERS = bitshift(uint8(1), 2)
11 FLAG_HAS_INDIRECTION_TABLE = bitshift(uint8(1), 3)
12 FLAG_HAS_SLICE_SIZE = bitshift(uint8(1), 4)
13 FLAG_IS_LAST_SLICE = bitshift(uint8(1), 5)
/dports/devel/py-ice37/ice-3.7.2/matlab/lib/+IceInternal/
H A DProtocol.m7 FLAG_HAS_TYPE_ID_STRING = bitshift(uint8(1), 0)
8 FLAG_HAS_TYPE_ID_INDEX = bitshift(uint8(1), 1)
9 FLAG_HAS_TYPE_ID_COMPACT = bitor(bitshift(uint8(1), 0), bitshift(uint8(1), 1))
10 FLAG_HAS_OPTIONAL_MEMBERS = bitshift(uint8(1), 2)
11 FLAG_HAS_INDIRECTION_TABLE = bitshift(uint8(1), 3)
12 FLAG_HAS_SLICE_SIZE = bitshift(uint8(1), 4)
13 FLAG_IS_LAST_SLICE = bitshift(uint8(1), 5)
/dports/graphics/xfractint/xfractint-20.04p16/common/
H A D3d.c272 int bitshift) in longvmultpersp() argument
311 t[0] = t[0]<<bitshift; in longvmultpersp()
343 longpersp(LVECTOR lv, LVECTOR lview, int bitshift) in longpersp() argument
352 lv[0] = lv[0]<<bitshift; in longpersp()
359 tmpview[0] = divide(lview[0],denom,bitshift); in longpersp()
360 tmpview[1] = divide(lview[1],denom,bitshift); in longpersp()
361 tmpview[2] = divide(lview[2],denom,bitshift); in longpersp()
363 lv[0] = multiply(lv[0], tmpview[2], bitshift) - in longpersp()
364 multiply(tmpview[0], lv[2], bitshift); in longpersp()
366 lv[1] = multiply(lv[1], tmpview[2], bitshift) - in longpersp()
[all …]
/dports/multimedia/vlc/vlc-3.0.16/modules/video_chroma/
H A Dcopy.c179 switch (bitshift) in CopyFromUswc()
621 if (bitshift != 0) in CopyPlane()
628 if (bitshift > 0) in CopyPlane()
733 int bitshift) in SplitPlanes16() argument
735 if (bitshift == 0) in SplitPlanes16()
737 else if (bitshift > 0) in SplitPlanes16()
767 assert(bitshift >= -6 && bitshift <= 6 && (bitshift % 2 == 0)); in Copy420_16_SP_to_P()
852 assert(bitshift >= -6 && bitshift <= 6 && (bitshift % 2 == 0)); in Copy420_16_P_to_SP()
874 if (bitshift == 0) in Copy420_16_P_to_SP()
876 else if (bitshift > 0) in Copy420_16_P_to_SP()
[all …]
/dports/lang/gcc10/gcc-10.3.0/libgo/go/math/
H A Dtrig_reduce.go37 digit, bitshift := uint(exp+61)/64, uint(exp+61)%64
38 z0 := (mPi4[digit] << bitshift) | (mPi4[digit+1] >> (64 - bitshift))
39 z1 := (mPi4[digit+1] << bitshift) | (mPi4[digit+2] >> (64 - bitshift))
40 z2 := (mPi4[digit+2] << bitshift) | (mPi4[digit+3] >> (64 - bitshift))
/dports/lang/go-devel/go-dragonfly-amd64-bootstrap/src/math/
H A Dtrig_reduce.go37 digit, bitshift := uint(exp+61)/64, uint(exp+61)%64
38 z0 := (mPi4[digit] << bitshift) | (mPi4[digit+1] >> (64 - bitshift))
39 z1 := (mPi4[digit+1] << bitshift) | (mPi4[digit+2] >> (64 - bitshift))
40 z2 := (mPi4[digit+2] << bitshift) | (mPi4[digit+3] >> (64 - bitshift))
/dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/src/math/
H A Dtrig_reduce.go43 digit, bitshift := uint(exp+61)/64, uint(exp+61)%64
44 z0 := (mPi4[digit] << bitshift) | (mPi4[digit+1] >> (64 - bitshift))
45 z1 := (mPi4[digit+1] << bitshift) | (mPi4[digit+2] >> (64 - bitshift))
46 z2 := (mPi4[digit+2] << bitshift) | (mPi4[digit+3] >> (64 - bitshift))
/dports/lang/gcc12-devel/gcc-12-20211205/libgo/go/math/
H A Dtrig_reduce.go43 digit, bitshift := uint(exp+61)/64, uint(exp+61)%64
44 z0 := (mPi4[digit] << bitshift) | (mPi4[digit+1] >> (64 - bitshift))
45 z1 := (mPi4[digit+1] << bitshift) | (mPi4[digit+2] >> (64 - bitshift))
46 z2 := (mPi4[digit+2] << bitshift) | (mPi4[digit+3] >> (64 - bitshift))
/dports/lang/gcc11-devel/gcc-11-20211009/libgo/go/math/
H A Dtrig_reduce.go43 digit, bitshift := uint(exp+61)/64, uint(exp+61)%64
44 z0 := (mPi4[digit] << bitshift) | (mPi4[digit+1] >> (64 - bitshift))
45 z1 := (mPi4[digit+1] << bitshift) | (mPi4[digit+2] >> (64 - bitshift))
46 z2 := (mPi4[digit+2] << bitshift) | (mPi4[digit+3] >> (64 - bitshift))
/dports/lang/gcc9-devel/gcc-9-20211007/libgo/go/math/
H A Dtrig_reduce.go37 digit, bitshift := uint(exp+61)/64, uint(exp+61)%64
38 z0 := (mPi4[digit] << bitshift) | (mPi4[digit+1] >> (64 - bitshift))
39 z1 := (mPi4[digit+1] << bitshift) | (mPi4[digit+2] >> (64 - bitshift))
40 z2 := (mPi4[digit+2] << bitshift) | (mPi4[digit+3] >> (64 - bitshift))
/dports/misc/cxx_atomics_pic/gcc-11.2.0/libgo/go/math/
H A Dtrig_reduce.go43 digit, bitshift := uint(exp+61)/64, uint(exp+61)%64
44 z0 := (mPi4[digit] << bitshift) | (mPi4[digit+1] >> (64 - bitshift))
45 z1 := (mPi4[digit+1] << bitshift) | (mPi4[digit+2] >> (64 - bitshift))
46 z2 := (mPi4[digit+2] << bitshift) | (mPi4[digit+3] >> (64 - bitshift))
/dports/devel/avr-gcc/gcc-10.2.0/libgo/go/math/
H A Dtrig_reduce.go37 digit, bitshift := uint(exp+61)/64, uint(exp+61)%64
38 z0 := (mPi4[digit] << bitshift) | (mPi4[digit+1] >> (64 - bitshift))
39 z1 := (mPi4[digit+1] << bitshift) | (mPi4[digit+2] >> (64 - bitshift))
40 z2 := (mPi4[digit+2] << bitshift) | (mPi4[digit+3] >> (64 - bitshift))
/dports/lang/gcc11/gcc-11.2.0/libgo/go/math/
H A Dtrig_reduce.go43 digit, bitshift := uint(exp+61)/64, uint(exp+61)%64
44 z0 := (mPi4[digit] << bitshift) | (mPi4[digit+1] >> (64 - bitshift))
45 z1 := (mPi4[digit+1] << bitshift) | (mPi4[digit+2] >> (64 - bitshift))
46 z2 := (mPi4[digit+2] << bitshift) | (mPi4[digit+3] >> (64 - bitshift))
/dports/lang/gcc10-devel/gcc-10-20211008/libgo/go/math/
H A Dtrig_reduce.go37 digit, bitshift := uint(exp+61)/64, uint(exp+61)%64
38 z0 := (mPi4[digit] << bitshift) | (mPi4[digit+1] >> (64 - bitshift))
39 z1 := (mPi4[digit+1] << bitshift) | (mPi4[digit+2] >> (64 - bitshift))
40 z2 := (mPi4[digit+2] << bitshift) | (mPi4[digit+3] >> (64 - bitshift))
/dports/lang/gcc9/gcc-9.4.0/libgo/go/math/
H A Dtrig_reduce.go37 digit, bitshift := uint(exp+61)/64, uint(exp+61)%64
38 z0 := (mPi4[digit] << bitshift) | (mPi4[digit+1] >> (64 - bitshift))
39 z1 := (mPi4[digit+1] << bitshift) | (mPi4[digit+2] >> (64 - bitshift))
40 z2 := (mPi4[digit+2] << bitshift) | (mPi4[digit+3] >> (64 - bitshift))
/dports/lang/gcc9-aux/gcc-9.1.0/libgo/go/math/
H A Dtrig_reduce.go37 digit, bitshift := uint(exp+61)/64, uint(exp+61)%64
38 z0 := (mPi4[digit] << bitshift) | (mPi4[digit+1] >> (64 - bitshift))
39 z1 := (mPi4[digit+1] << bitshift) | (mPi4[digit+2] >> (64 - bitshift))
40 z2 := (mPi4[digit+2] << bitshift) | (mPi4[digit+3] >> (64 - bitshift))
/dports/japanese/xv/xv-3.10a/
H A Dxvbmp.c555 bitshift[0] = 7; bitshift2[0] = 0;
556 bitshift[1] = 2; bitshift2[1] = 0;
557 bitshift[2] = 0; bitshift2[2] = 3;
558 bitshift[3] = 23; bitshift2[3] = 0;
572 bitshift[i] = 0;
577 ++bitshift[i];
580 bitshift[i+3] = bitshift[i] + 16;
591 bitshift[i] += (colorbits[i] - 8);
592 bitshift[i+3] = bitshift[i] + 16;
692 bitshift[i] = 0;
[all …]
/dports/graphics/xv/xv-3.10a/
H A Dxvbmp.c555 bitshift[0] = 7; bitshift2[0] = 0;
556 bitshift[1] = 2; bitshift2[1] = 0;
557 bitshift[2] = 0; bitshift2[2] = 3;
558 bitshift[3] = 23; bitshift2[3] = 0;
572 bitshift[i] = 0;
577 ++bitshift[i];
580 bitshift[i+3] = bitshift[i] + 16;
591 bitshift[i] += (colorbits[i] - 8);
592 bitshift[i+3] = bitshift[i] + 16;
692 bitshift[i] = 0;
[all …]
/dports/graphics/xv-m17n/xv-3.10a/
H A Dxvbmp.c555 bitshift[0] = 7; bitshift2[0] = 0;
556 bitshift[1] = 2; bitshift2[1] = 0;
557 bitshift[2] = 0; bitshift2[2] = 3;
558 bitshift[3] = 23; bitshift2[3] = 0;
572 bitshift[i] = 0;
577 ++bitshift[i];
580 bitshift[i+3] = bitshift[i] + 16;
591 bitshift[i] += (colorbits[i] - 8);
592 bitshift[i+3] = bitshift[i] + 16;
692 bitshift[i] = 0;
[all …]
/dports/emulators/atari800/atari800-3.1.0/src/wince/port/
H A Dscreen_wince.cpp584 bitshift += gxdp.cBPP; \
587 bitshift = refbitshift; \
623 static int bitshift; in mono_Refresh() local
662 bitshift = refbitshift = 0; in mono_Refresh()
908 bitshift = refbitshift = 0; in mono_Refresh()
1015 bitshift = refbitshift = 0; in mono_Refresh()
2085 static int bitshift; in mono_DrawKbd() local
2114 bitshift = 0; in mono_DrawKbd()
2150 bitshift += gxdp.cBPP; in mono_DrawKbd()
2151 if(bitshift >= 8) in mono_DrawKbd()
[all …]
/dports/x11/xmascot/xmascot-2.6a.20200830/imagelib/
H A Dpnm.c180 int i,c,n,bitshift,value; in load_pgm() local
189 for (bitshift = 0; value > 255; value >>= 1,bitshift++) in load_pgm()
204 *pic8++ = c >> bitshift; in load_pgm()
213 *pic8++ = get_short(fp) >> bitshift; in load_pgm()
228 int i,c,n,bitshift,value; in load_ppm() local
234 for (bitshift = 0; value > 255; value >>= 1,bitshift++) in load_ppm()
241 *pic24++ = c >> bitshift; in load_ppm()
247 *pic24++ = get_short(fp) >> bitshift; in load_ppm()
/dports/math/suitesparse-klu/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/@GrB/
H A Dbitshift.m1 function C = bitshift (A, B, assumedtype) function
3 % C = bitshift (A,B) is the bitwise shift of A; if B > 0 then A is shifted
8 % With a third parameter, C = bitshift (A,B,assumedtype) provides a data
18 % C1 = bitshift (A, -2) ;
19 % C2 = bitshift (G, -2)
28 % FUTURE: bitshift(A,B) for two matrices A and B is slower than it could be.
35 C = GrB (gb_bitwise ('bitshift', A, B, assumedtype)) ;
/dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/@GrB/
H A Dbitshift.m1 function C = bitshift (A, B, assumedtype) function
3 % C = bitshift (A,B) is the bitwise shift of A; if B > 0 then A is shifted
8 % With a third parameter, C = bitshift (A,B,assumedtype) provides a data
18 % C1 = bitshift (A, -2) ;
19 % C2 = bitshift (G, -2)
28 % FUTURE: bitshift(A,B) for two matrices A and B is slower than it could be.
35 C = GrB (gb_bitwise ('bitshift', A, B, assumedtype)) ;

12345678910>>...51