| /external/chromium_org/cc/trees/ |
| layer_sorter.h | 65 GraphEdge(GraphNode* from_node, GraphNode* to_node, float weight)
66 : from(from_node),
|
| layer_sorter.cc | 401 GraphNode* from_node = no_incoming_edge_node_list.front(); local
405 sorted_list.push_back(from_node);
407 DVLOG(2) << from_node->layer->id() << ", ";
410 for (size_t i = 0; i < from_node->outgoing.size(); i++) {
411 GraphEdge* outgoing_edge = from_node->outgoing[i];
420 from_node->outgoing.clear();
|
| /external/srec/srec/crec/ |
| srec_context.c | 913 nodeID from_node, last_from_node, into_node, num_nodes, max_node_number = 0; local
938 from_node = (nodeID)atoi_with_check(line, MAXnodeID);
939 if (from_node > max_num_FSMnodes)
940 max_num_FSMnodes = from_node;
1144 nodeID from_node, into_node; local
1771 nodeID from_node, into_node; local
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_deadlock_detector.h | 260 bool findEdge(uptr from_node, uptr to_node, u32 *stk_from, u32 *stk_to,
262 uptr from_idx = nodeToIndex(from_node);
|
| /external/chromium_org/tools/deep_memory_profiler/visualizer/static/third_party/jqTree/ |
| tree.jquery.js | [all...] |
| /external/srec/srec/Semproc/src/ |
| SemanticGraphImpl.c | 277 nodeID from_node, into_node; local
401 if (sscanf(line, "%hu\t%hu\t%[^\t]\t%[^\t\n\r]", &from_node, &into_node, iword, oword) == 4)
423 if (sscanf(line, "%hu\t%hu\t%[^\t]\t%[^\t\n\r]", &from_node, &into_node, iword, oword) == 4)
461 else if (sscanf(line, "%hu", &from_node) == 1)
485 atoken->next_token_index = (arc_token_lnk)from_node;
514 /* if this arc and the last one do NOT leave the same node (i.e. from_node, see above),
[all...] |
| /ndk/sources/host-tools/sed-4.2.1/lib/ |
| regexec.c | 110 Idx from_node, Idx bkref_idx)
[all...] |
