/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Math.h | 1 //===- Math.h - PBQP Vector and Matrix classes ------------------*- C++ -*-===// 120 /// PBQP Matrix class 121 class Matrix { 123 friend hash_code hash_value(const Matrix &); 126 /// Construct a PBQP Matrix with the given dimensions. 127 Matrix(unsigned Rows, unsigned Cols) : in Matrix() function 131 /// Construct a PBQP Matrix with the given dimensions and initial 133 Matrix(unsigned Rows, unsigned Cols, PBQPNum InitVal) in Matrix() function 139 /// Copy construct a PBQP matrix. 140 Matrix(const Matrix &M) in Matrix() function [all …]
|
H A D | ReductionRules.h | 34 using Matrix = typename GraphT::Matrix; in applyR1() local 43 const Matrix &ECosts = G.getEdgeCosts(EId); in applyR1() 78 using Matrix = typename GraphT::Matrix; in applyR2() local 96 const Matrix *YXECosts = FlipEdge1 ? in applyR2() 97 new Matrix(G.getEdgeCosts(YXEId).transpose()) : in applyR2() 100 const Matrix *ZXECosts = FlipEdge2 ? in applyR2() 101 new Matrix(G.getEdgeCosts(ZXEId).transpose()) : in applyR2() 134 const Matrix &YZECosts = G.getEdgeCosts(YZEId); in applyR2() 182 using Matrix = typename GraphT::Matrix; in backpropagate() local 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate()
|
/freebsd/sys/contrib/device-tree/Bindings/mfd/ |
H A D | atmel-matrix.txt | 1 * Device tree bindings for Atmel Bus Matrix 3 The Bus Matrix registers are used to configure Atmel SoCs internal bus 8 "atmel,at91sam9260-matrix", "syscon" 9 "atmel,at91sam9261-matrix", "syscon" 10 "atmel,at91sam9263-matrix", "syscon" 11 "atmel,at91sam9rl-matrix", "syscon" 12 "atmel,at91sam9g45-matrix", "syscon" 13 "atmel,at91sam9n12-matrix", "syscon" 14 "atmel,at91sam9x5-matrix", "syscon" 15 "atmel,sama5d3-matrix", "sysco [all...] |
/freebsd/crypto/openssh/.github/workflows/ |
H A D | selfhosted.yml | 9 name: "${{ matrix.target }} ${{ matrix.config }}" 11 runs-on: ${{ matrix.host }} 15 HOST: ${{ matrix.host }} 16 TARGET_HOST: ${{ matrix.target }} 17 TARGET_CONFIG: ${{ matrix.config }} 18 …T_DOMAIN: ${{ startsWith(matrix.host, 'libvirt') && format('{0}-{1}-{2}', matrix.target, matrix.co… 19 EPHEMERAL: ${{ startsWith(matrix.host, 'libvirt') }} 20 PERSISTENT: ${{ startsWith(matrix.host, 'persist') }} 21 REMOTE: ${{ startsWith(matrix.host, 'remote') }} 22 VM: ${{ startsWith(matrix.host, 'libvirt') || startsWith(matrix.host, 'persist') }} [all …]
|
H A D | upstream.yml | 10 name: "upstream ${{ matrix.target }} ${{ matrix.config }}" 12 runs-on: ${{ matrix.host }} 16 HOST: ${{ matrix.host }} 17 TARGET_HOST: ${{ matrix.target }} 18 TARGET_CONFIG: ${{ matrix.config }} 19 …TARGET_DOMAIN: ${{ format('{0}-{1}-{2}', matrix.target, matrix.config, github.run_id) || matrix.ta… 22 matrix: 50 …run: vmrun "cd /usr/src/usr.bin/ssh && case ${{ matrix.config }} in without-openssl) make OPENSSL=… 54 …run: vmrun "cd /usr/src/regress/usr.bin/ssh && case ${{ matrix.config }} in without-openssl) make … 65 name: ${{ matrix.target }}-${{ matrix.config }}-logs
|
H A D | c-cpp.yml | 11 name: "${{ matrix.target }} ${{ matrix.config }}" 15 matrix: 112 runs-on: ${{ matrix.target }} 115 if: ${{ startsWith(matrix.target, 'windows') }} 118 if: ${{ startsWith(matrix.target, 'windows') }} 122 run: sh ./.github/setup_ci.sh ${{ matrix.config }} 126 run: sh ./.github/configure.sh ${{ matrix.config }} 130 name: ${{ matrix.target }}-${{ matrix.config }}-config 137 run: sh ./.github/run_test.sh ${{ matrix.config }} 145 name: ${{ matrix.target }}-${{ matrix.config }}-logs
|
/freebsd/.github/workflows/ |
H A D | cross-bootstrap-tools.yml | 15 name: ${{ matrix.target_arch }} ${{ matrix.os }} (${{ matrix.compiler }}) 16 runs-on: ${{ matrix.os }} 19 matrix: 46 sudo apt-get -yq --no-install-suggests --no-install-recommends install ${{ matrix.pkgs }} 51 brew install ${{ matrix.pkgs }} || true 55 if [ -n "${{ matrix.cross-bindir }}" ]; then 56 echo "EXTRA_BUILD_ARGS=--cross-bindir=${{ matrix.cross-bindir }}" >> $GITHUB_ENV 58 if [ -n "${{ matrix.cross-toolchain }}" ]; then 59 echo "EXTRA_BUILD_ARGS=--cross-toolchain=${{ matrix.cross-toolchain }}" >> $GITHUB_ENV 66 …tools/build/make.py --debug $EXTRA_BUILD_ARGS TARGET=${{ matrix.target }} TARGET_ARCH=${{ matrix.t… [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | MatrixBuilder.h | 1 //===- llvm/MatrixBuilder.h - Builder to lower matrix ops -------*- C++ -*-===// 10 // to lower matrix operations to LLVM IR. 40 "One of the operands must be a matrix (embedded in a vector)"); in splatScalarOperandIfNeeded() 60 /// Create a column major, strided matrix load. 61 /// \p EltTy - Matrix element type 62 /// \p DataPtr - Start address of the matrix read 63 /// \p Rows - Number of rows in matrix (must be a constant) 64 /// \p Columns - Number of columns in matrix (must be a constant) 85 /// Create a column major, strided matrix store. 86 /// \p Matrix - Matrix to store [all …]
|
/freebsd/sys/dev/sound/pcm/ |
H A D | feeder_matrix.c | 41 * + very generic and compact, provided that the supplied matrix map is in a 47 * + 'matrix' is kind of 0x7a69, due to prolong mental block. 75 } matrix[SND_CHN_T_MAX + 1]; member 126 for (i = 0; info->matrix[i].chn[0] != SND_CHN_T_EOF; i++) { in feed_matrix_apply() 127 if (info->matrix[i].chn[0] == SND_CHN_T_NULL) { in feed_matrix_apply() 131 } else if (info->matrix[i].chn[1] == SND_CHN_T_EOF) { in feed_matrix_apply() 133 info->matrix[i].chn[0], fmt); in feed_matrix_apply() 140 for (j = 0; info->matrix[i].chn[j] != SND_CHN_T_EOF; in feed_matrix_apply() 143 info->matrix[i].chn[j], fmt); in feed_matrix_apply() 147 accum = (accum * info->matrix[i].mul) >> in feed_matrix_apply() [all …]
|
H A D | feeder_chain.c | 41 struct pcmchan_matrix *matrix; /* matrix map */ member 193 cdesc->current.matrix->channels, cdesc->current.matrix->ext); in feeder_build_formatne() 312 cdesc->target.matrix->channels, cdesc->target.matrix->ext); in feeder_build_matrix() 322 ret = feeder_matrix_setup(f, cdesc->current.matrix, in feeder_build_matrix() 323 cdesc->target.matrix); in feeder_build_matrix() 333 cdesc->current.matrix = cdesc->target.matrix; in feeder_build_matrix() 393 ret = feeder_volume_apply_matrix(f, cdesc->current.matrix); in feeder_build_volume() 531 #define FEEDER_BW(c, t) ((c)->t.matrix->channels * (c)->t.rate) 537 #define FEEDMATRIX_UP(c) ((c)->target.matrix->channels > \ 538 (c)->current.matrix->channels) [all …]
|
H A D | feeder_volume.c | 53 feed_volume_##SIGN##BIT##ENDIAN(int *vol, int *matrix, \ 68 v = FEEDVOLUME_CALC##BIT(x, vol[matrix[i]]); \ 105 int matrix[SND_CHN_MAX]; member 248 int i, *matrix; in feed_volume_feed() local 263 matrix = info->matrix; in feed_volume_feed() 271 if (vol[matrix[i]] != SND_VOL_FLAT || in feed_volume_feed() 272 muted[matrix[i]] != 0) { in feed_volume_feed() 298 info->apply(temp_vol, matrix, info->channels, dst, j); in feed_volume_feed() 327 * feeder_volume_apply_matrix(): For given matrix map, apply its configuration 328 * to feeder_volume matrix structure. There are [all …]
|
/freebsd/contrib/ofed/opensm/opensm/ |
H A D | osm_sa_multipath_record.c | 1345 osm_sa_item_t *matrix[2][2]; in mpr_rcv_get_apm_paths() local 1389 matrix[0][0] = in mpr_rcv_get_apm_paths() 1393 matrix[0][1] = in mpr_rcv_get_apm_paths() 1397 matrix[1][0] = in mpr_rcv_get_apm_paths() 1401 matrix[1][1] = in mpr_rcv_get_apm_paths() 1406 OSM_LOG(sa->p_log, OSM_LOG_DEBUG, "APM matrix:\n" in mpr_rcv_get_apm_paths() 1409 matrix[0][0] ? matrix[0][0]->resp.mpr_rec.path_rec.slid : 0, in mpr_rcv_get_apm_paths() 1410 matrix[0][0] ? matrix[0][0]->resp.mpr_rec.path_rec.dlid : 0, in mpr_rcv_get_apm_paths() 1411 matrix[0][0] ? matrix[0][0]->resp.mpr_rec.hops : 0, in mpr_rcv_get_apm_paths() 1412 matrix[0][1] ? matrix[0][1]->resp.mpr_rec.path_rec.slid : 0, in mpr_rcv_get_apm_paths() [all …]
|
/freebsd/contrib/file/magic/Magdir/ |
H A D | mathematica | 127 # check for valid imaginary flag of Matlab matrix version 4 129 # check for valid ASCII matrix name 138 # no example for 8-bit and 16-bit integers matrix 141 # branch for Little-Endian variant of Matlab MATrix version 4 146 # no misidentified little endian MATrix example with "short" matrix name 149 # by check for non zero matrix name length 152 # little endian MATrix with "long" matrix name or some misidentified samples 154 # skip TileCacheLogo-*.dat with invalid 2nd character \001 of matrix name with length 96 163 …e header with 5 long integers that contains information describing certain attributes of the Matrix 174 # namlen; the length of the matrix name [all …]
|
/freebsd/sys/contrib/device-tree/Bindings/input/ |
H A D | gpio-matrix-keypad.txt | 1 * GPIO driven matrix keypad device tree bindings 3 GPIO driven matrix keypad is used to interface a SoC with a matrix keypad. 4 The matrix keypad supports multiple row and column lines, a key can be 5 placed at each intersection of a unique row and a unique column. The matrix 10 - compatible: Should be "gpio-matrix-keypad" 18 bindings/input/matrix-keymap.txt 31 matrix-keypad { 32 compatible = "gpio-matrix-keypad";
|
/freebsd/sys/contrib/device-tree/Bindings/iio/ |
H A D | mount-matrix.txt | 5 * should we have HOWTO engineer a correct matrix for a new device (without comparing to a different… 10 Mounting matrix 12 The mounting matrix is a device tree property used to orient any device 16 The purpose of the mounting matrix is to translate the sensor frame of 17 reference into the device frame of reference using a translation matrix as 43 to this world. When using the mounting matrix, the sensor and device orientation 154 To achieve this, use the device tree property "mount-matrix" for the sensor. 156 This supplies a 3x3 rotation matrix in the strict linear algebraic sense, 159 multiplied by this matrix to give the proper vectors values in three-dimensional 165 The mounting matrix has the layout: [all …]
|
/freebsd/crypto/libecc/.github/workflows/ |
H A D | libecc_compilation_tests.yml | 11 matrix: 26 CC: ${{ matrix.cc }} 27 BLINDING: ${{ matrix.blinding }} 28 COMPLETE: ${{ matrix.complete }} 29 LADDER: ${{ matrix.ladder }} 30 CRYPTOFUZZ: ${{ matrix.cryptofuzz }} 31 EXTRA_LIB_CFLAGS: ${{ matrix.optflags }} 32 EXTRA_BIN_CFLAGS: ${{ matrix.optflags }}
|
/freebsd/contrib/libyaml/.github/workflows/ |
H A D | main.yml | 13 runs-on: ${{ matrix.os }} 15 matrix: 29 if [[ '${{ matrix.os }}' == macOS-latest ]]; then 50 run: ${{ matrix.compiler }} --version 52 CC: ${{ matrix.compiler }} 55 CC: ${{ matrix.compiler }} 58 CC: ${{ matrix.compiler }}
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LowerMatrixIntrinsics.cpp | 1 //===- LowerMatrixIntrinsics.cpp - Lower matrix intrinsics -----*- C++ -*-===// 9 // Lower matrix intrinsics to vector operations. 53 #define DEBUG_TYPE "lower-matrix-intrinsics" 56 FuseMatrix("fuse-matrix", cl::init(true), cl::Hidden, 57 cl::desc("Enable/disable fusing matrix instructions.")); 60 "fuse-matrix-tile-size", cl::init(4), cl::Hidden, 62 "Tile size for matrix instruction fusion using square-shaped tiles.")); 63 static cl::opt<bool> TileUseLoops("fuse-matrix-use-loops", cl::init(false), 67 "force-fuse-matrix", cl::init(false), cl::Hidden, 68 cl::desc("Force matrix instruction fusion even if not profitable.")); [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86InterleavedAccess.cpp | 75 /// Performs matrix transposition on a 4x4 matrix \p InputVectors and 319 ArrayRef<Instruction *> Matrix, in interleave8bitStride4VF8() argument 322 // Matrix[0]= c0 c1 c2 c3 c4 ... c7 in interleave8bitStride4VF8() 323 // Matrix[1]= m0 m1 m2 m3 m4 ... m7 in interleave8bitStride4VF8() 324 // Matrix[2]= y0 y1 y2 y3 y4 ... y7 in interleave8bitStride4VF8() 325 // Matrix[3]= k0 k1 k2 k3 k4 ... k7 in interleave8bitStride4VF8() 345 Builder.CreateShuffleVector(Matrix[0], Matrix[1], MaskLow); in interleave8bitStride4VF8() 347 Builder.CreateShuffleVector(Matrix[2], Matrix[3], MaskLow); in interleave8bitStride4VF8() 359 ArrayRef<Instruction *> Matrix, SmallVectorImpl<Value *> &TransposedMatrix, in interleave8bitStride4() argument 362 // Matrix[0]= c0 c1 c2 c3 c4 ... c31 in interleave8bitStride4() [all …]
|
/freebsd/crypto/openssl/crypto/ml_dsa/ |
H A D | ml_dsa_matrix.h | 10 /* A 'k' by 'l' Matrix object ('k' rows and 'l' columns) containing polynomial scalars */ 17 * @brief Initialize a Matrix object. 19 * @param m The matrix object. 26 matrix_init(MATRIX *m, POLY *polys, size_t k, size_t l) in matrix_init() 34 matrix_mult_vector(const MATRIX *a, const VECTOR *s, VECTOR *t) in matrix_mult_vector() 41 MATRIX *out) in matrix_expand_A()
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | LiveRegMatrix.cpp | 40 "Live Register Matrix", false, false) 44 "Live Register Matrix", false, false) in INITIALIZE_PASS_DEPENDENCY() 61 if (NumRegUnits != Matrix.size()) in runOnMachineFunction() 63 Matrix.init(LIUAlloc, NumRegUnits); in runOnMachineFunction() 71 for (unsigned i = 0, e = Matrix.size(); i != e; ++i) { in releaseMemory() 72 Matrix[i].clear(); in releaseMemory() 113 Matrix[Unit].unify(VirtReg, Range); in assign() 130 Matrix[Unit].extract(VirtReg, Range); in unassign() 140 if (!Matrix[Unit].empty()) in isPhysRegUsed() 181 Q.init(UserTag, LR, Matrix[RegUnit]); in query() [all …]
|
/freebsd/crypto/openssl/doc/designs/ |
H A D | ML-KEM.md | 37 Instead of the bulky "A" ("m" in the code) matrix, which represents the majority 39 key, holds a 32-byte seed from which the the matrix is regenerated by the recipient 41 In the OpenSSL implementation, the matrix is *eagerly* evaluated as part of 44 Since the private key includes the public key as one of its components, the matrix 48 possible to save space and compute the matrix elements *just-in-time*, as each 49 matrix element is used exactly once. 50 This is not currently implemented, and the matrix is pre-computed in full. 52 However, the same matrix is used both during key generation and decapsulation 55 If we wanted to do *just-in-time* matrix computation for decapsulation, we'd 57 is known, and to change the algorithm code to generate matrix elements on [all …]
|
/freebsd/crypto/openssl/test/recipes/30-test_evp_data/ |
H A D | evppkey_ml_kem_1024_decap.txt | 2008 # Rho leads to frequent rejection on matrix expansion 2015 # Rho leads to frequent rejection on matrix expansion 2022 # Rho leads to frequent rejection on matrix expansion 2029 # Rho leads to frequent rejection on matrix expansion 2036 # Rho leads to frequent rejection on matrix expansion 2043 # Rho leads to frequent rejection on matrix expansion 2050 # Rho leads to frequent rejection on matrix expansion 2057 # Rho leads to frequent rejection on matrix expansion 2064 # Rho leads to frequent rejection on matrix expansion 2071 # Rho leads to frequent rejection on matrix expansion [all …]
|
H A D | evppkey_ml_kem_768_encap.txt | 1917 # Rho leads to frequent rejection on matrix expansion 1925 # Rho leads to frequent rejection on matrix expansion 1933 # Rho leads to frequent rejection on matrix expansion 1941 # Rho leads to frequent rejection on matrix expansion 1949 # Rho leads to frequent rejection on matrix expansion 1957 # Rho leads to frequent rejection on matrix expansion 1965 # Rho leads to frequent rejection on matrix expansion 1973 # Rho leads to frequent rejection on matrix expansion 1981 # Rho leads to frequent rejection on matrix expansion 1989 # Rho leads to frequent rejection on matrix expansion [all …]
|
H A D | evppkey_ml_kem_768_decap.txt | 2008 # Rho leads to frequent rejection on matrix expansion 2015 # Rho leads to frequent rejection on matrix expansion 2022 # Rho leads to frequent rejection on matrix expansion 2029 # Rho leads to frequent rejection on matrix expansion 2036 # Rho leads to frequent rejection on matrix expansion 2043 # Rho leads to frequent rejection on matrix expansion 2050 # Rho leads to frequent rejection on matrix expansion 2057 # Rho leads to frequent rejection on matrix expansion 2064 # Rho leads to frequent rejection on matrix expansion 2071 # Rho leads to frequent rejection on matrix expansion [all …]
|