Home | History | Annotate | Download | only in graph

Lines Matching refs:id

57     const int local_id = cm.Id(n);
58 const int global_id = Id(n);
125 void CostModel::Ensure(int id, int num_outputs) {
126 if (slot_bytes_.size() <= static_cast<size_t>(id)) {
127 slot_bytes_.resize(id + 1);
128 count_.resize(id + 1);
129 time_.resize(id + 1);
130 max_mem_usage_.resize(id + 1);
131 max_exec_time_.resize(id + 1);
132 output_port_alloc_ids_.resize(id + 1);
135 auto perslot = &slot_bytes_[id];
136 auto output_port_alloc_ids = &output_port_alloc_ids_[id];
137 auto max_mem_usage = &max_mem_usage_[id];
154 const int id = Id(node);
155 if (id < 0) return;
158 Ensure(id, 0);
159 auto perslot = &slot_bytes_[id];
164 Ensure(id, num_outputs);
168 const int id = Id(node);
169 if (id < 0) return;
170 CHECK_LT(id, slot_bytes_.size());
171 count_[id] += count;
175 const int id = Id(node);
176 if (id < 0) return 0;
177 return (static_cast<size_t>(id) < slot_bytes_.size()) ? count_[id] : 0;
181 const int id = Id(node);
182 if (id < 0) return;
183 CHECK_LT(id, slot_bytes_.size());
184 auto perslot = &slot_bytes_[id];
195 const int id = Id(node);
196 if (id < 0 || static_cast<size_t>(id) >= slot_bytes_.size() ||
197 slot_bytes_[id].size() <= static_cast<size_t>(slot)) {
200 return slot_bytes_[id][slot];
210 const int id = Id(node);
211 if (id < 0) return;
213 Ensure(id, node->num_outputs());
214 time_[id] += time;
219 const int id = Id(node);
220 if (id < 0 || static_cast<size_t>(id) >= time_.size() ||
221 time_[id] < Microseconds(0)) {
224 return time_[id];
235 CHECK(static_cast<size_t>(n->id()) < time_.size() &&
236 time_[n->id()] >= Microseconds(0))
239 CHECK(static_cast<size_t>(n->id()) < slot_bytes_.size())
241 const auto& perslot = slot_bytes_[n->id()];
253 const int id = Id(node);
254 if (id < 0) return;
261 Ensure(id, node->num_outputs());
262 auto& current_max = max_mem_usage_[id].output_port_mem[output_slot];
270 max_mem_usage_[id].output_port_shape[output_slot] = tensor_shape;
271 max_mem_usage_[id].output_port_type[output_slot] = dtype;
276 const int id = Id(node);
277 if (id < 0 || static_cast<size_t>(id) >= max_mem_usage_.size() ||
278 max_mem_usage_[id].output_port_mem.size() <= static_cast<size_t>(slot)) {
281 return max_mem_usage_[id].output_port_mem[slot];
286 const int id = Id(node);
287 if (id < 0 || static_cast<size_t>(id) >= max_mem_usage_.size() ||
288 max_mem_usage_[id].output_port_shape.size() <=
292 return max_mem_usage_[id].output_port_shape[slot];
296 const int id = Id(node);
297 if (id < 0 || static_cast<size_t>(id) >= max_mem_usage_.size() ||
298 max_mem_usage_[id].output_port_type.size() <= static_cast<size_t>(slot)) {
301 return max_mem_usage_[id].output_port_type[slot];
305 const int id = Id(node);
306 if (id < 0) {
309 return max_mem_usage_[id].temp_memory_size;
313 const int id = Id(node);
314 if (id < 0) {
317 return max_mem_usage_[id].persistent_memory_size;
322 const int id = Id(node);
323 if (id < 0) return;
324 max_mem_usage_[id].temp_memory_size = memory_stats.temp_memory_size();
325 max_mem_usage_[id].persistent_memory_size =
335 const int id = Id(node);
336 if (id < 0) return;
337 Ensure(id, node->num_outputs());
338 max_exec_time_[id] = std::max(max_exec_time_[id], time);
342 const int id = Id(node);
343 if (id < 0 || static_cast<size_t>(id) >= max_exec_time_.size()) {
346 return max_exec_time_[id];
351 const int id = Id(node);
352 if (id < 0) return;
353 Ensure(id, node->num_outputs());
354 output_port_alloc_ids_[id][output_slot] = alloc_id;
358 const int id = Id(node);
359 if (id < 0 || static_cast<size_t>(id) >= output_port_alloc_ids_.size() ||
360 output_port_alloc_ids_[id].size() <= static_cast<size_t>(slot)) {
363 return output_port_alloc_ids_[id][slot];
446 VLOG(2) << "Node " << n->id() << ": " << n->name()
486 cnode->set_id(Id(n));
500 return Id(a->src()) < Id(b->src());
505 input_info->set_preceding_node(Id(e->src()));
531 cnode->add_control_input(Id(e->src()));