Searched refs:dead (Results 1 - 25 of 73) sorted by relevance

123

/external/clang/test/CodeGen/
H A Dswitch-dce.c7 // CHECK-NOT: @dead
10 // CHECK-NOT: @dead
13 void dead();
22 dead();
28 // CHECK-NOT: @dead
31 // CHECK-NOT: @dead
36 dead();
47 // CHECK-NOT: @dead
50 // CHECK-NOT: @dead
55 dead();
[all...]
/external/compiler-rt/test/asan/TestCases/Darwin/
H A Ddead-strip.c1 // Test that AddressSanitizer does not re-animate dead globals when dead
5 // detected after dead stripping has been performed. This proves that the
14 int dead[1] = {}; variable
/external/clang/test/Preprocessor/
H A Dmacro_paste_msextensions.c13 #define comment /##/ dead tokens live here
21 #define nested(x) int x comment cute little dead tokens...
24 nested(baz) rise of the dead tokens
/external/iproute2/testsuite/tests/ip/tunnel/
H A Dadd_tunnel.t12 ts_ip "$0" "Add GRE tunnel over IPv6" tunnel add name $TUNNEL_NAME mode ip6gre local dead:beef::1 remote dead:beef::2
/external/elfutils/libdwfl/
H A Ddwfl_end.c48 Dwfl_Module *dead = next; local
49 next = dead->next;
50 __libdwfl_module_free (dead);
/external/clang/test/Sema/
H A Dwarn-unreachable.c7 int dead();
33 dead(); // expected-warning {{will never be executed}}
37 dead(); // expected-warning {{will never be executed}}
43 dead();
54 dead(); // expected-warning {{will never be executed}}
68 dead(); // expected-warning {{will never be executed}}
71 dead();
81 dead(); // expected-warning {{will never be executed}}
91 dead() : dead();
[all...]
/external/iproute2/testsuite/tests/ip/route/
H A Dadd_default_route.t24 ts_ip "$0" "Add dead:beef::1/64 addr on $DEV" -6 addr add dead:beef::1/64 dev $DEV
25 ts_ip "$0" "Add default route via dead:beef::2" route add default via dead:beef::2
27 test_on "default via dead:beef::2 dev $DEV"
32 test_on "default via dead:beef::2 dev $DEV"
/external/iproute2/ip/
H A Droutel42 dead|onlink|pervasive|offload|notify|linkdown|unresolved)
/external/clang/test/SemaCXX/
H A Dwarn-unreachable.cpp5 int dead();
35 dead(); // expected-warning {{will never be executed}}
46 dead() : dead();
107 dead(); // expected-warning {{will never be executed}}
110 // Handle 'try' code dominating a dead return.
301 if (false) calledFun(); // expected-warning {{will never be executed}} expected-note {{silence by adding parentheses to mark code as explicitly dead}}
304 if (true) // expected-note {{silence by adding parentheses to mark code as explicitly dead}}
314 if (!true) // expected-note {{silence by adding parentheses to mark code as explicitly dead}}
331 if (0) calledFun(); // expected-warning {{will never be executed}} expected-note {{silence by adding parentheses to mark code as explicitly dead}}
[all...]
/external/ipsec-tools/src/racoon/
H A Dschedule.h51 int dead; /* dead or alive */ member in struct:sched
H A Dschedule.c90 if (p->dead)
99 /* mark it with dead. and call the function. */
100 p->dead = 1;
148 new->dead = 0;
201 sc->dead = 1;
215 if (!sc->dead) {
/external/skia/src/sksl/ir/
H A DSkSLVariable.h54 bool dead() const { function in struct:SkSL::Variable
65 // becomes zero during optimization), the variable is dead and may be eliminated.
67 // Tracks how many sites write to the variable. If this is zero, the variable is dead and may be
/external/skqp/src/sksl/ir/
H A DSkSLVariable.h46 bool dead() const { function in struct:SkSL::Variable
57 // becomes zero during optimization), the variable is dead and may be eliminated.
59 // Tracks how many sites write to the variable. If this is zero, the variable is dead and may be
/external/v8/src/compiler/
H A Ddead-code-elimination.h20 // Propagates {Dead} control through the graph and thereby removes dead code.
21 // Note that this does not include trimming dead uses from the graph, and it
22 // also does not include detecting dead code by any other means than seeing a
45 Node* dead() const { return dead_; } function in class:v8::internal::compiler::final
H A Dvalue-numbering-reducer.cc82 size_t dead = capacity_;
87 if (dead != capacity_) {
88 // Reuse dead entry that we discovered on the way.
89 entries_[dead] = node;
151 // Skip dead entries, but remember their indices so we can reuse them.
153 dead = i;
196 // Insert the old entries into the new block (skipping dead nodes).
H A Dosr.cc11 #include "src/compiler/dead-code-elimination.h"
55 Zone* tmp_zone, Node* dead, LoopTree* loop_tree,
61 Node* sentinel = graph->NewNode(dead->op());
75 mapping->at(osr_normal_entry->id()) = dead;
76 mapping->at(osr_loop_entry->id()) = dead;
78 // The outer loops are dead in this copy.
82 mapping->at(node->id()) = dead;
83 TRACE(" ---- #%d:%s -> dead (header)\n", node->id(),
238 loop_header->ReplaceUses(dead);
312 Node* dead local
54 PeelOuterLoopsForOsr(Graph* graph, CommonOperatorBuilder* common, Zone* tmp_zone, Node* dead, LoopTree* loop_tree, LoopTree::Loop* osr_loop, Node* osr_normal_entry, Node* osr_loop_entry) argument
[all...]
H A Dcommon-operator-reducer.h49 Node* dead() const { return dead_; } function in class:v8::internal::compiler::final
H A Dbranch-elimination.cc69 Replace(use, known_value ? control_input : dead());
72 Replace(use, known_value ? dead() : control_input);
78 return Replace(dead());
106 ReplaceWithValue(node, dead(), effect, control);
114 return Replace(dead());
H A Dcommon-operator-reducer.cc113 Replace(use, (decision == Decision::kTrue) ? control : dead());
116 Replace(use, (decision == Decision::kFalse) ? control : dead());
122 return Replace(dead());
149 ReplaceWithValue(node, dead(), effect, control);
157 return Replace(dead());
243 // Check that the branch is not dead already.
348 // Mark the Merge {control} and Return {node} as {dead}.
349 Replace(control, dead());
350 return Replace(dead());
364 // Mark the Merge {control} and Return {node} as {dead}
[all...]
H A Ddead-code-elimination.cc5 #include "src/compiler/dead-code-elimination.h"
49 // Skip dead inputs.
56 return Replace(dead());
73 // same time. We consider {Loop}s dead even if only the first control input
74 // is dead.
80 // Skip dead inputs.
96 return Replace(dead());
107 Replace(use, dead());
H A Dgraph-reducer.cc28 GraphReducer::GraphReducer(Zone* zone, Graph* graph, Node* dead) argument
30 dead_(dead),
35 if (dead != nullptr) {
/external/syslinux/core/fs/
H A Dfs.c44 struct inode *dead = inode; local
45 int refcnt = --(dead->refcnt);
46 dprintf("put_inode %p name %s refcnt %u\n", dead, dead->name, refcnt);
49 inode = dead->parent;
50 if (dead->name)
51 free((char *)dead->name);
52 free(dead);
/external/tensorflow/tensorflow/core/common_runtime/
H A Dpending_counts_test.cc43 // The dead count is no longer updated once pending is 0.
147 int pending, dead; local
153 // Don't increment the dead count this time
154 c.adjust_for_activation(h, false, &pending, &dead);
158 EXPECT_EQ(c.dead_count(h), dead);
160 // Increment the dead count this time
161 c.adjust_for_activation(h, true, &pending, &dead);
164 EXPECT_EQ(c.dead_count(h), dead);
/external/syslinux/gpxe/src/arch/i386/drivers/net/
H A Dundiload.c150 static uint32_t dead = 0xdeaddead; local
156 put_real ( dead, undi->pxenv.segment, undi->pxenv.offset );
158 put_real ( dead, undi->ppxe.segment, undi->ppxe.offset );
/external/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_dataflow_deadcode.c317 int dead = 1; local
322 dead = 0;
326 dead = 0;
329 dead = 0;
334 if (dead) {

Completed in 652 milliseconds

123