Programming

is this possible, if so plz please share with me..

Moderator's Comments:

Correct English please, not Cyber-/Leetspeak

This is entirely possible.

a bit more programmatical explanation will do.!!

"You're welcome"?

The thing (or rather, the combination of things) you're asking about is quite extensive and a bit niche. You'll have to do research for yourself on this one - don't expect anyone to hand the answers to you on a plate.

There are tutorials on the web for both subjects, so take a look. Search for "beej's guide to ipc" and you'll find some good info about shared memory, and it won't be hard to find examples of how to create linked lists. Combine these two (remembering that you can't use the linked list to "point" to data in your program's address space, you have to ship it all out to the shared memory region) and you're there.

Tank you

I do not think that this scenario is possible on protected memory managed systems ...
Like Linux / any flavor of UNIX .

If you recall that a shared memory is identified through key_t type of datatype and are operated through syscalls.

You can not perform memory operations like you do on normal program variables (be it a heap, stack, .bss, .data/ro etc).
Like &<my_variable>

Now a typical linked list node looks like:

Code:

struct myNode {
   int info;

      // ...

   struct myNode *nextNode;
};

Now could anyone explain , if you could populate the pointer (nextNode) with an address of a shared memory? If yes how, I want to learn.

However, the same is possible (and very much possible) possible on a flat memory managed systems like VxWorks. As a food for though just think how?

answer @praveen if you could..