| /external/iptables/extensions/ |
| libxt_CONNSECMARK.man | 12 If the packet has a security marking, copy it to the connection
16 If the packet does not have a security marking, and the connection
17 does, copy the security marking from the connection to the packet.
|
| /external/mockito/src/org/mockito/internal/progress/ |
| IOngoingStubbing.java | 9 * Marking interface to be removed when DeprecatedOngoingStubbing gets deleted
|
| /external/chromium_org/v8/src/ |
| incremental-marking-inl.h | 31 #include "incremental-marking.h"
41 MarkBit value_bit = Marking::MarkBitFrom(value_heap_obj);
42 if (Marking::IsWhite(value_bit)) {
43 MarkBit obj_bit = Marking::MarkBitFrom(obj);
44 if (Marking::IsBlack(obj_bit)) {
63 MarkBit obj_bit = Marking::MarkBitFrom(obj);
64 return Marking::IsBlack(obj_bit);
95 MarkBit obj_bit = Marking::MarkBitFrom(obj);
96 if (Marking::IsBlack(obj_bit)) {
110 ASSERT(Marking::MarkBitFrom(obj) == mark_bit)
[all...] |
| incremental-marking.cc | 30 #include "incremental-marking.h"
71 MarkBit obj_bit = Marking::MarkBitFrom(obj);
72 if (Marking::IsBlack(obj_bit)) {
85 IncrementalMarking* marking = isolate->heap()->incremental_marking(); local
86 ASSERT(!marking->is_compacting_);
91 marking->write_barriers_invoked_since_last_step_ +=
98 marking->RecordWrite(obj, slot, *slot);
106 IncrementalMarking* marking = isolate->heap()->incremental_marking(); local
107 ASSERT(marking->is_compacting_);
112 marking->write_barriers_invoked_since_last_step_ +
[all...] |
| incremental-marking.h | 45 MARKING,
70 INLINE(bool IsMarking()) { return state() >= MARKING; }
72 inline bool IsMarkingIncomplete() { return state() == MARKING; }
100 // Do some marking every time this much memory has been allocated or that many
104 // Start off by marking this many times more memory than has been allocated.
109 // After this many steps we increase the marking/allocating factor.
111 // This is how much we increase the marking/allocating factor by.
121 state_ = MARKING;
204 PrintPID("Increasing marking speed to %d "
|
| mark-compact-inl.h | 40 MarkBit Marking::MarkBitFrom(Address addr) {
56 ASSERT(Marking::MarkBitFrom(obj) == mark_bit);
69 ASSERT(Marking::MarkBitFrom(obj) == mark_bit);
78 return Marking::MarkBitFrom(heap_object).Get();
|
| mark-compact.h | 50 class Marking {
52 explicit Marking(Heap* heap)
135 return Color(Marking::MarkBitFrom(obj));
169 // Marking deque for tracing live objects.
194 // Push the (marked) object on the marking stack if there is room,
200 Marking::BlackToGrey(object);
406 // CodeFlusher collects candidates for code flushing during marking and
407 // processes those candidates after marking has completed in order to
738 // Parallel marking support.
805 // Phase 1: Marking live objects
[all...] |
| mark-compact.cc | 39 #include "incremental-marking.h"
41 #include "marking-thread.h"
51 const char* Marking::kWhiteBitPattern = "00";
52 const char* Marking::kBlackBitPattern = "10";
53 const char* Marking::kGreyBitPattern = "11";
54 const char* Marking::kImpossibleBitPattern = "01";
282 // over array bodies, this is easier than intrusive marking.
486 MarkBit mark_bit = Marking::MarkBitFrom(obj);
487 CHECK(Marking::IsWhite(mark_bit));
547 MarkBit mark_bit = Marking::MarkBitFrom(obj)
[all...] |
| /external/v8/src/ |
| incremental-marking-inl.h | 31 #include "incremental-marking.h"
40 MarkBit value_bit = Marking::MarkBitFrom(HeapObject::cast(value));
41 if (Marking::IsWhite(value_bit)) {
42 MarkBit obj_bit = Marking::MarkBitFrom(obj);
43 if (Marking::IsBlack(obj_bit)) {
82 MarkBit obj_bit = Marking::MarkBitFrom(obj);
83 if (Marking::IsBlack(obj_bit)) {
93 ASSERT(Marking::MarkBitFrom(obj) == mark_bit);
96 Marking::BlackToGrey(mark_bit);
107 // trace it. In this case we switch to non-incremental marking i
[all...] |
| incremental-marking.cc | 30 #include "incremental-marking.h"
68 MarkBit obj_bit = Marking::MarkBitFrom(obj);
69 if (Marking::IsBlack(obj_bit)) {
89 ASSERT(Marking::IsWhite(Marking::MarkBitFrom(HeapObject::cast(value))));
91 IncrementalMarking* marking = isolate->heap()->incremental_marking(); local
92 ASSERT(!marking->is_compacting_);
93 marking->RecordWrite(obj, NULL, value);
100 IncrementalMarking* marking = isolate->heap()->incremental_marking(); local
101 ASSERT(marking->is_compacting_)
[all...] |
| incremental-marking.h | 45 MARKING,
68 INLINE(bool IsMarking()) { return state() >= MARKING; }
70 inline bool IsMarkingIncomplete() { return state() == MARKING; }
96 // Do some marking every time this much memory has been allocated.
98 // Start off by marking this many times more memory than has been allocated.
103 // After this many steps we increase the marking/allocating factor.
105 // This is how much we increase the marking/allocating factor by.
118 state_ = MARKING;
162 ASSERT(!Marking::IsImpossible(mark_bit));
168 ASSERT(Marking::IsBlack(mark_bit))
[all...] |
| mark-compact-inl.h | 40 MarkBit Marking::MarkBitFrom(Address addr) {
56 ASSERT(Marking::MarkBitFrom(obj) == mark_bit);
66 MarkBit mark = Marking::MarkBitFrom(object);
80 ASSERT(Marking::MarkBitFrom(obj) == mark_bit);
92 return Marking::MarkBitFrom(heap_object).Get();
|
| mark-compact.cc | 38 #include "incremental-marking.h"
49 const char* Marking::kWhiteBitPattern = "00";
50 const char* Marking::kBlackBitPattern = "10";
51 const char* Marking::kGreyBitPattern = "11";
52 const char* Marking::kImpossibleBitPattern = "01";
338 MarkBit mark_bit = Marking::MarkBitFrom(obj);
339 ASSERT(Marking::IsWhite(mark_bit));
373 MarkBit mark_bit = Marking::MarkBitFrom(obj);
380 bool Marking::TransferMark(Address old_start, Address new_start) {
397 if (Marking::IsBlack(old_mark_bit))
[all...] |
| /external/clang/test/CodeGen/ |
| 2002-05-23-StaticValues.c | 3 /* Make sure the frontend is correctly marking static stuff as internal! */
|
| /external/iptables/include/linux/netfilter/ |
| xt_TPROXY.h | 4 /* TPROXY target is capable of marking the packet to perform
|
| /external/iproute2/examples/diffserv/ |
| regression-testing | 26 *observe that the metering/policing works correctly (and the marking
34 *observe that the metering/policing works correctly (and the marking
40 Marking: the should be a variation of marked packets:
55 Marking: Should vary between 0x88,0x90,0x98 and 0x0
60 Marking: Should vary between 0x90,0x98 and 0x0
65 Marking: Should vary between 0x98 and 0x0
70 Marking: Should be consistent at 0x0
80 *observe that the metering/policing works correctly (and the marking
89 Marking: the should be a variation of marked packets:
107 Marking: Should vary between 0x88,0x90,0x98 and 0x
[all...] |
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-1708.js | 29 // array caused invalid marking bit patterns on lazily swept pages.
31 // Flags: --expose-gc --noincremental-marking --max-new-space-size 1000
47 // located in a lazy swept page with intact marking bits. Now shift
56 // marking bits being correctly transfered to the new object start.
58 // that marking bit patterns are still sane.
|
| /external/v8/test/mjsunit/regress/ |
| regress-1708.js | 29 // array caused invalid marking bit patterns on lazily swept pages.
31 // Flags: --expose-gc --noincremental-marking --max-new-space-size 1000
47 // located in a lazy swept page with intact marking bits. Now shift
56 // marking bits being correctly transfered to the new object start.
58 // that marking bit patterns are still sane.
|
| /external/iproute2/man/man8/ |
| tc-sfb.8 | 28 non-responsive flows (i.e. flows that do not react to congestion marking
30 Unlike RED, where the marking probability has to be configured, BLUE
31 tries to determine the ideal marking probability automatically.
46 Every bin maintains a marking probability, which gets increased or decreased
48 bin, the marking probability is increased. If the number drops to zero, it
51 The marking probability is based on the minimum value of all bins a flow is
52 mapped into, thus, when a flow does not respond to marking or gradual packet
53 drops, the marking probability quickly reaches one.
91 Whenever a flow is then determined to be non-responsive, the marking
116 the marking probability is increased b
[all...] |
| tc-red.8 | 42 Depending on if ECN is configured, marking either means dropping or
43 purely marking a packet as overlimit.
45 The average queue size is used for determining the marking
70 Average queue size at which marking becomes a possibility. Defaults to
76 At this average queue size, the marking probability is maximal. Should be at
86 Maximum probability for marking, specified as a floating point
99 longer bursts of traffic before marking starts. Real life experiments
124 bytes, this parameter forces a drop instead of ecn marking.
|
| /external/e2fsprogs/tests/f_dup_de2/ |
| expect.1 | 4 Marking / (2) to be rebuilt.
|
| /external/llvm/test/CodeGen/X86/ |
| remat-phys-dead.ll | 16 ; marking the definition register as dead.
|
| /external/llvm/test/Transforms/DeadArgElim/ |
| 2008-06-23-DeadAfterLive.ll | 13 ; marking @test5's return value dead because only this call is unused.
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| Delayed.java | 10 * A mix-in style interface for marking objects that should be
|
| /external/proguard/docs/manual/ |
| optimizations.html | 55 <dt><code><b>class/marking/final</b></code></dt>
68 <dt><code><b>field/marking/private</b></code></dt>
75 <dt><code><b>method/marking/private</b></code></dt>
79 <code><b>method/marking/static</b></code></dt>
82 <dt><code><b>method/marking/final</b></code></dt>
|
