タグ検索の該当結果が少ないため、タイトル検索結果を表示しています。
In association with the release of curl 8.4.0, we publish a security advisory and all the details for CVE-2023-38545. This problem is the worst security problem found in curl in a long time. We set it to severity HIGH. While the advisory contains all the necessary details. I figured I would use a few additional words and expand the explanations for anyone who cares to understand how this flaw work
GitHub - remeh/diago: Diago is a visualization tool for CPU profiles and heap snapshots generated with `pprof`.
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert
SOCKS5 heap buffer overflow Project curl Security Advisory, October 11 2023 - Permalink VULNERABILITY This flaw makes curl overflow a heap based buffer in the SOCKS5 proxy handshake. When curl is asked to pass along the hostname to the SOCKS5 proxy to allow that to resolve the address instead of it getting done by curl itself, the maximum length that hostname can be is 255 bytes. If the hostname i
In this blog, I am going to explain the important concepts of Heap and use the ptmalloc in the Glibc 2.31 library as an example. The heap is a beautiful mess :) I really like the saying shown above. The word Heap we always use refers to the dynamically allocated segment in the virtual memory space of a process, but it actually stands for the implementation of the memory pool(the dynamic memory all
しれっとTreasure Advent Calendar 2019の13日目に入れちゃいました…笑 今回はVOYAGE GROUPさん(以後VG)のZucksデータチームの西林さんの元(お隣)で9月に行われていたAdventure voyagegroup.com の内容をベースにしてAd-networkにおける… 配信条件を満たす配信制御 多腕バンディット問題を用いた配信戦略 機械学習を用いたCTR予測 フィードバック制御を用いた配信制御 この辺りを三日間で総ざらいしていく形で参加させて頂きました！ 講師の西林さんの伝えたかった事のまとめもありますのでこちら hagino3000.blogspot.com も合わせて是非！ 参加の経緯 もともとアドテク分野において DSPのモデルを組んだことはあったがAd-networkでの経験は無かった ということもありましたが、何よりも VOYAGE
This post adds support for heap allocation to our kernel. First, it gives an introduction to dynamic memory and shows how the borrow checker prevents common allocation errors. It then implements the basic allocation interface of Rust, creates a heap memory region, and sets up an allocator crate. At the end of this post, all the allocation and collection types of the built-in alloc crate will be av
FortiOS - heap-based buffer overflow in sslvpnd | PSIRT Advisories | FortiGuard
Explore latest research and threat reports on emerging cyber threats.
GitHub - facebook/memlab: A framework for finding JavaScript memory leaks and analyzing heap snapshots
memlab is an end-to-end testing and analysis framework for identifying JavaScript memory leaks and optimization opportunities. Online Resources: [Website and Demo] | [Documentation] | [Meta Engineering Blog Post] Features: Browser memory leak detection - Write test scenarios with the Puppeteer API, and memlab will automatically compare JavaScript heap snapshots, filter out memory leaks, and aggreg
基本的な概念の確認のために自作してみました。 簡便化のために select, epoll は使わず、メインスレッドでイベントループ動かし、wakerはmpsc経由で別スレッドから投げます。 タスクを定義する タスクとは一連の Future のチェーンです。 Future を spawn するときに発生します。 今回はタスクを Future<Output = ()> のような値を返さないものとして定義しました。 use std::future::Future; use std::pin::Pin; use std::task::{Context, Poll, Waker}; /// タスクはアウトプットのない BoxFuture struct Task { future: Pin<Box<dyn Future<Output = ()> + 'static>>, } impl Task { f
A trash heap 62 meters high shows the scale of India’s climate challenge | CNN
- Source: CNN " data-fave-thumbnails="{"big": { "uri": "https://media.cnn.com/api/v1/images/stellar/prod/221209091513-india-salt-water-bath-vpx.jpg?c=16x9&q=h_540,w_960,c_fill" }, "small": { "uri": "https://media.cnn.com/api/v1/images/stellar/prod/221209091513-india-salt-water-bath-vpx.jpg?c=16x9&q=h_540,w_960,c_fill" } }" data-vr-video="false" data-show-html="" data-byline-html=" " data-check-eve
The answer is in your heap: debugging a big memory increase in Ruby on Rails
I recently participated in an interesting series of debugging sessions tracking down the source of a large increase in memory when upgrading a Rails application. We ultimately tracked down the cause using John Hawthorn’s Sheap heap analyzer and successfully submitted a patch to Rails. I thought it was interesting enough to write up because maybe the general approach to debugging memory issues woul
Docker memory resource limits and a heap of Java - #NoDrama DevOps
Docker memory resource limits and a heap of Java by Stephen Kuenzli | Oct 3, 2019 | DevOps, Docker | 0 comments Ok, so maybe you’re convinced why you need to set limits for container resource usage, especially when running on shared container application platforms like ECS, Kubernetes, and Swarm. In this post, I’ll show you how to set memory limits for a basic Java web app built with Spring Boot.
This blog post has been authored by José Dapena Paz (Igalia), with contributions from Jason Williams (Bloomberg), Ashley Claymore (Bloomberg), Rob Palmer (Bloomberg), Joyee Cheung (Igalia), and Shu-yu Guo (Google). In this post about V8 heap snapshots, I will talk about some performance problems found by Bloomberg engineers, and how we fixed them to make JavaScript memory analysis faster than ever
Memory management has always been a source of huge concern in Computer Science. Each piece of software is assigned a small portion of a computer’s finite memory; this memory has to be well-managed (carefully allocated and deallocated). With its efficient automatic garbage collection mechanism, Node.js tries to handle the tedious task of memory management and free up developers to work on other tas
Web Scraping via Javascript Runtime Heap Snapshots - Adrian Cooney's Blog
In recent years, the web has gotten very hostile to the lowly web scraper. It's a result of the natural progression of web technologies away from statically rendered pages to dynamic apps built with frameworks like React and CSS-in-JS. Developers no longer need to label their data with class-names or ids - it's only a courtesy to screen readers now. There's also been a concerted effort by large co
heapq — Heap queue algorithm
heapq — Heap queue algorithm¶ Source code: Lib/heapq.py This module provides an implementation of the heap queue algorithm, also known as the priority queue algorithm. Heaps are binary trees for which every parent node has a value less than or equal to any of its children. This implementation uses arrays for which heap[k] <= heap[2*k+1] and heap[k] <= heap[2*k+2] for all k, counting elements from
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
How I made a heap overflow in curl | daniel.haxx.se
CVE-2021-3156: Heap-Based Buffer Overflow in Sudo (Baron Samedit) | Qualys Security Blog
curl - SOCKS5 heap buffer overflow - CVE-2023-38545
May 2020 Updateの「Microsoft Edge」は省メモリ ～ブラウジング時の消費量を最大27％削減／“Segment Heap”によりメモリの利用効率が向上
Understanding the Heap - a beautiful mess
VOYAGEで遅めのAdventureしてきた話 - Ric.'s rubbish heap.
Heap Allocation | Writing an OS in Rust
いちばんシンプルな非同期 Rust のランタイムを自作する + Heap Timer - Qiita
Speeding up V8 heap snapshots · V8
Minimize Heap Allocations in Node.js | AppSignal Blog
consumer.huawei.com
topics.smt.docomo.ne.jp
solodc2011.com
pc.watch.impress.co.jp
tsubakiblog.com
trilltrill.jp