代码生成(用C写一个http请求行解析，并根据http请求路径生成一棵树)

以下是一个简单的示例代码，用于解析HTTP请求中的请求行，并根据请求路径生成一棵树。

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

// 定义 HTTP 请求行结构体
typedef struct {
    char *method;
    char *path;
    char *version;
} http_request_t;

// 解析 HTTP 请求行
http_request_t* parse_http_request(char *request) {
    http_request_t *http_req = (http_request_t*)malloc(sizeof(http_request_t));
    if (http_req == NULL) {
        return NULL;
    }
    char *token;
    token = strtok(request, " \r\n");
    if (token == NULL) {
        return NULL;
    }
    http_req->method = strdup(token);
    token = strtok(NULL, " \r\n");
    if (token == NULL) {
        return NULL;
    }
    http_req->path = strdup(token);
    token = strtok(NULL, " \r\n");
    if (token == NULL) {
        return NULL;
    }
    http_req->version = strdup(token);
    return http_req;
}

// 定义 HTTP 路径节点结构体
typedef struct path_node_t {
    char *name;
    struct path_node_t *child;
    struct path_node_t *sibling;
} path_node_t;

// 生成 HTTP 路径树
path_node_t* generate_path_tree(char *path) {
    path_node_t *root = (path_node_t*)malloc(sizeof(path_node_t));
    if (root == NULL) {
        return NULL;
    }
    root->name = NULL;
    root->child = NULL;
    root->sibling = NULL;
    path_node_t *cur_node = root;
    char *token;
    token = strtok(path, "/");
    while (token != NULL) {
        path_node_t *new_node = (path_node_t*)malloc(sizeof(path_node_t));
        if (new_node == NULL) {
            return NULL;
        }
        new_node->name = strdup(token);
        new_node->child = NULL;
        new_node->sibling = NULL;
        if (cur_node->child == NULL) {
            cur_node->child = new_node;
        } else {
            path_node_t *sibling = cur_node->child;
            while (sibling->sibling != NULL) {
                sibling = sibling->sibling;
            }
            sibling->sibling = new_node;
        }
        cur_node = new_node;
        token = strtok(NULL, "/");
    }
    return root;
}

int main() {
    char request[] = "GET /api/user/123 HTTP/1.1\r\nHost: localhost\r\n\r\n";
    http_request_t *http_req = parse_http_request(request);
    if (http_req == NULL) {
        printf("Failed to parse HTTP request.\n");
        return 1;
    }
    printf("Method: %s\n", http_req->method);
    printf("Path: %s\n", http_req->path);
    printf("Version: %s\n", http_req->version);
    path_node_t *root = generate_path_tree(http_req->path);
    if (root == NULL) {
        printf("Failed to generate path tree.\n");
        return 1;
    }
    printf("Path tree:\n");
    printf("  %s\n", root->name);
    path_node_t *child = root->child;
    while (child != NULL) {
        printf("  |- %s\n", child->name);
        child = child->sibling;
    }
    return 0;
}

该示例代码中，`parse_http_request`函数用于解析HTTP请求行，返回一个`http_request_t`结构体，其中包含了HTTP请求方法、请求路径和HTTP版本号。`generate_path_tree`函数用于根据请求路径生成一棵树，返回树的根节点。生成树时，我们将请求路径按照斜杠(`/`)分割成多个节点，并将每个节点作为树的一个子节点，从而形成一棵树。在示例中，我们只输出了根节点和其子节点，实际上生成的树可以包含多层子节点，以表示完整的请求路径。