Home
last modified time | relevance | path

Searched full:combine (Results 1 – 25 of 667) sorted by relevance

12345678910>>...27

/freebsd/lib/libpmc/
H A Dpmc.sandybridgeuc.3114 Must combine with one of the umask values of 20H, 40H, 80H
117 Must combine with one of the umask values of 20H, 40H, 80H
120 Must combine with one of the umask values of 20H, 40H, 80H
128 Must combine with at least one of 01H, 02H, 04H, 08H, 10H
132 Must combine with at least one of 01H, 02H, 04H, 08H, 10H
136 Must combine with at least one of 01H, 02H, 04H, 08H, 10H
140 Must combine with one of the umask values of 10H, 20H, 40H, 80H
144 Must combine with one of the umask values of 10H, 20H, 40H, 80H
148 Must combine with one of the umask values of 10H, 20H, 40H, 80H
152 Must combine with one of the umask values of 10H, 20H, 40H, 80H
[all …]
H A Dpmc.sandybridge.3454 Can combine Umask 04H and 20H
460 Can combine Umask 08H and 10H
466 Can combine Umask 08H and 10H
471 Can combine Umask 04H and 20H
476 Can combine Umask 04H, 08H and 30H
790 Combine with umask 10H, 20H, 40H, 80H.
794 Combine with umask 10H, 20H, 40H, 80H.
798 Must combine with umask 01H, 02H, to produce counts.
802 Must combine with umask 01H, 02H, to produce counts.
806 Must combine with umask 01H, 02H, to produce counts.
[all …]
H A Dpmc.haswelluc.3156 Must combine with at least one of 01H, 02H, 04H, 08H.
160 Must combine with at least one of 01H, 02H, 04H, 08H.
164 Must combine with at least one of 01H, 02H, 04H, 08H.
169 Must combine with at least one of 01H, 02H, 04H, 08H.
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonCopyToCombine.cpp1 //===------- HexagonCopyToCombine.cpp - Hexagon Copy-To-Combine Pass ------===//
8 // This pass replaces transfer instructions by combine instructions.
11 // replace them with a combine instruction.
34 #define DEBUG_TYPE "hexagon-copy-combine"
78 return "Hexagon Copy-To-Combine Pass"; in getPassName()
94 void combine(MachineInstr &I1, MachineInstr &I2,
122 INITIALIZE_PASS(HexagonCopyToCombine, "hexagon-copy-combine",
123 "Hexagon Copy-To-Combine Pass", false, false)
149 // workaround for an ABI bug that prevents GOT relocations on combine in isCombinableInstType()
154 // Only combine constant extended A2_tfrsi if we are in aggressive mode. in isCombinableInstType()
[all …]
/freebsd/lib/libc/quad/
H A Dqdivrem.c45 /* Combine two `digits' to make a single two-digit number. */
46 #define COMBINE(a, b) (((u_long)(a) << HALF_BITS) | (b)) macro
148 rbj = COMBINE(u[1] % t, u[2]); in __qdivrem()
150 rbj = COMBINE(rbj % t, u[3]); in __qdivrem()
152 rbj = COMBINE(rbj % t, u[4]); in __qdivrem()
156 tmp.ul[H] = COMBINE(q1, q2); in __qdivrem()
157 tmp.ul[L] = COMBINE(q3, q4); in __qdivrem()
211 u_long n = COMBINE(uj0, uj1); in __qdivrem()
215 while (v2 * qhat > COMBINE(rhat, uj2)) { in __qdivrem()
264 tmp.ul[H] = COMBINE(uspace[1], uspace[2]); in __qdivrem()
[all …]
/freebsd/sys/libkern/
H A Dqdivrem.c46 /* Combine two `digits' to make a single two-digit number. */
47 #define COMBINE(a, b) (((u_long)(a) << HALF_BITS) | (b)) macro
149 rbj = COMBINE(u[1] % t, u[2]); in __qdivrem()
151 rbj = COMBINE(rbj % t, u[3]); in __qdivrem()
153 rbj = COMBINE(rbj % t, u[4]); in __qdivrem()
157 tmp.ul[H] = COMBINE(q1, q2); in __qdivrem()
158 tmp.ul[L] = COMBINE(q3, q4); in __qdivrem()
212 u_long nn = COMBINE(uj0, uj1); in __qdivrem()
216 while (v2 * qhat > COMBINE(rhat, uj2)) { in __qdivrem()
265 tmp.ul[H] = COMBINE(uspace[1], uspace[2]); in __qdivrem()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DCombinerHelper.h9 /// This contains common combine transformations that may be used in a combine
95 /// Describes instructions to be built during a combine.
138 /// \return true if the combine is running prior to legalization, or if \p
142 /// \return true if the combine is running prior to legalization, or if \p Ty
170 /// If \p MI is COPY, try to combine it.
188 /// If \p MI is extend that consumes the result of a load, try to combine it.
197 /// Combine a G_EXTRACT_VECTOR_ELT of a load into a narrowed
211 /// Try to combine G_[SU]DIV and G_[SU]REM into a single G_[SU]DIVREM
221 /// If \p MI is G_CONCAT_VECTORS, try to combine it.
245 /// Try to combine G_SHUFFLE_VECTOR into G_CONCAT_VECTORS.
[all …]
H A DLegalizationArtifactCombiner.h73 LLVM_DEBUG(dbgs() << ".. Combine MI: " << MI;); in tryCombineAnyExt()
139 LLVM_DEBUG(dbgs() << ".. Combine MI: " << MI;); in tryCombineZExt()
150 // combine, but in this very common case, eliding early and regardless of in tryCombineZExt()
168 LLVM_DEBUG(dbgs() << ".. Combine MI: " << MI); in tryCombineZExt()
210 LLVM_DEBUG(dbgs() << ".. Combine MI: " << MI;); in tryCombineSExt()
234 LLVM_DEBUG(dbgs() << ".. Combine MI: " << MI); in tryCombineSExt()
334 // Unable to combine in tryCombineTrunc()
345 // Always combine trunc(trunc) since the eventual resulting trunc must be in tryCombineTrunc()
348 LLVM_DEBUG(dbgs() << ".. Combine G_TRUNC(G_TRUNC): " << MI); in tryCombineTrunc()
362 LLVM_DEBUG(dbgs() << ".. Combine G_TRUNC(G_[S,Z,ANY]EXT/G_TRUNC...): " in tryCombineTrunc()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/hexagon/
H A Ddfaddsub.S81 ATMP = combine(##0x20000000,#0)
93 if (BIGB) EXPB_A = combine(EXPA,EXPB) // swap exponents
99 ZTMP = combine(#62,#1)
133 ZTMP = combine(#54,##2045)
204 B = combine(##0x00100000,#0)
232 ATMP = combine(##0x7fefffff,#-1) // positive max finite
237 BTMP = combine(##0x7ff00000,#0) // positive infinity
289 ATMP = combine(##0x20000000,#0)
303 ZTMP = combine(#62,#1)
H A Ddffma.S133 CTMP = combine(PP_ODD_H,#0)
134 PP_ODD = combine(#0,PP_LL_H)
152 PP_HH = combine(#0,PP_ODD_H)
157 PP_LL = combine(PP_ODD_L,PP_LL_L)
196 if (SWAP.new) EXPCA = combine(EXPA,EXPC)
241 if (P_TMP) CTMP = combine(TMP,TMP) // sign extension of pre-shift-right-64
470 CTMP = combine(##0x7fefffff,#-1)
474 ATMP = combine(##0x7ff00000,#0)
565 ATMP = combine(##0x00100000,#0)
H A Ddfdiv.S81 EXPBA = combine(BH,AH)
293 TMPPAIR = combine(##0x00100000,#0) // min normal
328 B = combine(##0x7fefffff,#-1)
332 PROD = combine(##0x7ff00000,#0)
402 EXPBA = combine(BH,AH)
460 B = combine(##0x7ff00000,#0)
H A Dudivsi3.S26 r5:4 = combine(#1,#0)
32 r1:0 = combine(r0,r4)
/freebsd/contrib/ntp/html/
H A Dprefer.html21 <li class="inline"><a href="#combine">2. Combine Algorithm</a></li>
34 <h4 id="combine">2. Combine Algorithm</h4>
35 <p> The clock combine algorithm uses the survivor list to produce a weighted average of both offset…
36 <p> The clock combine algorithm uses a weight factor for each survivor equal to the reciprocal of t…
40 <p>The anti-clockhop algorithm is called immediately after the combine algorithm. If there was no o…
53 <p>Ordinarily, the combine algorithm computes a weighted average of the survivor
55 peer is among the survivors, the combine algorithm is not used. Instead,
75 …tter are inherited by the corresponding system variables. Otherwise, the combine algorithm compute…
/freebsd/contrib/googletest/googletest/samples/
H A Dsample8_unittest.cc31 // Combine() helps with generating all possible combinations of such flags,
83 using ::testing::Combine;
145 // Here, we instantiate our tests with a list of parameters. We must combine
149 // PrecalcPrimeTable instance and some inside it (10). Combine will produce all
152 Combine(Bool(), Values(1, 10)));
/freebsd/contrib/kyua/utils/config/
H A Dnodes.cpp96 /// \param [in,out] node The node to combine into.
121 new_node.reset((*iter1).second->combine(child_key, in combine_children_into()
136 /// \param other_base The node to combine with.
137 /// \param [in,out] node The node to combine into.
308 /// \param other The node to combine with.
314 config::detail::static_inner_node::combine(const tree_key& key, in combine() function in config::detail::static_inner_node
389 /// \param other The node to combine with.
395 config::detail::dynamic_inner_node::combine(const tree_key& key, in combine() function in config::detail::dynamic_inner_node
413 /// \param other_base The node to combine with.
419 config::leaf_node::combine(const detail::tree_key& key, in combine() function in config::leaf_node
/freebsd/contrib/googletest/googletest/include/gtest/
H A Dgtest-param-test.h88 // Combine(g1, g2, ..., gN) - Yields all combinations (the Cartesian product
347 // Combine() function.
361 // Combine() allows the user to combine two or more sequences to produce
365 // Combine(gen1, gen2, ..., genN)
385 // Combine(Values("cat", "dog"),
403 // Combine(Bool(), Bool()));
406 internal::CartesianProductHolder<Generator...> Combine(const Generator&... g) { in Combine() function
418 // It is useful when using the Combine() function to get the generated
441 // Combine(Values("cat", "dog"),
/freebsd/contrib/googletest/googletest/test/
H A Dgoogletest-param-test-test.cc54 using ::testing::Combine;
403 // Tests that Combine() with two parameters generates the expected sequence.
408 Combine(Values(foo, bar), Values(3, 4)); in TEST()
416 // Tests that Combine() with three parameters generates the expected sequence.
419 Combine(Values(0, 1), Values(3, 4), Values(5, 6)); in TEST()
428 // Tests that the Combine() with the first parameter generating a single value
433 Combine(Values(42), Values(0, 1)); in TEST()
440 // Tests that the Combine() with the second parameter generating a single value
445 Combine(Values(0, 1), Values(42)); in TEST()
453 // Combine() produces an empty sequence, too.
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUImageIntrinsicOptimizer.cpp9 // This pass tries to combine multiple image_load intrinsics with dim=2dmsaa
15 // vaddr/vdata dword transfers is reduced by the combine.
20 // | popcount | a16 | d16 | #load | vaddr / | #msaa_load | vaddr / | combine? |
41 // This pass will combine intrinsics such as (not neccessarily consecutive):
53 // - We may occasionally not want to do the combine if it increases the maximum
59 // combine only applies to gfx11, due to a limitation in gfx10: the gfx10
146 // Don't combine if there is a store in the middle or if there is a memory in collectMergeableInsts()
H A DAMDGPUCombinerHelper.h10 /// This contains common combine transformations that may be used in a combine
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsCombine.td1 //=- MipsCombine.td - Define Mips Combine Rules --------------*- tablegen -*-=//
9 include "llvm/Target/GlobalISel/Combine.td"
H A DMipsPreLegalizerCombiner.cpp69 // Don't attempt to combine non power of 2 loads or unaligned loads when in tryCombineAll()
137 "Combine Mips machine instrs before legalization", false,
142 "Combine Mips machine instrs before legalization", false,
/freebsd/sys/dev/sfxge/common/
H A Dsiena_flash.h204 efx_dword_t off1; /* offset of first byte to edit to combine images */
205 efx_dword_t off2; /* offset of second byte to edit to combine images */
214 efx_dword_t off1; /* offset of first byte to edit to combine images */
215 efx_dword_t off2; /* offset of second byte to edit to combine images */
/freebsd/crypto/openssl/Configurations/
H A D10-main.conf511 CFLAGS => combine(picker(debug => "-O0 -g",
616 cflags => combine("-mlp64", threads("-pthread")),
694 cxxflags => combine("-std=c++11", threads("-pthread")),
993 cppflags => combine("-DOPENSSL_SMALL_FOOTPRINT",
1144 cflags => combine("-Kalloca", threads("-Kthread")),
1237 cflags => combine("-maix64", threads("-pthread")),
1256 cflags => combine("-q32 -qmaxmem=16384 -qro -qroconst",
1275 …cflags => combine("-Wno-implicit-function-declaration -mcmodel=large -DBROKEN_CLANG_ATOM…
1291 cflags => combine("-q64 -qmaxmem=16384 -qro -qroconst",
1309 cflags => combine("-maix64 -Wno-implicit-function-declaration -mcmodel=large",
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DHashing.h328 /// A type trait which is true if we want to combine values for hashing by
495 /// This sets up the state for a recursive hash combine, including getting
500 /// Combine one chunk of data into the current in-flight hash.
511 // with the variadic combine because that formation can have varying
546 hash_code combine(size_t length, char *buffer_ptr, char *buffer_end,
551 return combine(length, buffer_ptr, buffer_end, args...);
559 hash_code combine(size_t length, char *buffer_ptr, char *buffer_end) {
582 /// Combine values into a single hash_code.
585 /// attempt to combine them into a single hash_code. For user-defined types it
596 return helper.combine(0, helper.buffer, helper.buffer + 64, args...);
/freebsd/crypto/heimdal/doc/doxyout/krb5/man/man3/
H A Dkrb5_crypto.3214 \fIcrypto1\fP first key to combine
216 \fIcrypto2\fP second key to combine
218 \fIpepper1\fP factor to combine with first key to garante uniqueness
220 \fIpepper2\fP factor to combine with second key to garante uniqueness

12345678910>>...27