| /trueos/contrib/dialog/samples/ |
| HD | wheel | 27 --begin `scaley 27` `scalex 98` --infobox "pushd /var/log >/dev/null" 0 0 --and-widget \ 28 --begin `scaley 35` `scalex 95` --infobox "mkdir -p news -m 755" 0 0 --and-widget \ 29 --begin `scaley 45` `scalex 86` --infobox "chown news.news news" 0 0 --and-widget \ 30 --begin `scaley 48` `scalex 78` --infobox "cd /var/log/news" 0 0 --and-widget \ 31 --begin `scaley 51` `scalex 61` --infobox "mkdir -p OLD -m 755" 0 0 --and-widget \ 32 --begin `scaley 52` `scalex 47` --infobox "chown news.news OLD" 0 0 --and-widget \ 33 --begin `scaley 51` `scalex 40` --infobox "cd /var/spool" 0 0 --and-widget \ 34 --begin `scaley 48` `scalex 25` --infobox "mkdir -p news -m 775" 0 0 --and-widget \ 35 --begin `scaley 42` `scalex 13` --infobox "chown news.news news" 0 0 --and-widget \ 36 --begin `scaley 35` `scalex 4` --infobox "cd /var/spool/news" 0 0 --and-widget \ [all …]
|
| /trueos/contrib/byacc/test/ |
| HD | grammar.y | 134 long begin; /* offset in temporary file */ member 151 long begin; /* offset in temporary file */ member 167 long begin; /* offset in temporary file */ member 534 new_decl_spec(&decl_spec, dft_decl_spec(), $1->begin, DS_NONE); 576 new_decl_spec(&$$, $1.text, $1.begin, DS_NONE); 580 new_decl_spec(&$$, $1.text, $1.begin, DS_EXTERN); 584 new_decl_spec(&$$, $1.text, $1.begin, DS_NONE); 588 new_decl_spec(&$$, $1.text, $1.begin, DS_STATIC); 592 new_decl_spec(&$$, $1.text, $1.begin, DS_INLINE); 596 new_decl_spec(&$$, $1.text, $1.begin, DS_JUNK); [all …]
|
| /trueos/contrib/llvm/tools/lldb/include/lldb/Core/ |
| HD | RangeMap.h | 198 m_entries.erase (m_entries.begin() + idx); in RemoveEntrtAtIndex() 208 std::stable_sort (m_entries.begin(), m_entries.end()); in Sort() 218 … for (pos = m_entries.begin(), end = m_entries.end(), prev = end; pos != end; prev = pos++) in IsSorted() 242 … for (pos = m_entries.begin(), end = m_entries.end(), prev = end; pos != end; prev = pos++) in CombineConsecutiveRanges() 256 … for (pos = m_entries.begin(), end = m_entries.end(), prev = end; pos != end; prev = pos++) in CombineConsecutiveRanges() 302 for (pos = m_entries.begin(), end = m_entries.end(); pos != end; ++pos) in Slide() 370 typename Collection::const_iterator begin = m_entries.begin(); in FindEntryIndexThatContains() local 372 … typename Collection::const_iterator pos = std::lower_bound (begin, end, entry, BaseLessThan); in FindEntryIndexThatContains() 376 return std::distance (begin, pos); in FindEntryIndexThatContains() 378 else if (pos != begin) in FindEntryIndexThatContains() [all …]
|
| /trueos/contrib/llvm/include/llvm/ADT/ |
| HD | SmallVector.h | 112 iterator begin() { return (iterator)this->BeginX; } in begin() function 113 const_iterator begin() const { return (const_iterator)this->BeginX; } in begin() function 124 reverse_iterator rend() { return reverse_iterator(begin()); } in rend() 125 const_reverse_iterator rend() const { return const_reverse_iterator(begin());} in rend() 127 size_type size() const { return end()-begin(); } in size() 132 size_t capacity() const { return capacity_ptr() - begin(); } in capacity() 135 pointer data() { return pointer(begin()); } in data() 137 const_pointer data() const { return const_pointer(begin()); } in data() 140 assert(begin() + idx < end()); 141 return begin()[idx]; [all …]
|
| HD | TinyPtrVector.h | 132 iterator begin() { in begin() function 136 return Val.template get<VecTy *>()->begin(); in begin() 141 return begin() + (Val.isNull() ? 0 : 1); in end() 146 const_iterator begin() const { in begin() function 147 return (const_iterator)const_cast<TinyPtrVector*>(this)->begin(); in begin() 219 assert(I >= begin() && "Iterator to erase is out of bounds."); in erase() 224 if (I == begin()) in erase() 235 assert(S >= begin() && "Range to erase is out of bounds."); in erase() 240 if (S == begin() && S != E) in erase() 249 assert(I >= this->begin() && "Insertion iterator is out of bounds."); in insert() [all …]
|
| HD | SparseBitVector.h | 299 CurrElementIter = Elements.begin(); 300 return Elements.begin(); 313 while (ElementIter != Elements.begin() 353 Iter = BitVector->Elements.begin(); 439 Iter = BitVector->Elements.begin(); 451 CurrElementIter = Elements.begin (); 459 ElementListConstIter ElementIter = RHS.Elements.begin(); 465 CurrElementIter = Elements.begin (); 477 ElementListConstIter ElementIter = RHS.Elements.begin(); 483 CurrElementIter = Elements.begin (); [all …]
|
| /trueos/contrib/llvm/tools/lldb/source/DataFormatters/ |
| HD | TypeCategoryMap.cpp | 93 ActiveCategoriesList::iterator iter = m_active_categories.begin(); in Enable() 147 MapIterator iter = m_map.begin(); in Get() 170 for (pos = m_map.begin(); pos != end; pos++) in AnyMatches() 189 ActiveCategoriesIterator begin, end = m_active_categories.end(); in GetFormat() local 195 for (begin = m_active_categories.begin(); begin != end; begin++) in GetFormat() 197 lldb::TypeCategoryImplSP category_sp = *begin; in GetFormat() 217 ActiveCategoriesIterator begin, end = m_active_categories.end(); in GetSummaryFormat() local 223 for (begin = m_active_categories.begin(); begin != end; begin++) in GetSummaryFormat() 225 lldb::TypeCategoryImplSP category_sp = *begin; in GetSummaryFormat() 247 ActiveCategoriesIterator begin, end = m_active_categories.end(); in GetSyntheticChildren() local [all …]
|
| /trueos/contrib/llvm/tools/lldb/source/Plugins/SymbolFile/DWARF/ |
| HD | DWARFDebugRanges.cpp | 96 dw_addr_t begin = debug_ranges_data.GetMaxU64(offset_ptr, addr_size); in Extract() local 98 if (!begin && !end) in Extract() 108 if (begin == 0xFFFFull) in Extract() 109 begin = LLDB_INVALID_ADDRESS; in Extract() 113 if (begin == 0xFFFFFFFFull) in Extract() 114 begin = LLDB_INVALID_ADDRESS; in Extract() 126 if (begin < end) in Extract() 127 range_list.Append(Range(begin, end - begin)); in Extract() 144 dw_addr_t begin = debug_ranges_data.GetMaxU64(offset_ptr, addr_size); in Dump() local 148 if (begin == 0xFFFFFFFFull && addr_size == 4) in Dump() [all …]
|
| HD | DWARFDeclContext.cpp | 36 collection::const_reverse_iterator begin = m_entries.rbegin(); in GetQualifiedName() local 38 for (pos = begin; pos != end; ++pos) in GetQualifiedName() 40 if (pos != begin) in GetQualifiedName() 74 collection::const_iterator begin = m_entries.begin(); in operator ==() local 78 collection::const_iterator rhs_begin = rhs.m_entries.begin(); in operator ==() 82 for (pos = begin, rhs_pos = rhs_begin; pos != end; ++pos, ++rhs_pos) in operator ==() 96 for (pos = begin, rhs_pos = rhs_begin; pos != end; ++pos, ++rhs_pos) in operator ==()
|
| /trueos/contrib/llvm/utils/TableGen/ |
| HD | CodeGenSchedule.cpp | 80 RI = RegexList.begin(), RE = RegexList.end(); RI != RE; ++RI) { in apply() 143 std::sort(ProcRecords.begin(), ProcRecords.end(), LessRecordFieldName()); in collectProcModels() 193 for (RecIter I = Seq.begin(), E = Seq.end(); I != E; ++I) in scanSchedRW() 199 for (RecIter VI = Vars.begin(), VE = Vars.end(); VI != VE; ++VI) { in scanSchedRW() 202 for (RecIter I = Selected.begin(), E = Selected.end(); I != E; ++I) in scanSchedRW() 225 for (RecIter RWI = RWs.begin(), RWE = RWs.end(); RWI != RWE; ++RWI) { in collectSchedRW() 236 for (RecIter OI = InstRWDefs.begin(), OE = InstRWDefs.end(); OI != OE; ++OI) { in collectSchedRW() 239 for (RecIter RWI = RWDefs.begin(), RWE = RWDefs.end(); in collectSchedRW() 251 for (RecIter II = ItinRWDefs.begin(), IE = ItinRWDefs.end(); II != IE; ++II) { in collectSchedRW() 254 for (RecIter RWI = RWDefs.begin(), RWE = RWDefs.end(); in collectSchedRW() [all …]
|
| /trueos/contrib/llvm/tools/lldb/source/Symbol/ |
| HD | VariableList.cpp | 57 std::copy(variable_list->m_variables.begin(), // source begin in AddVariables() 85 m_variables.erase (m_variables.begin() + idx); in RemoveVariableAtIndex() 94 for (pos = m_variables.begin(); pos != end; ++pos) in FindVariableIndex() 97 return std::distance (m_variables.begin(), pos); in FindVariableIndex() 107 for (pos = m_variables.begin(); pos != end; ++pos) in FindVariable() 123 for (pos = m_variables.begin(); pos != end; ++pos) in FindVariable() 139 for (pos = m_variables.begin(); pos != end; ++pos) in AppendVariablesIfUnique() 149 for (pos = m_variables.begin(); pos != end; ++pos) in AppendVariablesIfUnique() 170 for (pos = m_variables.begin(); pos != end; ++pos) in AppendVariablesWithScope() 189 const iterator begin = m_variables.begin(); in FindIndexForVariable() local [all …]
|
| /trueos/usr.sbin/newsyslog/tests/ |
| HD | legacy_test.sh | 13 begin() function 183 begin "create file ${name_postfix}" -newdir 189 begin "rotate normal 1 ${name_postfix}" 196 begin "rotate normal 2 ${name_postfix}" 204 begin "rotate normal 3 ${name_postfix}" 213 begin "rotate normal 4 ${name_postfix}" 222 begin "rotate normal 5 ${name_postfix}" 234 begin "noaction ${name_postfix}" 259 begin "create file ${name_postfix}" -newdir 265 begin "rotate normal 1 cnt=$cnt ${name_postfix}" [all …]
|
| /trueos/contrib/llvm/lib/Support/ |
| HD | DAGDeltaAlgorithm.cpp | 85 return Predecessors[Node].begin(); in pred_begin() 94 return PredClosure[Node].begin(); in pred_closure_begin() 103 return Successors[Node].begin(); in succ_begin() 112 return SuccClosure[Node].begin(); in succ_closure_begin() 129 for (changeset_ty::const_iterator it = S.begin(), in ExecuteOneTest() 190 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() 195 for (std::vector<edge_ty>::const_iterator it = Dependencies.begin(), in DAGDeltaAlgorithmImpl() 202 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() 208 std::vector<change_ty> Worklist(Roots.begin(), Roots.end()); in DAGDeltaAlgorithmImpl() 217 SuccClosure[*it].insert(ChangeSuccs.begin(), ChangeSuccs.end()); in DAGDeltaAlgorithmImpl() [all …]
|
| /trueos/bin/mv/tests/ |
| HD | legacy_test.sh | 9 begin() function 141 begin 'Rename file' 149 begin 'Move files into directory' 161 begin 'Move file from directory to file' 170 begin 'Move file from directory to existing file' 180 begin 'Move file from directory to existing directory' 192 begin 'Move file from directory to directory' 202 begin 'Rename directory' 210 begin 'Move directory to directory name' 219 begin 'Move directory to directory' [all …]
|
| /trueos/contrib/byacc/test/yacc/ |
| HD | grammar.tab.c | 164 long begin; /* offset in temporary file */ member 181 long begin; /* offset in temporary file */ member 197 long begin; /* offset in temporary file */ member 1457 new_decl_spec(&decl_spec, dft_decl_spec(), yystack.l_mark[-4].declarator->begin, DS_NONE); in YYPARSE_DECL() 1479 …new_decl_spec(&yyval.decl_spec, yystack.l_mark[0].text.text, yystack.l_mark[0].text.begin, DS_NONE… in YYPARSE_DECL() 1485 …new_decl_spec(&yyval.decl_spec, yystack.l_mark[0].text.text, yystack.l_mark[0].text.begin, DS_EXTE… in YYPARSE_DECL() 1491 …new_decl_spec(&yyval.decl_spec, yystack.l_mark[0].text.text, yystack.l_mark[0].text.begin, DS_NONE… in YYPARSE_DECL() 1497 …new_decl_spec(&yyval.decl_spec, yystack.l_mark[0].text.text, yystack.l_mark[0].text.begin, DS_STAT… in YYPARSE_DECL() 1503 …new_decl_spec(&yyval.decl_spec, yystack.l_mark[0].text.text, yystack.l_mark[0].text.begin, DS_INLI… in YYPARSE_DECL() 1509 …new_decl_spec(&yyval.decl_spec, yystack.l_mark[0].text.text, yystack.l_mark[0].text.begin, DS_JUNK… in YYPARSE_DECL() [all …]
|
| /trueos/usr.bin/jot/ |
| HD | jot.c | 100 double begin = BEGIN_DEF; in main() local 164 if (!sscanf(argv[1], "%lf", &begin)) in main() 165 begin = argv[1][strlen(argv[1])-1]; in main() 202 s = ender > begin ? 1 : -1; in main() 211 reps = (ender - begin + s) / s; in main() 218 begin = BEGIN_DEF; in main() 227 begin = BEGIN_DEF; in main() 230 begin = ender - reps * s + s; in main() 241 ender = begin + reps * s - s; in main() 250 s = (ender - begin) / (reps - 1); in main() [all …]
|
| /trueos/contrib/llvm/tools/lldb/source/Breakpoint/ |
| HD | BreakpointLocationCollection.cpp | 84 …return std::find_if(m_break_loc_collection.begin(), m_break_loc_collection.end(), // Search full… in GetIDPairIterator() 91 …return std::find_if(m_break_loc_collection.begin(), m_break_loc_collection.end(), // Search full… in GetIDPairConstIterator() 154 begin = m_break_loc_collection.begin(), in ValidForThisThread() local 157 for (pos = begin; pos != end; ++pos) in ValidForThisThread() 169 begin = m_break_loc_collection.begin(), in IsInternal() local 174 for (pos = begin; pos != end; ++pos) in IsInternal() 189 begin = m_break_loc_collection.begin(), in GetDescription() local 192 for (pos = begin; pos != end; ++pos) in GetDescription() 194 if (pos != begin) in GetDescription()
|
| /trueos/contrib/llvm/lib/CodeGen/ |
| HD | MachineBlockPlacement.cpp | 110 iterator begin() { return Blocks.begin(); } in begin() function in __anon47b9e8260211::BlockChain 133 assert(BB == *Chain->begin()); in merge() 134 assert(Chain->begin() != Chain->end()); in merge() 138 for (BlockChain::iterator BI = Chain->begin(), BE = Chain->end(); in merge() 149 for (iterator I = begin(), E = end(); I != E; ++I) in dump() 292 for (BlockChain::iterator CBI = Chain.begin(), CBE = Chain.end(); in markChainSuccessors() 311 BlockWorkList.push_back(*SuccChain.begin()); in markChainSuccessors() 351 if (*SI != *SuccChain.begin()) { in selectBestSuccessor() 438 WorkList.erase(std::remove_if(WorkList.begin(), WorkList.end(), in selectBestCandidateBlock() 444 for (SmallVectorImpl<MachineBasicBlock *>::iterator WBI = WorkList.begin(), in selectBestCandidateBlock() [all …]
|
| HD | BranchFolding.cpp | 133 MachineBasicBlock::iterator I = MBB->begin(); in OptimizeImpDefsBlock() 162 I = MBB->begin(); in OptimizeImpDefsBlock() 196 for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; I++) { in OptimizeFunction() 223 for (MachineFunction::iterator BB = MF.begin(), E = MF.end(); in OptimizeFunction() 225 for (MachineBasicBlock::iterator I = BB->begin(), E = BB->end(); in OptimizeFunction() 288 if (I == MBB->begin()) in HashEndOfMBB() 294 if (I==MBB->begin()) in HashEndOfMBB() 313 while (I1 != MBB1->begin() && I2 != MBB2->begin()) { in ComputeCommonTailLength() 317 if (I1==MBB1->begin()) { in ComputeCommonTailLength() 319 if (I2==MBB2->begin()) in ComputeCommonTailLength() [all …]
|
| /trueos/contrib/libstdc++/include/bits/ |
| D | list.tcc | 108 iterator __i = begin(); in resize() 125 iterator __first1 = begin(); in operator =() 127 const_iterator __first2 = __x.begin(); in operator =() 145 iterator __i = begin(); in _M_fill_assign() 161 iterator __first1 = begin(); in _M_assign_dispatch() 177 iterator __first = begin(); in remove() 194 iterator __first = begin(); in unique() 220 iterator __first1 = begin(); in merge() 222 iterator __first2 = __x.begin(); in merge() 250 iterator __first1 = begin(); in merge() [all …]
|
| /trueos/contrib/llvm/tools/lldb/source/Target/ |
| HD | PathMappingList.cpp | 94 for (pos = rhs.m_pairs.begin(); pos != end; ++pos) in Append() 112 insert_iter = m_pairs.begin() + index; in Insert() 141 iterator iter = m_pairs.begin() + index; in Remove() 189 for (pos = m_pairs.begin(); pos != end; ++pos) in RemapPath() 211 for (pos = m_pairs.begin(); pos != end; ++pos) in RemapPath() 236 for (pos = m_pairs.begin(); pos != end; ++pos) in FindFile() 294 const_iterator begin = m_pairs.begin(); in FindIteratorForPath() local 297 for (pos = begin; pos != end; ++pos) in FindIteratorForPath() 309 iterator begin = m_pairs.begin(); in FindIteratorForPath() local 312 for (pos = begin; pos != end; ++pos) in FindIteratorForPath() [all …]
|
| /trueos/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/ |
| D | split_join_fn_imps.hpp | 63 if (Cmp_Fn::operator()(r_key, PB_DS_V2F(*begin()))) in split() 91 new_this.copy_from_ordered_range(begin(), it); in split() 120 PB_DS_V2F(*other.begin())); in join() 123 PB_DS_V2F(*begin())); in join() 131 new_this.copy_from_ordered_range(begin(), end(), in join() 132 other.begin(), other.end()); in join() 134 new_this.copy_from_ordered_range(other.begin(), other.end(), in join() 135 begin(), end()); in join()
|
| /trueos/contrib/llvm/tools/lldb/source/Core/ |
| HD | ModuleList.cpp | 114 RemoveImpl(m_modules.begin() + idx); in ReplaceEquivalent() 130 for (pos = m_modules.begin(); pos != end; ++pos) in AppendIfNeeded() 168 for (pos = m_modules.begin(); pos != end; ++pos) in RemoveImpl() 216 for (pos = m_modules.begin(); pos != end; ++pos) in RemoveIfOrphaned() 248 collection::iterator pos = m_modules.begin(); in RemoveOrphans() 271 for (pos = module_list.m_modules.begin(); pos != end; ++pos) in Remove() 357 for (pos = m_modules.begin(); pos != end; ++pos) in FindFunctions() 394 for (pos = m_modules.begin(); pos != end; ++pos) in FindFunctions() 421 for (pos = m_modules.begin(); pos != end; ++pos) in FindFunctionSymbols() 454 for (pos = m_modules.begin(); pos != end; ++pos) in FindFunctionSymbols() [all …]
|
| /trueos/contrib/llvm/tools/clang/include/clang/Analysis/ |
| HD | CallGraph.h | 71 iterator begin() { return FunctionMap.begin(); } in begin() function 73 const_iterator begin() const { return FunctionMap.begin(); } in begin() function 151 inline iterator begin() { return CalledFunctions.begin(); } in begin() function 153 inline const_iterator begin() const { return CalledFunctions.begin(); } in begin() function 181 return map_iterator(N->begin(), CGNDerefFun(CGNDeref)); 195 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();} 211 return map_iterator(CG->begin(), DerefFun(CGdereference)); 237 return map_iterator(CG->begin(), DerefFun(CGdereference));
|
| /trueos/usr.bin/mkcsmapper/ |
| HD | yacc.y | 323 put32(ptr, ofs, rowcol[i].begin); ofs++; in create_rowcol_info() 549 check_src(u_int32_t begin, u_int32_t end) in check_src() argument 555 if (begin > end) in check_src() 557 if (begin < end) { in check_src() 558 m = begin & ~rowcol_mask; in check_src() 565 m = (begin >> i) & rowcol_mask; in check_src() 566 if (m < p->begin || m > p->end) in check_src() 569 if (begin < end) { in check_src() 572 if (n < p->begin || n > p->end) in check_src() 588 n = ((lz->begin >> i) & rowcol_mask) - p->begin; in store() [all …]
|