Home
last modified time | relevance | path

Searched refs:G (Results 1 – 25 of 1046) sorted by relevance

12345678910>>...42

/NextBSD/sys/dev/ath/ath_rate/sample/
HDtx_schedules.h118 #define G(_r) \ macro
124 { 3,G( 1), 3,G( 1), 0,G( 1), 0,G( 1) }, /* 1Mb/s */
125 { 4,G( 2), 3,G( 1), 4,G( 1), 0,G( 1) }, /* 2Mb/s */
126 { 4,G(5.5),3,G( 2), 4,G( 1), 2,G( 1) }, /* 5.5Mb/s */
127 { 4,G(11), 3,G(5.5), 4,G( 2), 2,G( 1) }, /* 11Mb/s */
128 { 4,G( 6), 3,G(5.5), 4,G( 2), 2,G( 1) }, /* 6Mb/s */
129 { 4,G( 9), 3,G( 6), 4,G(5.5), 2,G( 1) }, /* 9Mb/s */
130 { 4,G(12), 3,G( 11), 4,G(5.5), 2,G( 1) }, /* 12Mb/s */
131 { 4,G(18), 3,G( 12), 4,G( 11), 2,G( 1) }, /* 18Mb/s */
132 { 4,G(24), 3,G( 18), 4,G( 12), 2,G( 1) }, /* 24Mb/s */
[all …]
/NextBSD/contrib/gcc/
HDggc-page.c143 #define PAGE_L2_BITS (32 - PAGE_L1_BITS - G.lg_pagesize)
151 (((size_t) (p) >> G.lg_pagesize) & ((1 << PAGE_L2_BITS) - 1))
462 } G; variable
515 if (G.depth_in_use >= G.depth_max) in push_depth()
517 G.depth_max *= 2; in push_depth()
518 G.depth = xrealloc (G.depth, G.depth_max * sizeof (unsigned int)); in push_depth()
520 G.depth[G.depth_in_use++] = i; in push_depth()
528 if (G.by_depth_in_use >= G.by_depth_max) in push_by_depth()
530 G.by_depth_max *= 2; in push_by_depth()
531 G.by_depth = xrealloc (G.by_depth, in push_by_depth()
[all …]
HDggc-zone.c160 #define GGC_PAGE_SIZE G.pagesize
161 #define GGC_PAGE_MASK G.page_mask
162 #define GGC_PAGE_SHIFT G.lg_pagesize
377 } G; variable
509 base = &G.lookup[0]; in lookup_page_table_entry()
511 page_table table = G.lookup; in lookup_page_table_entry()
535 base = &G.lookup[0]; in set_page_table_entry()
539 for (table = G.lookup; table; table = table->next) in set_page_table_entry()
545 table->next = G.lookup; in set_page_table_entry()
547 G.lookup = table; in set_page_table_entry()
[all …]
/NextBSD/contrib/netbsd-tests/bin/df/
HDt_df.sh97 filer:/ 1.1T 229G 918G 20% /filer
98 filer:/ 1.1T 688G 459G 60% /filer
99 filer:/ 1.1T 1.1T 57G 95% /filer
102 filer:/ 1.1T 229G 860G 21% /filer
103 filer:/ 1.1T 688G 401G 63% /filer
105 filer:/ 1.1T 1.1T -57G 105% /filer
107 filer:/ 1.1T 229G 803G 22% /filer
108 filer:/ 1.1T 688G 344G 66% /filer
109 filer:/ 1.1T 1.1T -57G 105% /filer
110 filer:/ 1.1T 1.1T -115G 111% /filer
[all …]
/NextBSD/contrib/llvm/include/llvm/CodeGen/PBQP/
HDReductionRules.h29 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1() argument
36 assert(G.getNodeDegree(NId) == 1 && in applyR1()
39 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1()
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
42 const Matrix &ECosts = G.getEdgeCosts(EId); in applyR1()
43 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
44 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
47 if (NId == G.getEdgeNode1Id(EId)) { in applyR1()
68 G.setNodeCosts(MId, YCosts); in applyR1()
69 G.disconnectEdge(EId, MId); in applyR1()
[all …]
HDGraph.h83 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { in removeAdjEdgeId() argument
90 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx); in removeAdjEdgeId()
120 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) { in connectToN() argument
123 NodeEntry &N = G.getNode(NIds[NIdx]); in connectToN()
127 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { in connectTo() argument
129 connectToN(G, ThisEdgeId, 0); in connectTo()
132 connectToN(G, ThisEdgeId, 1); in connectTo()
136 void connect(Graph &G, EdgeId ThisEdgeId) { in connect() argument
137 connectToN(G, ThisEdgeId, 0); in connect()
138 connectToN(G, ThisEdgeId, 1); in connect()
[all …]
/NextBSD/sys/dev/hatm/
HDif_hatmreg.h138 #define HE_REGO_RBP_S(K,G) (HE_REGO_G0_RBPS_S + (K) * 0x10 + (G) * 0x20) argument
139 #define HE_REGO_RBP_T(K,G) (HE_REGO_G0_RBPS_T + (K) * 0x10 + (G) * 0x20) argument
140 #define HE_REGO_RBP_QI(K,G) (HE_REGO_G0_RBPS_QI + (K) * 0x10 + (G) * 0x20) argument
141 #define HE_REGO_RBP_BL(K,G) (HE_REGO_G0_RBPS_BL + (K) * 0x10 + (G) * 0x20) argument
157 #define HE_REGO_RBRQ_ST(G) (HE_REGO_G0_RBRQ_ST + (G) * 0x10) argument
158 #define HE_REGO_RBRQ_H(G) (HE_REGO_G0_RBRQ_H + (G) * 0x10) argument
159 #define HE_REGO_RBRQ_Q(G) (HE_REGO_G0_RBRQ_Q + (G) * 0x10) argument
160 #define HE_REGO_RBRQ_I(G) (HE_REGO_G0_RBRQ_I + (G) * 0x10) argument
173 #define HE_REGO_INMQ_S(G) (HE_REGO_G0_INMQ_S + (G) * 8) argument
174 #define HE_REGO_INMQ_L(G) (HE_REGO_G0_INMQ_L + (G) * 8) argument
[all …]
/NextBSD/contrib/llvm/include/llvm/ADT/
HDDepthFirstIterator.h133 static df_iterator begin(const GraphT &G) { in begin() argument
134 return df_iterator(GT::getEntryNode(G)); in begin()
136 static df_iterator end(const GraphT &G) { return df_iterator(); } in end() argument
139 static df_iterator begin(const GraphT &G, SetType &S) { in begin() argument
140 return df_iterator(GT::getEntryNode(G), S); in begin()
142 static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); } in end() argument
202 df_iterator<T> df_begin(const T& G) { in df_begin() argument
203 return df_iterator<T>::begin(G); in df_begin()
207 df_iterator<T> df_end(const T& G) { in df_end() argument
208 return df_iterator<T>::end(G); in df_end()
[all …]
HDPostOrderIterator.h137 static po_iterator begin(GraphT G) { in begin() argument
138 return po_iterator(GT::getEntryNode(G)); in begin()
140 static po_iterator end(GraphT G) { return po_iterator(); } in end() argument
142 static po_iterator begin(GraphT G, SetType &S) { in begin() argument
143 return po_iterator(GT::getEntryNode(G), S); in begin()
145 static po_iterator end(GraphT G, SetType &S) { return po_iterator(S); } in end() argument
178 po_iterator<T> po_begin(const T &G) { return po_iterator<T>::begin(G); } in po_begin() argument
180 po_iterator<T> po_end (const T &G) { return po_iterator<T>::end(G); } in po_end() argument
182 template <class T> iterator_range<po_iterator<T>> post_order(const T &G) { in post_order() argument
183 return make_range(po_begin(G), po_end(G)); in post_order()
[all …]
/NextBSD/contrib/llvm/include/llvm/CodeGen/
HDRegAllocPBQP.h347 RegAllocSolverImpl(Graph &G) : G(G) {} in RegAllocSolverImpl() argument
350 G.setSolver(*this); in solve()
353 S = backpropagate(G, reduce()); in solve()
354 G.unsetSolver(); in solve()
359 assert(G.getNodeCosts(NId).getLength() > 1 && in handleAddNode()
361 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); in handleAddNode()
367 handleReconnectEdge(EId, G.getEdgeNode1Id(EId)); in handleAddEdge()
368 handleReconnectEdge(EId, G.getEdgeNode2Id(EId)); in handleAddEdge()
372 handleDisconnectEdge(EId, G.getEdgeNode1Id(EId)); in handleRemoveEdge()
373 handleDisconnectEdge(EId, G.getEdgeNode2Id(EId)); in handleRemoveEdge()
[all …]
/NextBSD/contrib/llvm/lib/CodeGen/
HDRegAllocPBQP.cpp129 void initializeGraph(PBQPRAGraph &G, VirtRegMap &VRM, Spiller &VRegSpiller);
138 bool mapPBQPToRegAlloc(const PBQPRAGraph &G,
155 void apply(PBQPRAGraph &G) override { in apply() argument
156 LiveIntervals &LIS = G.getMetadata().LIS; in apply()
162 for (auto NId : G.nodeIds()) { in apply()
164 LIS.getInterval(G.getNodeMetadata(NId).getVReg()).weight; in apply()
169 PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId)); in apply()
171 G.setNodeCosts(NId, std::move(NodeCosts)); in apply()
187 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs() argument
190 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs(); in haveDisjointAllowedRegs()
[all …]
HDScheduleDAGPrinter.cpp34 static std::string getGraphName(const ScheduleDAG *G) { in getGraphName()
35 return G->MF.getName(); in getGraphName()
70 static void addCustomGraphFeatures(ScheduleDAG *G, in addCustomGraphFeatures()
72 return G->addCustomGraphFeatures(GW); in addCustomGraphFeatures()
78 const ScheduleDAG *G) { in getNodeLabel() argument
79 return G->getGraphNodeLabel(SU); in getNodeLabel()
HDMachineBlockFrequencyInfo.cpp59 const NodeType *getEntryNode(const MachineBlockFrequencyInfo *G) { in getEntryNode()
60 return G->getFunction()->begin(); in getEntryNode()
71 static nodes_iterator nodes_begin(const MachineBlockFrequencyInfo *G) { in nodes_begin()
72 return G->getFunction()->begin(); in nodes_begin()
75 static nodes_iterator nodes_end(const MachineBlockFrequencyInfo *G) { in nodes_end()
76 return G->getFunction()->end(); in nodes_end()
86 static std::string getGraphName(const MachineBlockFrequencyInfo *G) { in getGraphName()
87 return G->getFunction()->getName(); in getGraphName()
/NextBSD/contrib/llvm/lib/Analysis/
HDLazyCallGraph.cpp56 LazyCallGraph::Node::Node(LazyCallGraph &G, Function &F) in Node() argument
57 : G(&G), F(F), DFSNumber(0), LowLink(0) { in Node()
79 if (Node *N = G->lookup(Callee)) in insertEdgeInternal()
133 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G) in LazyCallGraph() argument
134 : BPA(std::move(G.BPA)), NodeMap(std::move(G.NodeMap)), in LazyCallGraph()
135 EntryNodes(std::move(G.EntryNodes)), in LazyCallGraph()
136 EntryIndexMap(std::move(G.EntryIndexMap)), SCCBPA(std::move(G.SCCBPA)), in LazyCallGraph()
137 SCCMap(std::move(G.SCCMap)), LeafSCCs(std::move(G.LeafSCCs)), in LazyCallGraph()
138 DFSStack(std::move(G.DFSStack)), in LazyCallGraph()
139 SCCEntryNodes(std::move(G.SCCEntryNodes)), in LazyCallGraph()
[all …]
/NextBSD/contrib/llvm/include/llvm/Analysis/
HDLazyCallGraph.h122 LazyCallGraph *G; variable
126 iterator(LazyCallGraph &G, NodeVectorImplT::iterator NI, in iterator() argument
128 : iterator_adaptor_base(NI), G(&G), E(E) { in iterator()
149 Node &ChildN = G->get(*F);
164 LazyCallGraph *G; variable
177 Node(LazyCallGraph &G, Function &F);
196 return iterator(*G, Callees.begin(), Callees.end()); in begin()
198 iterator end() const { return iterator(*G, Callees.end(), Callees.end()); } in end()
214 LazyCallGraph *G; variable
218 SCC(LazyCallGraph &G) : G(&G) {} in SCC() argument
[all …]
HDCallGraph.h317 std::unique_ptr<CallGraph> G; variable
327 const CallGraph &getCallGraph() const { return *G; } in getCallGraph()
328 CallGraph &getCallGraph() { return *G; } in getCallGraph()
334 Module &getModule() const { return G->getModule(); } in getModule()
336 inline iterator begin() { return G->begin(); } in begin()
337 inline iterator end() { return G->end(); } in end()
338 inline const_iterator begin() const { return G->begin(); } in begin()
339 inline const_iterator end() const { return G->end(); } in end()
343 return (*G)[F];
347 inline CallGraphNode *operator[](const Function *F) { return (*G)[F]; }
[all …]
/NextBSD/contrib/llvm/lib/Target/AArch64/
HDAArch64PBQPRegAlloc.cpp159 bool A57ChainingConstraint::addIntraChainConstraint(PBQPRAGraph &G, unsigned Rd, in addIntraChainConstraint() argument
164 LiveIntervals &LIs = G.getMetadata().LIS; in addIntraChainConstraint()
174 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addIntraChainConstraint()
175 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); in addIntraChainConstraint()
178 &G.getNodeMetadata(node1).getAllowedRegs(); in addIntraChainConstraint()
180 &G.getNodeMetadata(node2).getAllowedRegs(); in addIntraChainConstraint()
182 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
186 if (edge == G.invalidEdgeId()) { in addIntraChainConstraint()
203 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
207 if (G.getEdgeNode1Id(edge) == node2) { in addIntraChainConstraint()
[all …]
HDAArch64A57FPLoadBalancing.cpp141 bool colorChain(Chain *G, Color C, MachineBasicBlock &MBB);
142 int scavengeRegister(Chain *G, Color C, MachineBasicBlock &MBB);
464 while (Chain *G = getAndEraseNext(PreferredColor, GV)) { in colorChainSet() local
469 C = G->getPreferredColor(); in colorChainSet()
477 if (G->requiresFixup() && C != G->getPreferredColor()) { in colorChainSet()
478 C = G->getPreferredColor(); in colorChainSet()
479 DEBUG(dbgs() << " - " << G->str() << " - not worthwhile changing; " in colorChainSet()
483 Changed |= colorChain(G, C, MBB); in colorChainSet()
485 Parity += (C == Color::Even) ? G->size() : -G->size(); in colorChainSet()
492 int AArch64A57FPLoadBalancing::scavengeRegister(Chain *G, Color C, in scavengeRegister() argument
[all …]
/NextBSD/tools/tools/bus_autoconf/
HDbus_autoconf.sh50 G=$(basename ${F})
57 ${OBJCOPY} -j usb_host_id -O binary ${F} "usb_host_id,${G}" 2> /dev/null
58 [ -f "usb_host_id,${G}" ] && (echo -n " -i usb_host_id,${G}" >> bus_autoconf_args.txt)
61 ${OBJCOPY} -j usb_device_id -O binary ${F} "usb_device_id,${G}" 2> /dev/null
62 [ -f "usb_device_id,${G}" ] && (echo -n " -i usb_device_id,${G}" >> bus_autoconf_args.txt)
65 ${OBJCOPY} -j usb_dual_id -O binary ${F} "usb_dual_id,${G}" 2> /dev/null
66 [ -f "usb_dual_id,${G}" ] && (echo -n " -i usb_dual_id,${G}" >> bus_autoconf_args.txt)
/NextBSD/contrib/llvm/lib/CodeGen/SelectionDAG/
HDSelectionDAGDumper.cpp33 std::string SDNode::getOperationName(const SelectionDAG *G) const { in getOperationName()
39 if (G) in getOperationName()
40 if (const TargetInstrInfo *TII = G->getSubtarget().getInstrInfo()) in getOperationName()
45 if (G) { in getOperationName()
46 const TargetLowering &TLI = G->getTargetLoweringInfo(); in getOperationName()
116 else if (const TargetIntrinsicInfo *TII = G->getTarget().getIntrinsicInfo()) in getOperationName()
356 void SDNode::dump(const SelectionDAG *G) const { in dump()
357 print(dbgs(), G); in dump()
361 void SDNode::print_types(raw_ostream &OS, const SelectionDAG *G) const { in print_types()
371 OS << " = " << getOperationName(G); in print_types()
[all …]
HDSelectionDAGPrinter.cpp75 static std::string getGraphName(const SelectionDAG *G) { in getGraphName()
76 return G->getMachineFunction().getName(); in getGraphName()
104 const SelectionDAG *G) { in getSimpleNodeLabel()
105 std::string Result = Node->getOperationName(G); in getSimpleNodeLabel()
108 Node->print_details(OS, G); in getSimpleNodeLabel()
127 static void addCustomGraphFeatures(SelectionDAG *G, in addCustomGraphFeatures()
130 if (G->getRoot().getNode()) in addCustomGraphFeatures()
131 GW.emitEdge(nullptr, -1, G->getRoot().getNode(), G->getRoot().getResNo(), in addCustomGraphFeatures()
138 const SelectionDAG *G) { in getNodeLabel() argument
139 return DOTGraphTraits<SelectionDAG*>::getSimpleNodeLabel(Node, G); in getNodeLabel()
/NextBSD/contrib/llvm/include/llvm/Support/
HDGraphWriter.h58 const GraphType &G; variable
95 GraphWriter(raw_ostream &o, const GraphType &g, bool SN) : O(o), G(g) { in GraphWriter()
107 DOTGraphTraits<GraphType>::addCustomGraphFeatures(G, *this);
114 std::string GraphName = DTraits.getGraphName(G); in writeHeader()
130 O << DTraits.getGraphProperties(G); in writeHeader()
141 for (node_iterator I = GTraits::nodes_begin(G), E = GTraits::nodes_end(G); in writeNodes()
168 std::string NodeAttributes = DTraits.getNodeAttributes(Node, G); in writeNode()
175 O << DOT::EscapeString(DTraits.getNodeLabel(Node, G)); in writeNode()
178 if (DTraits.hasNodeAddressLabel(Node, G)) in writeNode()
181 std::string NodeDesc = DTraits.getNodeDescription(Node, G); in writeNode()
[all …]
/NextBSD/contrib/llvm/lib/Transforms/IPO/
HDMergeFunctions.cpp400 void replaceBy(Function *G) const { in replaceBy()
401 assert(!(*this < FunctionNode(G)) && !(FunctionNode(G) < *this) && in replaceBy()
404 F = G; in replaceBy()
1123 void mergeTwoFunctions(Function *F, Function *G);
1126 void writeThunkOrAlias(Function *F, Function *G);
1130 void writeThunk(Function *F, Function *G);
1133 void writeAlias(Function *F, Function *G);
1136 void replaceFunctionInTree(FnTreeType::iterator &IterToF, Function *G);
1292 void MergeFunctions::writeThunkOrAlias(Function *F, Function *G) { in writeThunkOrAlias() argument
1293 if (HasGlobalAliases && G->hasUnnamedAddr()) { in writeThunkOrAlias()
[all …]
/NextBSD/contrib/llvm/lib/Support/
HDMD5.cpp52 #define G(x, y, z) ((y) ^ ((z) & ((x) ^ (y)))) macro
113 STEP(G, a, b, c, d, GET(1), 0xf61e2562, 5) in body()
114 STEP(G, d, a, b, c, GET(6), 0xc040b340, 9) in body()
115 STEP(G, c, d, a, b, GET(11), 0x265e5a51, 14) in body()
116 STEP(G, b, c, d, a, GET(0), 0xe9b6c7aa, 20) in body()
117 STEP(G, a, b, c, d, GET(5), 0xd62f105d, 5) in body()
118 STEP(G, d, a, b, c, GET(10), 0x02441453, 9) in body()
119 STEP(G, c, d, a, b, GET(15), 0xd8a1e681, 14) in body()
120 STEP(G, b, c, d, a, GET(4), 0xe7d3fbc8, 20) in body()
121 STEP(G, a, b, c, d, GET(9), 0x21e1cde6, 5) in body()
[all …]
/NextBSD/contrib/compiler-rt/lib/tsan/rtl/
HDtsan_md5.cc18 #define G(x, y, z) ((y) ^ ((z) & ((x) ^ (y)))) macro
75 STEP(G, a, b, c, d, GET(1), 0xf61e2562, 5) in body()
76 STEP(G, d, a, b, c, GET(6), 0xc040b340, 9) in body()
77 STEP(G, c, d, a, b, GET(11), 0x265e5a51, 14) in body()
78 STEP(G, b, c, d, a, GET(0), 0xe9b6c7aa, 20) in body()
79 STEP(G, a, b, c, d, GET(5), 0xd62f105d, 5) in body()
80 STEP(G, d, a, b, c, GET(10), 0x02441453, 9) in body()
81 STEP(G, c, d, a, b, GET(15), 0xd8a1e681, 14) in body()
82 STEP(G, b, c, d, a, GET(4), 0xe7d3fbc8, 20) in body()
83 STEP(G, a, b, c, d, GET(9), 0x21e1cde6, 5) in body()
[all …]

12345678910>>...42