Searched refs:shuffle (Results 1 - 10 of 10) sorted by relevance

/freebsd-11.0-release/sys/geom/bde/
H A Dg_bde_lock.c101 * I have not worked out the statistical properties of this shuffle, but
106 * We include (and shuffle) an extra hash field in the stored version for
120 * The chosen shuffle algorithm only works as long as we have no more than 16
149 int shuffle[NLOCK_FIELDS]; local
156 g_bde_shuffle_lock(sha2, shuffle);
158 switch(shuffle[i]) {
183 le64enc(p, gl->lsector[shuffle[i] - 5]);
219 int shuffle[NLOCK_FIELDS]; local
226 g_bde_shuffle_lock(sc->sha2, shuffle);
228 switch(shuffle[
[all...]
/freebsd-11.0-release/contrib/binutils/bfd/
H A Decofflink.c347 struct shuffle
350 struct shuffle *next;
378 /* Linked lists describing how to shuffle the input debug
381 struct shuffle *line;
382 struct shuffle *line_end;
383 struct shuffle *pdr;
384 struct shuffle *pdr_end;
385 struct shuffle *sym;
386 struct shuffle *sym_end;
387 struct shuffle *op
344 struct shuffle struct
[all...]
/freebsd-11.0-release/usr.bin/enigma/
H A Denigma.c34 static void shuffle(char *);
132 shuffle(deck);
143 shuffle(char deckary[]) function
/freebsd-11.0-release/contrib/llvm/lib/Target/Hexagon/MCTargetDesc/
H A DHexagonShuffler.h173 bool shuffle();
H A DHexagonMCShuffler.cpp15 #define DEBUG_TYPE "hexagon-shuffle"
28 DisableShuffle("disable-hexagon-shuffle", cl::Hidden, cl::init(false),
92 if (shuffle()) {
186 // try shuffle with this duplex
196 doneShuffling = MCS.reshuffleTo(MCB); // shuffle
H A DHexagonShuffler.cpp15 #define DEBUG_TYPE "hexagon-shuffle"
419 bool HexagonShuffler::shuffle() {
/freebsd-11.0-release/contrib/llvm/lib/Target/Hexagon/
H A DHexagonBitTracker.cpp223 auto shuffle = [this] (const BT::RegisterCell &Rs, const BT::RegisterCell &Rt, member in class:__anon2834::RegisterRefs
699 RegisterCell RC = shuffle(rc(1), rc(2), 8, false);
703 RegisterCell RC = shuffle(rc(1), rc(2), 16, false);
707 RegisterCell RC = shuffle(rc(1), rc(2), 8, true);
711 RegisterCell RC = shuffle(rc(1), rc(2), 16, true);
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DSROA.cpp81 static cl::opt<bool> SROARandomShuffleSlices("sroa-random-shuffle-slices",
1021 std::shuffle(Slices.begin(), Slices.end(), MT);
2104 DEBUG(dbgs() << " shuffle: " << *V << "\n");
2131 // use a shuffle vector to widen it with undef elements, and then
2132 // a second shuffle vector to select between the loaded vector and the
2143 DEBUG(dbgs() << " shuffle: " << *V << "\n");
/freebsd-11.0-release/contrib/llvm/lib/Target/ARM/
H A DARMISelLowering.cpp5053 // check if an VEXT instruction can handle the shuffle mask when the
5054 // vector sources of the shuffle are the same.
5058 // Assume that the first shuffle index is not UNDEF. Fail if it is.
5064 // If this is a VEXT shuffle, the immediate value is the index of the first
5065 // element. The other shuffle indices must be the successive elements after
5089 // Assume that the first shuffle index is not UNDEF. Fail if it is.
5095 // If this is a VEXT shuffle, the immediate value is the index of the first
5096 // element. The other shuffle indices must be the successive elements after
5120 /// isVREVMask - Check if a vector shuffle corresponds to a VREV
5133 // If the first shuffle inde
5608 SDValue shuffle = ReconstructShuffle(Op, DAG); local
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Target/AArch64/
H A DAArch64ISelLowering.cpp4831 // shuffle in combination with VEXTs.
4845 // be compatible with the shuffle we intend to construct. As a result
4868 // A shuffle can only come from building a vector from various
4905 // to construct a compatible shuffle either by concatenating it with UNDEF or
4922 // shuffle...
4966 // for the shuffle.
4977 // Final sanity check before we try to actually produce a shuffle.
4983 // The stars all align, our next step is to produce the mask for the shuffle.
5002 // This source is expected to fill ResMultiplier lanes of the final shuffle,
5025 // check if an EXT instruction can handle the shuffle mas
[all...]

Completed in 147 milliseconds