/gem5/site_scons/ |
H A D | gem5_python_paths.py | 41 import SCons.Node.FS 43 fs = SCons.Node.FS.get_default_fs()
|
/gem5/src/mem/ |
H A D | stack_dist_calc.hh | 60 * ordered map <uint64_t, Node*>. Nodes are structs which take form 74 * flag of Node set to True). Then later if this same address is 142 * of the Node) 154 * Node Balancing: The tree structure is maintained by an 179 struct Node; 181 typedef std::map<uint64_t, Node*> IndexNodeMap; 199 uint64_t getSum(Node* node, bool from_left, uint64_t sum_from_below, 210 uint64_t getSumsLeavesToRoot(Node* node) const; 227 uint64_t updateSum(Node* node, 240 uint64_t updateSumsLeavesToRoot(Node* nod 351 struct Node{ struct in class:StackDistCalc 383 Node() : sumLeft(0), sumRight(0), discardLeft(false), function in struct:StackDistCalc::Node [all...] |
H A D | stack_dist_calc.cc | 61 // Create a root node. Node type variable in the topmost layer 62 Node* root_node = new Node(); 99 StackDistCalc::updateSum(Node* node, bool from_left, 113 Node* node_parent_ptr = node->parent; 188 StackDistCalc::updateSumsLeavesToRoot(Node* node, bool is_new_leaf) 213 StackDistCalc::getSum(Node* node, bool from_left, uint64_t sum_from_below, 236 StackDistCalc::getSumsLeavesToRoot(Node* node) const 269 Node* newRootNode = new Node(); [all...] |
/gem5/src/sim/ |
H A D | mathexpr.hh | 90 class Node { class in class:MathExpr 92 Node() : op(nInvalid), l(0), r(0), value(0) {} function in class:MathExpr::Node 108 Node *l, *r; 114 Node * root; 117 Node *parse(std::string expr); 120 std::string toStr(Node *n, std::string prefix) const; 123 double eval(const Node *n, EvalCallback fn) const;
|
H A D | mathexpr.cc | 76 MathExpr::Node * 97 Node *l = NULL; 100 Node *r = parse(expr.substr(i + 1)); 103 Node *n = new Node(); 123 Node *n = new Node(); 141 Node * n = new Node(); 152 MathExpr::eval(const Node * [all...] |
/gem5/src/base/ |
H A D | trie.hh | 46 struct Node struct in class:Trie 59 Node *parent; 60 Node *kids[2]; 62 Node(Key _key, Key _mask, Value *_val) : function in struct:Trie::Node 105 Node head; 108 typedef Node *Handle; 118 * beyond the Node being examined. If so, it returns true and advances the 124 * @return Whether the current Node was advanced. 127 goesAfter(Node **parent, Node *ki [all...] |
H A D | statistics.hh | 2103 class Node 2127 virtual ~Node() {}; 2130 /** Shared pointer to a function Node. */ 2131 typedef std::shared_ptr<Node> NodePtr; 2133 class ScalarStatNode : public Node 2160 class ScalarProxyNode : public Node 2200 class VectorStatNode : public Node 2216 class ConstNode : public Node 2230 class ConstVectorNode : public Node 2302 class UnaryNode : public Node [all...] |
/gem5/ext/googletest/googletest/test/ |
H A D | gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node 70 if expected_node.nodeType == Node.CDATA_SECTION_NODE: 71 self.assertEquals(Node.CDATA_SECTION_NODE, actual_node.nodeType) 75 self.assertEquals(Node.ELEMENT_NODE, actual_node.nodeType) 76 self.assertEquals(Node.ELEMENT_NODE, expected_node.nodeType) 132 if child.nodeType == Node.ELEMENT_NODE: 138 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]: 140 if (child.nodeType == Node.CDATA_SECTION_NODE or 186 if child.nodeType == Node [all...] |
H A D | gtest_xml_outfiles_test.py | 37 from xml.dom import minidom, Node
|
H A D | gtest_xml_output_unittest.py | 41 from xml.dom import minidom, Node
|
/gem5/src/python/m5/util/ |
H A D | dot_writer_ruby.py | 53 return pydot.Node( \ 66 return pydot.Node( \
|
H A D | dot_writer.py | 175 return pydot.Node( \
|
/gem5/ext/googletest/googlemock/scripts/generator/cpp/ |
H A D | ast.py | 109 class Node(object): class in inherits:object 144 class Define(Node): 146 Node.__init__(self, start, end) 155 class Include(Node): 157 Node.__init__(self, start, end) 168 class Goto(Node): 170 Node.__init__(self, start, end) 177 class Expr(Node): 179 Node.__init__(self, start, end) 204 class Using(Node) [all...] |
/gem5/util/stats/ |
H A D | db.py | 102 class Node(object): class in inherits:object 189 x.__dict__[name] = Node(fullname + name)
|
H A D | profile.py | 166 from pydot import Dot, Edge, Node 177 self.dot_node = Node(self, label=label)
|