Searched defs:dead (Results 1 - 25 of 35) sorted by relevance

12

/external/elfutils/libdwfl/
H A Ddwfl_end.c48 Dwfl_Module *dead = next; local
49 next = dead->next;
50 __libdwfl_module_free (dead);
/external/avahi/avahi-core/
H A Dbrowse.h35 int dead; member in struct:AvahiSRecordBrowser
H A Dmulticast-lookup.c39 int dead; member in struct:AvahiMulticastLookup
98 l->dead = 0;
169 if (l->dead)
172 l->dead = 1;
187 if (l->dead)
282 if (l->dead || !l->callback)
298 if (l->dead || !l->callback)
312 if (l->dead || !l->callback)
H A Dinternal.h68 int dead; member in struct:AvahiEntry
84 int dead; member in struct:AvahiSEntryGroup
H A Dwide-area.c62 int dead; member in struct:AvahiWideAreaLookup
117 if (l->dead)
221 l->dead = 0;
302 if (l->dead)
305 l->dead = 1;
320 if (l->dead)
377 if (l->dead || !l->callback)
389 if (l->dead || !l->callback)
496 if (!(l = find_lookup(e, avahi_dns_packet_get_field(p, AVAHI_DNS_FIELD_ID))) || l->dead)
545 if (l && !l->dead) {
[all...]
/external/ipsec-tools/src/racoon/
H A Dschedule.h51 int dead; /* dead or alive */ member in struct:sched
/external/v8/src/compiler/
H A Dcommon-operator-reducer.h46 Node* dead() const { return dead_; } function in class:v8::internal::compiler::final
H A Ddead-code-elimination.h18 // Propagates {Dead} control through the graph and thereby removes dead code.
19 // Note that this does not include trimming dead uses from the graph, and it
20 // also does not include detecting dead code by any other means than seeing a
39 Node* dead() const { return dead_; } function in class:v8::internal::compiler::final
H A Dbranch-elimination.h86 Node* dead() const { return dead_; } function in class:v8::internal::compiler::final
H A Dgraph-reducer.cc29 GraphReducer::GraphReducer(Zone* zone, Graph* graph, Node* dead) argument
31 dead_(dead),
H A Dloop-peeling.cc124 void CopyNodes(Graph* graph, Zone* tmp_zone, Node* dead, NodeRange nodes) { argument
215 Node* dead = graph->NewNode(common->Dead()); local
223 peeling.CopyNodes(graph, tmp_zone, dead, loop_tree->BodyNodes(loop));
282 peeling.CopyNodes(graph, tmp_zone, dead, exit_range);
H A Dosr.cc10 #include "src/compiler/dead-code-elimination.h"
47 Zone* tmp_zone, Node* dead,
53 Node* sentinel = graph->NewNode(dead->op());
67 mapping->at(osr_normal_entry->id()) = dead;
68 mapping->at(osr_loop_entry->id()) = dead;
70 // The outer loops are dead in this copy.
74 mapping->at(node->id()) = dead;
75 TRACE(" ---- #%d:%s -> dead (header)\n", node->id(),
229 loop_header->ReplaceUses(dead);
285 Node* dead local
46 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...]
/external/v8/test/unittests/compiler/
H A Ddead-code-elimination-unittest.cc6 #include "src/compiler/dead-code-elimination.h"
55 // General dead propagation
61 Node* const dead = graph()->NewNode(common()->Dead()); local
62 Node* const node = graph()->NewNode(&kOp0, value, effect, dead);
144 Node* const dead = graph()->NewNode(common()->Dead()); local
146 Reduction const r = Reduce(graph()->NewNode(common()->End(2), dead, start));
H A Dgraph-reducer-unittest.cc348 Node* dead = graph()->NewNode(&kMockOperator); local
354 GraphReducer graph_reducer(zone(), graph(), dead); local
358 EXPECT_EQ(dead, exception->InputAt(1));
361 EXPECT_EQ(1, dead->UseCount());
364 EXPECT_THAT(dead->uses(), ElementsAre(exception));
372 Node* dead = graph()->NewNode(&kMockOperator); local
378 GraphReducer graph_reducer(zone(), graph(), dead); local
382 EXPECT_EQ(dead, exception->InputAt(1));
385 EXPECT_EQ(1, dead->UseCount());
388 EXPECT_THAT(dead
[all...]
/external/avahi/avahi-glib/
H A Dglib-watch.c32 int dead; member in struct:AvahiWatch
45 gboolean dead; member in struct:AvahiTimeout
86 if (all || w->dead)
129 w->dead = FALSE;
141 assert(!w->dead);
148 assert(!w->dead);
155 assert(!w->dead);
162 w->dead = TRUE;
180 t->dead = FALSE;
195 assert(!t->dead);
[all...]
/external/curl/lib/
H A Drtsp.c64 static CURLcode rtsp_disconnect(struct connectdata *conn, bool dead);
141 * we cannot assume that an RTSP socket is dead just because it is readable.
189 static CURLcode rtsp_disconnect(struct connectdata *conn, bool dead) argument
191 (void) dead;
H A Dsmb.c61 static CURLcode smb_disconnect(struct connectdata *conn, bool dead);
893 static CURLcode smb_disconnect(struct connectdata *conn, bool dead) argument
898 (void) dead;
H A Durl.c2728 * killing of a dead old connection.
2787 /* Indicate to all handles on the pipe that we're dead */
2800 * be dead. Most commonly this happens when the server has closed the
3019 * This function checks if given connection is dead and disconnects if so.
3022 * Returns TRUE if the connection actually was dead and disconnected.
3029 /* The check for a dead socket makes sense only if there are no
3032 bool dead; local
3035 dead = Curl_rtsp_connisdead(conn);
3037 dead = SocketIsDead(conn->sock[FIRSTSOCKET]);
3039 if(dead) {
[all...]
/external/libchrome/base/strings/
H A Dstring_util_unittest.cc1130 const char kDead[] = "dead";
1132 std::string dead = live; local
1133 strncpy(WriteInto(&dead, 5), kDead, 4);
1134 EXPECT_EQ(kDead, dead);
1135 EXPECT_EQ(4u, dead.size());
/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) {
/external/avahi/avahi-common/
H A Dsimple-watch.c39 int dead; member in struct:AvahiWatch
52 int dead; member in struct:AvahiTimeout
150 w->dead = 0;
170 assert(!w->dead);
186 assert(!w->dead);
206 assert(!w->dead);
213 w->dead = 1;
224 if (!w->dead)
237 if (all || w->dead)
261 t->dead
[all...]
/external/llvm/lib/CodeGen/
H A DLiveIntervalAnalysis.cpp268 /// or contain only dead phi-defs from ABI blocks.
274 // Create all values as dead defs before extending to uses. Note that roots
417 SmallVectorImpl<MachineInstr*> *dead) {
470 // Handle dead values.
471 bool CanSeparate = computeDeadValues(*li, dead);
477 SmallVectorImpl<MachineInstr*> *dead) {
501 // This is a dead PHI. Remove it.
507 // This is a dead def. Make sure the instruction knows.
512 // If we have a dead def that is completely separate from the rest of
519 if (dead
416 shrinkToUses(LiveInterval *li, SmallVectorImpl<MachineInstr*> *dead) argument
476 computeDeadValues(LiveInterval &LI, SmallVectorImpl<MachineInstr*> *dead) argument
[all...]
/external/v8/test/cctest/compiler/
H A Dtest-loop-analysis.cc49 dead(graph.NewNode(common.Dead())),
70 Node* dead; member in class:v8::internal::compiler::LoopFinderTester
/external/clang/test/SemaCXX/
H A Dconstant-expression-cxx1y.cpp247 constexpr int &&dead() { return id(0); } // expected-note {{temporary created here}} function in namespace:lifetime
248 constexpr int bad() { int &&n = dead(); n = 1; return n; } // expected-note {{assignment to temporary whose lifetime has ended}}
/external/webrtc/webrtc/p2p/base/
H A Dport.cc625 if (dead()) {
652 if (dead()) {
1089 if (dead(now)) {
1122 bool Connection::dead(uint32_t now) const { function in class:cricket::Connection

Completed in 1345 milliseconds

12