如何使用gprof对程序进行性能分析

如何使用gprof对程序进行性能分析


目录

1 gprof概述
2 gprof原理简述
3 gprof使用
  3.1 gprof使用简述
  3.2 gprof使用示例
4 小结


1 gprof概述

    gprof 是 一个 GNU 的程序性能分析工具,可以用于分析C\C++程序的执行性能。gprof工具可以统计出各个函数的调用次数、执行时间、函数调用关系,具体功能可以通过 man gprof进一步了解。通常该工具在大多数linux内核的发行版本中会在你安装C/C++编译器的同时默认安装上。


2 gprof原理简述

    通过在编译、链接的时候使用 -pg 选项,就能够控制gcc/g++ 编译器在程序的每个函数中插入插桩函数,从而跟踪目标函数的执行时间、调用关系(通过函数调用堆栈查找)、执行次数等信息,并将相关数据保存到 gmon.out 文件中。

    【注意】: 必须是编译链接的时候都要添加 -pg 参数。并且目标程序不能使用 strip 命令去除符号表,否则 gprof 工具无法正常处理 gmon.out 到 profile.txt文件。


3 gprof使用

3.1 gprof使用简述

a、 在编译、链接设置中开启 -pg 参数:

    使用cmake,在CMakeList.txt中添加

SET(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -pg")
SET(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -pg")
SET(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -pg")
SET(CMAKE_SHARED_LINKER_FLAGS "${CMAKE_SHARED_LINKER_FLAGS} -pg")

    使用make,在Makefile中设置

CFLAGS += -pg
CPPFLAGS += -pg
LDFLAGS += -pg

b、 编译后正常运行程序

.testApp arg1 arg2

【注意】 运行程序后,要程序正常退出,才能正常生成 gmon.out 文件;在此步骤中程序是可以带命令行参数执行的。

c、 分析、收集数据

gprof testApp gmon.out > profile.txt

【注意】 在此步骤中,目标程序如果是带参的,此步骤不可以填入命令行参数。

d、 分析数据图形化

gprof2dot -e0 -n0 profile.txt > profile.dot
dot profile.dot -Tpng -o profile.png

【说明】 在此步骤中,需要通过 gprof2dot 和 dot工具将结果图形化,方便查看。

3.2 gprof使用示例

    上一小节简单讲述了如何 gprof 的使用,本小节会以 s_log_safe开源项目 为实例,介绍如何使用 gprof 工具 进行性能分析。

a、 clone s_log_safe项目源码

git clone https://github.com/smallerxuan/s_log_safe.git

cd s_log_safe

tree

clone完成后进入路径,能看到如下的目录结构:

在这里插入图片描述

b、 修改Makefile文件

gedit ./Makefile

用编辑器打开 Makefile文件,修改 FLAGS_BASE 关闭O2优化,添加 -pg 选项;给 LDFLAGS 追加 -pg;注释 strip 调用。

在这里插入图片描述

在这里插入图片描述
在这里插入图片描述

c、 调整测试用例并编译项目

gedit ./main.c

用编辑器打开 main.c 文件,对测试程序进行简单修改,不然测试程序不会自然结束。

#include <stdio.h>
#include "s_log_safe.h"

static int test_mark = 8;


void* thread_1_exec(void* arg)
{
    int* count =  (int*)arg;
    s_safe_tag("thread_1", S_LOG_SAFE_OPT_DEBUG);

    do {
        s_log_safe_a("%s %d","测试1",*count);
        usleep(5000);
    } while (*count -= 1);

    test_mark -= 1;
    return s_log_safe_null;
}

void* thread_2_exec(void* arg)
{
    int* count =  (int*)arg;
    s_safe_tag("thread_2", S_LOG_SAFE_OPT_DEBUG);

    do {
        s_log_safe_v("%s %d","测试2",*count);
        usleep(5000);
    } while (*count -= 1);

    test_mark -= 1;
    return s_log_safe_null;
}

void* thread_3_exec(void* arg)
{
    int* count =  (int*)arg;
    s_safe_tag("thread_3", S_LOG_SAFE_OPT_DEBUG);

    do {
        s_log_safe_e("%s %d","测试3",*count);
        usleep(5000);
    } while (*count -= 1);

    test_mark -= 1;
    return s_log_safe_null;
}

void* thread_4_exec(void* arg)
{
    int* count =  (int*)arg;
    s_safe_tag("thread_4", S_LOG_SAFE_OPT_DEBUG);

    do {
        s_log_safe_w("%s %d","测试4",*count);
        usleep(5000);
    } while (*count -= 1);

    test_mark -= 1;
    return s_log_safe_null;
}

void* thread_5_exec(void* arg)
{
    int* count =  (int*)arg;
    s_safe_tag("thread_5", S_LOG_SAFE_OPT_DEBUG);

    do {
        s_log_safe_t("%s %d","测试5",*count);
        usleep(5000);
    } while (*count -= 1);

    test_mark -= 1;
    return s_log_safe_null;
}

void* thread_6_exec(void* arg)
{
    int* count =  (int*)arg;
    s_safe_tag("thread_6", S_LOG_SAFE_OPT_DEBUG);

    do {
        s_log_safe_i("%s %d","测试6",*count);
        usleep(5000);
    } while (*count -= 1);

    test_mark -= 1;
    return s_log_safe_null;
}

void* thread_7_exec(void* arg)
{
    int* count =  (int*)arg;
    s_safe_tag("thread_7", S_LOG_SAFE_OPT_TRACE);

    do {
        s_log_safe_d("%s %d","测试7",*count);
        if((*count)%8 == 0) {
            s_safe_tag_log_level_limit_set(S_LOG_SAFE_OPT_DEBUG);
        } else {
            s_safe_tag_log_level_limit_set(S_LOG_SAFE_OPT_TRACE);
        }
        usleep(5000);
    } while (*count -= 1);

    test_mark -= 1;
    return s_log_safe_null;
}

void* thread_main_exec(void* arg)
{
    int count = 0;
    unsigned int log_safe_pool_cap = 0;
    unsigned int log_safe_pool_used = 0;
    s_safe_tag("main", S_LOG_SAFE_OPT_DEBUG);

    log_safe_pool_cap = s_log_safe_output_pool_cap_get();
    while(test_mark > 1) {
        log_safe_pool_used = s_log_safe_output_pool_used_get();
        s_log_safe_i("%s log_safe_pool_cap:%d log_safe_pool_used:%d count:%d","main", log_safe_pool_cap, log_safe_pool_used, count++);
        usleep(5000);
    }
    
    test_mark -= 1;
    return s_log_safe_null;
}

int main(void)
{
    int                  ret = 0;
    s_log_safe_thread_t* s_log_safe_thread_1_p;
    s_log_safe_thread_t* s_log_safe_thread_2_p;
    s_log_safe_thread_t* s_log_safe_thread_3_p;
    s_log_safe_thread_t* s_log_safe_thread_4_p;
    s_log_safe_thread_t* s_log_safe_thread_5_p;
    s_log_safe_thread_t* s_log_safe_thread_6_p;
    s_log_safe_thread_t* s_log_safe_thread_7_p;
    s_log_safe_thread_t* s_log_safe_thread_main_p;
    int                  count_1 = 77;
    int                  count_2 = 66;
    int                  count_3 = 55;
    int                  count_4 = 44;
    int                  count_5 = 33;
    int                  count_6 = 22;
    int                  count_7 = 11;

    ret = s_log_safe_init();
    if(ret != 0) {
        return 0;
    }
    s_log_safe_thread_7_p = s_log_safe_thread_create(thread_main_exec, (void*)s_log_safe_null, "", S_LOG_SAFE_THREAD_PRIORITY, 1024);
    s_log_safe_thread_1_p = s_log_safe_thread_create(thread_1_exec, (void*)&count_1, "", 10, 1024);
    s_log_safe_thread_2_p = s_log_safe_thread_create(thread_2_exec, (void*)&count_2, "", 10, 1024);
    s_log_safe_thread_3_p = s_log_safe_thread_create(thread_3_exec, (void*)&count_3, "", 12, 1024);
    s_log_safe_thread_4_p = s_log_safe_thread_create(thread_4_exec, (void*)&count_4, "", 12, 1024);
    s_log_safe_thread_5_p = s_log_safe_thread_create(thread_5_exec, (void*)&count_5, "", 11, 1024);
    s_log_safe_thread_6_p = s_log_safe_thread_create(thread_6_exec, (void*)&count_6, "", 11, 1024);
    s_log_safe_thread_7_p = s_log_safe_thread_create(thread_7_exec, (void*)&count_7, "", 10, 1024);

    while(test_mark != 0) {
        sleep(1);
    }
    return 0;
}

修改完成后运行make命令编译测试程序。

make

运行 make 命令后,会在 ./buld 路径生成目标测试程序。
在这里插入图片描述

d、 运测试程序

cd ./build/

./s_log_safe_test

切换到 ./build 路径后执行测试程序,通过 ls 会在路径下发现新生成了一个 gmon.out 文件。
在这里插入图片描述

e、 分析、收集数据

gprof s_log_safe_test gmon.out > profile.txt

通过该命令,可以在路径下看见导出的分析结果文件 profile.txt。在该文件中,详细的记录了 函数的执行时间、调用关系、执行次数等信息。但是还不是特别方便查看,毕竟看图会更直观。
在这里插入图片描述
profile.txt文件的内容如下:

Flat profile:

Each sample counts as 0.01 seconds.
 no time accumulated

  %   cumulative   self              self     total           
 time   seconds   seconds    calls  Ts/call  Ts/call  name    
  0.00      0.00     0.00     2048     0.00     0.00  s_log_safe_mutex_unlock
  0.00      0.00     0.00     2048     0.00     0.00  s_ring_buffer_unlock
  0.00      0.00     0.00     1294     0.00     0.00  s_log_safe_mutex_lock
  0.00      0.00     0.00     1294     0.00     0.00  s_ring_buffer_lock
  0.00      0.00     0.00      752     0.00     0.00  s_log_safe_mutex_try_lock
  0.00      0.00     0.00      752     0.00     0.00  s_log_strrchr
  0.00      0.00     0.00      751     0.00     0.00  s_ring_buffer_try_lock
  0.00      0.00     0.00      544     0.00     0.00  s_ring_buffer_could_read_num_get
  0.00      0.00     0.00      383     0.00     0.00  s_log_safe_out
  0.00      0.00     0.00      376     0.00     0.00  s_log_out_by_printf
  0.00      0.00     0.00      376     0.00     0.00  s_log_print
  0.00      0.00     0.00      376     0.00     0.00  s_log_safe_output
  0.00      0.00     0.00      376     0.00     0.00  s_ring_buffer_read_elements
  0.00      0.00     0.00      374     0.00     0.00  s_ring_buffer_write_elements
  0.00      0.00     0.00       78     0.00     0.00  s_log_safe_output_pool_used_get
  0.00      0.00     0.00        9     0.00     0.00  get_thread_policy
  0.00      0.00     0.00        9     0.00     0.00  s_log_safe_thread_create
  0.00      0.00     0.00        2     0.00     0.00  s_log_safe_mutex_create
  0.00      0.00     0.00        2     0.00     0.00  s_ring_buffer_lock_create
  0.00      0.00     0.00        1     0.00     0.00  s_log_safe_constructor
  0.00      0.00     0.00        1     0.00     0.00  s_log_safe_init
  0.00      0.00     0.00        1     0.00     0.00  s_log_safe_output_pool_cap_get
  0.00      0.00     0.00        1     0.00     0.00  s_ring_buffer_constructor
  0.00      0.00     0.00        1     0.00     0.00  s_ring_buffer_element_pool_constructor_malloc

 %         the percentage of the total running time of the
time       program used by this function.

cumulative a running sum of the number of seconds accounted
 seconds   for by this function and those listed above it.

 self      the number of seconds accounted for by this
seconds    function alone.  This is the major sort for this
           listing.

calls      the number of times this function was invoked, if
           this function is profiled, else blank.

 self      the average number of milliseconds spent in this
ms/call    function per call, if this function is profiled,
	   else blank.

 total     the average number of milliseconds spent in this
ms/call    function and its descendents per call, if this
	   function is profiled, else blank.

name       the name of the function.  This is the minor sort
           for this listing. The index shows the location of
	   the function in the gprof listing. If the index is
	   in parenthesis it shows where it would appear in
	   the gprof listing if it were to be printed.

Copyright (C) 2012-2015 Free Software Foundation, Inc.

Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.

		     Call graph (explanation follows)


granularity: each sample hit covers 2 byte(s) no time propagated

index % time    self  children    called     name
                0.00    0.00    2048/2048        s_ring_buffer_unlock [2]
[1]      0.0    0.00    0.00    2048         s_log_safe_mutex_unlock [1]
-----------------------------------------------
                0.00    0.00       2/2048        s_ring_buffer_constructor [23]
                0.00    0.00     544/2048        s_ring_buffer_could_read_num_get [8]
                0.00    0.00     750/2048        s_ring_buffer_write_elements [14]
                0.00    0.00     752/2048        s_ring_buffer_read_elements [13]
[2]      0.0    0.00    0.00    2048         s_ring_buffer_unlock [2]
                0.00    0.00    2048/2048        s_log_safe_mutex_unlock [1]
-----------------------------------------------
                0.00    0.00    1294/1294        s_ring_buffer_lock [4]
[3]      0.0    0.00    0.00    1294         s_log_safe_mutex_lock [3]
-----------------------------------------------
                0.00    0.00     374/1294        s_ring_buffer_write_elements [14]
                0.00    0.00     376/1294        s_ring_buffer_read_elements [13]
                0.00    0.00     544/1294        s_ring_buffer_could_read_num_get [8]
[4]      0.0    0.00    0.00    1294         s_ring_buffer_lock [4]
                0.00    0.00    1294/1294        s_log_safe_mutex_lock [3]
-----------------------------------------------
                0.00    0.00     752/752         s_ring_buffer_try_lock [7]
[5]      0.0    0.00    0.00     752         s_log_safe_mutex_try_lock [5]
-----------------------------------------------
                0.00    0.00     752/752         s_log_safe_output [12]
[6]      0.0    0.00    0.00     752         s_log_strrchr [6]
-----------------------------------------------
                0.00    0.00     375/751         s_ring_buffer_write_elements [14]
                0.00    0.00     376/751         s_ring_buffer_read_elements [13]
[7]      0.0    0.00    0.00     751         s_ring_buffer_try_lock [7]
                0.00    0.00     752/752         s_log_safe_mutex_try_lock [5]
-----------------------------------------------
                0.00    0.00      78/544         s_log_safe_output_pool_used_get [15]
                0.00    0.00     466/544         s_log_safe_thread_exec_func [36]
[8]      0.0    0.00    0.00     544         s_ring_buffer_could_read_num_get [8]
                0.00    0.00     544/1294        s_ring_buffer_lock [4]
                0.00    0.00     544/2048        s_ring_buffer_unlock [2]
-----------------------------------------------
                0.00    0.00      11/383         thread_7_exec [50]
                0.00    0.00      22/383         thread_6_exec [49]
                0.00    0.00      33/383         thread_5_exec [48]
                0.00    0.00      43/383         thread_4_exec [47]
                0.00    0.00      55/383         thread_3_exec [46]
                0.00    0.00      66/383         thread_2_exec [45]
                0.00    0.00      76/383         thread_1_exec [44]
                0.00    0.00      77/383         thread_main_exec [51]
[9]      0.0    0.00    0.00     383         s_log_safe_out [9]
                0.00    0.00     374/374         s_ring_buffer_write_elements [14]
-----------------------------------------------
                0.00    0.00     376/376         s_log_print [11]
[10]     0.0    0.00    0.00     376         s_log_out_by_printf [10]
-----------------------------------------------
                0.00    0.00     376/376         s_log_safe_output [12]
[11]     0.0    0.00    0.00     376         s_log_print [11]
                0.00    0.00     376/376         s_log_out_by_printf [10]
-----------------------------------------------
                0.00    0.00     376/376         s_log_safe_thread_exec_func [36]
[12]     0.0    0.00    0.00     376         s_log_safe_output [12]
                0.00    0.00     752/752         s_log_strrchr [6]
                0.00    0.00     376/376         s_ring_buffer_read_elements [13]
                0.00    0.00     376/376         s_log_print [11]
-----------------------------------------------
                0.00    0.00     376/376         s_log_safe_output [12]
[13]     0.0    0.00    0.00     376         s_ring_buffer_read_elements [13]
                0.00    0.00     752/2048        s_ring_buffer_unlock [2]
                0.00    0.00     376/751         s_ring_buffer_try_lock [7]
                0.00    0.00     376/1294        s_ring_buffer_lock [4]
-----------------------------------------------
                0.00    0.00     374/374         s_log_safe_out [9]
[14]     0.0    0.00    0.00     374         s_ring_buffer_write_elements [14]
                0.00    0.00     750/2048        s_ring_buffer_unlock [2]
                0.00    0.00     375/751         s_ring_buffer_try_lock [7]
                0.00    0.00     374/1294        s_ring_buffer_lock [4]
-----------------------------------------------
                0.00    0.00      78/78          thread_main_exec [51]
[15]     0.0    0.00    0.00      78         s_log_safe_output_pool_used_get [15]
                0.00    0.00      78/544         s_ring_buffer_could_read_num_get [8]
-----------------------------------------------
                0.00    0.00       9/9           s_log_safe_thread_create [17]
[16]     0.0    0.00    0.00       9         get_thread_policy [16]
-----------------------------------------------
                0.00    0.00       1/9           s_log_safe_init [21]
                0.00    0.00       8/9           main [30]
[17]     0.0    0.00    0.00       9         s_log_safe_thread_create [17]
                0.00    0.00       9/9           get_thread_policy [16]
-----------------------------------------------
                0.00    0.00       2/2           s_ring_buffer_lock_create [19]
[18]     0.0    0.00    0.00       2         s_log_safe_mutex_create [18]
-----------------------------------------------
                0.00    0.00       2/2           s_ring_buffer_constructor [23]
[19]     0.0    0.00    0.00       2         s_ring_buffer_lock_create [19]
                0.00    0.00       2/2           s_log_safe_mutex_create [18]
-----------------------------------------------
                0.00    0.00       1/1           s_log_safe_init [21]
[20]     0.0    0.00    0.00       1         s_log_safe_constructor [20]
                0.00    0.00       1/1           s_ring_buffer_constructor [23]
-----------------------------------------------
                0.00    0.00       1/1           main [30]
[21]     0.0    0.00    0.00       1         s_log_safe_init [21]
                0.00    0.00       1/1           s_log_safe_constructor [20]
                0.00    0.00       1/9           s_log_safe_thread_create [17]
-----------------------------------------------
                0.00    0.00       1/1           thread_main_exec [51]
[22]     0.0    0.00    0.00       1         s_log_safe_output_pool_cap_get [22]
-----------------------------------------------
                0.00    0.00       1/1           s_log_safe_constructor [20]
[23]     0.0    0.00    0.00       1         s_ring_buffer_constructor [23]
                0.00    0.00       2/2           s_ring_buffer_lock_create [19]
                0.00    0.00       2/2048        s_ring_buffer_unlock [2]
                0.00    0.00       1/1           s_ring_buffer_element_pool_constructor_malloc [24]
-----------------------------------------------
                0.00    0.00       1/1           s_ring_buffer_constructor [23]
[24]     0.0    0.00    0.00       1         s_ring_buffer_element_pool_constructor_malloc [24]
-----------------------------------------------

 This table describes the call tree of the program, and was sorted by
 the total amount of time spent in each function and its children.

 Each entry in this table consists of several lines.  The line with the
 index number at the left hand margin lists the current function.
 The lines above it list the functions that called this function,
 and the lines below it list the functions this one called.
 This line lists:
     index	A unique number given to each element of the table.
		Index numbers are sorted numerically.
		The index number is printed next to every function name so
		it is easier to look up where the function is in the table.

     % time	This is the percentage of the `total' time that was spent
		in this function and its children.  Note that due to
		different viewpoints, functions excluded by options, etc,
		these numbers will NOT add up to 100%.

     self	This is the total amount of time spent in this function.

     children	This is the total amount of time propagated into this
		function by its children.

     called	This is the number of times the function was called.
		If the function called itself recursively, the number
		only includes non-recursive calls, and is followed by
		a `+' and the number of recursive calls.

     name	The name of the current function.  The index number is
		printed after it.  If the function is a member of a
		cycle, the cycle number is printed between the
		function's name and the index number.


 For the function's parents, the fields have the following meanings:

     self	This is the amount of time that was propagated directly
		from the function into this parent.

     children	This is the amount of time that was propagated from
		the function's children into this parent.

     called	This is the number of times this parent called the
		function `/' the total number of times the function
		was called.  Recursive calls to the function are not
		included in the number after the `/'.

     name	This is the name of the parent.  The parent's index
		number is printed after it.  If the parent is a
		member of a cycle, the cycle number is printed between
		the name and the index number.

 If the parents of the function cannot be determined, the word
 `<spontaneous>' is printed in the `name' field, and all the other
 fields are blank.

 For the function's children, the fields have the following meanings:

     self	This is the amount of time that was propagated directly
		from the child into the function.

     children	This is the amount of time that was propagated from the
		child's children to the function.

     called	This is the number of times the function called
		this child `/' the total number of times the child
		was called.  Recursive calls by the child are not
		listed in the number after the `/'.

     name	This is the name of the child.  The child's index
		number is printed after it.  If the child is a
		member of a cycle, the cycle number is printed
		between the name and the index number.

 If there are any cycles (circles) in the call graph, there is an
 entry for the cycle-as-a-whole.  This entry shows who called the
 cycle (as parents) and the members of the cycle (as children.)
 The `+' recursive calls entry shows the number of function calls that
 were internal to the cycle, and the calls entry for each member shows,
 for that member, how many times it was called from other members of
 the cycle.

Copyright (C) 2012-2015 Free Software Foundation, Inc.

Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.

Index by function name

  [16] get_thread_policy (s_log_safe_platform.c) [1] s_log_safe_mutex_unlock [8] s_ring_buffer_could_read_num_get
  [10] s_log_out_by_printf     [9] s_log_safe_out         [24] s_ring_buffer_element_pool_constructor_malloc
  [11] s_log_print            [12] s_log_safe_output (s_log_safe.c) [4] s_ring_buffer_lock
  [20] s_log_safe_constructor (s_log_safe.c) [22] s_log_safe_output_pool_cap_get [19] s_ring_buffer_lock_create
  [21] s_log_safe_init        [15] s_log_safe_output_pool_used_get [13] s_ring_buffer_read_elements
  [18] s_log_safe_mutex_create [17] s_log_safe_thread_create [7] s_ring_buffer_try_lock
   [3] s_log_safe_mutex_lock   [6] s_log_strrchr           [2] s_ring_buffer_unlock
   [5] s_log_safe_mutex_try_lock [23] s_ring_buffer_constructor [14] s_ring_buffer_write_elements

f、 生成调用图

gprof2dot -e0 -n0 profile.txt > profile.dot
dot profile.dot -Tpng -o profile.png

通过 gprof2dot 和 dot 工具能够将 profile.txt 文件转换为 更直观的 图片。
在这里插入图片描述
在这里插入图片描述

如果没有安装 gprof2dot 和 dot 工具,可以通过以下命令进行安装:

sudo apt-get install graphviz

pip3 install gprof2dot

g、 查看调用图

通过上述操作,最终生成了 profile.png 文件,最终的调用图如下图所示:
在这里插入图片描述
从该图中,就比较直观的看到了调用流程和调用次数


4 小结

    上述的通过 gprof 和相关工具 对目标程序 进行 性能分析,是日常开发过程中常用的一种方式。

本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:/a/733680.html

如若内容造成侵权/违法违规/事实不符,请联系我们进行投诉反馈qq邮箱809451989@qq.com,一经查实,立即删除!

相关文章

修改docker中mongodb容器的时区

假设容器名称为mongodb&#xff0c;设置时区为伤害时区的命令为&#xff1a; docker exec -it mongodb bash -c "ln -snf /usr/share/zoneinfo/Asia/Shanghai /etc/localtime && echo Asia/Shanghai > /etc/timezone"验证时区更改&#xff1a; docker e…

【CT】LeetCode手撕—42. 接雨水

目录 题目1- 思路2- 实现⭐42. 接雨水——题解思路 3- ACM实现 题目 原题连接&#xff1a;42. 接雨水 1- 思路 模式识别&#xff1a;求雨水的面积 ——> 不仅是只求一个比当前元素大的元素&#xff0c;还要求面积 单调栈 应用场景&#xff0c;需要找到左边比当前元素大的…

如何用Spring使用Redis作为消息订阅?

目录 一、Spring 框架介绍二、Redis 框架介绍三、什么是消息订阅四、如何用Spring使用Redis作为消息订阅 一、Spring 框架介绍 Spring 框架是一个开源的 Java 平台&#xff0c;它提供了全面的基础设施支持&#xff0c;以便您可以更容易地开发 Java 应用程序。Spring 处理了基础…

【C++】优先队列的使用及模拟实现

&#x1f497;个人主页&#x1f497; ⭐个人专栏——C学习⭐ &#x1f4ab;点击关注&#x1f929;一起学习C语言&#x1f4af;&#x1f4ab; 目录 导读 一、什么是优先队列 二、优先队列的使用 1. 优先队列的构造 2. 优先队列的基本操作 3. 使用示例 三、优先队列模拟实…

[已解决]ImportError: DLL load failed while importing win32api: 找不到指定的程序。

使用pip install pywin32302安装后import找不到win32api 失败尝试 上网找别人的解决方案&#xff0c;大部分解决方案都是通过复制下面两个dll文件到 下面这个文件夹&#xff0c;并且复制到C:\Windows\System32&#xff0c;从而解决问题&#xff0c;但是我没能成功。 解决方…

web中间件漏洞-Redis漏洞未授权访问漏洞-写webshell、写ssh公钥

web中间件漏洞-Redis漏洞未授权访问漏洞 利用redis未授权访问漏洞写webshell 利用redis未授权访问、攻击机向服务器写入webshell 从服务器查看写入的webshell 菜刀连接 利用redis未授权访问漏洞写ssh公钥 kali生成rsa公私钥对 ssh-keygen -t rsa 将公钥id_rsa.pub写入文…

鸿蒙 HarmonyOS NEXT星河版APP应用开发—上篇

一、鸿蒙开发环境搭建 DevEco Studio安装 下载 访问官网&#xff1a;https://developer.huawei.com/consumer/cn/deveco-studio/选择操作系统版本后并注册登录华为账号既可下载安装包 安装 建议&#xff1a;软件和依赖安装目录不要使用中文字符软件安装包下载完成后&#xff0…

HTML(19)——Flex

Flex布局也叫弹性布局&#xff0c;是浏览器提倡的布局模型&#xff0c;非常适合结构化布局&#xff0c;提供了强大的空间分布和对齐能力。 Flex模型不会产生浮动布局中脱标现象&#xff0c;布局网页更简单、更灵活。 Flex-组成 设置方式&#xff1a;给父元素设置display:fle…

以太坊==windows电脑本地搭建一个虚拟的以太坊环境

提供不同的选择&#xff0c;适合不同需求和技术水平的开发者&#xff1a; Geth&#xff1a;适合需要与主网兼容或构建私有网络的开发者。Ganache&#xff1a;适合快速开发和测试智能合约的开发者&#xff0c;特别是初学者。Docker&#xff1a;适合需要快速、可重复搭建环境的开…

四川汇聚荣科技有限公司靠谱吗?

在如今这个信息爆炸的时代&#xff0c;了解一家公司是否靠谱对于消费者和合作伙伴来说至关重要。四川汇聚荣科技有限公司作为一家位于中国西部地区的企业&#xff0c;自然也受到了人们的关注。那么&#xff0c;这家公司究竟如何呢?接下来&#xff0c;我们将从多个角度进行深入…

c语言 课设 atm

功能需求分析 ATM功能主界面:显示所能进行的操作,用户可多次选择。 ATM注册界面:输入用户名,用户密码,确认密码,密码长度不是六位重新输入,两次密码不一致重新输入,输入账号。密码隐藏,实现退格换行对*无影响。多人注册 ATM登录界面:输入账号,密码,三次以内输入…

NettyのFuturePromise、HandlerPipeline、ByteBuf

本篇介绍Netty的剩下三个组件Future&Promise、Handler&Pipeline、ByteBuf 1、Future&Promise Future和Promise都是Netty实现异步的组件。 1.1、JDK中的future 在JDK中也有一个同名的Future&#xff0c;通常是配合多线程的Callable以及线程池的submit()方法使用&am…

Rocky Linux 更换CN镜像地址

官方镜像列表&#xff0c;下拉查找 官方镜像列表&#xff1a;https://mirrors.rockylinux.org/mirrormanager/mirrorsCN 开头的站点。 一键更改镜像地址脚本 以下是更改从默认更改到阿里云地址 cat <<EOF>>/RackyLinux_Update_repo.sh #!/bin/bash # -*- codin…

ChatTTS增强版V3【已开源】,长文本修复,中英混读,导入音色,批量SRT、TXT

ChatTTS增强版V3来啦&#xff01;本次更新增加支持导入SRT、导入音色等功能。结合上次大家反馈的问题&#xff0c;修复了长文本、中英混读等问题。 项目已开源(https://github.com/CCmahua/ChatTTS-Enhanced) 项目介绍 V3 ChatTTS增强版V3&#xff0c;长文本修复&#xff0c…

【职场人】职场进化记:我的“不惹人厌邀功精”之路

刚步入职场的我&#xff0c;就像一张白纸&#xff0c;什么都不懂&#xff0c;只知道埋头苦干。但渐渐地&#xff0c;我发现那些经常“冒泡”的同事似乎总能得到更多的关注和机会。我不禁想&#xff1a;“我是否也要成为那样一个‘邀功精’呢&#xff1f;” 不过&#xff0c;我…

Go自定义数据的序列化流程

&#x1f49d;&#x1f49d;&#x1f49d;欢迎莅临我的博客&#xff0c;很高兴能够在这里和您见面&#xff01;希望您在这里可以感受到一份轻松愉快的氛围&#xff0c;不仅可以获得有趣的内容和知识&#xff0c;也可以畅所欲言、分享您的想法和见解。 推荐:「stormsha的主页」…

Apple - Launch Services Programming Guide

本文翻译整理自&#xff1a;Launch Services Programming Guide https://developer.apple.com/library/archive/documentation/Carbon/Conceptual/LaunchServicesConcepts/LSCIntro/LSCIntro.html#//apple_ref/doc/uid/TP30000999-CH201-TP1 文章目录 一、导言谁应该阅读此文档…

Oracle基本语法(SQLPlus)

目录&#xff1a; 前言&#xff1a; 准备工作&#xff1a; 登录&#xff1a; 1.打开SQL Plus命令行工具 第一种方式&#xff1a; 第二种方式&#xff1a; 2.以不同用户登录 SYSTEM&#xff08;普通管理员&#xff09;&#xff1a; SYS(超级管理员)&#xff1a; 不显示…

二叉搜索树及其Java实现

二叉搜索树&#xff08;Binary Search Tree&#xff0c;简称BST&#xff09;是一种特殊的二叉树数据结构&#xff0c;它满足以下特性&#xff1a; 有序性&#xff1a;对于树中的任意一个节点&#xff0c;其左子树中所有节点的值都小于该节点的值&#xff0c;而其右子树中所有节…

Web Worker 学习及使用

了解什么是 Web Worker 提供了可以在后台线程中运行 js 的方法。可以不占用主线程&#xff0c;不干扰用户界面&#xff0c;可以用来执行复杂、耗时的任务。 在worker中运行的是另一个全局上下文&#xff0c;不能直接获取 Window 全局对象。不同的 worker 可以分为专用和共享&…