TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Google Engineers Propose “Machine Function Splitter” for Faster Performance

4 点作者 ykm将近 5 年前

1 comment

twoodfin将近 5 年前
They preface this by discussing the prevalence of deep inlining in aggressive, profile-guided optimization of modern (presumably C++-dominated) code.<p>Couple of thoughts:<p>- I wonder how relatively effective this optimization would be applied to profiled, typical &quot;old school&quot; C, written and tuned in an era when compilers were simpler and inlining of small functions—and other abstractions we would consider &quot;zero cost&quot; today—could not be assumed (and thus were often replaced by macros). This is the C of the 400-line function, which surely has a few hot paths and many cold paths as well.<p>- Are there existing or promising potential optimizations similar to this but without the profiling requirement? Are there effective heuristics for identifying likely &quot;hot&quot; code paths without requiring profiling or user annotation?