Sponsored Content
Full Discussion: shared memory deallocation
Top Forums UNIX for Dummies Questions & Answers shared memory deallocation Post 2807 by Neo on Tuesday 5th of June 2001 04:28:33 PM
Old 06-05-2001
I don't know, off hand, of any way to get rid of the ipc entry except to reboot. This is especially true if the processes that are using the shared memory segment have not released their locks (did not exit or terminate processes cleanly). If you do not have access to the source code, tracking this down could be difficult. You might consider using a system call tracing utility like strace or truss to see if the processes deallocate before exiting.
 

10 More Discussions You Might Find Interesting

1. UNIX for Advanced & Expert Users

Shared memory shortage but lots of unused memory

I am running HP-UX B.11.11. I'm increasing a parameter for a database engine so that it uses more memory to buffer the disk drive (to speed up performance). I have over 5GB of memory not being used. But when I try to start the DB with the increased buffer parameter I get told. "Not... (1 Reply)
Discussion started by: cjcamaro
1 Replies

2. Linux

all about shared memory

Hi all :confused: , I am new to unix.I have been asked to implement shared memory in user's mode.What does this mean?What is the difference it makes in kernel mode and in users mode?What are the advantages of this impemenation(user's mode)? And also i would like to know why exactly shared... (0 Replies)
Discussion started by: vijaya2006
0 Replies

3. Programming

Memory Deallocation Enquery

If i "new" a object of class type A and A uses some data structure like array, set, map etc. When i delete this object, need I delete/clear the array/set/map in the destrucator of A, or system will deallocate the memory automatically?? Thanks in advance! Em, do bear me if the question is... (3 Replies)
Discussion started by: zzz_zzz
3 Replies

4. Programming

help with shared memory

what i want to do is have an int that can been written into by 2 processes but my code doesn't seem to work. #include <sys/types.h> #include <sys/ipc.h> #include <sys/sem.h> #include <sys/shm.h> #include<stdio.h> #define KEY1 (1492) int main() { int shmid; volatile int * addr;... (6 Replies)
Discussion started by: ddx08
6 Replies

5. Programming

memory sharing - not shared memory -

hi, this is the problem: i want to swap a linked list between 4 processes (unrelated), is there any way i can do that just by sending a pointer to a structure? //example typedef struct node { int x; char c; struct node *next; } node; or i should send the items ( x,c ) by... (9 Replies)
Discussion started by: elzalem
9 Replies

6. Programming

Shared memory in shared library

I need to create a shared library to access an in memory DB. The DB is not huge, but big enough to make it cumbersome to carry around in every single process using the shared library. Luckily, it is pretty static information, so I don't need to worry much about synchronizing the data between... (12 Replies)
Discussion started by: DreamWarrior
12 Replies

7. Programming

Shared memory for shared library

I am writing a shared library in Linux (but compatible with other UNIXes) and I want to allow multiple instances to share a piece of memory -- 1 byte is enough. What's the "best" way to do this? I want to optimize for speed and portability. Obviously, I'll have to worry about mutual exclusion. (0 Replies)
Discussion started by: otheus
0 Replies

8. UNIX for Advanced & Expert Users

Shared Memory

Hi, Using ipcs we can see shared memory, etc.. details. How can I add/remove shared memory(command name)? Thanks, Naga:cool: (2 Replies)
Discussion started by: Nagapandi
2 Replies

9. AIX

shared memory

1.How to know wich process is using the shared memory? 2.How to flush (release) the process from the shared memory? (1 Reply)
Discussion started by: pchangba
1 Replies

10. Programming

Shared library with acces to shared memory.

Hello. I am new to this forum and I would like to ask for advice about low level POSIX programming. I have to implement a POSIX compliant C shared library. A file will have some variables and the shared library will have some functions which need those variables. There is one special... (5 Replies)
Discussion started by: iamjag
5 Replies
flock(2)							System Calls Manual							  flock(2)

Name
       flock - apply or remove an advisory lock on an open file

Syntax
       #include <sys/file.h>

       #define	 LOCK_SH   1	/* shared lock */
       #define	 LOCK_EX   2	/* exclusive lock */
       #define	 LOCK_NB   4	/* don't block when locking */
       #define	 LOCK_UN   8	/* unlock */

       flock(fd, operation)
       int fd, operation;

Description
       The  system  call applies or removes an advisory lock on the file associated with the file descriptor, fd.  A lock is applied by specifying
       an operation parameter that is the inclusive OR of LOCK_SH or LOCK_EX and, possibly, LOCK_NB.  To unlock an existing lock, operation should
       be LOCK_UN.

       Advisory  locks allow cooperating processes to perform consistent operations on files, but do not guarantee consistency; that is, processes
       might still access files without using advisory locks, possibly resulting in inconsistencies.

       The locking mechanism allows two types of locks: shared locks and exclusive locks.  At any time, multiple shared locks can be applied to  a
       file.  However, multiple exclusive locks, or shared and exclusive locks cannot be applied simultaneously on a file.

       A  shared  lock can be upgraded to be an exclusive lock, and an exclusive lock can become shared, simply by specifying the appropriate lock
       type. This change results in the previous lock being released and the new lock applied. When upgrading, do not include  LOCK_NB	in  opera-
       tion, because there is a possibility that other processes have requests for locks, or have gained or released a lock.

       Requesting  a lock on an object that is already locked normally causes the caller to blocked until the lock can be acquired.  If LOCK_NB is
       included in operation, the call is not blocked; instead, the call fails and the error EWOULDBLOCK is returned.

       Locks are on files, not file descriptors.  That is, file descriptors duplicated through or call do not result in multiple  instances  of  a
       lock,  but  rather  multiple references to a single lock.  If a process holding a lock on a file forks and the child explicitly unlocks the
       file, the parent loses its lock.

       Processes blocked awaiting a lock may be awakened by signals.

Return Values
       Zero is returned if the operation was successful; on an error, a -1 is returned and an error code is stored in the global variable, errno.

Diagnostics
       The call fails under the following conditions:

       [EWOULDBLOCK]  The file is locked and the LOCK_NB option was specified.

       [EBADF]	      The argument fd is an invalid descriptor.

       [EINVAL]       The argument fd refers to an object other than a file.

       [EOPNOTSUPP]   Invalid operation is requested.  The argument fd refers to a socket.

Restrictions
       File region locking is not supported over NFS.

See Also
       close(2), dup(2), execve(2), fork(2), open(2)

																	  flock(2)
All times are GMT -4. The time now is 04:36 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy