search for: __ops

...cpp:186) ==29299== by 0x13FCF12: operator() (Attributes.cpp:627) ==29299== by 0x13FCF12: operator()<const std::pair<unsigned int, llvm::Attribute> *> (predefined_ops.h:234) ==29299== by 0x13FCF12: __find_if<const std::pair<unsigned int, llvm::Attribute> *, __gnu_cxx::__ops::_Iter_pred<(lambda at ../lib/IR/Attributes.cpp:627:3)> > (stl_algo.h:140) ==29299== by 0x13FCF12: __find_if<const std::pair<unsigned int, llvm::Attribute> *, __gnu_cxx::__ops::_Iter_pred<(lambda at ../lib/IR/Attributes.cpp:627:3)> > (stl_algo.h:161) ==29299== by...

...: operator() (Attributes.cpp:627) >> ==29299== by 0x13FCF12: operator()<const std::pair<unsigned int, >> llvm::Attribute> *> (predefined_ops.h:234) >> ==29299== by 0x13FCF12: __find_if<const std::pair<unsigned int, >> llvm::Attribute> *, __gnu_cxx::__ops::_Iter_pred<(lambda at >> ../lib/IR/Attributes.cpp:627:3)> > (stl_algo.h:140) >> ==29299== by 0x13FCF12: __find_if<const std::pair<unsigned int, >> llvm::Attribute> *, __gnu_cxx::__ops::_Iter_pred<(lambda at >> ../lib/IR/Attributes.cpp:627:3)> >...

...ipt/public-i libxapian.so.30.8.0 [.] std::__push_heap<__gnu_cxx::__normal_iterator<Xapian::PostingIterator::Internal**, std::vector<Xapian::PostingIterator::Internal*, std::allocator<Xapian::PostingIterator::Internal*> > >, long, Xapian::PostingIterator::Internal*, __gnu_cxx::__ops::_Iter_comp_val<Xapian::Internal::ComparePostListTermFreqAscending> > 0.06% /mnt/btr/public libc-2.28.so [.] __strchr_sse2 0.06% script/public-i perl [.] Perl_call_sv 0.06% /mnt/btr/public perl [.] Perl_pp_nextstate 0.06% p...

Going back to the "prioritizing aggregated DBs" thread from February 2020, I've got 390 Xapian shards for 130 public inboxes I want to search against(*). There's more on the horizon (we're expecting tens of thousands of public inboxes). After bumping RLIMIT_NOFILE and running ->add_database a bunch, the actual queries seem to be taking ~30s (not good :x). Now I'm