Linaro-mm-sig

linaro-mm-sig@lists.linaro.org

33 participants
6624 discussions

[PATCH v6] dma-buf: Fix silent overflow for phys vec to sgt

by David Hu

In case MMIO size is bigger than 4G and peer2peer DMA goes through host bridge, we trigger a code path that assigns the total linked IOVA (which is greater than 4G) to mapped_len. Previously, `mapped_len` was declared as 32-bit `unsigned int`. When accumulating `size_t` lengths, this leads to a silent wrap-around. This truncation causes truncated lengths to be passed to functions like `fill_sg_entry()`. Fix this by changing `mapped_len` to `size_t` (64-bit). While at it, fix similar potential overflow issues in `calc_sg_nents` by using `check_add_overflow()` for `nents` and using `unsigned int` for the loop iterator in `fill_sg_entry` to match. Fixes: 3aa31a8bb11e ("dma-buf: provide phys_vec to scatter-gather mapping routine") Cc: stable(a)vger.kernel.org Cc: iommu(a)lists.linux.dev Reviewed-by: Pranjal Shrivastava <praan(a)google.com> Reviewed-by: Kevin Tian <kevin.tian(a)intel.com> Signed-off-by: David Hu <xuehaohu(a)google.com> --- Changes in v6: - Used `check_add_overflow()` in `calc_sg_nents()` for safer accumulation (Leon). - Dropped explicit `!nents` check and added a comment noting that `sg_alloc_table` handles `nents == 0` (Leon). - Collected Reviewed-by from Kevin Tian. Changes in v5: - Removed WARN_ON_ONCE from calc_sg_nents() to avoid log noise (Jason). - Added explicit check for `!nents` in dma_buf_phys_vec_to_sgt() to cleanly return -EINVAL on overflow (Jason). Changes in v4: - Added WARN_ON_ONCE() to the nents overflow check to prevent silent failures (Claude Bot). Changes in v3: - Removed leftover sentence fragment from the commit message. - Kept `nents = 0` initialization (previously stated as removed in the v2 changelog) as it is strictly required for the `+=` accumulation loop in `calc_sg_nents()`. Changes in v2: - Fixed 'IVOA' -> 'IOVA' typo and expanded commit message (Claude Bot). - Added Reverse Xmas tree formatting (Pranjal). - Folded in extra bounds checking for calc_sg_nents() (Pranjal). - Folded in type consistency fix for fill_sg_entry() (Pranjal). - Collected Reviewed-by from Pranjal Shrivastava. drivers/dma-buf/dma-buf-mapping.c | 15 +++++++++++---- 1 file changed, 11 insertions(+), 4 deletions(-) diff --git a/drivers/dma-buf/dma-buf-mapping.c b/drivers/dma-buf/dma-buf-mapping.c index 794acff2546a..67a8ff52fb8f 100644 --- a/drivers/dma-buf/dma-buf-mapping.c +++ b/drivers/dma-buf/dma-buf-mapping.c @@ -5,12 +5,13 @@ */ #include <linux/dma-buf-mapping.h> #include <linux/dma-resv.h> +#include <linux/overflow.h> static struct scatterlist *fill_sg_entry(struct scatterlist *sgl, size_t length, dma_addr_t addr) { unsigned int len, nents; - int i; + unsigned int i; nents = DIV_ROUND_UP(length, UINT_MAX); for (i = 0; i < nents; i++) { @@ -40,8 +41,11 @@ static unsigned int calc_sg_nents(struct dma_iova_state *state, size_t i; if (!state || !dma_use_iova(state)) { - for (i = 0; i < nr_ranges; i++) - nents += DIV_ROUND_UP(phys_vec[i].len, UINT_MAX); + for (i = 0; i < nr_ranges; i++) { + unsigned int added = DIV_ROUND_UP(phys_vec[i].len, UINT_MAX); + if (check_add_overflow(nents, added, &nents)) + return 0; + } } else { /* * In IOVA case, there is only one SG entry which spans @@ -95,9 +99,10 @@ struct sg_table *dma_buf_phys_vec_to_sgt(struct dma_buf_attachment *attach, size_t nr_ranges, size_t size, enum dma_data_direction dir) { - unsigned int nents, mapped_len = 0; struct dma_buf_dma *dma; struct scatterlist *sgl; + size_t mapped_len = 0; + unsigned int nents; dma_addr_t addr; size_t i; int ret; @@ -133,6 +138,8 @@ struct sg_table *dma_buf_phys_vec_to_sgt(struct dma_buf_attachment *attach, } nents = calc_sg_nents(dma->state, phys_vec, nr_ranges, size); + + /* sg_alloc_table will cleanly fail and return -EINVAL if nents == 0 */ ret = sg_alloc_table(&dma->sgt, nents, GFP_KERNEL | __GFP_ZERO); if (ret) goto err_free_state; -- 2.54.0.1064.gd145956f57-goog

2 minutes

Unlocking the Melody: A Guide to Heardle

by many.unicorn.syms＠hidingmail.net

Ever found yourself humming along to a tune, only to realize you can’t quite place the artist or title? If so, you’re in for a treat with Heardle. This delightful online game offers a daily dose of musical trivia, challenging your ear and memory in a surprisingly addictive way. Whether you're a seasoned music aficionado or just looking for a fun brain-teaser, Heardle provides an engaging experience. https://heardlefree.com/ What is Heardle? At its core, Heardle is a daily musical guessing game. Each day, a new song is presented, and your task is to identify it based on short audio snippets. The beauty of Heardle lies in its progressive difficulty. You start with just a second of the intro, and if you’re stumped, you can get more time, up to a maximum of 16 seconds. It's a fantastic way to discover new music or reconnect with old favorites. You can experience the game and try your hand at guessing the daily song by visiting Heardle. Gameplay: Your Daily Musical Challenge Playing Heardle is straightforward and intuitive. When you first open the game, you'll see a simple interface with a play button and a search bar. Listen to the Snippet: Click the play button to hear the initial one-second snippet of the song. Make Your Guess (or Skip): Based on this tiny fragment, you can either type your guess into the search bar. As you type, the game will suggest potential song titles and artists. If you have no idea, or want more time, you can click "Skip" to hear a longer segment. Progressive Reveals: Each time you skip, the audio snippet gets slightly longer, giving you more musical clues. You have a total of six attempts. The Reveal: If you guess correctly, or if you exhaust all your attempts, the song's title and artist are revealed. You'll also see your score (how many attempts it took you) and have the option to share your result. Tips for Mastering Heardle While luck plays a small part, there are strategies to improve your Heardle success rate: Focus on Intros: Many songs have very distinctive introductions. Pay close attention to unique instrumentals, vocal hooks, or production styles in the initial seconds. Genre Awareness: If you have a general idea of the era or genre, it can significantly narrow down your search. Sometimes just knowing it's a 90s pop song or a classic rock anthem is enough to trigger a memory. Don't Be Afraid to Skip: There's no penalty for skipping! If the first second doesn't ring a bell, don't waste time pondering. Get those extra seconds of audio. Hum It Out: Sometimes, humming the tune in your head can help you connect it to lyrics or a title you know. Listen Actively: Instead of just hearing, actively listen for specific instruments, vocal inflections, or rhythmic patterns. Explore Past Heardles: While not directly helping with the current day's song, revisiting past Heardle puzzles can help you train your ear and recognize common song structures. You can often find archives of past games on sites like Heardle. Conclusion Heardle offers a delightful and accessible way to engage with music. It's a perfect brief escape for your coffee break, a fun challenge to share with friends, or simply a way to test your musical knowledge. Give it a try, and you might just surprise yourself with how many melodies you recognize – and perhaps discover a new favorite along the way!

5 minutes

Embrace the Chaos: A Beginner's Guide to the Joy of Basket Random

by unable.rhinoceros.micz＠hidingmail.net

If you are tired of ultra-realistic sports simulators that require complex button combinations and intense strategic planning, it is time to embrace the chaos. Enter the world of physics-based ragdoll games, where the only rule is that there are no rules. At the absolute peak of this hilariously unpredictable genre is Basket Random, a two-button browser game that turns the structured sport of basketball into a chaotic, laughter-inducing spectacle. https://basketrandomgame.com/ Whether you want to kill a few minutes during a study break or challenge a friend to a local duel, here is your ultimate guide to experiencing this delightfully absurd game. What is Basket Random? At its core, the game is a 2v2 basketball match, but with a major twist: your players move like floppy, inflatable tube men. Developed with bouncy ragdoll physics, every round presents a completely randomized setup. One round you might be playing with giant heads on a snowy court with a heavy bowling ball; the next, you are on a sunny beach holding a tiny tennis ball with shortened arms. The objective is simple: be the first to score 5 points. However, achieving that objective is a beautifully chaotic journey of trial, error, and luck. How to Play: One-Button Mastery The beauty of the game lies in its minimalist control scheme. You do not need to worry about passing, sprinting, or shooting buttons. You only need one key: Player 1 (or Single Player): Press the W key (or Up Arrow). Player 2: Press the Up Arrow key. When you tap the key, both of your players will jump and tilt in the direction of the ball. If you hold the key, they will swing their arms and legs wildly. Releasing the key at the right moment allows your player to throw the ball toward the hoop. It sounds simple, but because the physics change with every single point scored, you must constantly adapt your timing to the new weight of the ball, the bounce of the court, and the length of your players' limbs. Tips to Dominate the Chaotic Court While the game relies heavily on accidental moments of brilliance, you can actually develop a loose strategy to win more matches: Master the "Spam" vs. "Hold" Balance: Do not just mash the jump button blindly. If the ball is loose, rapid tapping can help you scramble toward it. However, if your player has possession, hold the button to lean backward, then release it at the peak of your jump for a cleaner arc toward the hoop. Play Defense First: Sometimes, the best offense is a solid block. Position your tallest player under the opponent's hoop to swat away their chaotic shots. Use the Environment: Take note of the court changes. On icy courts, your players will slide much further, which can be used to slide-tackle the ball away from opponents. Conclusion Ultimately, the best way to experience Basket Random is with a friend sitting right next to you. The game’s charm lies in its ability to level the playing field; a seasoned gaming pro can easily lose to a beginner who happened to get a lucky bounce off a player's head. It is a game designed not for sweat and competition, but for shared laughter and high-fives. So, open up your browser, grab a friend, and prepare for some of the most hilarious basketball matches you will ever play.

4 hours, 56 minutes

[PATCH] iommufd: take dma_resv lock before dma_buf_unpin() in release path

by Ankit Soni

dma_buf_unpin() requires the caller to hold the exporter's dma_resv lock: void dma_buf_unpin(struct dma_buf_attachment *attach) { ... dma_resv_assert_held(dmabuf->resv); ... } iopt_release_pages() calls dma_buf_unpin() without taking that lock, so every iommufd_ioas_destroy()/iommufd_ioas_unmap() that releases the last reference on a DMABUF-backed iopt_pages triggers a WARN. This was hit while running tools/testing/selftests/iommu/iommufd: WARNING: drivers/dma-buf/dma-buf.c:1137 at dma_buf_unpin+0x62/0x70 RIP: 0010:dma_buf_unpin+0x62/0x70 Call Trace: <TASK> dma_buf_unpin+0x62/0x70 iopt_release_pages+0xe4/0x190 iopt_unmap_iova_range+0x1c7/0x290 iopt_unmap_all+0x1a/0x30 iommufd_ioas_destroy+0x1d/0x50 iommufd_fops_release+0x93/0x150 __fput+0xfc/0x2c0 __x64_sys_close+0x3d/0x80 do_syscall_64+0x65/0x180 </TASK> Take the dma_resv lock around dma_buf_unpin() in iopt_release_pages(), matching the iopt_map_dmabuf() convention. dma_buf_detach() acquires the reservation lock internally, so it must remain outside the locked region. Fixes: 8c5f9645c389 ("iommufd: Add dma_buf_pin()") Reported-by: Ankit Soni <Ankit.Soni(a)amd.com> Signed-off-by: Ankit Soni <Ankit.Soni(a)amd.com> --- drivers/iommu/iommufd/pages.c | 2 ++ 1 file changed, 2 insertions(+) diff --git a/drivers/iommu/iommufd/pages.c b/drivers/iommu/iommufd/pages.c index 9bdb2945afe1..7b64002e54b9 100644 --- a/drivers/iommu/iommufd/pages.c +++ b/drivers/iommu/iommufd/pages.c @@ -1663,7 +1663,9 @@ void iopt_release_pages(struct kref *kref) if (iopt_is_dmabuf(pages) && pages->dmabuf.attach) { struct dma_buf *dmabuf = pages->dmabuf.attach->dmabuf; + dma_resv_lock(dmabuf->resv, NULL); dma_buf_unpin(pages->dmabuf.attach); + dma_resv_unlock(dmabuf->resv); dma_buf_detach(dmabuf, pages->dmabuf.attach); dma_buf_put(dmabuf); WARN_ON(!list_empty(&pages->dmabuf.tracker)); -- 2.43.0

7 hours, 6 minutes

[PATCH v5] dma-buf: Fix silent overflow for phys vec to sgt

by David Hu

In case MMIO size is bigger than 4G and peer2peer DMA goes through host bridge, we trigger a code path that assigns the total linked IOVA (which is greater than 4G) to mapped_len. Previously, `mapped_len` was declared as 32-bit `unsigned int`. When accumulating `size_t` lengths, this leads to a silent wrap-around. This truncation causes truncated lengths to be passed to functions like `fill_sg_entry()`. Fix this by changing `mapped_len` to `size_t` (64-bit). While at it, fix similar potential overflow issues in `calc_sg_nents` by using `size_t` for `nents` and checking against `UINT_MAX` and using `unsigned int` for the loop iterator in `fill_sg_entry` to match. Fixes: 3aa31a8bb11e ("dma-buf: provide phys_vec to scatter-gather mapping routine") Cc: stable(a)vger.kernel.org Cc: iommu(a)lists.linux.dev Reviewed-by: Pranjal Shrivastava <praan(a)google.com> Signed-off-by: David Hu <xuehaohu(a)google.com> --- Changes in v5: - Removed WARN_ON_ONCE from calc_sg_nents() to avoid log noise (Jason). - Added explicit check for `!nents` in dma_buf_phys_vec_to_sgt() to cleanly return -EINVAL on overflow (Jason). Changes in v4: - Added WARN_ON_ONCE() to the nents overflow check to prevent silent failures (Claude Bot). Changes in v3: - Removed leftover sentence fragment from the commit message. - Kept `nents = 0` initialization (previously stated as removed in the v2 changelog) as it is strictly required for the `+=` accumulation loop in `calc_sg_nents()`. Changes in v2: - Fixed 'IVOA' -> 'IOVA' typo and expanded commit message (Claude Bot). - Added Reverse Xmas tree formatting (Pranjal). - Folded in extra bounds checking for calc_sg_nents() (Pranjal). - Folded in type consistency fix for fill_sg_entry() (Pranjal). drivers/dma-buf/dma-buf-mapping.c | 15 ++++++++++++--- 1 file changed, 12 insertions(+), 3 deletions(-) diff --git a/drivers/dma-buf/dma-buf-mapping.c b/drivers/dma-buf/dma-buf-mapping.c index 794acff2546a..607b7998463d 100644 --- a/drivers/dma-buf/dma-buf-mapping.c +++ b/drivers/dma-buf/dma-buf-mapping.c @@ -10,7 +10,7 @@ static struct scatterlist *fill_sg_entry(struct scatterlist *sgl, size_t length, dma_addr_t addr) { unsigned int len, nents; - int i; + unsigned int i; nents = DIV_ROUND_UP(length, UINT_MAX); for (i = 0; i < nents; i++) { @@ -36,7 +36,7 @@ static unsigned int calc_sg_nents(struct dma_iova_state *state, struct phys_vec *phys_vec, size_t nr_ranges, size_t size) { - unsigned int nents = 0; + size_t nents = 0; size_t i; if (!state || !dma_use_iova(state)) { @@ -51,6 +51,9 @@ static unsigned int calc_sg_nents(struct dma_iova_state *state, nents = DIV_ROUND_UP(size, UINT_MAX); } + if (nents > UINT_MAX) + return 0; + return nents; } @@ -95,9 +98,10 @@ struct sg_table *dma_buf_phys_vec_to_sgt(struct dma_buf_attachment *attach, size_t nr_ranges, size_t size, enum dma_data_direction dir) { - unsigned int nents, mapped_len = 0; struct dma_buf_dma *dma; struct scatterlist *sgl; + size_t mapped_len = 0; + unsigned int nents; dma_addr_t addr; size_t i; int ret; @@ -133,6 +137,11 @@ struct sg_table *dma_buf_phys_vec_to_sgt(struct dma_buf_attachment *attach, } nents = calc_sg_nents(dma->state, phys_vec, nr_ranges, size); + if (!nents) { + ret = -EINVAL; + goto err_free_state; + } + ret = sg_alloc_table(&dma->sgt, nents, GFP_KERNEL | __GFP_ZERO); if (ret) goto err_free_state; -- 2.54.0.929.g9b7fa37559-goog

12 hours, 29 minutes

[PATCH v19 0/4] Rust bindings for gem shmem

by Lyude Paul

Most of this patch series has already been pushed upstream, this is just the second half of the patch series that has not been pushed yet + some additional changes which were required to implement changes requested by the mailing list. This patch series is originally from Asahi, previously posted by Daniel Almeida. The previous version of the patch series can be found here: https://patchwork.freedesktop.org/series/164580/ Branch with patches applied available here: https://gitlab.freedesktop.org/lyudess/linux/-/commits/rust/gem-shmem This patch series applies on top of drm-rust-next Patch-series wide changes since V15: * Fix some major rebasing errors I somehow didn't notice :( * Drop the dependency on LazyInit, use the trick that Alice suggested instead. * Fix dependency ordering so that Tyr can get the vmap stuff first without the other bits. Patch-series wide changes since V16: * Fix ordering one more time (SetOnce::reset() doesn't need to come before adding vmap functions) * Rebase against the latest DeviceContext changes from me that got pushed. Lyude Paul (4): rust: drm: gem: shmem: Add DmaResvGuard helper rust: drm: gem: shmem: Add vmap functions rust: faux: Allow retrieving a bound Device rust: drm: gem: Introduce shmem::Object::sg_table() rust/kernel/drm/gem/shmem.rs | 524 ++++++++++++++++++++++++++++++++++- rust/kernel/faux.rs | 16 +- 2 files changed, 524 insertions(+), 16 deletions(-) base-commit: fea3a2dd7d3fc1936211ced5f84420e610435730 -- 2.54.0

12 hours, 34 minutes

Re: [PATCH v18 1/4] rust: drm: gem: shmem: Add DmaResvGuard helper

by lyude＠redhat.com

I think I have just been defaulting to always for anything that seems like it should be unquestionably inlined - should I be defaulting to #[inline] instead? On Sun, 2026-06-07 at 13:22 +0100, Gary Guo wrote: > > +impl<'a, T: DriverObject, C: DeviceContext> DmaResvGuard<'a, T, C> > > { > > + #[inline(always)] > > Why `always` here? > > Best, > Gary

14 hours, 14 minutes

Re: [PATCH net-next 2/4] udmabuf: emit one sg entry per pinned folio

by Christian König

On 6/8/26 15:55, Bobby Eshleman wrote: > > On Sun, Jun 7, 2026 at 11:42 PM Christian König <christian.koenig(a)amd.com <mailto:christian.koenig@amd.com>> wrote: > > On 6/5/26 20:44, Bobby Eshleman wrote: > > On Fri, Jun 05, 2026 at 11:30:07AM +0200, Christian König wrote: > >> On 6/4/26 02:42, Bobby Eshleman wrote: > >>> From: Bobby Eshleman <bobbyeshleman(a)meta.com <mailto:bobbyeshleman@meta.com>> > >>> > >>> get_sg_table() emitted one PAGE_SIZE sg entry per page even when the > >>> underlying folio was larger. > >>> > >>> Instead, walk folios[] and emit one sg entry per folio. When folios > >>> represent large pages (as is for MFD_HUGETLB), each sg entry is a large > >>> page. Normal PAGE_SIZE sg tables are unchanged. > >>> > >>> Required by net/core/devmem to support rx-buf-size > PAGE_SIZE with > >>> udmabuf. > >> > >> That doesn't explain why this is required. > > > > Sure, can definitely add. Devmem currently requires dmabuf sg entries to > > be length and size aligned when it allocates niovs for NIC page pools. > > Though udmabuf is not violating any dmabuf contract by emitting > > PAGE_SIZE entries and the above restriction is probably more a > > shortfalling of devmem, by emitting a single entry per folio this patch > > allows udmabuf to be used by devmem for large pages. > > > >> > >> Please note that accessing the pages/folio of an sg-table returned by DMA-buf is illegal and strictly forbidden! > >> > >> Regards, > >> Christian. > > > > It seems both devmem and io_uring zcrx at least introspect through to > > the sg-table to build NIC page pools (not accessing the memory itself, > > however). Is there a better way? > > That's an absolute NO-GO! We need to stop that immediately. > > Touching the underlying struct page of an DMA-buf exported sg-table is strictly forbidden. > > We even have code to wrap the sg_table and hide the struct pages on debug builds to catch those issues, see function dma_buf_wrap_sg_table(). > > My last status is that the NIC page pools are build directly from the DMA addresses exposed by the sg_table. > > Was there any change I'm not aware of? > > Regards, > Christian. > > > Oh no change, your mental model is still current. > They just go through each sg and use sg_dma_address() on each. Ah, thanks! That was a near heart attack :D Yeah that is perfectly correct, question is do you then still really need this udmabuf change? I mean the DMA API usually merges together contiguous DMA addresses. Regards, Christian. > > Best, > Bobby > > > > > > Best, > > Bobby > > > >> > >>> Signed-off-by: Bobby Eshleman <bobbyeshleman(a)meta.com <mailto:bobbyeshleman@meta.com>> > >>> --- > >>> drivers/dma-buf/udmabuf.c | 47 ++++++++++++++++++++++++++++++++++++++++++----- > >>> 1 file changed, 42 insertions(+), 5 deletions(-) > >>> > >>> diff --git a/drivers/dma-buf/udmabuf.c b/drivers/dma-buf/udmabuf.c > >>> index 94b8ecb892bb..f28dd3788ada 100644 > >>> --- a/drivers/dma-buf/udmabuf.c > >>> +++ b/drivers/dma-buf/udmabuf.c > >>> @@ -141,26 +141,63 @@ static void vunmap_udmabuf(struct dma_buf *buf, struct iosys_map *map) > >>> vm_unmap_ram(map->vaddr, ubuf->pagecount); > >>> } > >>> > >>> +/* Return the number of contiguous pages backed by the folio at @i. > >>> + * A udmabuf may map only part of a folio, or reference the same folio > >>> + * in multiple non-contiguous runs, so folio_nr_pages() can't be used. > >>> + */ > >>> +static pgoff_t udmabuf_folio_nr_pages(struct udmabuf *ubuf, pgoff_t i) > >>> +{ > >>> + struct folio *f = ubuf->folios[i]; > >>> + pgoff_t j; > >>> + > >>> + for (j = 1; i + j < ubuf->pagecount; j++) { > >>> + if (ubuf->folios[i + j] != f) > >>> + break; > >>> + /* Same folio, but not a sequential offset within it. */ > >>> + if (ubuf->offsets[i + j] != ubuf->offsets[i] + j * PAGE_SIZE) > >>> + break; > >>> + } > >>> + return j; > >>> +} > >>> + > >>> +/* Count the contiguous folio runs in @ubuf, one sg entry per run. */ > >>> +static unsigned int udmabuf_sg_nents(struct udmabuf *ubuf) > >>> +{ > >>> + unsigned int nents = 0; > >>> + pgoff_t i; > >>> + > >>> + for (i = 0; i < ubuf->pagecount; i += udmabuf_folio_nr_pages(ubuf, i)) > >>> + nents++; > >>> + return nents; > >>> +} > >>> + > >>> static struct sg_table *get_sg_table(struct device *dev, struct dma_buf *buf, > >>> enum dma_data_direction direction) > >>> { > >>> struct udmabuf *ubuf = buf->priv; > >>> - struct sg_table *sg; > >>> struct scatterlist *sgl; > >>> - unsigned int i = 0; > >>> + struct sg_table *sg; > >>> + pgoff_t i, run; > >>> + unsigned int nents; > >>> int ret; > >>> > >>> + nents = udmabuf_sg_nents(ubuf); > >>> + > >>> sg = kzalloc_obj(*sg); > >>> if (!sg) > >>> return ERR_PTR(-ENOMEM); > >>> > >>> - ret = sg_alloc_table(sg, ubuf->pagecount, GFP_KERNEL); > >>> + ret = sg_alloc_table(sg, nents, GFP_KERNEL); > >>> if (ret < 0) > >>> goto err_alloc; > >>> > >>> - for_each_sg(sg->sgl, sgl, ubuf->pagecount, i) > >>> - sg_set_folio(sgl, ubuf->folios[i], PAGE_SIZE, > >>> + sgl = sg->sgl; > >>> + for (i = 0; i < ubuf->pagecount; i += run) { > >>> + run = udmabuf_folio_nr_pages(ubuf, i); > >>> + sg_set_folio(sgl, ubuf->folios[i], run << PAGE_SHIFT, > >>> ubuf->offsets[i]); > >>> + sgl = sg_next(sgl); > >>> + } > >>> > >>> ret = dma_map_sgtable(dev, sg, direction, 0); > >>> if (ret < 0) > >>> > >>> -- > >>> 2.53.0-Meta > >>> > >> >

16 hours, 15 minutes

Buy/Get/Order Verified NEBOSH Certificates Online in South Korea

by jamestoah113＠gmail.com

(certifitasap(a)gmail.com) No Exam: When you buy a genuine NEBOSH Certification, there will be no need to take the exams. Convenience: Many people have tight schedules and do not have enough time to go through the exams or testing process. Buying the NEBOSH Certification will be very convenient for them. Apply for the NEBOSH certificate in Malaysia https://streamable.com/2yj6u6 To check NEBOSH results online in Kuwait or the UAE. Where can I buy the NEBOSH Diploma online? How to see my registered NEBOSH certificates? Get the NEBOSH health and safety certificate in the USA. France. Luxembourg. Switzerland. Colombia. India. Turkey. Kuwait. Qatar. Hong Kong. Bahrain. Malaysia. Russian. Japan. Ireland. Saudi Arabia. Egypt . China. Taiwan. Israel. Indonesia Lebanon. Jordan. Serbia. Iran. Thailand. United Arab Emirates. Iraq. Oman Buy original NEBOSH diplomas without exam in Saudi Arabia We are a group of Teachers and Examiners specialized in the Acquisition of NEBOSH CERTIFICATES & all Certificates without taking the exams. https://streamable.com/2n368u 1- We provide an Official certificate with registration in the database and actual center stamps for customers interested in obtaining the certificate without taking the test. 2. We provide you with a new certificate with the updated results for you to follow your PR procedures without any risk. 3- We can provide Question papers for future tests before the actual test date. The questionnaires will be issued about 6 to 10 days before the test data and will be 100% the same questions that will appear in the test. Guaranteed at 100%. https://vimeo.com/1189663914?share=copy&fl=sv&fe=ci 4- We are teachers and examination officials working together as a team, so you can choose any of our professionals to go in for the exams on your behave. 5- You can register for your exams and go in for but we shall provide your target scores as you request because we have underground partners working at any center test, which gives us access to the system. 6- We equally assist our clients by sending recommendation letters to well-known educational institutions or enterprises offering employment abroad in Canada, the UK, the USA, Australia, New Zealand, and others to give you a kick start for your future. NEBOSH Diplomas in countries like: USA, Australia, Belgium, Brazil, Canada, Italy, Finland, France, Germany, Israel, Mexico, Netherlands, , Spain, United Kingdom. https://t.me/+A1TvrjQBdZc2MWRh https://t.me/+UfhkuxkiJsw5NWEx https://t.me/neboshigcdiploma https://neboshigc03.wixsite.com/website/services https://neboshigc03.wixsite.com/website/about https://neboshigc03.wixs....com/website/book-online https://neboshigc03.wixsite.com/website/contact https://neboshigc03.wixsite.com/website/products Contact us via Teams ID-- (Jacob JB) We provide verified NEBOSH certificates with online possibilities. You are guaranteed 100% with us, as the certificate you obtain is 100% legal and accepted anywhere without any doubt. Customers interested in obtaining the certificate should contact us through the contact details listed below. Payment and prices shall be discussed upon your response to this ad. Contact Customer Care for a fast chat via Email....certifitasap(a)gmail.com WhatsApp...+1 (450)912-2147 Contact us via Teams ID-- (Jacob JB) Email (neboshigc03(a)yahoo.com) NEBOSH IGC Certificate NEBOSH Oil and Gas Safety NEBOSH Fire Certificate NEBOSH Diploma Contact Customer Care for a fast chat via Email....certifitasap(a)gmail.com WhatsApp.....+1 (450) 912-2147 https://streamable.com/xhi9hi British NEBOSH certificate Obtain Real NEBOSH Diploma Acquire NEBOSH Diploma online Diploma without Exam in Tuvalu Buy NEBOSH Diploma without exam Obtain NEBOSH certificate in Dubai Acquire NEBOSH certificate in India Buy NEBOSH Fire Certificate in Nepal Obtain NEBOSH certificate in the UAE NEBOSH Fire Certificate without Exam BCSP Certification Online in Austria Obtain NEBOSH Exam in the Netherlands Get NEBOSH Diploma online without Exam Apply for NEBOSH Diploma UK without Exam Apply for the British NEBOSH Certificate Buy a NEBOSH certificate without an exam Buy British NEBOSH IGC certificates in UK Apply for the NEBOSH IGC certificate in UK NEBOSH Diploma Online in the Netherlands Acquire the NEBOSH certificate in Punjab Buy NEBOSH in New York/Islamabad/Seoul, Buy/get/order NEBOSH WITHOUT exams/test, Order NEBOSH in Tashkent/ Hanoi/Hong Kong, NEBOSH certificate without exam in Kerala Order original NEBOSH Diploma without Exam Buy CSP Certificate Without Exam in Germany Buy SMS Certificate Without Exam in Sweden Buy a CHST Certificate Without Exam in Iran NEBOSH certificate without Exam in the UAE Buy a NEBOSH certificate UK without an Exam Buy a British NEBOSH Fire certificate online Acquire NEBOSH certificates without an Exam Order NEBOSH Certificate Online Without Exam Want to Improve your NEBOSH IGC or Diplomas? Apply for the NEBOSH certificate in Malaysia. British NEBOSH Fire certificate without Exam Buy NEBOSH IGC Certificate Online in Austria NEBOSH certificate without exam in Hyderabad Buy NEBOSH Certificate Without Exam in Belgium Apply for the NEEBOSH certificate in Australia Buy a NEBOSH certificate in Karachi, Australia Buy NEBOSH certificate in Australia/Pakistan, Buy Original NEBOSH without exams in Karachi Obtain NEBOSH WITHOUT tests/exams in the UK, Buy a CET Certificate Without Exam in Belgium Buy NEBOSH Certificate Without Exam in Bulgaria Buy ASP Certificate Without Exam in Luxembourg Order NEBOSH certificate without Exam in Aruba Acquire a Diploma without an Exam in Australia Purchase NEBOSH Fire Certificate without Exam Buy NEBOSH certificate without Exam in Algeria Buy NEBOSH Diploma without exam in Martinique Buy NEBOSH Diploma without Exam in Kyrgyzstan NEBOSH IGC Certificate Without Exam in Denmark Get NEBOSH HSW Certificate Without Exam in Greece Buy Original NEBOSH Certificate Online in the UK Obtain NEBOSH certificate without exam in Punjab Order NEBOSH Certificate Without Exam in Bulgaria Purchase the NBOSH certificate without the Exam Apply for NEBOSH IGC Certificate UK without Exam Apply for NEBOSH Diploma without Exam in Mongolia NEBOSH certificate without Exam in New Caledonia NEBOSH IGC Certificate Without Exam in Seychelles Buy STSC Certificate Without Exam in Switzerland Buy NEBOSH HSW Certificate Without Exam in Croatia Buy STS Certificate Without Exam in the Netherlands Buy NEBOSH HSW Certificate Without Exam in Greece Buy NEBOSH HSW Certificate Without Exam in Norway Buy NEBOSH IDIP Certificate Without Exam in Turkey Buy NEBOSH IGC Certificate Without Exam in Poland Purchase a registered NEBOSH London/Sydney/Dubai NEBOSH Certificate Without Exam in Saudi Arabia Buy/get NEBOSH in Qatar without taking the test, Obtain a Registered NEBOSH certificate in Qatar, Buy/obtain/get NEBOSH certificate in Dubai/UAE, Get/purchase/Buy NEBOSH certificate in Qatar/ India, Original NEBOSH Certificate Without Exam in Jordan Buy NEBOSH IGC 1 Certificate Without Exam in Ukraine Buy NEBOSH IGC 2 Certificate Without Exam in Portugal Obtain NEBOSH Oil and Gas Safety without Exam in London Acquire NEBOSH Diploma without Exam in Western Sahara Purchase NEBOSH Diploma without Exam in Cote d'Ivoire Purchase NEBOSH IGC Certificate without Exam in Uganda Obtain original NEBOSH Fire Certificate without Exam Obtain NEBOSH IGC Certificate Without Exam in Poland Buy NEBOSH IGC 1 Certificate Without Exam in Ukraine Acquire NEBOSH Certificate Without Exam in Germany Acquire NEBOSH certificate without exam in Bangalore Buy a NEBOSH Certificate without an exam in Chennai Get NEBOSH Diploma Certificate Without Exam in Sweden Obtain NEBOSH Certificate Without Exam in Switzerland Acquire NEBOSH HSW Certificate Without Exam in Croatia Apply for NEBOSH HSW Certificate Without Exam in Norway Acquire NEBOSH IDIP Certificate Without Exam in Turkey Buy a NEBOSH certificate without an Exam in Bouvet Island Apply for British NEBOSH Oil and Gas Safety certificates Apply for the NEBOSH certificate without an exam in Delhi Acquire NEBOSH Certificate Without Exam in the Netherlands Apply for NEBOSH IGC Certificate Without Exam in Luxembourg Buy NEBOSH health and safety Certificate Without Exam in Iran Buy/purchase/ Acquire an original NEBOSH certificate in Karachi Order/obtain/buy NEBOSH certificate in Malaysia/Germany, Get/obtain NEBOSH certificate in Pakistan, New Zealand, Buy/Obtain/Get NEBOSH certificate in the United Kingdom (UK), Order Original NEBOSH Diploma Without Exam Online in Egypt Order Original NEBOSH course Certificate Without Exam in Jordan, Apply for Original NEBOSH Diplomas Without Exam in Saudi Arabia Apply for NEBOSH Oil and Gas Safety without Exam in Guyana Buy NEBOSH HSW Certificate Without Exam in the Czech Republic How to get the original NEBOSH Fire Certificate without Exam Get NEBOSH verification. Obtain a real NEBOSH Certificate online Acquire a NEBOSH certificate without an Exam in the United States Order original NEBOSH Oil and Gas Safety certificate without the Exam Purchase real NEBOSH Oil and Gas Safety certificates without an Exam Apply for NEBOSH Fire Certificate without Exam in Brunei Darussalam Apply for NEBOSH IGC Certificate without Exam in Antigua and Barbuda Purchase Original NEBOSH Diploma Online Without Exam in Jordan, Acquire Original NEBOSH Oil and Gas Safety Without Exam Online in Bahrain, Apply for Original NEBOSH Fire Certificate Without Exam Online in Algeria, Order Original NEBOSH Fire Certificate Online Without Exam in Saudi Arabia Obtain Original NEBOSH Diploma Without Exam Online in the Middle East, Obtain Original NEBOSH IGC Certificates Online Without Exam in Kuwait, Apply for Original NEBOSH Oil and Gas Safety Online Without Exam in Qatar, Obtain Original NEBOSH Fire Certificate Online Without Exam in Jordan, Apply for the NEBOSH certificate without an Exam in the Falkland Islands Apply for NEBOSH oil and gas Certificate Without Exam in Iran, Netherlands Buy/Get/Order Verified NEBOSH Certificates Online in South Korea, Gwangju Apply for Original NEBOSH Certificates Online in the United Arab Emirates, UAE, Dubai, Purchase the NEBOSH Oil and Gas Safety certificate without an Exam online in Antigua Obtain NEBOSH Oil and Gas Safety without an exam in the French Southern Territories Buy/Get/Order Verified NEBOSH Diplomas Certificates Online in South Korea, Seoul Apply for Original NEBOSH Certificate Without Exam in the United Arab Emirates, UAE, Dubai NEBOSH Diploma in the UAE, Qatar, Kuwait, Oman, Bahrain, Malaysia Singapore Jordan Saudi Arabia USA Ireland UK France Italy Belgium, Ukraine, Iceland, Brazil, Spain, Germany Egypt, Turkey, Morocco, Algeria, Greece) Contact Customer Care for a fast chat via Contact us via Teams ID-- (Jacob JB) Email....certifitasap(a)gmail.com WhatsApp.....+1 (450) 912-2147 Don't hesitate, feel free to contact us so as to get your certificates done perfectly and on time. available service 24Hs/7Ds

16 hours, 16 minutes

Living a Thousand Lives: Exploring the Quirky World of BitLife

by vast.stoat.yach＠hidingmail.net

Have you ever wondered what your life would look like if you made entirely different choices? Life simulation games have always been a fascinating genre for gamers, but few capture the unpredictable, hilarious, and sometimes chaotic nature of existence quite like Bitlife. Instead of relying on heavy 3D graphics, it is a text-based simulator that focuses entirely on the ripple effects of your decisions. It’s perfect for casual gaming sessions, so let's dive into how to play and get the most out of this quirky experience. https://bitlifefree.io/ Gameplay: Growing Up, One Year at a Time The premise of the game is incredibly simple but highly addictive. You are born with a random set of basic stats—Happiness, Health, Smarts, and Looks—in a random country to random parents. From there, you control your character's life year by year simply by tapping the "Age" button. In your early years, your choices are understandably limited to things like interacting with your parents, going to the doctor, or playing with pets. But as you grow into a teenager and an adult, the world completely opens up. You can choose to study hard, drop out, date, travel the world, buy real estate, or even turn to a life of crime. Every year, the game throws random scenarios at you: a classmate might insult you, you might be offered a questionable substance at a party, or you might find a wallet on the street. How you react directly impacts your stats and future opportunities. You might even have to pass mini-games, like navigating a maze for your driving test or escaping from prison. The ultimate goal is simply to live your life until your character passes away, leaving behind a unique legacy and a tombstone summarizing your deeds. Tips for a Great Experience If you are just starting out, here are a few tips to make your virtual life more successful—or at least more entertaining: Keep an eye on your core stats: Your Health and Happiness are crucial. If they drop too low, your character might face early health issues. Go to the gym, meditate, go to the movies, or spend time with family to keep these bars in the green. Education pays off (usually): If you want a high-paying, stable career like a doctor, judge, or CEO, use the "Study harder" option every year during school. Read books at the library to passively boost your Smarts stat. Hunt for Ribbons: At the end of every life, you are awarded a ribbon based on how you lived (e.g., "Hero," "Scandalous," "Lazy," or "Rich"). Trying to collect all the different ribbons is a great way to give yourself specific goals. Don't be afraid of the absurd: The real charm of the game is in its wild unpredictability. Sometimes, making terrible choices, trying to become a famous actor, or buying a crazy exotic pet leads to the most memorable playthroughs. Don't always play it safe! Conclusion Ultimately, the beauty of this simulator lies in its endless replayability. Every time you hit the button to start a new life, it is a completely blank slate. You can be a saint in one lifetime and an absolute menace to society in the next. Whether you have five minutes to kill on a bus commute or an hour to craft a sprawling, multi-generational family dynasty, diving into Bitlife offers a fun, lighthearted escape into a world where you pull all the strings. Give it a try, and see exactly where your choices take you!

22 hours, 56 minutes

Jump to page:

2026

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

Linaro-mm-sig