Changeset 58a4cde
- Timestamp:
- Aug 6, 2025, 10:47:44 AM (3 months ago)
- Branches:
- master
- Children:
- 81e1984b
- Parents:
- d7a2de1 (diff), b2e4a73 (diff)
 Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
 Use the(diff)links above to see all the changes relative to each parent.
- Files:
- 
      - 1 added
- 3 edited
 
 - 
          
  Jenkinsfile (modified) (2 diffs)
- 
          
  doc/proposals/modules-alvin/proposal.md (added)
- 
          
  libcfa/src/heap.cfa (modified) (2 diffs)
- 
          
  src/ResolvExpr/SatisfyAssertions.cpp (modified) (3 diffs)
 
Legend:
- Unmodified
- Added
- Removed
- 
      Jenkinsfilerd7a2de1 r58a4cde 320 320 // Use only generic clang/gcc here because of unknown version numbers on different architectures. 321 321 case 'clang': 322 this.Compiler = new CC_Desc('clang', 'clang++', 'gcc ', '-flto=thin -flto-jobs=0')322 this.Compiler = new CC_Desc('clang', 'clang++', 'gcc-11', '-flto=thin -flto-jobs=0') 323 323 break 324 324 default : … … 379 379 description: 'Which compiler to use', \ 380 380 name: 'Compiler', \ 381 choices: 'gcc-9\ngcc-10\ngcc-11\ngcc-12 gcc-13gcc-14\nclang',\381 choices: 'gcc-9\ngcc-10\ngcc-11\ngcc-12\ngcc-13\ngcc-14\nclang', \ 382 382 defaultValue: 'gcc', \ 383 383 ], \ 
- 
      libcfa/src/heap.cfard7a2de1 r58a4cde 10 10 // Created On : Tue Dec 19 21:58:35 2017 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Wed Aug 7 10:14:47 202413 // Update Count : 164 612 // Last Modified On : Thu May 15 16:47:35 2025 13 // Update Count : 1647 14 14 // 15 15 … … 974 974 if ( likely( tsize < heapMaster.mmapStart ) ) { // small size => sbrk 975 975 size_t bucket; 976 // Find smallest bucket that is >= the allocation side. 976 977 #ifdef FASTLOOKUP 977 978 if ( likely( tsize < LookupSizes ) ) bucket = lookup[tsize]; 
- 
      src/ResolvExpr/SatisfyAssertions.cpprd7a2de1 r58a4cde 10 10 // Created On : Mon Jun 10 17:45:00 2019 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : T ue Jul 2 18:15:51 202413 // Update Count : 512 // Last Modified On : Thu Jul 31 18:04:31 2025 13 // Update Count : 6 14 14 // 15 15 … … 456 456 // should a limit be imposed? worst case here is O(n^2) but very unlikely to happen. 457 457 458 for ( unsigned resetCount = 0; ; ++resetCount) {458 for ( ;; ) { 459 459 ast::AssertionList next; 460 460 // make initial pass at matching assertions … … 475 475 } else if ( result == AssertionResult::Skip ) { 476 476 next.emplace_back(assn); 477 // goto nextSat;478 477 } 479 478 } 
  Note:
 See   TracChangeset
 for help on using the changeset viewer.
  