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

/freebsd-11-stable/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-stable/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-stable/usr.bin/enigma/
H A Denigma.c34 static void shuffle(char *);
132 shuffle(deck);
143 shuffle(char deckary[]) function
/freebsd-11-stable/contrib/llvm-project/llvm/tools/bugpoint/
H A DFindBugs.cpp44 std::shuffle(PassesToRun.begin(), PassesToRun.end(), randomness);
H A DListReducer.h95 std::shuffle(ShuffledList.begin(), ShuffledList.end(), randomness);
97 // Check that random shuffle doesn't lose the bug
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dquarantine.h59 void shuffle(u32 State) { ::scudo::shuffle(Batch, Count, &State); } function in struct:scudo::QuarantineBatch
283 B->shuffle(Seed);
H A Dcommon.h92 template <typename T> inline void shuffle(T *A, u32 N, u32 *RandState) { function in namespace:scudo
H A Dprimary32.h285 shuffle(PointersArray, Count, &Sci->RandState);
H A Dprimary64.h246 // No need to shuffle the batches size class.
248 shuffle(PointersArray, Count, &Region->RandState);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/MCTargetDesc/
H A DHexagonShuffler.h172 bool shuffle();
H A DHexagonMCShuffler.cpp14 #define DEBUG_TYPE "hexagon-shuffle"
30 DisableShuffle("disable-hexagon-shuffle", cl::Hidden, cl::init(false),
95 if (shuffle()) {
165 // try shuffle with this duplex
174 doneShuffling = MCS.reshuffleTo(MCB); // shuffle
H A DHexagonShuffler.cpp14 #define DEBUG_TYPE "hexagon-shuffle"
620 bool HexagonShuffler::shuffle() { function in class:HexagonShuffler
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonBitTracker.cpp296 auto shuffle = [this] (const BT::RegisterCell &Rs, const BT::RegisterCell &Rt,
775 RegisterCell RC = shuffle(rc(1), rc(2), 8, false);
779 RegisterCell RC = shuffle(rc(1), rc(2), 16, false);
783 RegisterCell RC = shuffle(rc(1), rc(2), 8, true);
787 RegisterCell RC = shuffle(rc(1), rc(2), 16, true);
/freebsd-11-stable/contrib/llvm-project/clang/lib/Headers/
H A Dopencl-c.h13700 * The shuffle and shuffle2 built-in functions construct
13704 * input and length that is the same as the shuffle mask.
13706 * size of each element in the result. For shuffle, only
13715 * by vec_step(gentypem). The shuffle mask operand
13723 * float4 r = shuffle(a, mask);
13734 * b = shuffle(a, mask);
13739 * b = shuffle(a, mask); <- not valid
13741 char2 __ovld __cnfn shuffle(char2 x, uchar2 mask);
13742 char2 __ovld __cnfn shuffle(char4 x, uchar2 mask);
13743 char2 __ovld __cnfn shuffle(char
[all...]
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerMutate.cpp99 std::shuffle(Data + ShuffleStart, Data + ShuffleStart + ShuffleAmount, Rand);
H A DFuzzerDriver.cpp666 Options.ShuffleAtStartUp = Flags.shuffle;
H A DFuzzerLoop.cpp754 std::shuffle(CorporaFiles.begin(), CorporaFiles.end(), MD.GetRand());
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-stress/
H A Dllvm-stress.cpp714 std::shuffle(BoolInst.begin(), BoolInst.end(), R);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSTLExtras.h1062 std::shuffle(Start, End, Generator);
1111 // Provide wrappers to std::sort which shuffle the elements before sorting
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSROA.cpp120 static cl::opt<bool> SROARandomShuffleSlices("sroa-random-shuffle-slices",
1076 std::shuffle(Slices.begin(), Slices.end(), MT);
2203 LLVM_DEBUG(dbgs() << " shuffle: " << *V << "\n");
2230 // use a shuffle vector to widen it with undef elements, and then
2231 // a second shuffle vector to select between the loaded vector and the
2242 LLVM_DEBUG(dbgs() << " shuffle: " << *V << "\n");
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64ISelLowering.cpp6537 // shuffle in combination with VEXTs.
6552 // be compatible with the shuffle we intend to construct. As a result
6579 "a shuffle can only come from building a vector from "
6619 // to construct a compatible shuffle either by concatenating it with UNDEF or
6636 // shuffle...
6681 // for the shuffle.
6692 // Final sanity check before we try to actually produce a shuffle.
6697 // The stars all align, our next step is to produce the mask for the shuffle.
6716 // This source is expected to fill ResMultiplier lanes of the final shuffle,
6728 LLVM_DEBUG(dbgs() << "Reshuffle failed: illegal shuffle mas
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMISelLowering.cpp6678 // check if an VEXT instruction can handle the shuffle mask when the
6679 // vector sources of the shuffle are the same.
6683 // Assume that the first shuffle index is not UNDEF. Fail if it is.
6689 // If this is a VEXT shuffle, the immediate value is the index of the first
6690 // element. The other shuffle indices must be the successive elements after
6713 // Assume that the first shuffle index is not UNDEF. Fail if it is.
6719 // If this is a VEXT shuffle, the immediate value is the index of the first
6720 // element. The other shuffle indices must be the successive elements after
6744 /// isVREVMask - Check if a vector shuffle corresponds to a VREV
6757 // If the first shuffle inde
7327 SDValue shuffle = ReconstructShuffle(Op, DAG); local
[all...]

Completed in 371 milliseconds