Spaces:
Running
Running
File size: 17,832 Bytes
332826f 30c6ca2 332826f acdc6c1 332826f 30c6ca2 332826f 30c6ca2 332826f 30c6ca2 332826f 30c6ca2 332826f 30c6ca2 332826f 30c6ca2 332826f 30c6ca2 332826f 30c6ca2 332826f 30c6ca2 332826f 27c1c3c 332826f 27c1c3c 332826f 30c6ca2 332826f 27c1c3c 332826f 7caa6ba 332826f 7caa6ba 332826f 30c6ca2 332826f 30c6ca2 332826f | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 | #include "runtime_components.h"
#include "config.h"
#include "http_helpers.h"
#include "model_manager.h"
#include <algorithm>
#include <cctype>
#include <cmath>
#include <sstream>
#include <utility>
RateLimiterStore::RateLimiterStore(const RateLimitConfig &config)
: requests_per_minute_(std::max(0, config.requests_per_minute)),
estimated_tokens_per_minute_(std::max(0, config.estimated_tokens_per_minute)) {}
RateLimitDecision RateLimiterStore::allow(const std::string &api_key_id, int estimated_tokens) {
if (requests_per_minute_ <= 0 && estimated_tokens_per_minute_ <= 0) return {};
std::lock_guard<std::mutex> lock(mu_);
auto &bucket = buckets_[api_key_id];
const auto now = std::chrono::steady_clock::now();
refill(bucket.request_tokens, bucket.last_request_refill, requests_per_minute_, now);
refill(bucket.estimated_tokens, bucket.last_estimated_refill, estimated_tokens_per_minute_, now);
// Seconds until the bucket refills enough for this request, so Retry-After
// reflects reality instead of a constant that invites retry storms.
auto retry_after_for = [](double deficit, int limit_per_minute) {
const double seconds = deficit * 60.0 / limit_per_minute;
return std::max(1, static_cast<int>(std::ceil(seconds)));
};
if (requests_per_minute_ > 0 && bucket.request_tokens < 1.0) {
return {false,
retry_after_for(1.0 - bucket.request_tokens, requests_per_minute_),
"Rate limit exceeded: requests"};
}
if (estimated_tokens_per_minute_ > 0 && bucket.estimated_tokens < estimated_tokens) {
return {false,
retry_after_for(estimated_tokens - bucket.estimated_tokens, estimated_tokens_per_minute_),
"Rate limit exceeded: estimated tokens"};
}
if (requests_per_minute_ > 0) bucket.request_tokens -= 1.0;
if (estimated_tokens_per_minute_ > 0) bucket.estimated_tokens -= estimated_tokens;
return {};
}
void RateLimiterStore::refill(
double &tokens,
std::chrono::steady_clock::time_point &last_refill,
int limit_per_minute,
std::chrono::steady_clock::time_point now) {
if (limit_per_minute <= 0) return;
if (last_refill.time_since_epoch().count() == 0) {
tokens = limit_per_minute;
last_refill = now;
return;
}
const auto elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(now - last_refill).count();
if (elapsed <= 0) return;
const double refill_amount = (static_cast<double>(limit_per_minute) * elapsed) / 60000.0;
tokens = std::min(static_cast<double>(limit_per_minute), tokens + refill_amount);
last_refill = now;
}
std::shared_ptr<RequestContext> RequestRegistry::create(
const std::string &request_id,
const ApiKeyRecord &principal,
const TokenEstimate &estimate,
const std::string &request_body) {
auto ctx = std::make_shared<RequestContext>();
ctx->request_id = request_id;
ctx->api_key_id = principal.key_id;
ctx->role = principal.role;
ctx->priority = role_to_priority(principal.role);
ctx->estimate = estimate;
ctx->request_body = request_body;
ctx->created_at = std::chrono::steady_clock::now();
ctx->enqueue_time = ctx->created_at;
std::lock_guard<std::mutex> lock(mu_);
requests_[request_id] = ctx;
return ctx;
}
std::shared_ptr<RequestContext> RequestRegistry::find(const std::string &request_id) const {
std::lock_guard<std::mutex> lock(mu_);
const auto it = requests_.find(request_id);
if (it == requests_.end()) return nullptr;
return it->second;
}
void RequestRegistry::remove(const std::string &request_id) {
std::lock_guard<std::mutex> lock(mu_);
requests_.erase(request_id);
}
void RequestRegistry::complete(const std::shared_ptr<RequestContext> &ctx, RequestState state, RequestResult result) {
{
std::lock_guard<std::mutex> lock(ctx->mu);
ctx->state.store(state);
ctx->result = std::move(result);
ctx->completed = true;
}
ctx->cv.notify_all();
}
std::shared_ptr<RequestContext> RequestRegistry::cancel_request(
const std::string &request_id,
RequestState *previous_state) {
auto ctx = find(request_id);
if (!ctx) return nullptr;
ctx->cancelled.store(true);
// CAS so the scheduler's QUEUED->RUNNING transition and this cancel can't
// both win: either we complete it here, or we observe the state it really
// reached and act on that.
auto expected = RequestState::QUEUED;
if (ctx->state.compare_exchange_strong(expected, RequestState::CANCELLED)) {
if (previous_state) *previous_state = RequestState::QUEUED;
complete(ctx, RequestState::CANCELLED, {499, R"({"error":"Request cancelled"})"});
} else {
if (previous_state) *previous_state = expected;
if (expected == RequestState::RUNNING) {
ctx->state.store(RequestState::CANCELLED);
}
}
return ctx;
}
std::vector<std::shared_ptr<RequestContext>> RequestRegistry::cancel_all() {
std::vector<std::shared_ptr<RequestContext>> out;
std::lock_guard<std::mutex> lock(mu_);
out.reserve(requests_.size());
for (auto &[_, ctx] : requests_) {
ctx->cancelled.store(true);
auto expected = RequestState::QUEUED;
if (ctx->state.compare_exchange_strong(expected, RequestState::CANCELLED)) {
{
std::lock_guard<std::mutex> ctx_lock(ctx->mu);
ctx->result = {499, R"({"error":"Request cancelled"})"};
ctx->completed = true;
}
ctx->cv.notify_all();
} else if (expected == RequestState::RUNNING) {
ctx->state.store(RequestState::CANCELLED);
}
out.push_back(ctx);
}
return out;
}
void MetricsRegistry::inc_requests_total() { requests_total_.fetch_add(1); }
void MetricsRegistry::inc_requests_inflight() { requests_inflight_.fetch_add(1); }
void MetricsRegistry::dec_requests_inflight() { requests_inflight_.fetch_sub(1); }
void MetricsRegistry::inc_queue_rejected_total() { queue_rejected_total_.fetch_add(1); }
void MetricsRegistry::inc_rate_limited_total() { rate_limited_total_.fetch_add(1); }
void MetricsRegistry::add_cancellations_total(uint64_t delta) { cancellations_total_.fetch_add(delta); }
void MetricsRegistry::inc_switch_total() { switch_total_.fetch_add(1); }
void MetricsRegistry::inc_worker_restarts_total() { worker_restarts_total_.fetch_add(1); }
void MetricsRegistry::observe_request_latency_ms(int64_t value) {
request_latency_ms_total_.fetch_add(value);
request_latency_samples_.fetch_add(1);
}
void MetricsRegistry::observe_queue_wait_ms(int64_t value) {
queue_wait_ms_total_.fetch_add(value);
queue_wait_samples_.fetch_add(1);
}
void MetricsRegistry::observe_inference(
uint64_t prompt_ms,
uint64_t predicted_ms,
uint64_t prompt_tokens,
uint64_t predicted_tokens) {
inference_prompt_ms_total_.fetch_add(prompt_ms);
inference_predicted_ms_total_.fetch_add(predicted_ms);
inference_prompt_tokens_total_.fetch_add(prompt_tokens);
inference_predicted_tokens_total_.fetch_add(predicted_tokens);
inference_samples_.fetch_add(1);
}
// Pull llama-server's timings/usage out of a completion body so /queue/metrics
// can report real prompt-eval and generation speed (tokens/sec falls out of
// predicted_tokens_total / predicted_ms_total).
static void record_inference_metrics(MetricsRegistry &metrics, const std::string &body) {
json completion = json::parse(body, nullptr, false);
if (completion.is_discarded() || !completion.is_object()) return;
auto num_or_zero = [](const json &obj, const char *key) -> uint64_t {
if (!obj.contains(key) || !obj[key].is_number()) return 0;
const double v = obj[key].get<double>();
return v > 0 ? static_cast<uint64_t>(v) : 0;
};
uint64_t prompt_ms = 0, predicted_ms = 0, prompt_tokens = 0, predicted_tokens = 0;
if (completion.contains("timings") && completion["timings"].is_object()) {
const auto &t = completion["timings"];
prompt_ms = num_or_zero(t, "prompt_ms");
predicted_ms = num_or_zero(t, "predicted_ms");
prompt_tokens = num_or_zero(t, "prompt_n");
predicted_tokens = num_or_zero(t, "predicted_n");
}
if (completion.contains("usage") && completion["usage"].is_object()) {
const auto &u = completion["usage"];
if (prompt_tokens == 0) prompt_tokens = num_or_zero(u, "prompt_tokens");
if (predicted_tokens == 0) predicted_tokens = num_or_zero(u, "completion_tokens");
}
if (prompt_ms == 0 && predicted_ms == 0 && prompt_tokens == 0 && predicted_tokens == 0) return;
metrics.observe_inference(prompt_ms, predicted_ms, prompt_tokens, predicted_tokens);
}
std::string MetricsRegistry::render_prometheus(const QueueSnapshot &queue, ModelManager &manager) const {
std::ostringstream oss;
oss << "llm_manager_requests_total " << requests_total_.load() << '\n';
oss << "llm_manager_requests_inflight " << requests_inflight_.load() << '\n';
oss << "llm_manager_request_latency_ms_total " << request_latency_ms_total_.load() << '\n';
oss << "llm_manager_request_latency_ms_samples " << request_latency_samples_.load() << '\n';
oss << "llm_manager_queue_size " << queue.total_size << '\n';
oss << "llm_manager_queue_admin_size " << queue.admin_size << '\n';
oss << "llm_manager_queue_user_size " << queue.user_size << '\n';
oss << "llm_manager_queue_tokens " << queue.total_tokens << '\n';
oss << "llm_manager_queue_rejected_total " << queue_rejected_total_.load() << '\n';
oss << "llm_manager_rate_limited_total " << rate_limited_total_.load() << '\n';
oss << "llm_manager_queue_wait_time_ms_total " << queue_wait_ms_total_.load() << '\n';
oss << "llm_manager_queue_wait_time_ms_samples " << queue_wait_samples_.load() << '\n';
oss << "llm_manager_cancellations_total " << cancellations_total_.load() << '\n';
oss << "llm_manager_switch_total " << switch_total_.load() << '\n';
oss << "llm_manager_worker_restarts_total " << worker_restarts_total_.load() << '\n';
oss << "llm_manager_inference_prompt_ms_total " << inference_prompt_ms_total_.load() << '\n';
oss << "llm_manager_inference_predicted_ms_total " << inference_predicted_ms_total_.load() << '\n';
oss << "llm_manager_inference_prompt_tokens_total " << inference_prompt_tokens_total_.load() << '\n';
oss << "llm_manager_inference_predicted_tokens_total " << inference_predicted_tokens_total_.load() << '\n';
oss << "llm_manager_inference_samples " << inference_samples_.load() << '\n';
const auto active = manager.active_worker();
oss << "llm_manager_active_worker " << (active ? 1 : 0) << '\n';
return oss.str();
}
PrioritySchedulerQueue::PrioritySchedulerQueue(const QueueConfig &config)
: max_size_(config.max_size),
max_tokens_(config.max_tokens),
admin_quota_(std::max(1, config.admin_quota)),
retry_after_sec_(std::max(1, config.retry_after_sec)) {}
bool PrioritySchedulerQueue::try_push(const std::shared_ptr<RequestContext> &ctx) {
std::lock_guard<std::mutex> lock(mu_);
if (current_size_ >= max_size_) return false;
if (current_tokens_ + ctx->estimate.estimated_total_tokens > max_tokens_) return false;
if (ctx->priority == Priority::ADMIN) admin_queue_.push_back(ctx);
else user_queue_.push_back(ctx);
++current_size_;
current_tokens_ += ctx->estimate.estimated_total_tokens;
cv_.notify_one();
return true;
}
std::shared_ptr<RequestContext> PrioritySchedulerQueue::pop_next() {
std::unique_lock<std::mutex> lock(mu_);
cv_.wait(lock, [&]() { return stopped_ || current_size_ > 0; });
if (stopped_) return nullptr;
std::deque<std::shared_ptr<RequestContext>> *selected_queue = nullptr;
if (!admin_queue_.empty() && (admin_streak_ < admin_quota_ || user_queue_.empty())) {
selected_queue = &admin_queue_;
++admin_streak_;
} else if (!user_queue_.empty()) {
selected_queue = &user_queue_;
admin_streak_ = 0;
} else if (!admin_queue_.empty()) {
selected_queue = &admin_queue_;
admin_streak_ = 1;
}
if (!selected_queue || selected_queue->empty()) return nullptr;
auto best_it = std::min_element(
selected_queue->begin(),
selected_queue->end(),
[](const auto &a, const auto &b) {
return a->estimate.estimated_total_tokens < b->estimate.estimated_total_tokens;
});
auto ctx = *best_it;
selected_queue->erase(best_it);
--current_size_;
current_tokens_ -= ctx->estimate.estimated_total_tokens;
return ctx;
}
void PrioritySchedulerQueue::stop() {
std::lock_guard<std::mutex> lock(mu_);
stopped_ = true;
cv_.notify_all();
}
int PrioritySchedulerQueue::retry_after_sec() const {
return retry_after_sec_;
}
QueueSnapshot PrioritySchedulerQueue::snapshot() const {
std::lock_guard<std::mutex> lock(mu_);
return QueueSnapshot{current_size_, admin_queue_.size(), user_queue_.size(), current_tokens_};
}
Scheduler::Scheduler(
ModelManager &manager,
RequestRegistry ®istry,
MetricsRegistry &metrics,
const QueueConfig &queue_config)
: manager_(manager), registry_(registry), metrics_(metrics), queue_(queue_config) {
worker_ = std::thread([this]() { worker_loop(); });
}
Scheduler::~Scheduler() {
queue_.stop();
if (worker_.joinable()) worker_.join();
}
bool Scheduler::try_enqueue(const std::shared_ptr<RequestContext> &ctx) {
return queue_.try_push(ctx);
}
int Scheduler::retry_after_sec() const {
return queue_.retry_after_sec();
}
QueueSnapshot Scheduler::snapshot() const {
return queue_.snapshot();
}
void Scheduler::worker_loop() {
for (;;) {
auto ctx = queue_.pop_next();
if (!ctx) return;
// Set start_time before publishing RUNNING: the client handler reads
// start_time as soon as it observes state == RUNNING.
ctx->start_time = std::chrono::steady_clock::now();
auto expected = RequestState::QUEUED;
if (!ctx->state.compare_exchange_strong(expected, RequestState::RUNNING)) {
// A concurrent cancel won the race and already completed this
// request; don't forward it to the worker.
continue;
}
metrics_.observe_queue_wait_ms(
std::chrono::duration_cast<std::chrono::milliseconds>(ctx->start_time - ctx->enqueue_time).count());
auto worker = manager_.active_worker();
if (!worker) {
registry_.complete(ctx, RequestState::FAILED, {503, R"({"error":"No active model"})"});
continue;
}
try {
auto [status, body] = forward_chat(*worker, ctx->request_body);
if (ctx->cancelled.load()) {
registry_.complete(ctx, RequestState::CANCELLED, {499, R"({"error":"Request cancelled"})"});
continue;
}
if (status >= 200 && status < 300) {
record_inference_metrics(metrics_, body);
}
registry_.complete(ctx, RequestState::DONE, {status, body});
} catch (const std::exception &e) {
log_line("request_id=" + ctx->request_id + " scheduler_exception=" + std::string(e.what()));
registry_.complete(ctx, RequestState::FAILED, {500, json({{"error", e.what()}}).dump()});
} catch (...) {
log_line("request_id=" + ctx->request_id + " scheduler_exception=unknown");
registry_.complete(ctx, RequestState::FAILED, {500, json({{"error", "Unknown exception"}}).dump()});
}
}
}
ApiKeyAuth::ApiKeyAuth(const ManagerConfig &config)
: header_name_(config.auth.header), scheme_(config.auth.scheme) {
for (const auto &record : config.api_keys) {
records_by_secret_.emplace(record.secret, record);
}
}
bool ApiKeyAuth::enabled() const {
return !records_by_secret_.empty();
}
std::optional<ApiKeyRecord> ApiKeyAuth::authenticate(
const http::request<http::string_body> &req,
std::string &error) const {
if (!enabled()) {
error.clear();
return ApiKeyRecord{"anonymous", "", Role::ADMIN, true};
}
const auto token = extract_bearer_token(req, error);
if (!token) return std::nullopt;
const auto it = records_by_secret_.find(*token);
if (it == records_by_secret_.end()) {
error = "Invalid API key";
return std::nullopt;
}
if (!it->second.enabled) {
error = "API key disabled";
return std::nullopt;
}
error.clear();
return it->second;
}
std::optional<std::string> ApiKeyAuth::extract_bearer_token(
const http::request<http::string_body> &req,
std::string &error) const {
const auto header_it = req.find(header_name_);
if (header_it == req.end()) {
error = "Missing authorization header";
return std::nullopt;
}
const std::string value = trim_copy(header_it->value().to_string());
// Auth scheme names are case-insensitive (RFC 7235), so accept
// "bearer <key>" as well as "Bearer <key>".
const auto iequals = [](char a, char b) {
return std::tolower(static_cast<unsigned char>(a)) == std::tolower(static_cast<unsigned char>(b));
};
if (value.size() <= scheme_.size() + 1 ||
!std::equal(scheme_.begin(), scheme_.end(), value.begin(), iequals) ||
value[scheme_.size()] != ' ') {
error = "Invalid authorization scheme";
return std::nullopt;
}
std::string token = trim_copy(value.substr(scheme_.size() + 1));
if (token.empty()) {
error = "Missing API key";
return std::nullopt;
}
return token;
}
|