Searched refs:used (Results 1 - 25 of 176) sorted by relevance

12345678

/haiku-fatelf/src/bin/coreutils/lib/
H A Dsavedir.c55 size_t used = 0; local
79 if (used + entry_size < used)
81 if (allocated <= used + entry_size)
89 while (allocated <= used + entry_size);
93 memcpy (name_space + used, entry, entry_size);
94 used += entry_size;
97 name_space[used] = '\0';
/haiku-fatelf/src/bin/findutils/gnulib/lib/
H A Dsavedir.c45 /* The results of opendir() in this file are not used with dirfd and fchdir,
61 size_t used = 0; local
85 if (used + entry_size < used)
87 if (allocated <= used + entry_size)
95 while (allocated <= used + entry_size);
99 memcpy (name_space + used, entry, entry_size);
100 used += entry_size;
103 name_space[used] = '\0';
/haiku-fatelf/src/libs/ncurses/ncurses/tinfo/
H A Dlib_tgoto.c24 * holders shall not be used in advertising or otherwise to promote the *
76 size_t used = 0; local
89 if ((used + need) > length) {
90 length += (used + need);
131 result[used++] = *value++;
134 result[used++] = *string;
162 sprintf(result + used, fmt, *value++);
163 used += strlen(result + used);
171 result[used
[all...]
/haiku-fatelf/src/libs/ncurses/ncurses/trace/
H A Dvarargs.c24 * holders shall not be used in advertising or otherwise to promote the *
84 ARGTYPE used = atUnknown; local
112 used = atInteger;
120 used = atFloat;
124 used = atInteger;
128 used = atString;
132 used = atPoint;
136 used = atPoint;
144 if (used != atUnknown && parms < MAX_PARMS) {
145 parm[parms++] = used;
[all...]
H A Dlib_tracedmp.c24 * holders shall not be used in advertising or otherwise to promote the *
49 static size_t used = 0; local
69 if (++width + 1 > (int) used) {
70 used = 2 * (width + 1);
71 buf = typeRealloc(char, used, buf);
153 used = 0;
/haiku-fatelf/src/libs/ncurses/ncurses/base/
H A Dsafe_sprintf.c24 * holders shall not be used in advertising or otherwise to promote the *
82 int used = 0; local
139 used = 'i';
147 used = 'f';
151 used = 'i';
165 used = 'p';
169 used = 'p';
173 used = 0;
182 used = 'p';
186 switch (used) {
217 static size_t used; local
[all...]
H A Dlib_slk.c24 * holders shall not be used in advertising or otherwise to promote the *
138 size_t used = max_length + 1; local
140 if ((SP->_slk->ent[i].ent_text = (char *) _nc_doalloc(0, used)) == 0)
142 memset(SP->_slk->ent[i].ent_text, 0, used);
144 if ((SP->_slk->ent[i].form_text = (char *) _nc_doalloc(0, used)) == 0)
146 memset(SP->_slk->ent[i].form_text, 0, used);
/haiku-fatelf/src/kits/network/libbind/isc/
H A Dctl_p.h3 size_t used; member in struct:ctl_buf
14 #define buffer_init(Buf) ((Buf).text = 0, (Buf.used) = 0)
/haiku-fatelf/src/libs/ncurses/misc/
H A Dmakedef.cmd12 * is used to build a new .def file.
35 used. = 0
91 * we mark that code as used
107 used.new_code = 1
129 do while used.new_code \= 0
133 used.new_code = 1
/haiku-fatelf/src/libs/iconv/
H A Dcp950ext.h142 unsigned short used = summary->used; local
144 if (used & ((unsigned short) 1 << i)) {
146 /* Keep in `used' only the bits 0..i-1. */
147 used &= ((unsigned short) 1 << i) - 1;
148 /* Add `summary->indx' and the number of bits set in `used'. */
149 used = (used & 0x5555) + ((used & 0xaaaa) >> 1);
150 used
[all...]
/haiku-fatelf/src/system/kernel/
H A Dsem.cpp107 } used; member in union:sem_entry::__anon328
118 ThreadQueue queue; // should be in u.used, but has a constructor
162 || (last != -1 && sem->u.used.last_acquirer != last)
163 || (name != NULL && strstr(sem->u.used.name, name) == NULL)
164 || (owner != -1 && sem->u.used.owner != owner))
169 " %s\n", sem, sem->id, sem->u.used.count,
170 sem->u.used.owner,
171 sem->u.used.last_acquirer > 0 ? sem->u.used.last_acquirer : 0,
172 sem->u.used
[all...]
/haiku-fatelf/headers/private/kernel/arch/m68k/
H A Darch_mmu.h31 * routines. Both supervisor and root pointers must be used so we can't
69 uint32 used : 1;
77 uint32 used : 1;
92 uint32 used : 1;
104 uint32 used : 1;
112 // limit only used on early table terminators, else unused
/haiku-fatelf/src/bin/
H A Dlistport.c50 int32 max = 0, used = 0, left; local
55 used = sys.used_ports;
58 left = max - used;
60 printf("port: total: %5ld, used: %5ld, left: %5ld\n", max, used, left);
H A Dlistarea.c28 int32 max = 0, used = 0; local
34 used = info.used_pages * 4;
37 printf("memory: total: %4ldKB, used: %4ldKB, left: %4ldKB\n", max, used, max - used);
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/server-1.2.6/
H A Dfile_shares.h21 bool used; member in struct:fileShare
/haiku-fatelf/src/bin/findutils/find/
H A Dfstype.c258 size_t used = 0u; local
273 result = extendbuf(result, used+len, &alloc_size);
274 strcpy(&result[used], entry->me_mountdir);
275 used += len; /* len already includes one for the \0 */
287 size_t used = 0u; local
301 result = extendbuf(result, sizeof(dev_t)*(used+1), &alloc_size);
303 result[used] = entry->me_dev;
304 ++used;
307 *n = used;
/haiku-fatelf/src/system/libroot/posix/glibc/misc/
H A Dhsearch_r.c36 unsigned int used; member in struct:_ENTRY
42 /* For the used double hash method the table size has to be a prime. To
64 The contents of the table is zeroed, especially the field used
105 /* After using the hash table it has to be destroyed. The used memory can
106 be freed and the local static variable can be marked as not used. */
118 /* Free used memory. */
135 special. This index will never be used because we store the first hash
136 index in the field used where zero means not used. Every other value
137 means used
[all...]
/haiku-fatelf/build/scripts/
H A Dconvert_build_config_to_shell_format.pl9 that is being used in BuildSetup into a format that's understood by sh.
/haiku-fatelf/src/bin/bfs_tools/lib/
H A DBitmap.h28 bool BackupSetAt(off_t block,bool used);
29 void BackupSet(Inode *inode,bool used);
H A DBitmap.cpp65 // set root block, block bitmap, log as used
82 // calculate used blocks
137 Bitmap::BackupSetAt(off_t block, bool used) argument
150 if (used)
160 Bitmap::BackupSet(Inode *inode, bool used) argument
168 BackupSetAt(inode->Block(),used);
184 if (!BackupSetAt(block, used)) {
197 BackupSetAt(fDisk->ToBlock(node->data.indirect), used);
222 if (!BackupSetAt(block, used))
235 BackupSetAt(fDisk->ToBlock(node->data.double_indirect), used);
[all...]
/haiku-fatelf/src/system/kernel/cache/
H A DBlockMap.cpp8 * It has been designed to contain few and mostly contiguous offset mappings - it is used
43 uint32 used; member in struct:BlockMap::block_entry
164 entry->used--;
169 if (entry->used == 0) {
170 // release entry if it's no longer used
197 entry->used++;
199 entry->used--;
213 entry->used = 1;
/haiku-fatelf/src/add-ons/mail_daemon/inbound_protocols/imap/imap_lib/
H A DIMAPFolders.h42 status_t GetQuota(uint64& used, uint64& total);
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/FileSharing-Windows/
H A Dprinting.h16 bool used; member in struct:__anon5619
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/server-Windows/
H A Dprinting.h13 bool used; member in struct:__anon5677
/haiku-fatelf/src/libs/zlib/
H A Dinftrees.c24 lens shorts, which is used as a work area. type is the type of code
47 unsigned used; /* code entries in table used */ local
99 The length counts are used for other purposes as well, i.e. finding
151 filled is at next and has curr index bits. The code being used is huff
165 counts are used for this, and so count[] is decremented as codes are
168 used keeps track of how many table entries have been allocated from the
183 base = extra = work; /* dummy value--not used */
207 used = 1U << root; /* use root table entries */
208 mask = used
[all...]

Completed in 193 milliseconds

12345678