/gem5/configs/topologies/ |
H A D | MeshDirCorners_XY.py | 65 for node in nodes: 66 if node.type == 'L1Cache_Controller' or \ 67 node.type == 'L2Cache_Controller': 68 cache_nodes.append(node) 69 elif node.type == 'Directory_Controller': 70 dir_nodes.append(node) 71 elif node.type == 'DMA_Controller': 72 dma_nodes.append(node) 143 for (i, node) in enumerate(dma_nodes): 144 assert(node [all...] |
H A D | Mesh_westfirst.py | 93 # Connect each node to the appropriate router 105 for (i, node) in enumerate(remainder_nodes): 106 assert(node.type == 'DMA_Controller') 108 ext_links.append(ExtLink(link_id=link_count, ext_node=node,
|
H A D | Mesh_XY.py | 92 # Connect each node to the appropriate router 104 for (i, node) in enumerate(remainder_nodes): 105 assert(node.type == 'DMA_Controller') 107 ext_links.append(ExtLink(link_id=link_count, ext_node=node,
|
/gem5/src/cpu/o3/ |
H A D | dep_graph.hh | 67 * value on the list. The head node of each linked list represents 245 DepEntry *node; local 246 node = dependGraph[idx].next; 248 if (node) { 249 inst = node->inst; 250 dependGraph[idx].next = node->next; 251 node->inst = NULL; 253 delete node;
|
/gem5/tests/test-progs/asmtest/src/riscv/env/v/ |
H A D | vm.c | 99 freelist_t* node = &user_mapping[addr/PGSIZE]; local 100 if (node->addr) 114 freelist_head = freelist_tail = node; 117 freelist_tail->next = node; 118 freelist_tail = node; 139 freelist_t* node = freelist_head; local 140 assert(node); 141 freelist_head = node->next; 145 uintptr_t new_pte = (node->addr >> PGSHIFT << PTE_PPN_SHIFT) | PTE_V | PTE_U | PTE_R | PTE_W | PTE_X; 150 user_mapping[addr/PGSIZE] = *node; [all...] |
/gem5/src/dev/arm/ |
H A D | SMMUv3.py | 178 node = FdtNode("smmuv3@%x" % long(reg_addr)) 179 node.appendCompatible("arm,smmu-v3") 180 node.append(FdtPropertyWords("reg", 183 node.append(FdtPropertyWords("#iommu-cells", [1])) 185 node.appendPhandle(self) 186 yield node
|
/gem5/src/mem/ruby/structures/ |
H A D | WireBuffer.cc | 115 MsgPtr node = m_message_queue.front(); local 119 node->setLastEnqueueTime(future_time); 121 m_message_queue.back() = node;
|
/gem5/configs/example/ |
H A D | read_config.py | 458 def is_sim_object(self, node): 459 return isinstance(node, dict) and 'path' in node 461 def find_all_objects(self, node): 462 if self.is_sim_object(node): 463 self.object_dicts[node['path']] = node 465 if isinstance(node, list): 466 for elem in node: 468 elif isinstance(node, dic [all...] |
/gem5/util/dist/test/ |
H A D | simple_bootscript.rcS | 59 /bin/hostname node${MY_RANK} 93 echo "A real multi node workload might start here ..."
|
/gem5/src/mem/ruby/slicc_interface/ |
H A D | RubySlicc_ComponentMapping.hh | 88 MachineTypeAndNodeIDToMachineID(MachineType type, NodeID node) argument 90 MachineID mach = {type, node};
|
/gem5/ext/pybind11/tools/ |
H A D | mkdoc.py | 193 def extract(filename, node, prefix, output): 194 if not (node.location.file is None or 195 os.path.samefile(d(node.location.file.name), filename)): 197 if node.kind in RECURSE_LIST: 199 if node.kind not in PREFIX_BLACKLIST: 202 sub_prefix += d(node.spelling) 203 for i in node.get_children(): 205 if node.kind in PRINT_LIST: 206 comment = d(node.raw_comment) if node [all...] |
/gem5/ext/googletest/googletest/scripts/ |
H A D | pump.py | 656 def RunAtomicCode(env, node, output): 657 if isinstance(node, VarNode): 658 identifier = node.identifier.value.strip() 660 RunAtomicCode(env.Clone(), node.atomic_code, result) 663 elif isinstance(node, RangeNode): 664 identifier = node.identifier.value.strip() 665 lower = int(env.EvalExp(node.exp1)) 666 upper = int(env.EvalExp(node.exp2)) 668 elif isinstance(node, ForNode): 669 identifier = node [all...] |
/gem5/src/mem/ruby/network/simple/ |
H A D | Throttle.hh | 55 Throttle(int sID, RubySystem *rs, NodeID node, Cycles link_latency, 84 void init(NodeID node, Cycles link_latency, int link_bandwidth_multiplier,
|
H A D | Throttle.cc | 51 Throttle::Throttle(int sID, RubySystem *rs, NodeID node, Cycles link_latency, argument 54 : Consumer(em), m_switch_id(sID), m_switch(em), m_node(node),
|
/gem5/src/cpu/ |
H A D | BaseCPU.py | 300 cpu-map node. Note that this implementation does not support clusters 305 generated node adheres the GEM5 way of doing things.""" 317 node = FdtNode("cpu@%x" % reg) 318 node.append(FdtPropertyStrings("device_type", "cpu")) 319 node.appendCompatible(["gem5,arm-cpu"]) 320 node.append(FdtPropertyWords("reg", state.CPUAddrCells(reg))) 323 platform.annotateCpuDeviceNode(node, state) 329 node.append(FdtPropertyWords("clock-frequency", freq)) 333 node.appendPhandle(phandle_key) 334 cpus_node.append(node) [all...] |
H A D | profile.hh | 80 void sample(ProfileNode *node, Addr pc);
|
/gem5/src/python/m5/util/ |
H A D | fdthelper.py | 171 """Create an empty node.""" 176 """Create a new node and immediately set the phandle property, if obj 183 """Change the behavior of the normal append to override if a node with 184 the same name already exists or merge if the name exists and is a node 219 """Append a phandle property to this node with the phandle of the 228 def sortNodes(self, node): 233 properties = FdtNode(node.name) 234 subnodes = FdtNode(node.name) 236 while len(node): 237 subnode = node [all...] |
/gem5/src/sim/power/ |
H A D | thermal_model.hh | 125 node = n; 137 ThermalNode * node; member in class:ThermalReference
|
H A D | thermal_model.cc | 55 : SimObject(p), _temperature(p->temperature), node(NULL) 223 // For each node in the system, create the kirchhoff nodal equation 254 ref->node->temp = ref->_temperature; 255 ref->node->isref = true; 265 if (ref->node == n) { 273 // Assign each node an ID
|
/gem5/util/stats/ |
H A D | profile.py | 115 node = FuncNode() 116 node.symbol = data[1] 117 if node.symbol == '': 118 node.symbol = 'unknown' 119 node.count = long(data[2]) 120 node.children = [ long(child, 16) for child in data[3:] ] 121 nodes[node_id] = node 123 for node in nodes.itervalues(): 125 for cid in node.children: 128 child.parent = node [all...] |
/gem5/src/cpu/testers/garnet_synthetic_traffic/ |
H A D | GarnetSyntheticTraffic.py | 43 single_sender = Param.Int(-1, "Send only from this node. \ 44 By default every node sends")
|
/gem5/src/base/ |
H A D | statistics.hh | 2100 * Base class for formula statistic node. These nodes are used to build a tree 2107 * Return the number of nodes in the subtree starting at this node. 3117 * Helper class to construct formula node trees. 3125 NodePtr node; 3132 Temp(const NodePtr &n) : node(n) { } 3134 Temp(NodePtr &&n) : node(std::move(n)) { } 3137 * Return the node pointer. 3138 * @return the node pointer. 3140 operator NodePtr&() { return node; } 3143 * Makde gcc < 4.6.3 happy and explicitly get the underlying node [all...] |
/gem5/src/mem/ruby/network/ |
H A D | MessageBuffer.cc | 294 MsgPtr node = m_prio_heap.front(); local 298 node->setLastEnqueueTime(future_time); 300 m_prio_heap.back() = node;
|
H A D | Topology.cc | 199 NodeID node = dest - m_nodes; local 203 net->makeExtOutLink(src - (2 * m_nodes), node, link_entry.link,
|
/gem5/ext/googletest/googlemock/scripts/generator/cpp/ |
H A D | ast.py | 110 """Base AST node.""" 117 """Returns bool if this node is a declaration.""" 121 """Returns bool if this node is a definition.""" 125 """Returns bool if this node exportable from a header file.""" 128 def Requires(self, node): 129 """Does this AST node require the definition of the node passed in?""" 182 def Requires(self, node): 220 def Requires(self, node): 222 return self.type.name == node [all...] |