/device/linaro/bootloader/edk2/MdeModulePkg/Bus/Pci/PciBusDxe/ |
PciResourceSupport.c | 92 This function inserts a resource node into the resource list.
95 @param Bridge PCI resource node for bridge.
96 @param ResNode Resource node want to be inserted.
185 @param Bridge PCI resource node for bridge.
196 PCI_RESOURCE_NODE *Node;
247 Node = RESOURCE_NODE_FROM_LINK (CurrentLink);
248 if (Node->ResourceUsage == PciResUsagePadding) {
250 PaddingAperture = Node->Length;
256 Offset = Aperture & (Node->Alignment);
260 Aperture = Aperture + (Node->Alignment + 1) - Offset; [all...] |
/external/v8/src/interpreter/ |
interpreter-generator.cc | 31 using compiler::Node; 60 Node* zero_value = NumberConstant(0.0); 69 Node* smi_int = BytecodeOperandImmSmi(0); 78 Node* constant = LoadConstantPoolEntryAtOperandIndex(0); 127 Node* value = LoadRegisterAtOperandIndex(0); 136 Node* accumulator = GetAccumulator(); 145 Node* src_value = LoadRegisterAtOperandIndex(0); 159 Node* feedback_slot = BytecodeOperandIdx(slot_operand_index); 162 ExitPoint exit_point(this, [=](Node* result) { 170 Node* name = LoadConstantPoolEntryAtOperandIndex(name_operand_index) [all...] |
interpreter-intrinsics-generator.cc | 23 using compiler::Node; 34 Node* InvokeIntrinsic(Node* function_id, Node* context, 43 Node* IsInstanceType(Node* input, int type); 44 Node* CompareInstanceType(Node* map, int type, InstanceTypeCompareMode mode); 45 Node* IntrinsicAsStubCall(const InterpreterAssembler::RegListNodePair& args, 46 Node* context, Callable const& callable) [all...] |
/external/v8/src/compiler/ |
graph-assembler.cc | 14 GraphAssembler::GraphAssembler(JSGraph* jsgraph, Node* effect, Node* control, 21 Node* GraphAssembler::IntPtrConstant(intptr_t value) { 25 Node* GraphAssembler::Int32Constant(int32_t value) { 29 Node* GraphAssembler::UniqueInt32Constant(int32_t value) { 33 Node* GraphAssembler::SmiConstant(int32_t value) { 37 Node* GraphAssembler::Uint32Constant(int32_t value) { 41 Node* GraphAssembler::Float64Constant(double value) { 45 Node* GraphAssembler::HeapConstant(Handle<HeapObject> object) { 50 Node* GraphAssembler::ExternalConstant(ExternalReference ref) [all...] |
control-equivalence.h | 10 #include "src/compiler/node.h" 43 // Run the main algorithm starting from the {exit} control node. This causes 49 void Run(Node* exit); 52 size_t ClassOf(Node* node) { 53 DCHECK_NE(kInvalidClass, GetClass(node)); 54 return GetClass(node); 65 Node* from; // Node that this bracket originates from. 66 Node* to; // Node that this bracket points to 77 Node* node; \/\/ Node that this stack entry belongs to. member in struct:v8::internal::compiler::final::DFSStackEntry [all...] |
verifier.h | 17 class Node; 21 // each node, etc. 33 // Verifies consistency of node inputs and uses: 34 // - node inputs should agree with the input count computed from 35 // the node's operator. 39 // - if the node has control uses, it should produce control. 40 // - if the node has effect uses, it should produce effect. 41 // - if the node has frame state uses, it must be a frame state. 42 static void VerifyNode(Node* node); [all...] |
load-elimination.h | 38 Reduction Reduce(Node* node) final; 53 AbstractChecks(Node* node, Zone* zone) : AbstractChecks(zone) { 54 nodes_[next_index_++] = node; 57 AbstractChecks const* Extend(Node* node, Zone* zone) const { 59 that->nodes_[that->next_index_] = node; 63 Node* Lookup(Node* node) const [all...] |
control-flow-optimizer.h | 8 #include "src/compiler/node-marker.h" 20 class Node; 30 void Enqueue(Node* node); 31 void VisitNode(Node* node); 32 void VisitBranch(Node* node); 34 bool TryBuildSwitch(Node* node); [all...] |
memory-optimizer.h | 21 class Node; 25 // out-of-line data associated with each node. 48 AllocationGroup(Node* node, PretenureFlag pretenure, Zone* zone); 49 AllocationGroup(Node* node, PretenureFlag pretenure, Node* size, 53 void Add(Node* object); 54 bool Contains(Node* object) const; 58 Node* size() const { return size_; 108 Node* node; member in struct:v8::internal::compiler::final::Token [all...] |
machine-graph.cc | 7 #include "src/compiler/node-properties.h" 14 Node* MachineGraph::Int32Constant(int32_t value) { 15 Node** loc = cache_.FindInt32Constant(value); 22 Node* MachineGraph::Int64Constant(int64_t value) { 23 Node** loc = cache_.FindInt64Constant(value); 30 Node* MachineGraph::IntPtrConstant(intptr_t value) { 35 Node* MachineGraph::RelocatableInt32Constant(int32_t value, 37 Node** loc = cache_.FindRelocatableInt32Constant( 45 Node* MachineGraph::RelocatableInt64Constant(int64_t value, 47 Node** loc = cache_.FindRelocatableInt64Constant [all...] |
node.h | 24 // Each node has a mark which is a monotonically increasing integer, and a 25 // {NodeMarker} has a range of values that indicate states of a node. 30 // out-of-line data associated with each node. 34 // A Node is the basic primitive of graphs. Nodes are chained together by 42 // by the Node's id. 43 class V8_EXPORT_PRIVATE Node final { 45 static Node* New(Zone* zone, NodeId id, const Operator* op, int input_count, 46 Node* const* inputs, bool has_extensible_inputs); 47 static Node* Clone(Zone* zone, NodeId id, const Node* node) [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
CFGPrinter.h | 35 static std::string getSimpleNodeLabel(const BasicBlock *Node, 37 if (!Node->getName().empty()) 38 return Node->getNameStr(); 43 WriteAsOperand(OS, Node, false); 47 static std::string getCompleteNodeLabel(const BasicBlock *Node, 52 if (Node->getName().empty()) { 53 WriteAsOperand(OS, Node, false); 57 OS << *Node; 75 std::string getNodeLabel(const BasicBlock *Node, 78 return getSimpleNodeLabel(Node, Graph) [all...] |
/external/v8/src/builtins/ |
builtins-async-gen.cc | 15 using compiler::Node; 26 Node* AsyncBuiltinsAssembler::Await( 27 Node* context, Node* generator, Node* value, Node* outer_promise, 29 Node* on_resolve_context_index, Node* on_reject_context_index, 30 Node* is_predicted_as_caught) { 33 Node* const native_context = LoadNativeContext(context) [all...] |
builtins-math-gen.cc | 20 Node* context = Parameter(Descriptor::kContext); 30 Node* x = var_x.value(); 42 Node* pair = IntPtrAbsWithOverflow(x); 43 Node* overflow = Projection(1, pair); 47 Node* result = Projection(0, pair); 82 Node* x_value = LoadHeapNumberValue(x); 83 Node* value = Float64Abs(x_value); 84 Node* result = AllocateHeapNumberWithValue(value); 99 Node* context, Node* x [all...] |
builtins-date-gen.cc | 21 void Generate_DatePrototype_GetField(Node* context, Node* receiver, 25 void DateBuiltinsAssembler::Generate_DatePrototype_GetField(Node* context, 26 Node* receiver, 31 Node* receiver_instance_type = LoadInstanceType(receiver); 41 Node* date_cache_stamp = Load( 45 Node* cache_stamp = LoadObjectField(receiver, JSDate::kCacheStampOffset); 53 Node* field_index_smi = SmiConstant(field_index); 54 Node* function = 56 Node* result = CallCFunction2 [all...] |
builtins-sharedarraybuffer-gen.cc | 13 using compiler::Node; 22 typedef Node* (CodeAssembler::*AssemblerFunction)(MachineType type, 23 Node* base, Node* offset, 24 Node* value); 25 void ValidateSharedTypedArray(Node* tagged, Node* context, 26 Node** out_instance_type, 27 Node** out_backing_store); 28 Node* ConvertTaggedAtomicIndexToWord32(Node* tagged, Node* context [all...] |
/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/ |
Position.java | 24 import com.github.javaparser.ast.Node; 30 public static final Position ABSOLUTE_START = new Position(Node.ABSOLUTE_BEGIN_LINE,-1); 31 public static final Position ABSOLUTE_END = new Position(Node.ABSOLUTE_END_LINE,-1); 33 public static Position beginOf(Node node){ 34 return new Position(node.getBeginLine(),node.getBeginColumn()); 37 public static Position endOf(Node node){ 38 return new Position(node.getEndLine(),node.getEndColumn()) [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
ScheduleDAGSDNodes.h | 53 /// isPassiveNode - Return true if the node is a non-scheduled leaf. 55 static bool isPassiveNode(SDNode *Node) { 56 if (isa<ConstantSDNode>(Node)) return true; 57 if (isa<ConstantFPSDNode>(Node)) return true; 58 if (isa<RegisterSDNode>(Node)) return true; 59 if (isa<RegisterMaskSDNode>(Node)) return true; 60 if (isa<GlobalAddressSDNode>(Node)) return true; 61 if (isa<BasicBlockSDNode>(Node)) return true; 62 if (isa<FrameIndexSDNode>(Node)) return true; 63 if (isa<ConstantPoolSDNode>(Node)) return true [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/ |
ScheduleDAGSDNodes.h | 63 /// isPassiveNode - Return true if the node is a non-scheduled leaf. 65 static bool isPassiveNode(SDNode *Node) { 66 if (isa<ConstantSDNode>(Node)) return true; 67 if (isa<ConstantFPSDNode>(Node)) return true; 68 if (isa<RegisterSDNode>(Node)) return true; 69 if (isa<RegisterMaskSDNode>(Node)) return true; 70 if (isa<GlobalAddressSDNode>(Node)) return true; 71 if (isa<BasicBlockSDNode>(Node)) return true; 72 if (isa<FrameIndexSDNode>(Node)) return true; 73 if (isa<ConstantPoolSDNode>(Node)) return true [all...] |
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/observer/ |
PropagatingAstObserver.java | 24 import com.github.javaparser.ast.Node; 42 public void concretePropertyChange(Node observedNode, ObservableProperty property, Object oldValue, Object newValue) { 47 public void concreteListChange(NodeList observedNode, ListChangeType type, int index, Node nodeAddedOrRemoved) { 52 public void parentChange(Node observedNode, Node previousParent, Node newParent) { 59 public final void propertyChange(Node observedNode, ObservableProperty property, Object oldValue, Object newValue) { 66 public final void listChange(NodeList observedNode, ListChangeType type, int index, Node nodeAddedOrRemoved) { 76 public void listReplacement(NodeList observedNode, int index, Node oldNode, Node newNode) [all...] |
/external/syzkaller/pkg/ast/ |
walk.go | 6 // Walk calls callback cb for every top-level node in description. 8 func (desc *Description) Walk(cb func(Node)) { 14 func Recursive(cb func(Node)) func(Node) { 15 var rec func(Node) 16 rec = func(n Node) { 23 func (n *NewLine) Walk(cb func(Node)) {} 24 func (n *Comment) Walk(cb func(Node)) {} 25 func (n *Ident) Walk(cb func(Node)) {} 26 func (n *String) Walk(cb func(Node)) {} [all...] |
/external/apache-commons-bcel/src/examples/Mini/ |
SimpleNode.java | 27 public abstract class SimpleNode implements Node { 28 protected Node parent; 29 protected Node[] children; 51 public void jjtSetParent(Node n) { parent = n; } 52 public Node jjtGetParent() { return parent; } 54 public void jjtAddChild(Node n, int i) { 56 children = new Node[i + 1]; 58 Node c[] = new Node[i + 1]; 65 public Node jjtGetChild(int i) [all...] |
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
Node.java | 3 package com.google.clearsilver.jsilver.syntax.node; 8 public abstract class Node implements Switchable, Cloneable 10 private Node parent; 15 public Node parent() 20 void parent(@SuppressWarnings("hiding") Node parent) 25 abstract void removeChild(Node child); 26 abstract void replaceChild(Node oldChild, Node newChild); 28 public void replaceBy(Node node) [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/Support/ |
DOTGraphTraits.h | 62 /// isNodeHidden - If the function returns true, the given node is not 64 static bool isNodeHidden(const void *Node) { 68 /// getNodeLabel - Given a node and a pointer to the top level graph, return 69 /// the label to print in the node. 71 std::string getNodeLabel(const void *Node, const GraphType& Graph) { 75 /// hasNodeAddressLabel - If this method returns true, the address of the node 76 /// is added to the label of the node. 78 static bool hasNodeAddressLabel(const void *Node, const GraphType& Graph) { 82 /// If you want to specify custom node attributes, this is the place to do so 85 static std::string getNodeAttributes(const void *Node, [all...] |
/external/v8/src/profiler/ |
unbound-queue-inl.h | 14 struct UnboundQueue<Record>::Node: public Malloced { 15 explicit Node(const Record& value) : value(value), next(nullptr) {} 18 Node* next; 24 first_ = new Node(Record()); 37 Node* tmp = first_; 46 Node* next = reinterpret_cast<Node*>(divider_)->next; 55 Node*& next = reinterpret_cast<Node*>(last_)->next; 56 next = new Node(rec) [all...] |