函数buf_LRU_get_free_block

/******************************************************************//**
Returns a free block from the buf_pool. The block is taken off the
free list. If it is empty, blocks are moved from the end of the
LRU list to the free list.
@return    the free control block, in state BUF_BLOCK_READY_FOR_USE */
UNIV_INTERN
buf_block_t*
buf_LRU_get_free_block(
/*===================*/
    buf_pool_t*    buf_pool)    /*!< in/out: buffer pool instance */
{
    buf_block_t*    block        = NULL;
    ibool        freed;
    ulint        n_iterations    = 1;
    ibool        mon_value_was    = FALSE;
    ibool        started_monitor    = FALSE;
loop:
    buf_pool_mutex_enter(buf_pool);

    if (!recv_recovery_on && UT_LIST_GET_LEN(buf_pool->free)
        + UT_LIST_GET_LEN(buf_pool->LRU) < buf_pool->curr_size / 20) {
        ut_print_timestamp(stderr);

        fprintf(stderr,
            "  InnoDB: ERROR: over 95 percent of the buffer pool"
            " is occupied by\n"
            "InnoDB: lock heaps or the adaptive hash index!"
            " Check that your\n"
            "InnoDB: transactions do not set too many row locks.\n"
            "InnoDB: Your buffer pool size is %lu MB."
            " Maybe you should make\n"
            "InnoDB: the buffer pool bigger?\n"
            "InnoDB: We intentionally generate a seg fault"
            " to print a stack trace\n"
            "InnoDB: on Linux!\n",
            (ulong) (buf_pool->curr_size
                 / (1024 * 1024 / UNIV_PAGE_SIZE)));

        ut_error;

    } else if (!recv_recovery_on
           && (UT_LIST_GET_LEN(buf_pool->free)
               + UT_LIST_GET_LEN(buf_pool->LRU))
           < buf_pool->curr_size / 3) {

        if (!buf_lru_switched_on_innodb_mon) {

            /* Over 67 % of the buffer pool is occupied by lock
            heaps or the adaptive hash index. This may be a memory
            leak! */

            ut_print_timestamp(stderr);
            fprintf(stderr,
                "  InnoDB: WARNING: over 67 percent of"
                " the buffer pool is occupied by\n"
                "InnoDB: lock heaps or the adaptive"
                " hash index! Check that your\n"
                "InnoDB: transactions do not set too many"
                " row locks.\n"
                "InnoDB: Your buffer pool size is %lu MB."
                " Maybe you should make\n"
                "InnoDB: the buffer pool bigger?\n"
                "InnoDB: Starting the InnoDB Monitor to print"
                " diagnostics, including\n"
                "InnoDB: lock heap and hash index sizes.\n",
                (ulong) (buf_pool->curr_size
                     / (1024 * 1024 / UNIV_PAGE_SIZE)));

            buf_lru_switched_on_innodb_mon = TRUE;
            srv_print_innodb_monitor = TRUE;
            os_event_set(srv_lock_timeout_thread_event);
        }
    } else if (buf_lru_switched_on_innodb_mon) {

        /* Switch off the InnoDB Monitor; this is a simple way
        to stop the monitor if the situation becomes less urgent,
        but may also surprise users if the user also switched on the
        monitor! */

        buf_lru_switched_on_innodb_mon = FALSE;
        srv_print_innodb_monitor = FALSE;
    }

    /* If there is a block in the free list, take it */
    block = buf_LRU_get_free_only(buf_pool); //这里
    buf_pool_mutex_exit(buf_pool);

    if (block) {
        ut_ad(buf_pool_from_block(block) == buf_pool);
        memset(&block->page.zip, 0, sizeof block->page.zip);

        if (started_monitor) {
            srv_print_innodb_monitor = mon_value_was;
        }

        return(block);
    }

    /* If no block was in the free list, search from the end of the LRU
    list and try to free a block there */

    freed = buf_LRU_search_and_free_block(buf_pool, n_iterations); //从lru中取一块 这里    if (freed > 0) {
        goto loop;
    }

    if (n_iterations > 30) {
        ut_print_timestamp(stderr);
        fprintf(stderr,
            "  InnoDB: Warning: difficult to find free blocks in\n"
            "InnoDB: the buffer pool (%lu search iterations)!"
            " Consider\n"
            "InnoDB: increasing the buffer pool size.\n"
            "InnoDB: It is also possible that"
            " in your Unix version\n"
            "InnoDB: fsync is very slow, or"
            " completely frozen inside\n"
            "InnoDB: the OS kernel. Then upgrading to"
            " a newer version\n"
            "InnoDB: of your operating system may help."
            " Look at the\n"
            "InnoDB: number of fsyncs in diagnostic info below.\n"
            "InnoDB: Pending flushes (fsync) log: %lu;"
            " buffer pool: %lu\n"
            "InnoDB: %lu OS file reads, %lu OS file writes,"
            " %lu OS fsyncs\n"
            "InnoDB: Starting InnoDB Monitor to print further\n"
            "InnoDB: diagnostics to the standard output.\n",
            (ulong) n_iterations,
            (ulong) fil_n_pending_log_flushes,
            (ulong) fil_n_pending_tablespace_flushes,
            (ulong) os_n_file_reads, (ulong) os_n_file_writes,
            (ulong) os_n_fsyncs);

        mon_value_was = srv_print_innodb_monitor;
        started_monitor = TRUE;
        srv_print_innodb_monitor = TRUE;
        os_event_set(srv_lock_timeout_thread_event);
    }

    /* No free block was found: try to flush the LRU list */

    buf_flush_free_margin(buf_pool);
    ++srv_buf_pool_wait_free;

    os_aio_simulated_wake_handler_threads();

    buf_pool_mutex_enter(buf_pool);

    if (buf_pool->LRU_flush_ended > 0) {
        /* We have written pages in an LRU flush. To make the insert
        buffer more efficient, we try to move these pages to the free
        list. */

        buf_pool_mutex_exit(buf_pool);

        buf_LRU_try_free_flushed_blocks(buf_pool);
    } else {
        buf_pool_mutex_exit(buf_pool);
    }

    if (n_iterations > 10) {

        os_thread_sleep(500000);
    }

    n_iterations++;

    goto loop;
}
时间: 2024-08-10 23:26:30

函数buf_LRU_get_free_block的相关文章

js高阶函数

map()方法定义在JavaScript的Array中,我们调用Array的map()方法,传入我们自己的函数,就得到了一个新的Array作为结果: function pow(x) { return x * x; } var arr = [1, 2, 3, 4, 5, 6, 7, 8, 9]; arr.map(pow); // [1, 4, 9, 16, 25, 36, 49, 64, 81] reduce()把一个函数作用在这个Array的[x1, x2, x3...]上,这个函数必须接收两个

Django url 标签和reverse()函数的使用(转)

原文:http://www.yihaomen.com/article/python/355.htm 使用url标签和reverse()函数,可以避免在模板和view中对url进行硬编码,这样即使url改变了,对模板和view也没有影响 起初用django 开发应用的时候,完全是在urls.py 中硬编码配置地址,在views.py中HttpResponseRedirect()也是硬编码转向地址,当然在template 中也是一样了,这样带来一个问题,如果在urls.py 中修改了某个页面的地址,

Python2.7-内置函数

具体参见:https://docs.python.org/2/library/functions.html#file 1.进制转换:bin(x), oct(x), hex(x) 把一个十进制数分别转换为2.8.16进制 2.字符转换:chr(x)将数字(255以内不报错,128以后无字符)转换为对应ASCII字符, unichr(x)将数字转换为unicode, ord(x) 将字符转数字与前两个相反, unicode(obj, [encoding, [error]]) 用encoding解码o

linux Shell函数

Shell函数类似于Shell脚本,里面存放了一系列的指令,不过Shell的函数存在于内存,而不是硬盘文件,所以速度很快,另外,Shell还能对函数进行预处理,所以函数的启动比脚本更快. 1.函数定义 1 2 3 4 function 函数名() {     语句     [return] } 关键字function表示定义一个函数,可以省略,其后是函数名,有时函数名后可以跟一个括号,符号"{"表示函数执行命令的入口,该符号也可以在函数名那一行,"}"表示函数体的结

pythonの函数学习笔记(一)

函数是可以实现一些特定功能的小方法或小程序定义函数function的方法:def function_name(arg1,arg2[,...]): statement [return value]注意事项:1.def开头,代表定义函数,def和函数名中间要敲一个空格:2.返回值不是必须的,如果没有renturn语句,则默认返回值None:3.函数名必须以下划线或字母开头,可以包含任意字母.数字或下划线的组合,区分大小写且不能是保留字: py使用名称空间的概念存储对象,这个名称空间就是对象作用的区域

条件、循环、函数定义、字符串操作练习

注意标准库的两种导入与使用方式,建议大家采用<库名>.<函数名>的方式. 对前面的代码进行优化,用for,while,if,def实现: 用循环画五角星 1 import turtle 2 3 turtle.fillcolor("red") 4 turtle.begin_fill() 5 for i in range(5): 6 turtle.forward(100) 7 turtle.right(144) 8 turtle.end_fill() 用循环画同心圆

sql常用格式化函数及字符串函数

一.常用格式化函数 1.日期转字符串 select to_char(current_timestamp, 'YYYY-MM-DD HH24:MI:SS') //2017-09-18 22:41:50 YYYY:年(4和更多位) MM:月份号(01-12) DD:一个月里的日(01-31) HH24:一天的小时数(00-23) MI:分钟(00-59) SS:秒(00-59) 2.字符串转日期 select to_date('2017-09-18','YYYY-MM-DD') //2017-09-

Delphi常用系统函数总结

字符串处理函数 Unit System 函数原型 function Concat(s1 [, s2,..., sn]: string): string; 说明 与 S := S1 + S2 + S3 ...; 相同. 将字符串相加. 函数原型 function Copy(S: string; Index, Count: Integer): string;说明 S : 字符串. Indexd : 从第几位开始拷贝. Count : 总共要拷贝几位. 从母字符串拷贝至另一个字符串. 函数原型 pro

python练习之map()和reduce()函数

利用map()函数,把用户输入的不规范的英文名字,变为首字母大写,其他小写的规范名字.输入:['adam', 'LISA', 'barT'],输出:['Adam', 'Lisa', 'Bart']: 1 def normalize(name): 2 name=name.lower() 3 name=name[0].upper()+name[1:] 4 return name 5 6 7 8 9 10 # 测试: 11 L1 = ['adam', 'LISA', 'barT'] 12 L2 = l