Sponsored Content
Full Discussion: help with data type sizes
Top Forums Programming help with data type sizes Post 302488775 by DGPickett on Tuesday 18th of January 2011 11:14:59 AM
Old 01-18-2011
Yes, people love to argue with the term "heap". Yackety yack, but it does not improve functional understanding.

Everything but the stack comes out of the address space at the bottom, starting with code load, initial dynamic library load (which is mmap()), globals, statics; all as the sections they are in are encountered, and then dynamic additions: ld() calls laying down dynamically linked (again via mmap()), malloc/calloc/realloc(), explicit mmap(), object new, etc. If you mmap(), the files under this VM are not the swap, but the mmap()'d file's area. Everyone executes the same RAM pages of /lib/libc.so, for instance, but possibly at different local VM offsets.

The stack grows down from the top of the address space, with subroutine parameters, automatic variables, allloca() calls (deprecated but deliciously cheap since return does an implicit free()). While automatic arrays are stored here, automatic pointers are here but initialization objects they point to are mostly not here. Space is allocated with calls and automatic declarations and freed with return, and the return value overwrites/redefines the 'top' of the stack. The language metaphors of the stack like tops are "heap-esque", since it is a metaphor for a stack of sheets of paper, but it was handy to allocate it down from the top. Most systems have CPU binary info on the same stack, to restore state on return. Sometimes registers are pushed on call and restored on return. This way, each lower level subroutine gets the free use of registers it needs without first saving and finally restoring the content, when the content might be worthless. Compilers can assign call/return parameters to registers for the call of the bottom level subroutines, saving RAM activity on the stack in the inner parts of loops.

Sometimes the CPU hardware stack is not friendly to programmer data, and the stack is realloc()'d on the heap, and so grows upward.

A system might have an odd allocation scheme where the VM is subdivided into pieces that can all grow independently from the bottom without the restriction of items being allocated in the way. Some systems use segmentation, where the virtual memory is divided into N separate spaces. The problem is, usually these spaces are not big enough, or too few, and the schemes usually shrink the segment space when they devote address bits to the segment number. The x86 segmentation, as I recall, can have 16384 segments, half nominally for the system, and they span a million either bytes or 4KB pages, but in the latter case length is enforced only to the page. In unsegmented space, a really bad offset on a pointer to the stack can look into a legally readable part of the heap. UNIX generally always uses unsegmented space.

Yes, comparing addresses of items not in the same array is nonsense, except as research, for instance if you desire to do some raw binary i/o. Even then, it is nicer to make a struct or object for such purposes, using #pragma pack if you dislike the amount of padding/alignment. Beware of the other-endian systems!
 

10 More Discussions You Might Find Interesting

1. Programming

FILE data type

Hi all, Can anyone tell me a little about the datatype FILE, which represents stream. What does its structure look like, and in which header file is it defined and so on... Ex : FILE *fp ; fp = fopen("filename", "w") ; (6 Replies)
Discussion started by: milhan
6 Replies

2. Programming

time_t data type-- what does start +1 mean?

Hi, I am trying to understand an very old C program. .... time_t start, end; ptr = localtime(&start); ... fprintf(out, "%-35s 01 %5s %2s %10d 1 5 /tty/M%d/%02d %24s", buffer3, job, ver, start, mach_num,atoi(buffer), asctime(ptr)); fprintf(out, "%-35s 03 %5s %2s %10d 1 5... (9 Replies)
Discussion started by: whatisthis
9 Replies

3. Programming

data type limitation

I am writing some code to do analysis on the file system (HP-UX 11.11). I am using stat(..) to get file information. My problem is that the file-size may exceed the data types defined in 'sys/stat.h' & 'sys/types.h' respectively. Thus file-sizes in the Giga-byte range are not read correctly.... (2 Replies)
Discussion started by: ALTRUNVRSOFLN
2 Replies

4. AIX

Value too large to be stored in data type???

Hello, I get this message : "Value too large to be stored in data type" when I try to open a 3Gb file. Can someone helps me to resolve the problem. Thank you very much (5 Replies)
Discussion started by: limame
5 Replies

5. UNIX for Dummies Questions & Answers

Directorie listing in Human form for data sizes

I have seen it done at my job before, there is a command that will make a notepad and show the directorie path, subfolders, and size of the subfolders? But i dont want it to go lower than 2 levels for example: folder_01 10 GB subfolder_02 10 GB subfolder_03 10 GB... (4 Replies)
Discussion started by: JUSSAN007
4 Replies

6. Shell Programming and Scripting

Perl data type checking

I am using perl 5.8.0. I need to check some values to see it they are floats. Our system does not have Data::Types so I can't use is_float. Is there something else that I can use? The only thing in Data is Dump.pm. I am not allowed to download anything to our system so I have to use what I have.... (3 Replies)
Discussion started by: ajgwin
3 Replies

7. UNIX for Advanced & Expert Users

Memory allocation for float data type

Dear All, How internally memory allocated when we declare the float data type. how many bytes allocated for decimal and how many bytes for fraction. kindly help me in this regards. (2 Replies)
Discussion started by: rajamohan
2 Replies

8. Shell Programming and Scripting

Can I split a 10GB file into 1 GB sizes using my repeating data pattern

I'm not a unix guy so excuses my ignorance... I'm the database ETL guy. I'm trying to be proactive and devise a plan B for a ETL process where I expect a file 10X larger than what I process daily for a recast job. The ETL may handle it but I just don't know. This file may need to be split... (3 Replies)
Discussion started by: john091
3 Replies

9. Web Development

Data type to use for prices with commas

Hi everybody, I`m very new with PHP and Databases and I having the follow issue with prices data.. The original information is in CSV files. The prices have formatted with commas and dots as follow: 12,300.99 -->(thousands separated by commas) 3,500.25 -->(thousands separated... (10 Replies)
Discussion started by: cgkmal
10 Replies

10. Programming

Incompatible data type fpos_t in C

This is from a program I wrote over in 1998 that I am trying to compile on a linux machine: void write_line (FILE *fp, int rec_no, line_rec *arec) { fpos_t woffset; woffset = (rec_no - 1) * sizeof(line_rec); fsetpos(fp,&woffset); fwrite(arec,sizeof(line_rec),1,fp); }On the line... (2 Replies)
Discussion started by: wbport
2 Replies
DC(1)							      General Commands Manual							     DC(1)

NAME
dc - desk calculator SYNOPSIS
dc [ file ] DESCRIPTION
Dc is an arbitrary precision arithmetic package. Ordinarily it operates on decimal integers, but one may specify an input base, output base, and a number of fractional digits to be maintained. The overall structure of dc is a stacking (reverse Polish) calculator. If an argument is given, input is taken from that file until its end, then from the standard input. The following constructions are recognized: number The value of the number is pushed on the stack. A number is an unbroken string of the digits 0-9. It may be preceded by an under- score _ to input a negative number. Numbers may contain decimal points. + - / * % ^ The top two values on the stack are added (+), subtracted (-), multiplied (*), divided (/), remaindered (%), or exponentiated (^). The two entries are popped off the stack; the result is pushed on the stack in their place. Any fractional part of an exponent is ignored. sx The top of the stack is popped and stored into a register named x, where x may be any character. If the s is capitalized, x is treated as a stack and the value is pushed on it. lx The value in register x is pushed on the stack. The register x is not altered. All registers start with zero value. If the l is capitalized, register x is treated as a stack and its top value is popped onto the main stack. d The top value on the stack is duplicated. p The top value on the stack is printed. The top value remains unchanged. P interprets the top of the stack as an ascii string, removes it, and prints it. f All values on the stack and in registers are printed. q exits the program. If executing a string, the recursion level is popped by two. If q is capitalized, the top value on the stack is popped and the string execution level is popped by that value. x treats the top element of the stack as a character string and executes it as a string of dc commands. X replaces the number on the top of the stack with its scale factor. [ ... ] puts the bracketed ascii string onto the top of the stack. <x >x =x The top two elements of the stack are popped and compared. Register x is executed if they obey the stated relation. v replaces the top element on the stack by its square root. Any existing fractional part of the argument is taken into account, but otherwise the scale factor is ignored. ! interprets the rest of the line as a UNIX command. c All values on the stack are popped. i The top value on the stack is popped and used as the number radix for further input. I pushes the input base on the top of the stack. o The top value on the stack is popped and used as the number radix for further output. O pushes the output base on the top of the stack. k the top of the stack is popped, and that value is used as a non-negative scale factor: the appropriate number of places are printed on output, and maintained during multiplication, division, and exponentiation. The interaction of scale factor, input base, and out- put base will be reasonable if all are changed together. z The stack level is pushed onto the stack. Z replaces the number on the top of the stack with its length. ? A line of input is taken from the input source (usually the terminal) and executed. ; : are used by bc for array operations. An example which prints the first ten values of n! is [la1+dsa*pla10>y]sy 0sa1 lyx SEE ALSO
bc(1), which is a preprocessor for dc providing infix notation and a C-like syntax which implements functions and reasonable control struc- tures for programs. DIAGNOSTICS
`x is unimplemented' where x is an octal number. `stack empty' for not enough elements on the stack to do what was asked. `Out of space' when the free list is exhausted (too many digits). `Out of headers' for too many numbers being kept around. `Out of pushdown' for too many items on the stack. `Nesting Depth' for too many levels of nested execution. 7th Edition April 29, 1985 DC(1)
All times are GMT -4. The time now is 04:53 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy