C语言中如何将自定义时间字段转换为Unix时间戳（MCU场景）

Hey Thomas, great question—your initial idea makes sense at first glance, but you’re absolutely right to flag the issues with leap years and varying month lengths. Those details are dealbreakers for accurate Unix timestamp conversion, so let’s break down how to do this properly.

Your approach uses fixed values for years and months, but:

• A "year" isn’t always 31556952 seconds (that’s the average over 400 years, but individual years are either 365 or 366 days).
• Months range from 28-31 days, so multiplying by 2630000 (~30.44 days) will be wrong for most months.
• Unix time counts seconds since 1970-01-01 00:00:00 UTC, so you also need to account for the offset from this epoch, not just raw time components.

Unix time doesn’t "handle" these edge cases directly—it’s just a linear count of seconds. The work happens when converting human-readable datetime to this linear count: you have to calculate exactly how many seconds have passed from the epoch to your target datetime, accounting for:

• Leap years (adding an extra day every 4 years, except century years not divisible by 400)
• Variable month lengths (28-31 days per month)
• The fact that the epoch starts at 1970, not year 0.

Follow these steps to get an accurate timestamp:

1. Calculate seconds from 1970 to the year before your target year

   • For each year between 1970 and target_year - 1, add 31536000 seconds (365 days × 86400 sec/day).
   • For every leap year in that range, add an extra 86400 seconds (the extra day).

2. Calculate seconds from the start of the target year to the start of the target month

   • Use a lookup table for month lengths (e.g., [31,28,31,30,31,30,31,31,30,31,30,31] for non-leap years).
   • Sum the days of all months before your target month, then multiply by 86400.
   • If the target year is a leap year and the target month is after February, add an extra 86400 seconds.

3. Calculate seconds from the start of the target month to your target datetime

   • Add (day - 1) × 86400 (since day 1 is 0 seconds into the month).
   • Add hour × 3600 + minute × 60 + second.

Since you’re working with a microcontroller, here’s a lightweight C-style implementation that’s easy to port:

// Lookup table for days per month (non-leap year)
const uint8_t month_days[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

// Helper to check if a year is a leap year
bool is_leap_year(uint16_t year) {
    if (year % 4 != 0) return false;
    if (year % 100 != 0) return true;
    return (year % 400 == 0);
}

// Convert datetime to Unix timestamp (uses 64-bit integer to avoid 2038 overflow)
uint64_t datetime_to_unix(uint16_t year, uint8_t month, uint8_t day, uint8_t hour, uint8_t minute, uint8_t second) {
    uint64_t unix_ts = 0;

    // Step 1: Add seconds from 1970 to year-1
    for (uint16_t y = 1970; y < year; y++) {
        unix_ts += 31536000; // 365 days in seconds
        if (is_leap_year(y)) {
            unix_ts += 86400; // Add extra day for leap year
        }
    }

    // Step 2: Add seconds from start of year to start of month
    uint8_t total_days = 0;
    for (uint8_t m = 1; m < month; m++) {
        total_days += month_days[m - 1];
    }
    if (month > 2 && is_leap_year(year)) {
        total_days += 1; // Add leap day if applicable
    }
    unix_ts += (uint64_t)total_days * 86400;

    // Step 3: Add seconds from start of month to target datetime
    unix_ts += (uint64_t)(day - 1) * 86400;
    unix_ts += (uint64_t)hour * 3600;
    unix_ts += (uint64_t)minute * 60;
    unix_ts += second;

    return unix_ts;
}

• Use 64-bit integers: 32-bit Unix timestamps overflow in 2038, so uint64_t is safer for modern systems.
• Incrementing the timestamp: Once you have the initial Unix timestamp, using an interrupt to increment it by 1 every second is a perfect approach—this avoids recalculating the datetime from scratch every time, saving resources.
• Avoid floating points: All calculations here use integers, which is ideal for microcontrollers with limited processing power.

内容的提问来源于stack exchange，提问作者Thomas Morris