/freebsd-11-stable/sys/dev/sound/pcm/ |
H A D | ac97.c | 65 struct ac97mixtable_entry mix[AC97_MIXER_SIZE]; member in struct:ac97_info 423 struct ac97mixtable_entry *e = &codec->mix[channel]; 439 struct ac97mixtable_entry *e = &codec->mix[channel]; 540 codec->mix[SOUND_MIXER_OGAIN].reg = AC97_MIXEXT_SURROUND; 545 bzero(&codec->mix[SOUND_MIXER_OGAIN], 546 sizeof(codec->mix[SOUND_MIXER_OGAIN])); 572 bzero(&codec->mix[SOUND_MIXER_BASS], 573 sizeof(codec->mix[SOUND_MIXER_BASS])); 574 bzero(&codec->mix[SOUND_MIXER_TREBLE], 575 sizeof(codec->mix[SOUND_MIXER_TREBL [all...] |
H A D | feeder_mixer.c | 94 feed_mixer_t mix; member in struct:feed_mixer_info 306 * list of children and calling mixer function to mix count bytes from 331 if (info->mix == NULL) { 373 info->mix(tmp, b, cnt);
|
/freebsd-11-stable/sys/libkern/ |
H A D | jenkins_hash.c | 14 hashword(), hashlittle(), hashlittle2(), hashbig(), mix(), and final() 28 mix(a,b,c); 30 mix(a,b,c); 36 a mix of things, see the comments above hashlittle(). 39 then mix those integers. This is fast (you can do a lot more thorough 49 mix -- mix 3 32-bit values reversibly. 51 This is reversible, so any information in (a,b,c) before mix() is 52 still in (a,b,c) after mix(). 54 If four pairs of (a,b,c) inputs are run through mix(), o 91 #define mix macro [all...] |
/freebsd-11-stable/contrib/unbound/util/storage/ |
H A D | lookup3.c | 19 hashword(), hashlittle(), hashlittle2(), hashbig(), mix(), and final() 33 mix(a,b,c); 35 mix(a,b,c); 41 a mix of things, see the comments above hashlittle(). 44 then mix those integers. This is fast (you can do a lot more thorough 117 mix -- mix 3 32-bit values reversibly. 119 This is reversible, so any information in (a,b,c) before mix() is 120 still in (a,b,c) after mix(). 122 If four pairs of (a,b,c) inputs are run through mix(), o 159 #define mix macro [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | Hashing.h | 264 /// This effectively performs the initial mix. 270 state.mix(s); 287 /// We mix all 64 bytes even when the chunk length is smaller, but we 289 void mix(const char *s) { function in struct:llvm::hashing::detail::hash_state 424 // a mix of the last 64-bytes. That is how the algorithm works when we 429 state.mix(buffer); 458 state.mix(s_begin); 462 state.mix(s_end - 64); 524 // either initialize the hash state (on the first full buffer) or mix 532 state.mix(buffe [all...] |
/freebsd-11-stable/sys/netpfil/pf/ |
H A D | pf_lb.c | 67 #define mix(a,b,c) \ macro 94 mix(a, b, c); 102 mix(a, b, c); 107 mix(a, b, c); 112 mix(a, b, c); 117 mix(a, b, c);
|
/freebsd-11-stable/contrib/gcclibs/libiberty/ |
H A D | hashtab.c | 821 hash(), hash2(), hash3, and mix() are externally useful functions. 829 mix -- mix 3 32-bit values reversibly. 833 * If mix() is run forward or backward, at least 32 bits in a,b,c 835 * If mix() is run forward, every bit of c will change between 1/3 and 837 mix() was built out of 36 single-cycle latency instructions in a 854 #define mix(a,b,c) \ macro 920 mix(a,b,c); 930 mix(a,b,c); 952 mix( [all...] |
/freebsd-11-stable/contrib/binutils/libiberty/ |
H A D | hashtab.c | 821 hash(), hash2(), hash3, and mix() are externally useful functions. 829 mix -- mix 3 32-bit values reversibly. 833 * If mix() is run forward or backward, at least 32 bits in a,b,c 835 * If mix() is run forward, every bit of c will change between 1/3 and 837 mix() was built out of 36 single-cycle latency instructions in a 854 #define mix(a,b,c) \ macro 920 mix(a,b,c); 930 mix(a,b,c); 952 mix( [all...] |
/freebsd-11-stable/sys/contrib/octeon-sdk/ |
H A D | cvmx-helper-board.c | 158 int mix; local 161 sprintf(name_buffer, "mix%d", interface_index); 163 snprintf(name_buffer, sizeof(name_buffer), "mix%d", interface_index); 168 cvmx_dprintf("ERROR: mix%d path not found in device tree\n",interface_index); 170 mix = fdt_path_offset(fdt_addr, mix_path); 171 if (mix < 0) 176 return mix;
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_client/ |
H A D | copy.c | 3042 _("Cannot mix repository and working copy sources"));
|
/freebsd-11-stable/contrib/tcsh/ |
H A D | sh.hist.c | 168 #define mix(a,b,c) \ macro 215 mix(a, b, c); 227 mix(a, b, c); 246 mix(a, b, c); 258 mix(h->a, h->b, h->c);
|
/freebsd-11-stable/sys/dev/netmap/ |
H A D | netmap_vale.c | 697 #define mix(a, b, c) \ macro 723 mix(a, b, c); 728 #undef mix macro
|
/freebsd-11-stable/sys/net80211/ |
H A D | ieee80211.c | 2040 #define mix(a, b, c) \ macro 2066 mix(a, b, c); 2070 #undef mix macro
|
/freebsd-11-stable/sys/net/ |
H A D | if_bridge.c | 2899 #define mix(a, b, c) \ macro 2924 mix(a, b, c); 2929 #undef mix macro
|
H A D | if_vxlan.c | 2808 #define mix(a, b, c) \ macro 2821 mix(a, b, c); 2823 #undef mix macro
|
/freebsd-11-stable/contrib/gcc/ |
H A D | tree.c | 3320 #define mix(a,b,c) \ 3341 mix (a, val, val2); 3358 mix (a, b, val2); 3376 mix (a, b, val2); 3381 mix (a, b, val2); 3299 #define mix macro
|
/freebsd-11-stable/sys/dev/nxge/xgehal/ |
H A D | xgehal-device.c | 49 * mix(a,b,c) used in Jenkins hash algorithm 51 #define mix(a,b,c) { \ macro 6004 mix(a,b,c); 6038 mix(a,b,c);
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Headers/ |
H A D | opencl-c.h | 10256 float __ovld __cnfn mix(float x, float y, float a); 10257 float2 __ovld __cnfn mix(float2 x, float2 y, float2 a); 10258 float3 __ovld __cnfn mix(float3 x, float3 y, float3 a); 10259 float4 __ovld __cnfn mix(float4 x, float4 y, float4 a); 10260 float8 __ovld __cnfn mix(float8 x, float8 y, float8 a); 10261 float16 __ovld __cnfn mix(float16 x, float16 y, float16 a); 10262 float2 __ovld __cnfn mix(float2 x, float2 y, float a); 10263 float3 __ovld __cnfn mix(float3 x, float3 y, float a); 10264 float4 __ovld __cnfn mix(float4 x, float4 y, float a); 10265 float8 __ovld __cnfn mix(float [all...] |