Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7803873
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 2, 20262026-06-02T01:43:40+00:00 2026-06-02T01:43:40+00:00

int val = memLoc[index++]; or better yet int val = memLoc[index++ & 0xFF]; Trying

  • 0

int val = memLoc[index++];

or better yet

int val = memLoc[index++ & 0xFF];

Trying to do a threadsafe read from a shared ring buffer where each call gets the next value – and I’d love it to be lock free if at all possible as it happens a TON. No Boost / C++ 11 allowed 🙁

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-02T01:43:42+00:00Added an answer on June 2, 2026 at 1:43 am

    The only operation here which needs to be synchronized is the increment of the index value. Since this is just a numeric value it can be done without the use of locks via an atomic increment. The rest of the operations you listed are just reads of a shared location and don’t need to be synchronized.

    On Win32 making the increment synchronized is done with the InterlockedIncrement function

    int oldValue = InterlockedIncrement(&index);
    int val = memLoc[oldValue & 0xFF];
    

    There are various synchronized increment functions available on Linux. There is a fairly good discussion about the options on this stackoverflow thread

    • How to perform atomic operations on Linux that work on x86, arm, GCC and icc?
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

class test{ public: int data; test(const test& ){cout<<INSIDE COPY CON <<endl;} test(int val =
int val = 233; byte b = (byte) val; System.out.println(b); I have a simple
public class Ex7 { private int fld; private void meth(int val) { fld =
// File: InitFirst.h #pragma once template <int val> struct InitFirst { static float s_dividedByThree;
A question about inheritance in java... class Base { private int val = 10;
I have an unordered map: class O(val a: Int) Map[String, List[O]] which I'd like
I have this quick sort implementation to sort the characters. int main(){ char val[]
scala> val l = List((1,2), (2,3)) l: List[(Int, Int)] = List((1,2), (2,3)) I can
scala> val m = Map(1 -> 2) m: scala.collection.immutable.Map[Int,Int] = Map(1 -> 2) scala>
I have some financial data gathered at a List[(Int, Double)], like this: val snp

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.