{"push_id":2757868738,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"97bd10ffc91b62304bcd84c1a5a51fcea42aa5cb","before":"d659e2906c59eeda0429d8efbe01fccebb807d32","commits":[{"sha":"6c0563afac57d81872ec44831dfb9227e0a79e44","author":{"name":"Neal Cardwell","email":"58d301c70203188c35d379474c26c9cc0636a189@google.com"},"message":"lib/win_minmax: windowed min or max estimator\n\nThis commit introduces a generic library to estimate either the min or\nmax value of a time-varying variable over a recent time window. This\nis code originally from Kathleen Nichols. The current form of the code\nis from Van Jacobson.\n\nA single struct minmax_sample will track the estimated windowed-max\nvalue of the series if you call minmax_running_max() or the estimated\nwindowed-min value of the series if you call minmax_running_min().\n\nNearly equivalent code is already in place for minimum RTT estimation\nin the TCP stack. This commit extracts that code and generalizes it to\nhandle both min and max. Moving the code here reduces the footprint\nand complexity of the TCP code base and makes the filter generally\navailable for other parts of the codebase, including an upcoming TCP\ncongestion control module.\n\nThis library works well for time series where the measurements are\nsmoothly increasing or decreasing.\n\nSigned-off-by: Van Jacobson <vanj@google.com>\nSigned-off-by: Neal Cardwell <ncardwell@google.com>\nSigned-off-by: Yuchung Cheng <ycheng@google.com>\nSigned-off-by: Nandita Dukkipati <nanditad@google.com>\nSigned-off-by: Eric Dumazet <edumazet@google.com>\nSigned-off-by: Soheil Hassas Yeganeh <soheil@google.com>\nSigned-off-by: David S. Miller <davem@davemloft.net>","distinct":true,"url":"https://api.github.com/repos/mawrick26/S7E-O4/commits/6c0563afac57d81872ec44831dfb9227e0a79e44"},{"sha":"97bd10ffc91b62304bcd84c1a5a51fcea42aa5cb","author":{"name":"Andrew Morton","email":"5c1e68b099950c134891f0b6e179498a8ebe9cf9@linux-foundation.org"},"message":"include/linux/nodemask.h: create next_node_in() helper\n\nLots of code does\n\n\tnode = next_node(node, XXX);\n\tif (node == MAX_NUMNODES)\n\t\tnode = first_node(XXX);\n\nso create next_node_in() to do this and use it in various places.\n\n[mhocko@suse.com: use next_node_in() helper]\nAcked-by: Vlastimil Babka <vbabka@suse.cz>\nAcked-by: Michal Hocko <mhocko@kernel.org>\nSigned-off-by: Michal Hocko <mhocko@suse.com>\nCc: Xishi Qiu <qiuxishi@huawei.com>\nCc: Joonsoo Kim <js1304@gmail.com>\nCc: David Rientjes <rientjes@google.com>\nCc: Naoya Horiguchi <n-horiguchi@ah.jp.nec.com>\nCc: Laura Abbott <lauraa@codeaurora.org>\nCc: Hui Zhu <zhuhui@xiaomi.com>\nCc: Wang Xiaoqiang <wangxq10@lzu.edu.cn>\nCc: Johannes Weiner <hannes@cmpxchg.org>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/mawrick26/S7E-O4/commits/97bd10ffc91b62304bcd84c1a5a51fcea42aa5cb"}]}
{"actor":{"display_login":"mawrick26"}}