{"id":632,"date":"2023-09-26T21:10:59","date_gmt":"2023-09-26T13:10:59","guid":{"rendered":"https:\/\/harson.co\/?p=632"},"modified":"2023-10-09T21:54:11","modified_gmt":"2023-10-09T13:54:11","slug":"jyys-os-m1pstree","status":"publish","type":"post","link":"https:\/\/harson.co\/index.php\/2023\/09\/26\/jyys-os-m1pstree\/","title":{"rendered":"Jyy’s OS-[M1]pstree"},"content":{"rendered":"\n

\u4eca\u5929\u4ece\u8fd9\u7bc7\u535a\u5ba2\u5f00\u59cb\u8bb0\u5f55\u5b66\u4e60CS\u4e4b\u8def\uff0c\u672c\u6b21\u5b66\u4e60\u7684\u662f\u5357\u4eac\u5927\u5b66\u848b\u708e\u5ca9\u8001\u5e08\u7684\u64cd\u4f5c\u7cfb\u7edf\uff1a\u8bbe\u8ba1\u4e0e\u5b9e\u73b0 (2023 \u6625\u5b63\u5b66\u671f)<\/a>\u3002<\/p>\n\n\n\n

\u848b\u8001\u5e08\u8bf4\uff0c\u4ec5\u5b8c\u6210\u5b9e\u9a8c\u5373\u53ef\u5b8c\u6210\u64cd\u4f5c\u7cfb\u7edf\u7684\u5b66\u4e60\uff0c\u5b9e\u9645\u5b8c\u6210\u5b9e\u9a8c\u65f6\u786e\u5b9e\u53d1\u73b0\u4e86\u81ea\u5df1\u975e\u5e38\u591a\u6709\u5f85\u6b20\u7f3a\u7684\u5730\u65b9\uff0c\u7b2c\u4e00\u4e2a\u5b9e\u9a8c\u5b8c\u6210\u4e00\u4e2apstree\u505a\u4e86\u6570\u5929\u4e5f\u53ea\u5b8c\u6210\u4e86\u5efa\u6811\u90e8\u5206\uff0c\u6253\u5370\u8fdb\u7a0b\u6811\u90e8\u5206\u53c2\u8003\u4e86SiyuanYue\/NJUOSLab-M1-pstree<\/a>\u8fd9\u4e2a\u5b9e\u9a8c\u624d\u5f97\u4ee5\u5b8c\u6210(\u6211\u771f\u662f\u592a\u83dc\u4e86)<\/p>\n\n\n\n

0x00\u9605\u8bfb\u5b9e\u9a8c\u8bf4\u660e<\/h2>\n\n\n\n

\u5b9e\u9a8c\u63cf\u8ff0\/\u63cf\u8ff0<\/strong><\/p>\n\n\n\n

\n

\u5b9e\u73b0 pstree \u6253\u5370\u8fdb\u7a0b\u4e4b\u95f4\u7684\u6811\u72b6\u7684\u7236\u5b50\u5173\u7cfb\uff1bLinux \u7684 psmisc \u4e2d pstree \u7684\u5b9e\u73b0\u5927\u7ea6\u6709 1,300 \u884c\uff0c\u652f\u6301\u591a\u79cd\u547d\u4ee4\u884c\u53c2\u6570\u3002\u8fd9\u4e2a\u5b9e\u9a8c\u91cc\u5b9e\u73b0\u6700\u7b80\u5355\u7684\u5c31\u884c\u3002\u5927\u5bb6\u53ef\u4ee5\u5148\u73a9\u4e00\u4e0b Linux \u7684 pstree\uff0c\u4f7f\u7528 man \u547d\u4ee4\u67e5\u770b pstree \u652f\u6301\u7684\u529f\u80fd\uff0c\u5e76\u8bd5\u4e00\u8bd5\u3002\u5728\u8fd9\u4e2a\u5b9e\u9a8c\u4e2d\uff0c\u6211\u4eec\u9700\u8981\u5b9e\u73b0\u5b83\u7684\u7b80\u5316\u7248\uff1a<\/p>\n\n\n\n

pstree [OPTION]\u2026<\/p>\n\n\n\n

\u628a\u7cfb\u7edf\u4e2d\u7684\u8fdb\u7a0b\u6309\u7167\u7236\u4eb2-\u5b69\u5b50\u7684\u6811\u72b6\u7ed3\u6784\u6253\u5370\u5230\u7ec8\u7aef\u3002<\/p>\n\n\n\n

-p \u6216 –show-pids: \u6253\u5370\u6bcf\u4e2a\u8fdb\u7a0b\u7684\u8fdb\u7a0b\u53f7\u3002
-n \u6216 –numeric-sort: \u6309\u7167pid\u7684\u6570\u503c\u4ece\u5c0f\u5230\u5927\u987a\u5e8f\u8f93\u51fa\u4e00\u4e2a\u8fdb\u7a0b\u7684\u76f4\u63a5\u5b69\u5b50\u3002
-V \u6216 –version: \u6253\u5370\u7248\u672c\u4fe1\u606f\u3002
\u4f60\u53ef\u4ee5\u5728\u547d\u4ee4\u884c\u4e2d\u89c2\u5bdf\u7cfb\u7edf\u7684 pstree \u7684\u6267\u884c\u884c\u4e3a (\u5982\u6267\u884c pstree -V\u3001pstree –show-pids \u7b49)\u3002\u8fd9\u4e9b\u53c2\u6570\u53ef\u80fd\u4efb\u610f\u7ec4\u5408\uff0c\u4f46\u4f60\u4e0d\u9700\u8981\u5904\u7406\u5355\u5b57\u6bcd\u53c2\u6570\u5408\u5e76\u7684\u60c5\u51b5\uff0c\u4f8b\u5982 -np\u3002<\/p>\n<\/blockquote>\n\n\n\n

\u5b66\u4e60POSIX\u6807\u51c6<\/strong><\/p>\n\n\n\n

\u4e0a\u8ff0\u8981\u6c42\u662f\u6309\u7167man page\u7684\u683c\u5f0f\u5199\u51fa\u7684\uff0cPOSIX\u5bf9\u547d\u4ee4\u884c\u5de5\u5177\u53c2\u6570\u4e5f\u6709\u683c\u5f0f\u8981\u6c42\uff0c\u89c1\uff1aUtility Argument Syntax<\/a><\/p>\n\n\n\n

\u540c\u65f6\uff0cPOSIX\u6807\u51c6\u4e5f\u5236\u5b9a\u4e86\u7a0b\u5e8f\u8fd4\u56de\u503c\u7684\u542b\u4e49\uff0c\u8fd4\u56de\u975e0\u4e3a\u5931\u8d25\uff0c\u5982diff \u8fd4\u56de 1 \u8868\u793a\u6bd4\u8f83\u7684\u6587\u4ef6\u4e0d\u540c\uff0c\u8fd4\u56de 2 \u8868\u793a\u8bfb\u53d6\u6587\u4ef6\u5931\u8d25<\/p>\n\n\n\n

procfs<\/strong><\/p>\n\n\n\n

\u5728UNIX\u54f2\u5b66\u4e2d\uff0cEverything is a file. \u56e0\u6b64\uff0c\u8bfb\u53d6\u5f53\u524d\u8fdb\u7a0b\u72b6\u6001\u4e5f\u4f7f\u7528\u8bfb\u53d6\u6587\u4ef6\u7684\u65b9\u5f0f\u3002\u5728C\u8bed\u8a00\u4e2d\u4f7f\u7528pid_t\u7c7b\u578b\u8868\u793apid\uff0c\u5728glibc\u4e2d\u662ftypedef int pid_t\uff0c\u8fd9\u4e00\u70b9\u5728glibc\u6587\u6863<\/a>\u4e2d\u6709\u8bf4\u660e\u3002<\/p>\n\n\n\n

man 5 proc<\/code><\/pre>\n\n\n\n
\u901a\u8fc7\u4e0a\u8ff0\u547d\u4ee4\u9605\u8bfb\u6587\u6863\uff0c\u6211\u4eec\u5f97\u5230\u5173\u952e\u4fe1\u606f<\/p>\n\n\n\n
    \n
  1. \/proc\/[pid]\u76ee\u5f55\u8868\u793aPID\u5bf9\u5e94\u8fdb\u7a0b\u7684\u4fe1\u606f<\/li>\n\n\n\n
  2. \/proc\/[pid]\/stat\u6587\u4ef6\u5305\u542b\u4e86\u8fdb\u7a0b\u540d\uff0cppid\u5373\u7236\u8fdb\u7a0bpid<\/li>\n<\/ol>\n\n\n\n
    0x01\u5b9e\u9a8c\u4ee3\u7801<\/h2>\n\n\n\n
    \u7531\u4e8e\u5bf9\u6811\u7684\u6253\u5370\u4e0d\u591f\u719f\u6089\uff0c\u53c2\u8003\u4e86\u4ed6\u4eba\u4ee3\u7801\u540e\u624d\u52c9\u5f3a\u5199\u51fa\u6765\uff0c\u76ee\u524d\u8fd9\u4efd\u4ee3\u7801\u6709\u4ee5\u4e0b\u51e0\u4e2a\u95ee\u9898<\/p>\n\n\n\n
      \n
    • \u8fdb\u7a0b\u540d\u4e2d\u51fa\u73b0\u7a7a\u683c\u4f1a\u51fa\u73b0\u9519\u4f4d\u95ee\u9898\uff0c\u8fd9\u4e2a\u95ee\u9898\u6e90\u81ea\u8bfb\u53d6\/proc\/[pid]\/stat\u6587\u4ef6\u65f6\u4f7f\u7528\u7a7a\u683c\u5206\u9694<\/li>\n\n\n\n
    • \u8f93\u51fa\u7684\u8fdb\u7a0b\u6811\u4e0a\u4e0b\u6ca1\u6709\u8fde\u63a5\u8d77\u6765\uff0c-+-\u5206\u652f\u90e8\u5206\u6ca1\u6709\u548cGNU pstree\u5b8c\u5168\u4e00\u81f4<\/li>\n\n\n\n
    • \u5728\u5b9e\u9a8c\u8bf4\u660e\u4e2d\u63cf\u8ff0\u5230\u7684\u53ef\u80fd\u5bfc\u81f4UB\u7684\u95ee\u9898<\/li>\n<\/ul>\n\n\n\n
      #include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <assert.h>\n#include <dirent.h>\n\ntypedef struct pTree *node;\nstruct pTree\n{\n  int pid;\n  char* p_name;\n  node children[100];\n};\n\nnode node_num[65537];\nint  pid_num[65537];\nchar path[100] = {0};\nint pid_count = 0;\n\nvoid init_num()\n{\n  for(int i=0; i<65537; i++)\n  {\n    node_num[i] = NULL;\n    pid_num[i]  = 0;\n  }\n}\n\n\/\/ \u83b7\u53d6stat\u6587\u4ef6\u7684\u7b2c[part]\u90e8\u5206 \nchar* get_stat(int pid, int part)\n{\n  char* result;\n  const char space[2] = \" \";\n  char stat_path[128] = {0};\n  char stat_buffer[128] = {0};\n  char* proc_result = (char*)malloc(256 *sizeof(char));\n\n  sprintf(stat_path ,\"\/proc\/%d\/stat\", pid);\n  FILE *stat_fp = fopen(stat_path, \"r\");\n  if (stat_fp == NULL)\n  {\n    perror(\"fopen\");  \n    return NULL;  \n  }\n  fread(stat_buffer, 1, sizeof(stat_buffer), stat_fp);\n  fclose(stat_fp);\n\/*\n * \u6587\u4ef6\u5185\u5bb9\u4e3a\n * 1 (systemd) S 0 1 1 0 -1 4194560...\n * \u9700\u8981\u83b7\u53d6\u5230\u8fdb\u7a0b\u540dsystem\uff0c\u6545\u4f7f\u7528\u7a7a\u683c\u5206\u9694\n * \u800c\u540e\u53bb\u9664\u5de6\u53f3\u62ec\u53f7\n *\/\n  result = strtok(stat_buffer, space);\n  for(int i=0; i<part; i++)\n  {\n    result = strtok(NULL, space);\n  }\n  strcpy(proc_result, result);\n  return proc_result;\n}\n\n\/\/ \u6839\u636estat\u6587\u4ef6\u83b7\u53d6ppid\nint get_proc_ppid(int pid)\n{\n  int ppid = 0;\n  char* ppid_s = get_stat(pid, 3);\n  ppid = atoi(ppid_s);\n  return ppid;\n}\n\n\/\/ \u6839\u636estat\u6587\u4ef6\u83b7\u53d6\u8fdb\u7a0b\u540d\nchar* get_proc_name(int pid)\n{\n  char* name = get_stat(pid, 1);\n  \/\/ \u53bb\u9664\u5de6\u53f3\u62ec\u53f7\n  size_t len = strlen(name);\n  name[len - 1] = '\\0';\n  for(int j=0; j<len; j++)\n  {\n      name[j] = name[j+1];\n  }\n  return name;\n}\n\nint create_tree()\n{\n  DIR *dir;\n  struct dirent *entry;  \n  \/\/ \u83b7\u53d6pid\u5217\u8868\n  dir = opendir(\"\/proc\/\");  \n  if (dir == NULL) \n  {\n      perror(\"opendir\");  \n      return 1;  \n  }  \n  int i = 0;\n  while ((entry = readdir(dir)) != NULL) \n  {\n    \/\/ \u5efa\u7acb\u6811\u8282\u70b9\uff0c\u5e76\u5c06\u8fdb\u7a0b\u540d\u4ee5\u53capid\u653e\u5165\u8282\u70b9\u4e2d\n    char *name = entry->d_name;\n    if(name[0] >= 48 && name[0] <= 57)\n    {\n      \/\/ printf(\"%s\\n\", name);\n      int pid = atoi(name);\n      pid_num[i] = atoi(name);\n\n      node pNode = (node)malloc(sizeof(struct pTree));\n      pNode->pid = pid;\n      pNode->p_name = get_proc_name(pid);\n\n      if(pNode->p_name == NULL)\n      {\n        perror(\"get_proc_name\");  \n        return 1;\n      }\n      \/\/ \u5168\u90e8\u8282\u70b9\u6307\u9488\u5b58\u5728\u4e00\u4e2a\u5168\u5c40\u6307\u9488\u6570\u7ec4\u4e2d\n      node_num[i] = pNode;\n      i++;\n    }\n    pid_count = i;\n  }\n  closedir(dir);\n\n    \n  \/\/ \u904d\u5386\u83b7\u53d6\u7236\u5b50\u5173\u7cfb\n  for(int i=0; i<pid_count; i++)\n  {\n    node curr_node = node_num[i];\n    int pid = curr_node->pid;\n    int ppid = get_proc_ppid(pid);\n    if(ppid == 0)\n    {\n      continue;\n    }\n    else\n    {\n      for(int j=0; j<pid_count; j++)\n      {\n        node parent_node = node_num[j];\n        int parent_pid = parent_node->pid;\n        if(parent_pid == ppid)\n        {\n          int x = 0;\n          while((parent_node->children)[x] != NULL)\n          {\n            x++;\n          }\n          (parent_node->children)[x] = curr_node;\n          \/\/ \u592a\u83dc\u4e86\uff0c\u5199\u51fa\u8fd9\u79cd\u4e94\u5c42\u5d4c\u5957\u7684\u5c4e\u5c71\u4ee3\u7801\n        }\n      }\n    }\n  }\n  return 0;\n}\n\nvoid print_tree(node root, int tab_length, int pid_out_flag)\n{\n  int child_flag = 2;\n  char str[100]={0};\n  \/\/ \u53f6\u5b50\u8282\u70b9\u76f4\u63a5\u6253\u5370\u540e\u8fd4\u56de\n  if((root->children)[0] == NULL)\n  {\n    if(pid_out_flag)\n    {\n      printf(\"%s(%d)\", root->p_name, root->pid);\n      return;\n    }\n    else\n    {\n      printf(\"%s\", root->p_name);\n      return;\n    }\n  }\n\n  if(pid_out_flag)\n  {\n    \/\/ \u901a\u8fc7\u5c06\u5f85\u6253\u5370\u5185\u5bb9\u653e\u5728\u5b57\u7b26\u4e32\u4e2d\u4fbf\u4e8e\u8ba1\u7b97\u957f\u5ea6\n    sprintf(str,\"%s(%d)--\", root->p_name, root->pid);\n  }\n  else\n  {\n    sprintf(str,\"%s--\", root->p_name);\n  }\n  printf(\"%s\", str);\n\n  \/\/ \u5224\u65ad\u8be5\u8282\u70b9\u662f\u5426\u53ea\u6709\u4e00\u4e2a\u5b50\u8fdb\u7a0b \n  if((root->children)[1] != NULL)\n  {\n    printf(\"+-\");\n  }\n  else\n  {\n    child_flag = 0;\n  }\n\n  \/\/ \u8fd9\u4e2a\u53d8\u91cf\u76f8\u5f53\u4e8ei\n  int while_count = 0;\n  while((root->children)[while_count] != NULL && while_count < 100)\n  {\n    node child_node = (root->children)[while_count];\n    int next_tab_len = strlen(str) + tab_length + child_flag;\n    print_tree(child_node, next_tab_len, pid_out_flag);\n\n    if((root->children)[while_count+1] != NULL && while_count+1 < 100)\n    {\n      printf(\"\\n\");\n\t\t\tfor (int i = 0; i <strlen(str)+tab_length; i++)\n\t\t\t{\n\t\t\t\tprintf(\" \");\n\t\t\t}\n\t\t\tprintf(\"|-\");\n    }\n    while_count++;\n  }\n}\n\nint main(int argc, char *argv[]) \n{\n  init_num();\n  int flag = 0;\n\n  for (int i = 0; i < argc; i++) \n  {\n    assert(argv[i]);\n    if(!strcmp(argv[i],  \"-V\") || !strcmp(argv[i],  \"--version\"))\n    {\n      flag = 1;\n      break;\n    }\n    else if(!strcmp(argv[i],  \"-p\") || !strcmp(argv[i],  \"--show-pids\"))\n    {\n      flag = 2;\n      break;\n    }\n    else if(!strcmp(argv[i],  \"-n\") || !strcmp(argv[i],  \"--numeric-sort\"))\n    {\n      flag = 3;\n      break;\n    }\n  }\n  assert(!argv[argc]);\n\n  if(create_tree())\n  {\n    \/\/ \u5efa\u6811\u671f\u95f4\u51fa\u73b0\u5f02\u5e38\uff0c\u9000\u51fa\n    return 1;\n  }\n  if(flag == 1)\n  {\n    \/\/ \u5c06\u7248\u672c\u4fe1\u606f\u6253\u5370\u5230stderr\n    fprintf(stderr,\"pstree for jyy's os\\n\");\n    return 0;\n  }\n  \/\/ -p\u53c2\u6570\u663e\u793aPID\n  if(flag == 2)\n  {\n    node root_node = node_num[0];\n    print_tree(root_node, 0, 1);\n  }\n  \/\/ -n\u53c2\u6570\u987a\u5e8f\u663e\u793aPID\n  else if(flag == 3)\n  {\n    \/\/ \u5728\u5efa\u6811\u65f6\u83b7\u53d6\u5230\u7684PID\u5df2\u7ecf\u662f\u6709\u5e8f\u7684\n    node root_node = node_num[0];\n    print_tree(root_node, 0, 1);\n  }\n  \/\/ \u9ed8\u8ba4\u60c5\u51b5\n  else\n  {\n    node root_node = node_num[0];\n    print_tree(root_node, 0, 0);\n  }\n  return 0;\n}\n<\/code><\/pre>\n\n\n\n
      0x02\u5b9e\u9a8c\u7ed3\u679c<\/h2>\n\n\n\n
      \u5b9e\u9a8c\u73af\u5883\uff1aUbuntu 20.04<\/p>\n\n\n\n
      -p\u53c2\u6570\u6b63\u786e\u8f93\u51fa\u8fdb\u7a0b\u540d\u4ee5\u53ca\u987a\u5e8f\u8f93\u51faPID<\/p>\n\n\n\n
      \"\"<\/div><\/figure>\n\n\n\n
      -V\u53c2\u6570\u6b63\u786e\u8f93\u51fa\u5230stderr<\/p>\n\n\n\n
      \"\"<\/div><\/figure>\n","protected":false},"excerpt":{"rendered":"
      \u4eca\u5929\u4ece\u8fd9\u7bc7\u535a\u5ba2\u5f00\u59cb\u8bb0\u5f55\u5b66\u4e60CS\u4e4b\u8def\uff0c\u672c\u6b21\u5b66\u4e60\u7684\u662f\u5357\u4eac\u5927\u5b66\u848b\u708e\u5ca9\u8001\u5e08\u7684\u64cd\u4f5c\u7cfb\u7edf\uff1a\u8bbe\u8ba1\u4e0e\u5b9e\u73b0 (2023 \u6625\u5b63\u5b66\u671f […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[22],"tags":[],"class_list":["post-632","post","type-post","status-publish","format-standard","hentry","category-computerscience"],"_links":{"self":[{"href":"https:\/\/harson.co\/index.php\/wp-json\/wp\/v2\/posts\/632","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/harson.co\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/harson.co\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/harson.co\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/harson.co\/index.php\/wp-json\/wp\/v2\/comments?post=632"}],"version-history":[{"count":9,"href":"https:\/\/harson.co\/index.php\/wp-json\/wp\/v2\/posts\/632\/revisions"}],"predecessor-version":[{"id":649,"href":"https:\/\/harson.co\/index.php\/wp-json\/wp\/v2\/posts\/632\/revisions\/649"}],"wp:attachment":[{"href":"https:\/\/harson.co\/index.php\/wp-json\/wp\/v2\/media?parent=632"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/harson.co\/index.php\/wp-json\/wp\/v2\/categories?post=632"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/harson.co\/index.php\/wp-json\/wp\/v2\/tags?post=632"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}