back\-end (full) in projects: freebsd - OpenGrok search results

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched +full:back +full:- +full:end (Results 1 – 25 of 1048) sorted by relevance

12 3 4 5 6 7 8 9 10 >>...42

/freebsd/lib/libpmc/pmu-events/arch/x86/icelakex/
H A D	frontend.json	3 …t end is resteered, mainly when the BPU cannot provide a correct prediction and this is corrected … 9 …"PublicDescription": "Counts the number of times the front-end is resteered when it finds a branch… 15 "BriefDescription": "Decode Stream Buffer (DSB)-to-MITE transitions count.", 23 …"PublicDescription": "Counts the number of Decode Stream Buffer (DSB a.k.a. Uop Cache)-to-MITE spe… 29 "BriefDescription": "DSB-to-MITE switch true penalty cycles.", 35 …"PublicDescription": "Decode Stream Buffer (DSB) is a Uop-cache that holds translations of previou… 50 …Instructions that experienced DSB (Decode stream buffer i.e. the decoded instruction-cache) miss.", 65 …e stream buffer i.e. the decoded instruction-cache) miss. Critical means stalls were exposed to th… 116 "BriefDescription": "Retired instructions after front-end starvation of at least 1 cycle", 125 …r an interval where the front-end delivered no uops for a period of at least 1 cycle which was not… [all …]
/freebsd/lib/libpmc/pmu-events/arch/x86/icelake/
H A D	frontend.json	3 …t end is resteered, mainly when the BPU cannot provide a correct prediction and this is corrected … 9 …"PublicDescription": "Counts the number of times the front-end is resteered when it finds a branch… 15 "BriefDescription": "Decode Stream Buffer (DSB)-to-MITE transitions count.", 23 …"PublicDescription": "Counts the number of Decode Stream Buffer (DSB a.k.a. Uop Cache)-to-MITE spe… 29 "BriefDescription": "DSB-to-MITE switch true penalty cycles.", 35 …"PublicDescription": "Decode Stream Buffer (DSB) is a Uop-cache that holds translations of previou… 50 …Instructions that experienced DSB (Decode stream buffer i.e. the decoded instruction-cache) miss.", 65 …e stream buffer i.e. the decoded instruction-cache) miss. Critical means stalls were exposed to th… 116 "BriefDescription": "Retired instructions after front-end starvation of at least 1 cycle", 125 …r an interval where the front-end delivered no uops for a period of at least 1 cycle which was not… [all …]
/freebsd/lib/libpmc/pmu-events/arch/x86/tigerlake/
H A D	frontend.json	3 …t end is resteered, mainly when the BPU cannot provide a correct prediction and this is corrected … 9 …"PublicDescription": "Counts the number of times the front-end is resteered when it finds a branch… 14 "BriefDescription": "Decode Stream Buffer (DSB)-to-MITE transitions count.", 22 …"PublicDescription": "Counts the number of Decode Stream Buffer (DSB a.k.a. Uop Cache)-to-MITE spe… 27 "BriefDescription": "DSB-to-MITE switch true penalty cycles.", 33 …"PublicDescription": "Decode Stream Buffer (DSB) is a Uop-cache that holds translations of previou… 47 …Instructions that experienced DSB (Decode stream buffer i.e. the decoded instruction-cache) miss.", 62 …e stream buffer i.e. the decoded instruction-cache) miss. Critical means stalls were exposed to th… 113 "BriefDescription": "Retired instructions after front-end starvation of at least 1 cycle", 122 …r an interval where the front-end delivered no uops for a period of at least 1 cycle which was not… [all …]
/freebsd/lib/libpmc/pmu-events/arch/x86/sapphirerapids/
H A D	frontend.json	9 …e number of prefixes in a 16B-line. This may result in a three-cycle penalty for each LCP (Length … 14 "BriefDescription": "DSB-to-MITE switch true penalty cycles.", 20 …"PublicDescription": "Decode Stream Buffer (DSB) is a Uop-cache that holds translations of previou… 34 …Instructions that experienced DSB (Decode stream buffer i.e. the decoded instruction-cache) miss.", 49 …e stream buffer i.e. the decoded instruction-cache) miss. Critical means stalls were exposed to th… 100 "BriefDescription": "Retired instructions after front-end starvation of at least 1 cycle", 109 …r an interval where the front-end delivered no uops for a period of at least 1 cycle which was not… 115 …fter an interval where the front-end delivered no uops for a period of 128 cycles which was not in… 124 …fter an interval where the front-end delivered no uops for a period of 128 cycles which was not in… 130 …fter an interval where the front-end delivered no uops for a period of 16 cycles which was not int… [all …]
/freebsd/contrib/less/
H A D	lesskey.nro	`4 lesskey \- customize key bindings for less 6 .B "lesskey [\-o output] [\-\-] [input]" 8 .B "lesskey [\-\-output=output] [\-\-] [input]" 10 .B "lesskey \-V" 12 .B "lesskey \-\-version" 46 .IP #line-edit 47 Customizes line-editing key bindings. 64 \fIstring\fP <whitespace> \fIaction\fP <whitespace> [extra-string] <newline> 91 \ekB ctrl-BACKSPACE 94 \eke END [all …]`
H A D	jump.c	2 * Copyright (C) 1984-2025 Mark Nudelman 26 * Jump to the end of the file. 35 error("Cannot seek to end of file", NULL_PARG); in jump_forw() 39 if (position(sc_height-1) == end_pos) in jump_forw() 52 * Go back one line from the end of the file in jump_forw() 58 jump_loc(ch_zero(), sc_height-1); in jump_forw() 61 jump_loc(pos, sc_height-1); in jump_forw() 62 if (position(sc_height-1) != end_pos) in jump_forw() 72 POSITION end; in jump_forw_buffered() local 76 error("Cannot seek to end of buffers", NULL_PARG); in jump_forw_buffered() [all …]
/freebsd/lib/libpmc/pmu-events/arch/x86/goldmont/
H A D	pipeline.json	263 …ocation is stalled waiting for a mispredicted jump to retire or other branch-like conditions (e.g.… 273 …ource in the backend. Including but not limited to resources such as the Re-order Buffer (ROB), r… 352 "BriefDescription": "Self-Modifying Code detected", 357 …ction and has to perform a machine clear because of that modification. Self-modifying code (SMC) … 362 "BriefDescription": "Uops issued to the back end per cycle", 367 …end and allocated into the back end of the machine. This event counts uops that retire as well as… 371 "BriefDescription": "Uops requested but not-delivered to the back-end per cycle", 376 …-end inefficiencies. I.e. when front-end of the machine is not delivering uops to the back-end and… 407 …ued by the micro-sequencer (MS). Counts both the uops from a micro-coded instruction, and the uop…
/freebsd/contrib/llvm-project/clang/lib/Format/
H A D	FormatTokenLexer.cpp	1 //===--- FormatTokenLexer.cpp - Lex FormatTokens -------------- C++ -----===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 13 //===----------------------------------------------------------------------===// 38 Lex->SetKeepWhitespaceMode(true); 100 if (Tokens.back()->NewlinesBefore > 0 \|\| Tokens.back()->IsMultiline) in lex() 101 FirstInLineIndex = Tokens.size() - 1; in lex() 102 } while (Tokens.back()->isNot(tok::eof)); in lex() 104 auto &TokEOF = *Tokens.back(); in lex() 138 Tokens.back()->Tok.setKind(tok::pipepipe); in tryMergePreviousTokens() [all …]
H A D	MacroCallReconstructor.cpp	1 //===--- MacroCallReconstructor.cpp - Format C++ code ------------ C++ --===// 8 //===----------------------------------------------------------------------===// 14 //===----------------------------------------------------------------------===// 24 #define DEBUG_TYPE "format-reconstruct" 63 Result.Tokens.front()->Children.size() == 1); in takeResult() 65 *Result.Tokens.front()->Children.front(), Result.Level); in takeResult() 77 llvm::dbgs() << "MCR: Token: " << Token->TokenText << ", Parent: " in add() 78 << (ExpandedParent ? ExpandedParent->TokenText : "<null>") in add() 98 if (!ActiveExpansions.empty() && Token->MacroCtx && in add() 99 (Token->MacroCtx->Role != MR_Hidden \|\| in add() [all …]
/freebsd/lib/libpmc/pmu-events/arch/x86/skylake/
H A D	frontend.json	3 …t end is resteered, mainly when the BPU cannot provide a correct prediction and this is corrected … 8 …"PublicDescription": "Counts the number of times the front-end is resteered when it finds a branch… 13 "BriefDescription": "Decode Stream Buffer (DSB)-to-MITE switches", 18 …e Decode Stream Buffer (DSB)-to-MITE switches including all misses because of missing Decode Strea… 23 "BriefDescription": "Decode Stream Buffer (DSB)-to-MITE switch true penalty cycles.", 28 …-to-MITE switch true penalty cycles. These cycles do not include uops routed through because of th… 41 …Instructions that experienced DSB (Decode stream buffer i.e. the decoded instruction-cache) miss.", 55 …e stream buffer i.e. the decoded instruction-cache) miss. Critical means stalls were exposed to th… 101 "BriefDescription": "Retired instructions after front-end starvation of at least 1 cycle", 109 …r an interval where the front-end delivered no uops for a period of at least 1 cycle which was not… [all …]
/freebsd/lib/libpmc/pmu-events/arch/x86/cascadelakex/
H A D	frontend.json	3 …t end is resteered, mainly when the BPU cannot provide a correct prediction and this is corrected … 8 …"PublicDescription": "Counts the number of times the front-end is resteered when it finds a branch… 13 "BriefDescription": "Decode Stream Buffer (DSB)-to-MITE switches", 18 …e Decode Stream Buffer (DSB)-to-MITE switches including all misses because of missing Decode Strea… 23 "BriefDescription": "Decode Stream Buffer (DSB)-to-MITE switch true penalty cycles.", 28 …-to-MITE switch true penalty cycles. These cycles do not include uops routed through because of th… 41 …Instructions that experienced DSB (Decode stream buffer i.e. the decoded instruction-cache) miss.", 55 …e stream buffer i.e. the decoded instruction-cache) miss. Critical means stalls were exposed to th… 101 "BriefDescription": "Retired instructions after front-end starvation of at least 1 cycle", 109 …r an interval where the front-end delivered no uops for a period of at least 1 cycle which was not… [all …]
/freebsd/lib/libpmc/pmu-events/arch/x86/skylakex/
H A D	frontend.json	3 …t end is resteered, mainly when the BPU cannot provide a correct prediction and this is corrected … 8 …"PublicDescription": "Counts the number of times the front-end is resteered when it finds a branch… 13 "BriefDescription": "Decode Stream Buffer (DSB)-to-MITE switches", 18 …e Decode Stream Buffer (DSB)-to-MITE switches including all misses because of missing Decode Strea… 23 "BriefDescription": "Decode Stream Buffer (DSB)-to-MITE switch true penalty cycles.", 28 …-to-MITE switch true penalty cycles. These cycles do not include uops routed through because of th… 41 …Instructions that experienced DSB (Decode stream buffer i.e. the decoded instruction-cache) miss.", 55 …e stream buffer i.e. the decoded instruction-cache) miss. Critical means stalls were exposed to th… 101 "BriefDescription": "Retired instructions after front-end starvation of at least 1 cycle", 109 …r an interval where the front-end delivered no uops for a period of at least 1 cycle which was not… [all …]
/freebsd/contrib/llvm-project/lldb/include/lldb/Utility/
H A D	RangeMap.h	1 //===-- RangeMap.h -------- 191 auto end = m_entries.end(); Insert() local 224 typename Collection::const_iterator pos, end, prev; IsSorted() local 252 Entry &back = minimal_ranges.back(); CombineConsecutiveRanges() local 284 typename Collection::iterator pos, end; Slide() local 306 Entry Back() { return (m_entries.empty() ? nullptr : &m_entries.back()); } Back() function 308 const Entry Back() const { Back() function 323 typename Collection::const_iterator end = m_entries.end(); FindEntryIndexThatContains() local 345 typename Collection::const_iterator end = m_entries.end(); FindEntryThatContains() local 367 typename Collection::const_iterator end = m_entries.end(); FindEntryThatContains() local 385 const_iterator end() const { return m_entries.end(); } end() function 398 auto end = m_entries.end(); CombinePrevAndNext() local 453 Erase(uint32_t start,uint32_t end) Erase() argument 476 typename Collection::const_iterator pos, end, prev; IsSorted() local 491 typename Collection::iterator end; CombineConsecutiveEntriesWithEqualData() local 579 typename Collection::const_iterator end = m_entries.end(); FindEntryThatContains() local 597 auto begin = m_entries.begin(), end = m_entries.end(); FindEntryStartsAt() local 620 typename Collection::const_iterator end = m_entries.end(); FindEntryThatContainsOrFollows() local 646 Entry Back() { return (m_entries.empty() ? nullptr : &m_entries.back()); } Back() function 648 const Entry Back() const { Back() function 654 const_iterator end() const { return m_entries.end(); } end() function 756 typename Collection::const_iterator pos, end, prev; IsSorted() local 794 typename Collection::iterator end = m_entries.end(); FindEntry() local 815 Entry Back() { return (m_entries.empty() ? nullptr : &m_entries.back()); } Back() function 817 const Entry Back() const { Back() function [all...]
/freebsd/contrib/llvm-project/clang/lib/Lex/
H A D	PPConditionalDirectiveRecord.cpp	1 //===--- PPConditionalDirectiveRecord.h - Preprocessing Directives-- C++ --=// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 12 //===----------------------------------------------------------------------===// 30 if (low == CondDirectiveLocs.end()) in rangeIntersectsConditionalDirective() 33 if (SourceMgr.isBeforeInTranslationUnit(Range.getEnd(), low->getLoc())) in rangeIntersectsConditionalDirective() 37 upp = std::upper_bound(low, CondDirectiveLocs.end(), in rangeIntersectsConditionalDirective() 40 if (upp != CondDirectiveLocs.end()) in rangeIntersectsConditionalDirective() 41 uppRegion = upp->getRegionLoc(); in rangeIntersectsConditionalDirective() 43 return low->getRegionLoc() != uppRegion; in rangeIntersectsConditionalDirective() [all …]
/freebsd/lib/libpmc/pmu-events/arch/x86/goldmontplus/
H A D	pipeline.json	284 "BriefDescription": "Instructions retired - using Reduced Skid PEBS feature", 312 …ocation is stalled waiting for a mispredicted jump to retire or other branch-like conditions (e.g.… 324 …ource in the backend. Including but not limited to resources such as the Re-order Buffer (ROB), r… 419 …r of times that the machines clears due to a page fault. Covers both I-side and D-side(Loads/Store… 424 "BriefDescription": "Self-Modifying Code detected", 431 …ction and has to perform a machine clear because of that modification. Self-modifying code (SMC) … 436 "BriefDescription": "Uops issued to the back end per cycle", 443 …end and allocated into the back end of the machine. This event counts uops that retire as well as… 447 "BriefDescription": "Uops requested but not-delivered to the back-end per cycle", 454 …-end inefficiencies. I.e. when front-end of the machine is not delivering uops to the back-end and… [all …]
/freebsd/share/doc/usd/12.vi/summary/
H A D	vi.summary	`76 % ex \fIname\fP edit \fIname\fP, start at end 78 % ex \-t \fItag\fP start at \fItag\fP 79 % ex \-r list saved files 80 % ex \-r \fIname\fP recover file \fIname\fP 82 % ex \-R \fIname\fP read only mode 127 $ last \fIx\fP-\fIn\fP \fIn\fP before \fIx\fP 129 \- previous \(aa\fIx\fP marked with \fIx\fP 168 lisp \fB( ) { }\fP are s-exp's 169 list print ^I for tab, $ at end 180 wrapscan ws around end of buffer? [all …]`
/freebsd/lib/libpmc/pmu-events/arch/x86/alderlake/
H A D	frontend.json	47 "BriefDescription": "DSB-to-MITE switch true penalty cycles.", 133 "BriefDescription": "Retired instructions after front-end starvation of at least 1 cycle", 148 …fter an interval where the front-end delivered no uops for a period of 128 cycles which was not in… 163 …fter an interval where the front-end delivered no uops for a period of 16 cycles which was not int… 178 "BriefDescription": "Retired instructions after front-end starvation of at least 2 cycles", 193 …fter an interval where the front-end delivered no uops for a period of 256 cycles which was not in… 208 … an interval where the front-end had at least 1 bubble-slot for a period of 2 cycles which was not… 223 …fter an interval where the front-end delivered no uops for a period of 32 cycles which was not int… 238 …after an interval where the front-end delivered no uops for a period of 4 cycles which was not int… 253 …fter an interval where the front-end delivered no uops for a period of 512 cycles which was not in… [all …]
/freebsd/contrib/llvm-project/llvm/lib/BinaryFormat/
H A D	MsgPackDocument.cpp	`1 //===-- MsgPackDocument.cpp - MsgPack Document ------- 116 size_t End; global() member [all...]`
/freebsd/sys/fs/ext2fs/
H A D	ext2_subr.c	`1 /- 4 Aug 1995, Godmar Back (gback@cs.utah.edu) 7 /- 8 SPDX-License-Identifier: BSD-3-Clause 60 * directory "ip". If "res" is non-zero, fill it in with a pointer to the 73 fs = ip->i_e2fs; in ext2_blkatoff() 87 res = (char )bp->b_data + blkoff(fs, offset); in ext2_blkatoff() 97 * Cnt == 1 means free; cnt == -1 means allocating. 102 int32_t *sump = fs->e2fs_clustersum[cg].cs_sum; in ext2_clusteracct() 104 e4fs_daddr_t start, end, loc, forw, back; in ext2_clusteracct() local [all …]`
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A D	JSON.cpp	1 //=== JSON.cpp - JSON value, parsing and serialization - C++ -----------*-===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===---------------------------------------------------------------------===// 25 return try_emplace(K, nullptr).first->getSecond(); in operator []() 28 return try_emplace(std::move(K), nullptr).first->getSecond(); in operator []() 32 if (I == end()) in get() 34 return &I->second; in get() 38 if (I == end()) in get() 40 return &I->second; in get() 44 return V->getAsNull(); in getNull() [all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A D	SCCIterator.h	1 //===- ADT/SCCIterator.h - Strongly Connected Comp. Iter. -------- C++ --===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 20 //===----------------------------------------------------------------------===// 45 /// iterator and thus you cannot backtrack or re-visit nodes. 74 /// nodeVisitNumbers are per-node visit numbers, also used as DFS flags. 88 /// A single "visit" within the non-recursive DFS traversal. 91 /// The stack-based DFS traversal; defined below. 102 /// End is when the DFS stack is empty. 109 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end() function [all …]
H A D	PriorityWorklist.h	1 //===- PriorityWorklist.h - Worklist with insertion priority ----- C++ --===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 13 //===----------------------------------------------------------------------===// 30 /// A FILO worklist that prioritizes on re-insertion without duplication. 33 /// while re-insertion does not create a duplicate, it does adjust the 38 /// Note that this doesn't prevent re-insertion of elements which have been 39 /// visited -- if you need to break cycles, a set will still be necessary. 83 const T &back() const { in back() function 84 assert(!empty() && "Cannot call back() on empty PriorityWorklist!"); in back() [all …]
H A D	DirectedGraph.h	1 //===- llvm/ADT/DirectedGraph.h - Directed Graph ----------------- C++ --===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 13 //===----------------------------------------------------------------------===// 105 const_iterator end() const { return Edges.end(); } in end() function 107 iterator end() { return Edges.end(); } in end() function 110 const EdgeType &back() const { return Edges.back(); } in back() function 111 EdgeType &back() { return Edges.back(); } in back() function 120 if (E->getTargetNode() == N) in findEdgesTo() 134 return (findEdgeTo(N) != Edges.end()); in hasEdgeTo() [all …]
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A D	ConstantRangeList.cpp	1 //===- ConstantRangeList.cpp - ConstantRangeList implementation -----------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 22 auto PreRange = RangesRef[i - 1]; in isOrderedRanges() 44 if (empty() \|\| Ranges.back().getUpper().slt(NewRange.getLower())) { in insert() 57 if (LowerBound != Ranges.end() && LowerBound->contains(NewRange)) in insert() 61 SmallVector<ConstantRange, 2> ExistingTail(LowerBound, Ranges.end()); in insert() 62 Ranges.erase(LowerBound, Ranges.end()); in insert() 64 if (!Ranges.empty() && NewRange.getLower().sle(Ranges.back().getUpper())) { in insert() 65 APInt NewLower = Ranges.back().getLower(); in insert() [all …]
/freebsd/contrib/llvm-project/clang/include/clang/Serialization/
H A D	ContinuousRangeMap.h	1 //===- ContinuousRangeMap.h - Map with int range as key ---------- C++ --===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 12 //===----------------------------------------------------------------------===// 30 /// where one ends, the next one begins. So if the map contains the stops I0-3, 67 if (!Rep.empty() && Rep.back() == Val) in insert() 70 assert((Rep.empty() \|\| Rep.back().first < Val.first) && in insert() 77 if (I != Rep.end() && I->first == Val.first) { in insertOrReplace() 78 I->second = Val.second; in insertOrReplace() 89 iterator end() { return Rep.end(); } in end() function [all …]

12 3 4 5 6 7 8 9 10 >>...42