HomeSort by relevance Sort by last modified time
    Searched refs:Mutator (Results 1 - 19 of 19) sorted by null

  /art/test/068-classloader/src-ex/
Mutator.java 18 * Simple mutator to change a static field of the mutator target. This will require a dex-cache
21 public class Mutator {
  /bionic/libc/private/
WriteProtected.h 72 template <typename Mutator>
73 void mutate(Mutator mutator) {
78 mutator(&contents.value);
  /frameworks/av/media/libmedia/include/media/
SingleStateQueue.h 32 class Mutator;
44 friend class Mutator;
55 class Mutator {
57 Mutator(Shared *shared)
60 // exactly one of Mutator and Observer must initialize, currently it is Observer
112 // exactly one of Mutator and Observer must initialize, currently it is Observer
149 // (optional) used to indicate to the Mutator that the state that has been polled
  /prebuilts/clang/host/linux-x86/clang-3859424/prebuilt_include/llvm/lib/Fuzzer/
FuzzerMutate.h 31 /// Mutates data by invoking user-provided mutator.
96 struct Mutator {
104 const std::vector<Mutator> &Mutators);
129 std::vector<Mutator> CurrentMutatorSequence;
139 std::vector<Mutator> Mutators;
140 std::vector<Mutator> DefaultMutators;
  /frameworks/av/media/libnbaio/include/
MonoPipe.h 99 ExtendedTimestampSingleStateQueue::Mutator mTimestampMutator;
  /frameworks/av/include/private/media/
AudioTrackShared.h 402 PlaybackRateQueue::Mutator mPlaybackRateMutator;
446 StaticAudioTrackSingleStateQueue::Mutator mMutator;
544 ExtendedTimestampQueue::Mutator mTimestampMutator;
636 StaticAudioTrackPosLoopQueue::Mutator mPosLoopMutator;
  /external/llvm/lib/Fuzzer/
FuzzerInternal.h 250 /// Mutates data by invoking user-provided mutator.
306 struct Mutator {
314 const std::vector<Mutator> &Mutators);
327 std::vector<Mutator> CurrentMutatorSequence;
332 std::vector<Mutator> Mutators;
333 std::vector<Mutator> DefaultMutators;
FuzzerMutate.cpp 284 const std::vector<Mutator> &Mutators) {
  /external/llvm/lib/Fuzzer/test/
FuzzerUnittest.cpp 88 typedef size_t (MutationDispatcher::*Mutator)(uint8_t *Data, size_t Size,
91 void TestEraseByte(Mutator M, int NumIter) {
127 void TestInsertByte(Mutator M, int NumIter) {
163 void TestChangeByte(Mutator M, int NumIter) {
199 void TestChangeBit(Mutator M, int NumIter) {
235 void TestShuffleBytes(Mutator M, int NumIter) {
265 void TestAddWordFromDictionary(Mutator M, int NumIter) {
307 void TestAddWordFromDictionaryWithHint(Mutator M, int NumIter) {
336 void TestChangeASCIIInteger(Mutator M, int NumIter) {
  /build/soong/android/
mutator.go 23 // Mutator phases:
31 var registeredMutators []*mutator
33 func registerMutatorsToContext(ctx *blueprint.Context, mutators []*mutator) {
90 mutators []*mutator
148 mutator := &mutator{name: name, bottomUpMutator: f}
149 x.mutators = append(x.mutators, mutator)
150 return mutator
163 mutator := &mutator{name: name, topDownMutator: f
    [all...]
  /external/protobuf/csharp/src/Google.Protobuf/Reflection/
IFieldAccessor.cs 62 /// Mutator for single "simple" fields only.
  /build/blueprint/
module_ctx.go 33 // A Module can be split into multiple Modules by a Mutator. All existing
35 // modified as necessary by the Mutator.
91 // initial blueprint parsing. To change the name later a mutator must call
554 // A Mutator function is called for each Module, and can use
560 // The Mutator function should only modify members of properties structs, and not
562 // if a second Mutator chooses to split the module a second time.
568 // used to transfer information on a dependency between the mutator that called AddDependency
592 // when the Mutator is later called on it, the dependency of the depending module will
624 panic("module already has variations from this mutator")
646 // Does not affect the ordering of the current mutator pass, but will be ordere
    [all...]
context.go 79 depsModified uint32 // positive if a mutator modified the dependencies
211 // Mutator is the axis on which this variation applies, i.e. "arch" or "link"
212 Mutator string
218 // A variationMap stores a map of Mutator to Variation to specify a variant of a module.
291 // generation for the module. If a Mutator splits a module into multiple variants,
398 // RegisterTopDownMutator registers a mutator that will be invoked to propagate dependency info
399 // top-down between Modules. Each registered mutator is invoked in registration order (mixing
403 // The mutator type names given here must be unique to all top down mutators in
406 // Returns a MutatorHandle, on which Parallel can be called to set the mutator to visit modules in
408 func (c *Context) RegisterTopDownMutator(name string, mutator TopDownMutator) MutatorHandle
    [all...]
  /prebuilts/go/darwin-x86/src/runtime/
mstkbar.go 28 // mutator to record stack unwinding and the trampoline is only a few
64 // 1) Mutator writes below the lowest un-hit stack barrier. This
70 // 2) Mutator writes above the lowest un-hit stack barrier. It's
71 // possible for a mutator to modify the stack above the lowest un-hit
mbarrier.go 43 // The two shades and the condition work together to prevent a mutator
46 // 1. shade(*slot) prevents a mutator from hiding an object by moving
50 // 2. shade(ptr) prevents a mutator from hiding an object by moving
73 // the slot doesn't concurrently change color without the mutator
76 // Consider the following example where the mutator writes into
82 // Mutator thread GC thread
92 // barriers, which will slow down both the mutator and the GC, we always grey
97 // heap. On relaxed memory machines, it's possible for a mutator to
102 // mark the object, even though it's reachable. However, the mutator
mgc.go 7 // The GC runs concurrently with mutator threads, is type accurate (aka precise), allows multiple
35 // (from _GCoff), enabling the write barrier, enabling mutator
250 // gcBlackenEnabled is 1 if mutator assists and background mark
287 // is mutator assists, which happen in response to allocations and are
323 // work to do in mutator assists and background marking.
350 // the background scan and stolen by mutator assists. This is
355 // assistTime is the nanoseconds spent in mutator assists
388 // bytes that should be performed by mutator assists. This is
521 // mutator utilization, heap size, or assist time and it
523 // mutator outpace the garbage collector
    [all...]
  /prebuilts/go/linux-x86/src/runtime/
mstkbar.go 28 // mutator to record stack unwinding and the trampoline is only a few
64 // 1) Mutator writes below the lowest un-hit stack barrier. This
70 // 2) Mutator writes above the lowest un-hit stack barrier. It's
71 // possible for a mutator to modify the stack above the lowest un-hit
mbarrier.go 43 // The two shades and the condition work together to prevent a mutator
46 // 1. shade(*slot) prevents a mutator from hiding an object by moving
50 // 2. shade(ptr) prevents a mutator from hiding an object by moving
73 // the slot doesn't concurrently change color without the mutator
76 // Consider the following example where the mutator writes into
82 // Mutator thread GC thread
92 // barriers, which will slow down both the mutator and the GC, we always grey
97 // heap. On relaxed memory machines, it's possible for a mutator to
102 // mark the object, even though it's reachable. However, the mutator
mgc.go 7 // The GC runs concurrently with mutator threads, is type accurate (aka precise), allows multiple
35 // (from _GCoff), enabling the write barrier, enabling mutator
250 // gcBlackenEnabled is 1 if mutator assists and background mark
287 // is mutator assists, which happen in response to allocations and are
323 // work to do in mutator assists and background marking.
350 // the background scan and stolen by mutator assists. This is
355 // assistTime is the nanoseconds spent in mutator assists
388 // bytes that should be performed by mutator assists. This is
521 // mutator utilization, heap size, or assist time and it
523 // mutator outpace the garbage collector
    [all...]

Completed in 2130 milliseconds