from __future__ import annotations

from dataclasses import dataclass
import math

import torch
import torch.nn as nn
import torch.nn.functional as F


@dataclass
class GPTConfig:
    vocab_size: int = 32000
    n_layers: int = 30
    d_model: int = 576
    n_heads: int = 9
    n_kv_heads: int = 3  # GQA KV heads; == n_heads is plain MHA (pre-GQA checkpoints)
    d_ff: int = 1536  # SwiGLU: ~2.67x d_model (MobileLLM/SmolLM2-135M deep-thin shape)
    max_seq_len: int = 2048
    dropout: float = 0.0
    tie_embeddings: bool = True

    # RoPE (rotary positional embedding)
    rope_theta: float = 10000.0
    rope_pct: float = 1.0  # fraction of head_dim to rotate (1.0 = full head_dim)


CANONICAL_DENSE_PARAMETER_COUNT = 124_635_456
_CANONICAL_PARAMETERIZATION = {
    "vocab_size": 32_000,
    "n_layers": 30,
    "d_model": 576,
    "n_heads": 9,
    "n_kv_heads": 3,
    "d_ff": 1_536,
    "tie_embeddings": True,
}


def expected_gpt_parameter_count(cfg: GPTConfig) -> int:
    """Derive the unique parameter count for the dense bias-free GPT."""
    integer_fields = {
        "vocab_size": cfg.vocab_size,
        "n_layers": cfg.n_layers,
        "d_model": cfg.d_model,
        "n_heads": cfg.n_heads,
        "n_kv_heads": cfg.n_kv_heads,
        "d_ff": cfg.d_ff,
    }
    for name, value in integer_fields.items():
        if isinstance(value, bool) or not isinstance(value, int) or value <= 0:
            raise ValueError(f"GPTConfig.{name} must be a positive integer")
    if cfg.d_model % cfg.n_heads:
        raise ValueError("GPTConfig.d_model must be divisible by n_heads")
    if cfg.n_heads % cfg.n_kv_heads:
        raise ValueError("GPTConfig.n_heads must be divisible by n_kv_heads")

    head_dim = cfg.d_model // cfg.n_heads
    kv_dim = cfg.n_kv_heads * head_dim
    token_matrices = 1 if cfg.tie_embeddings else 2
    embeddings = token_matrices * cfg.vocab_size * cfg.d_model
    # q + output projections are d_model x d_model; k and v are d_model x kv_dim (GQA)
    attention = 2 * cfg.d_model * cfg.d_model + 2 * cfg.d_model * kv_dim
    swiglu = 3 * cfg.d_model * cfg.d_ff
    block_norms = 2 * cfg.d_model
    final_norm = cfg.d_model
    return int(embeddings + cfg.n_layers * (attention + swiglu + block_norms) + final_norm)


def audit_gpt_parameter_count(model: nn.Module, cfg: GPTConfig) -> dict[str, int | bool | str]:
    """Fail fast on implementation/config drift and return manifest metadata."""
    expected = expected_gpt_parameter_count(cfg)
    actual = int(sum(parameter.numel() for parameter in model.parameters()))
    trainable = int(
        sum(parameter.numel() for parameter in model.parameters() if parameter.requires_grad)
    )
    if actual != expected:
        raise RuntimeError(
            "GPT parameter count disagrees with the architecture-derived count: "
            f"actual={actual:,}, expected={expected:,}"
        )

    canonical = all(
        getattr(cfg, field) == expected_value
        for field, expected_value in _CANONICAL_PARAMETERIZATION.items()
    )
    if canonical and actual != CANONICAL_DENSE_PARAMETER_COUNT:
        raise RuntimeError(
            "canonical PetitGPT parameter count mismatch: "
            f"actual={actual:,}, expected={CANONICAL_DENSE_PARAMETER_COUNT:,}"
        )

    return {
        "status": "passed",
        "counting_method": "unique_parameter_objects_excluding_buffers",
        "actual_total": actual,
        "actual_trainable": trainable,
        "derived_expected_total": expected,
        "canonical_parameterization": canonical,
        "canonical_expected_total": CANONICAL_DENSE_PARAMETER_COUNT,
        "canonical_match": canonical and actual == CANONICAL_DENSE_PARAMETER_COUNT,
    }


def gpt_config_from_checkpoint_dict(cfg_dict: dict) -> GPTConfig:
    """Rebuild a GPTConfig from a checkpoint's serialized config dict.

    Pre-GQA checkpoints carry no n_kv_heads; absence means plain MHA
    (n_kv_heads == n_heads), whose fused-QKV weight layout is unchanged.
    """
    cfg_dict = dict(cfg_dict)
    cfg_dict.setdefault("n_kv_heads", cfg_dict["n_heads"])
    return GPTConfig(**cfg_dict)


class RMSNorm(nn.Module):
    def __init__(self, dim: int, eps: float = 1e-6):
        super().__init__()
        self.eps = eps
        self.weight = nn.Parameter(torch.ones(dim))

    def forward(self, x: torch.Tensor) -> torch.Tensor:
        # x: [B, T, C]
        rms = x.pow(2).mean(dim=-1, keepdim=True).add(self.eps).rsqrt()
        return x * rms * self.weight


def _rotate_half(x: torch.Tensor) -> torch.Tensor:
    # x: [..., D]. Half-split layout (Llama/GPT-NeoX): pairs are (i, i+D/2),
    # matching the `cat([freqs, freqs])` cos/sin cache below.
    half = x.shape[-1] // 2
    x1 = x[..., :half]
    x2 = x[..., half:]
    return torch.cat((-x2, x1), dim=-1)


class RotaryEmbedding(nn.Module):
    """Precomputes RoPE cos/sin caches up to max_seq_len."""

    def __init__(self, head_dim: int, max_seq_len: int, theta: float = 10000.0, pct: float = 1.0):
        super().__init__()
        if head_dim % 2 != 0:
            raise ValueError(f"RoPE requires even head_dim, got {head_dim}")
        self.head_dim = int(head_dim)
        self.max_seq_len = int(max_seq_len)
        self.theta = float(theta)
        self.pct = float(pct)

        rope_dim = int(self.head_dim * self.pct)
        rope_dim = rope_dim - (rope_dim % 2)
        rope_dim = max(0, min(rope_dim, self.head_dim))
        self.rope_dim = rope_dim

        if self.rope_dim > 0:
            inv_freq = 1.0 / (
                self.theta ** (torch.arange(0, self.rope_dim, 2).float() / self.rope_dim)
            )
            t = torch.arange(self.max_seq_len, dtype=torch.float32)
            freqs = torch.outer(t, inv_freq)  # [T, rope_dim/2]
            emb = torch.cat([freqs, freqs], dim=-1)  # [T, rope_dim]
            cos = emb.cos()
            sin = emb.sin()
        else:
            cos = torch.empty(self.max_seq_len, 0, dtype=torch.float32)
            sin = torch.empty(self.max_seq_len, 0, dtype=torch.float32)

        self.register_buffer("cos_cached", cos, persistent=False)
        self.register_buffer("sin_cached", sin, persistent=False)

    def forward(
        self, q: torch.Tensor, k: torch.Tensor, seq_len: int, offset: int = 0
    ) -> tuple[torch.Tensor, torch.Tensor]:
        """Apply RoPE to q,k. q,k: [B, nH, T, Hd].

        `offset` is the absolute position of the first token in q,k — nonzero
        during KV-cached incremental decoding, where the new tokens sit at
        positions [offset, offset+seq_len).
        """
        end = offset + seq_len
        if end > self.max_seq_len:
            raise ValueError(
                f"position {end} exceeds max_seq_len={self.max_seq_len} for RoPE cache"
            )
        if self.rope_dim == 0:
            return q, k

        cos = self.cos_cached[offset:end].to(dtype=q.dtype, device=q.device)  # [T, rope_dim]
        sin = self.sin_cached[offset:end].to(dtype=q.dtype, device=q.device)  # [T, rope_dim]
        cos = cos.unsqueeze(0).unsqueeze(0)  # [1,1,T,rope_dim]
        sin = sin.unsqueeze(0).unsqueeze(0)

        q1, q2 = q[..., : self.rope_dim], q[..., self.rope_dim :]
        k1, k2 = k[..., : self.rope_dim], k[..., self.rope_dim :]

        q1 = q1 * cos + _rotate_half(q1) * sin
        k1 = k1 * cos + _rotate_half(k1) * sin

        q = torch.cat([q1, q2], dim=-1)
        k = torch.cat([k1, k2], dim=-1)
        return q, k


class SwiGLU(nn.Module):
    def __init__(self, cfg: GPTConfig):
        super().__init__()
        self.w1 = nn.Linear(cfg.d_model, cfg.d_ff, bias=False)
        self.w3 = nn.Linear(cfg.d_model, cfg.d_ff, bias=False)
        self.w2 = nn.Linear(cfg.d_ff, cfg.d_model, bias=False)
        self.drop = nn.Dropout(cfg.dropout)

    def forward(self, x: torch.Tensor) -> torch.Tensor:
        x = F.silu(self.w1(x)) * self.w3(x)
        x = self.w2(x)
        return self.drop(x)


class CausalSelfAttention(nn.Module):
    def __init__(self, cfg: GPTConfig):
        super().__init__()
        assert cfg.d_model % cfg.n_heads == 0
        assert cfg.n_heads % cfg.n_kv_heads == 0
        self.cfg = cfg
        self.head_dim = cfg.d_model // cfg.n_heads
        self.kv_dim = cfg.n_kv_heads * self.head_dim

        # QKV fused: one matmul instead of three. K/V carry n_kv_heads (GQA);
        # n_kv_heads == n_heads is plain MHA with the historical 3*d_model layout.
        self.qkv = nn.Linear(cfg.d_model, cfg.d_model + 2 * self.kv_dim, bias=False)
        # residual branch output projection
        self.proj = nn.Linear(cfg.d_model, cfg.d_model, bias=False)
        self.drop = nn.Dropout(cfg.dropout)

        self.rope = RotaryEmbedding(
            head_dim=self.head_dim,
            max_seq_len=cfg.max_seq_len,
            theta=cfg.rope_theta,
            pct=cfg.rope_pct,
        )

    @staticmethod
    def _incremental_mask(T: int, past_len: int, device: torch.device) -> torch.Tensor:
        """Bottom-right causal mask [T, past_len+T] (True = attend) for decoding
        T new queries against past_len cached keys plus the new keys."""
        q_pos = past_len + torch.arange(T, device=device)
        k_pos = torch.arange(past_len + T, device=device)
        return k_pos[None, :] <= q_pos[:, None]

    def forward(
        self,
        x: torch.Tensor,
        past_kv: tuple[torch.Tensor, torch.Tensor] | None = None,
        use_cache: bool = False,
    ):
        """x: [B, T, C]. With no cache this is byte-identical to a plain causal
        forward and returns the output tensor. With `use_cache` (or a supplied
        `past_kv`) it also returns the updated (k, v) for this layer."""
        B, T, C = x.shape
        past_len = 0 if past_kv is None else past_kv[0].size(2)
        if past_len + T > self.cfg.max_seq_len:
            raise ValueError(
                f"cache length {past_len + T} exceeds max_seq_len={self.cfg.max_seq_len}"
            )

        qkv = self.qkv(x)  # [B, T, C + 2*kv_dim]
        q, k, v = qkv.split([C, self.kv_dim, self.kv_dim], dim=-1)

        q = q.view(B, T, self.cfg.n_heads, self.head_dim).transpose(1, 2)  # [B,nH,T,Hd]
        k = k.view(B, T, self.cfg.n_kv_heads, self.head_dim).transpose(1, 2)  # [B,nKV,T,Hd]
        v = v.view(B, T, self.cfg.n_kv_heads, self.head_dim).transpose(1, 2)

        # RoPE rotates only the new tokens, at their absolute positions.
        q, k = self.rope(q, k, seq_len=T, offset=past_len)

        # Prepend cached keys/values (already rotated when they were new). The
        # cache stays un-expanded at n_kv_heads so its memory reflects GQA.
        if past_kv is not None:
            k = torch.cat([past_kv[0], k], dim=2)
            v = torch.cat([past_kv[1], v], dim=2)
        present = (k, v) if use_cache else None

        # Expand grouped KV heads to the full head count for attention. KV head g
        # serves query heads [g*rep, (g+1)*rep) — repeat_interleave matches SDPA's
        # enable_gqa grouping (torch >= 2.5), which can replace this someday.
        if self.cfg.n_kv_heads != self.cfg.n_heads:
            rep = self.cfg.n_heads // self.cfg.n_kv_heads
            k = k.repeat_interleave(rep, dim=1)
            v = v.repeat_interleave(rep, dim=1)

        dropout_p = float(self.cfg.dropout) if (self.training and self.cfg.dropout > 0) else 0.0

        if q.device.type == "cuda":
            if past_len == 0:
                y = F.scaled_dot_product_attention(
                    q, k, v, attn_mask=None, dropout_p=dropout_p, is_causal=True
                )
            else:
                y = F.scaled_dot_product_attention(
                    q,
                    k,
                    v,
                    attn_mask=self._incremental_mask(T, past_len, q.device),
                    dropout_p=dropout_p,
                )
        else:
            scale = 1.0 / math.sqrt(self.head_dim)
            att = torch.matmul(q * scale, k.transpose(-2, -1))  # [B,nH,T,past_len+T]
            if past_len == 0:
                mask = torch.triu(torch.ones((T, T), device=q.device, dtype=torch.bool), diagonal=1)
                att = att.masked_fill(mask, float("-inf"))
            else:
                allow = self._incremental_mask(T, past_len, q.device)  # [T, past_len+T]
                att = att.masked_fill(~allow, float("-inf"))
            att = F.softmax(att, dim=-1)
            if dropout_p > 0.0:
                att = F.dropout(att, p=dropout_p)
            y = torch.matmul(att, v)

        y = y.transpose(1, 2).contiguous().view(B, T, C)
        y = self.drop(self.proj(y))
        if use_cache:
            return y, present
        return y


class Block(nn.Module):
    def __init__(self, cfg: GPTConfig):
        super().__init__()
        self.norm1 = RMSNorm(cfg.d_model)
        self.attn = CausalSelfAttention(cfg)
        self.norm2 = RMSNorm(cfg.d_model)
        self.mlp = SwiGLU(cfg)

    def forward(
        self,
        x: torch.Tensor,
        past_kv: tuple[torch.Tensor, torch.Tensor] | None = None,
        use_cache: bool = False,
    ):
        if use_cache or past_kv is not None:
            attn_out, present = self.attn(self.norm1(x), past_kv=past_kv, use_cache=True)
            x = x + attn_out
            x = x + self.mlp(self.norm2(x))
            return x, present
        x = x + self.attn(self.norm1(x))
        x = x + self.mlp(self.norm2(x))
        return x


class GPT(nn.Module):
    def __init__(self, cfg: GPTConfig):
        super().__init__()
        self.cfg = cfg

        self.tok_emb = nn.Embedding(cfg.vocab_size, cfg.d_model)
        self.drop = nn.Dropout(cfg.dropout)

        self.blocks = nn.ModuleList([Block(cfg) for _ in range(cfg.n_layers)])
        self.norm_f = RMSNorm(cfg.d_model)

        self.lm_head = nn.Linear(cfg.d_model, cfg.vocab_size, bias=False)
        if cfg.tie_embeddings:
            self.lm_head.weight = self.tok_emb.weight

        # Base init everywhere...
        self.apply(self._init_weights)
        # ...then scale init ONLY on residual-branch output projections: attn.proj and mlp.w2
        self._init_residual_projections()

    def _init_weights(self, m: nn.Module):
        if isinstance(m, (nn.Linear, nn.Embedding)):
            torch.nn.init.normal_(m.weight, mean=0.0, std=0.02)

    def _init_residual_projections(self):
        std = 0.02 / math.sqrt(2.0 * float(self.cfg.n_layers))
        for blk in self.blocks:
            torch.nn.init.normal_(blk.attn.proj.weight, mean=0.0, std=std)
            torch.nn.init.normal_(blk.mlp.w2.weight, mean=0.0, std=std)

    def forward(
        self,
        input_ids: torch.Tensor,
        past_kv: list[tuple[torch.Tensor, torch.Tensor]] | None = None,
        use_cache: bool = False,
    ):
        """Default call `model(input_ids)` returns logits [B, T, V] — unchanged.

        For incremental decoding, pass `use_cache=True` to also get a per-layer
        list of (k, v) tensors, and feed it back as `past_kv` with only the new
        token(s) on the next call. See `generate`.
        """
        B, T = input_ids.shape
        past_len = 0 if past_kv is None else past_kv[0][0].size(2)
        if past_len + T > self.cfg.max_seq_len:
            raise ValueError(
                f"T={T} with cache={past_len} exceeds max_seq_len={self.cfg.max_seq_len}"
            )
        if T < 1:
            raise ValueError("Empty sequence")
        caching = use_cache or (past_kv is not None)

        x = self.tok_emb(input_ids)
        x = self.drop(x)
        presents: list[tuple[torch.Tensor, torch.Tensor]] = []
        for i, blk in enumerate(self.blocks):
            layer_past = past_kv[i] if past_kv is not None else None
            if caching:
                x, present = blk(x, past_kv=layer_past, use_cache=True)
                presents.append(present)
            else:
                x = blk(x)
        x = self.norm_f(x)
        logits = self.lm_head(x)
        if caching:
            return logits, presents
        return logits

    @staticmethod
    def _sample_token(
        logits: torch.Tensor, temperature: float, top_k: int, top_p: float
    ) -> torch.Tensor:
        """logits: [B, V] -> next token [B, 1]. temperature<=0 is greedy."""
        if temperature <= 0:
            return logits.argmax(dim=-1, keepdim=True)
        logits = logits / temperature
        if top_k and top_k > 0:
            k = min(int(top_k), logits.size(-1))
            thresh = torch.topk(logits, k, dim=-1).values[:, -1, None]
            logits = logits.masked_fill(logits < thresh, float("-inf"))
        if top_p and top_p < 1.0:
            sorted_logits, sorted_idx = torch.sort(logits, descending=True, dim=-1)
            cum = torch.softmax(sorted_logits, dim=-1).cumsum(dim=-1)
            drop_sorted = cum > top_p
            drop_sorted[..., 0] = False
            drop = torch.zeros_like(drop_sorted).scatter(-1, sorted_idx, drop_sorted)
            logits = logits.masked_fill(drop, float("-inf"))
        probs = torch.softmax(logits, dim=-1)
        return torch.multinomial(probs, num_samples=1)

    @torch.no_grad()
    def generate(
        self,
        input_ids: torch.Tensor,
        max_new_tokens: int,
        *,
        temperature: float = 1.0,
        top_k: int = 0,
        top_p: float = 1.0,
        eos_id: int | None = None,
    ) -> torch.Tensor:
        """KV-cached incremental decoding. input_ids: [B, T] -> [B, T + n].

        Prefills the prompt once, then feeds one new token per step against the
        cache (O(T) forwards of length 1) instead of re-running the full growing
        sequence each step. Stops early if all rows emit `eos_id`.
        """
        was_training = self.training
        self.eval()
        logits, past = self.forward(input_ids, use_cache=True)
        out = input_ids
        for _ in range(int(max_new_tokens)):
            next_tok = self._sample_token(logits[:, -1, :], temperature, top_k, top_p)
            out = torch.cat([out, next_tok], dim=1)
            if eos_id is not None and bool((next_tok.squeeze(1) == eos_id).all()):
                break
            if out.size(1) >= self.cfg.max_seq_len:
                break
            logits, past = self.forward(next_tok, past_kv=past, use_cache=True)
        if was_training:
            self.train()
        return out