Home
last modified time | relevance | path

Searched defs:ei (Results 1 – 25 of 183) sorted by relevance

12345678

/third_party/boost/libs/process/test/
Denvironment.cpp85 auto ei = env.begin(); variable
103 auto ei = wenv.begin(); variable
129 auto ei = env.begin(); variable
/third_party/mesa3d/src/gallium/drivers/nouveau/codegen/
Dnv50_ir_ssa.cpp102 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) { in buildDFS() local
145 for (Graph::EdgeIterator ei = nw->incident(); !ei.end(); ei.next()) { in build() local
230 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in buildLiveSetsPreSSA() local
271 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in buildDefSetsPreSSA() local
503 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in search() local
509 for (Graph::EdgeIterator ei = sb->cfg.incident(); !ei.end(); ei.next()) { in search() local
525 for (Graph::EdgeIterator ei = bb->dom.outgoing(); !ei.end(); ei.next()) in search() local
Dnv50_ir_graph.cpp131 EdgeIterator ei = this->outgoing(); in detach() local
186 for (EdgeIterator ei = pos->outgoing(); !ei.end(); ei.next()) { in reachableBy() local
225 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) in search() local
300 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) { in search() local
413 for (EdgeIterator ei = c->outgoing(); !ei.end(); ei.next()) { in findLightestPathWeight() local
Dnv50_ir_ra.cpp404 for (Graph::EdgeIterator ei = p->cfg.outgoing(); !ei.end(); ei.next()) in needNewElseBlock() local
433 Graph::EdgeIterator ei; in splitEdges() local
511 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in visit() local
613 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in buildLiveSets() local
671 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in collectLiveValues() local
696 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in visit() local
785 static inline RIG_Node *get(const Graph::EdgeIterator& ei) in get()
896 for (Graph::EdgeIterator ei = nodes[i].outgoing(); !ei.end(); ei.next()) in printNodeInfo() local
898 for (Graph::EdgeIterator ei = nodes[i].incident(); !ei.end(); ei.next()) in printNodeInfo() local
1358 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) in simplifyNode() local
[all …]
/third_party/boost/libs/metaparse/test/
Dentire_input.cpp37 typedef entire_input<one_char> ei; in BOOST_METAPARSE_TEST_CASE() typedef
/third_party/boost/boost/graph/
Dgraph_utility.hpp155 typename graph_traits< IncidenceGraph >::in_edge_iterator ei, ei_end; in print_in_edges() local
170 typename graph_traits< IncidenceGraph >::out_edge_iterator ei, ei_end; in print_graph_dispatch() local
184 typename graph_traits< IncidenceGraph >::out_edge_iterator ei, ei_end; in print_graph_dispatch() local
207 typename graph_traits< EdgeListGraph >::edge_iterator ei, ei_end; in print_edges() local
218 typename graph_traits< EdgeListGraph >::edge_iterator ei, ei_end; in print_edges2() local
290 typename Graph::edge_iterator ei, ei_end, found; in in_edge_set() local
307 typename Graph::edge_iterator ei, ei_end; in in_edge_set() local
434 typedef typename boost::graph_traits< Graph >::edge_iterator ei; in has_no_edges() typedef
444 typedef typename boost::graph_traits< Graph >::out_edge_iterator ei; in has_no_out_edges() typedef
Dboykov_kolmogorov_max_flow.hpp128 edge_iterator ei, e_end; in bk_max_flow() local
176 out_edge_iterator ei, e_end; in augment_direct_paths() local
277 out_edge_iterator ei, e_end; in grow() local
339 out_edge_iterator ei, e_end; in grow() local
528 out_edge_iterator ei, e_end; in adopt() local
594 out_edge_iterator ei, e_end; in adopt() local
Dwrite_dimacs.hpp65 edge_iterator ei, e_end; in write_dimacs_max_flow() local
/third_party/boost/boost/container/detail/
Dconstruct_in_place.hpp56 …CONTAINER_FORCEINLINE void construct_in_place(Allocator &a, T *dest, emplace_iterator<U, EF, D> ei) in construct_in_place()
88 BOOST_CONTAINER_FORCEINLINE void assign_in_place(DstIt dest, emplace_iterator<U, EF, D> ei) in assign_in_place()
/third_party/ffmpeg/libavformat/
Dsrtdec.c72 static int get_event_info(const char *line, struct event_info *ei) in get_event_info()
95 const struct event_info *ei, int append_cache) in add_event()
134 struct event_info ei; in srt_read_header() local
/third_party/boost/libs/graph/example/
Din_edges.cpp44 boost::graph_traits< Graph >::in_edge_iterator ei, edge_end; in main() local
Dkuratowski_subgraph.cpp50 graph_traits< graph >::edge_iterator ei, ei_end; in main() local
Dcanonical_ordering.cpp49 graph_traits< graph >::edge_iterator ei, ei_end; in main() local
Dmake_biconnected_planar.cpp46 graph_traits< graph >::edge_iterator ei, ei_end; in main() local
Dmax_flow.cpp89 graph_traits< Graph >::out_edge_iterator ei, e_end; in main() local
Dboykov_kolmogorov-eg.cpp105 graph_traits< Graph >::out_edge_iterator ei, e_end; in main() local
Dpush-relabel-eg.cpp79 graph_traits< Graph >::out_edge_iterator ei, e_end; in main() local
/third_party/libunwind/src/coredump/
D_UCD_elf_map_image.c36 struct elf_image *ei = &ui->edi.ei; in CD_elf_map_image() local
/third_party/libunwind/src/
Dos-hpux.c35 tdep_get_elf_image (struct elf_image *ei, pid_t pid, unw_word_t ip, in tdep_get_elf_image()
Dos-solaris.c33 tdep_get_elf_image (struct elf_image *ei, pid_t pid, unw_word_t ip, in tdep_get_elf_image()
/third_party/icu/icu4c/source/common/unicode/
Dparsepos.h229 ParsePosition::setErrorIndex(int32_t ei) in setErrorIndex()
/third_party/skia/third_party/externals/icu/source/common/unicode/
Dparsepos.h229 ParsePosition::setErrorIndex(int32_t ei) in setErrorIndex()
/third_party/flutter/skia/third_party/externals/icu/source/common/unicode/
Dparsepos.h226 ParsePosition::setErrorIndex(int32_t ei) in setErrorIndex()
/third_party/node/deps/icu-small/source/common/unicode/
Dparsepos.h229 ParsePosition::setErrorIndex(int32_t ei) in setErrorIndex()
/third_party/boost/libs/graph/test/
Dlayout_test.cpp91 typename graph_traits< Graph >::edge_iterator ei, ei_end; in dump_graph_layout() local
211 edge_iterator ei, ei_end; in test_cube() local
283 edge_iterator ei, ei_end; in test_triangular() local
357 edge_iterator ei, ei_end; in test_disconnected() local

12345678