/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | Query.cpp | 295 // allocate & copy the attribute string 753 char* copy = (char*)malloc(length); 754 if (copy == NULL) 765 copy[i] = c; 767 copy[length - 1] = '\0'; 769 return copy;
|
/haiku/src/kits/network/libnetservices/ |
H A D | NetworkCookieJar.cpp | 466 BUrl copy(url); 467 copy.SetPath("/"); 468 return BNetworkCookieJar::UrlIterator(this, copy); 865 // Makes a copy of the characters from the key. This is important,
|
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/ |
H A D | kernel_emu.cpp | 56 UserlandFS::KernelEmu::new_path(const char *path, char **copy) argument 59 if (!copy) 62 *copy = NULL; 95 *copy = copiedPath;
|
/haiku/headers/cpp/std/ |
H A D | bastring.h | 15 // You should have received a copy of the GNU General Public License 132 inline void copy (size_t, const charT *, size_t); 179 // _lib.string.cons_ construct/copy/destroy: 364 size_type copy (charT* s, size_type n, size_type pos = 0) const; 480 p->copy (0, data (), pos); 481 p->copy (pos + n2, data () + pos + n1, len - (pos + n1));
|
/haiku/src/apps/activitymonitor/ |
H A D | ActivityView.cpp | 813 DataSource* copy; local 815 copy = source->CopyForCPU(i); 817 copy = source->Copy(); 819 ListAddDeleter<DataSource> sourceDeleter(fSources, copy, insert); 831 copy->SetColor(*color);
|
/haiku/headers/private/file_systems/ |
H A D | QueryParser.h | 459 // allocate & copy the attribute string 560 char* copy = (char*)malloc(length); local 561 if (copy == NULL) 564 memcpy(copy, start, length - 1); 565 copy[length - 1] = '\0'; 567 return copy;
|
/haiku/src/servers/app/drawing/Painter/ |
H A D | Painter.cpp | 1465 BRegion copy(*region); 1466 int32 count = copy.CountRects(); 1467 BRect touched = FillRect(copy.RectAt(0)); 1469 touched = touched | FillRect(copy.RectAt(i)); 1481 BRegion copy(*region); 1482 int32 count = copy.CountRects(); 1483 BRect touched = FillRect(copy.RectAt(0), gradient); 1485 touched = touched | FillRect(copy.RectAt(i), gradient);
|
/haiku/headers/cpp/ |
H A D | stl_uninitialized.h | 6 * Permission to use, copy, modify, distribute and sell this software 18 * Permission to use, copy, modify, distribute and sell this software 38 // Valid if copy construction is equivalent to assignment, and if the 46 return copy(__first, __last, __result); 141 // Valid if copy construction is equivalent to assignment, and if the 181 // Valid if copy construction is equivalent to assignment, and if the
|
H A D | stl_rope.h | 5 * Permission to use, copy, modify, distribute and sell this software 20 // really copy enough of the data structure to leave the original 127 copy(__x._M_buffer, __x._M_buffer + __x._M_buf_count, _M_buffer); 144 copy(__x._M_buffer, __x._M_buffer + __x._M_buf_count, _M_buffer); 263 // Internal rope nodes potentially store a copy of the allocator 774 // a copy constructor or generating reference to a proxy 799 // the only unusual operation it uses is the copy constructor, which 1000 // Perhaps we should instead copy the iterator 1329 // For strings shorter than _S_copy_max, we copy to 1746 void copy(_Char function in class:rope 1756 size_type copy(size_type __pos, size_type __n, _CharT* __buffer) const function in class:rope 2280 size_type copy(_CharT* __buffer, size_type __n, function in class:rope [all...] |
/haiku/headers/private/userlandfs/legacy/ |
H A D | fsproto.h | 234 extern _IMPEXP_KERNEL int new_path(const char *path, char **copy);
|
/haiku/src/tools/fs_shell/ |
H A D | block_cache.cpp | 26 // TODO: the retrieval/copy of the original data could be delayed until the 233 // Notify listener, we need to copy the notification, as it might 235 cache_notification copy = *notification; local 238 copy.hook(copy.transaction_id, event, copy.data); 1345 // we "allocate" the parent data lazily, that means, we don't copy
|
/haiku/src/apps/mediaplayer/playlist/ |
H A D | ListViews.cpp | 563 bool copy = modifiers() & B_SHIFT_KEY; local 564 bool replaceAll = !message->HasPointer("list") && copy; 583 const uchar* cursorData = copy ? kCopyCursor : B_HAND_CURSOR;
|
/haiku/src/apps/mail/ |
H A D | MailApp.cpp | 8 Permission is hereby granted, free of charge, to any person obtaining a copy of 11 use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies 521 // system dictionary, copy words 524 BFile copy(dataPath.Path(), B_WRITE_ONLY | B_CREATE_FILE); 529 copy.Write(buffer, size); 530 BNodeInfo(©).SetType("text/plain");
|
/haiku/src/bin/debug/strace/ |
H A D | strace.cpp | 629 char* copy = strdup(filterString); local 630 char *tok = strtok(copy, ","); 685 free(copy);
|
/haiku/src/apps/icon-o-matic/generic/gui/ |
H A D | ListViews.cpp | 419 bool copy = modifiers() & B_SHIFT_KEY; local 420 bool replaceAll = !message->HasPointer("list") && !copy; 437 const uchar* cursorData = copy ? kCopyCursor : B_HAND_CURSOR;
|
/haiku/src/add-ons/kernel/drivers/network/ether/rdc/dev/vte/ |
H A D | if_vte.c | 984 int copy, error, nsegs, padlen; local 1007 * To mitigate the de-fragmenting issue, perform deep copy 1010 * that is composed of single TX buffer, the deep copy is 1014 copy = 0; 1016 copy++; 1019 copy++; 1020 if (copy != 0) { 1021 /* Avoid expensive m_defrag(9) and do deep copy. */ 1039 /* Get a writable copy. */ 1148 * If there's a BPF listener, bounce a copy o [all...] |
/haiku/src/tests/servers/app/painter/ |
H A D | Painter.cpp | 874 BRegion copy(*region); 875 int32 count = copy.CountRects(); 877 FillRect(copy.RectAt(i), p);
|
/haiku/src/add-ons/input_server/filters/shortcut_catcher/ |
H A D | CommandActuators.cpp | 120 char* copy = new char[strlen(temp) + 1]; local 121 strcpy(copy, temp); 122 argList.AddItem(copy);
|
/haiku/src/bin/network/ftpd/ |
H A D | ftpcmd.y | 245 static char *copy(char *); 1413 yylval.s = copy(cp); 1538 copy(char *s)
|
/haiku/src/servers/launch/ |
H A D | LaunchDaemon.cpp | 806 Job* copy = new Job(*job); local 807 copy->SetTarget(target); 809 fJobs.insert(std::make_pair(copy->Name(), copy));
|
/haiku/src/libs/compat/freebsd_network/ |
H A D | fbsd_uipc_mbuf.c | 373 * In particular, this does a deep copy of the packet tags. 407 * copy junk along. 433 * Make a copy of an mbuf chain starting "off0" bytes from the beginning, 434 * continuing for "len" bytes. If len is M_COPYALL, copy to end of mbuf. 436 * Note that the copy is read-only, because clusters are not copied, 506 * Note that the copy is read-only, because clusters are not copied, 591 * you need a writable copy of an mbuf chain. 960 * Routine to copy from device local memory into mbufs. 966 void (*copy)(char *from, caddr_t to, u_int len)) 1013 if (copy) [all...] |
/haiku/3rdparty/mmu_man/onlinedemo/ |
H A D | haiku.php | 24 // you must *copy* (apache doesn't seem to like symlinks) it there.
|
/haiku/headers/os/support/ |
H A D | String.h | 380 status_t _MakeWritable(int32 length, bool copy);
|
/haiku/src/apps/cortex/NodeManager/ |
H A D | NodeRef.cpp | 1013 // copy found inputs into vector 1014 copy(inputBuffer, inputBuffer + count, 1057 // copy found inputs matching the given type into vector 1105 // copy found outputs into vector 1106 copy(outputBuffer, outputBuffer + count, 1148 // copy found outputs matching the given type into vector
|
/haiku/src/kits/app/ |
H A D | Message.cpp | 1119 Therefore instead of flattening into a buffer, we copy the message data 1126 The double copying is reduced to a single copy in most cases and we safe 2136 BMessage* copy = NULL; local 2144 copy = new BMessage(*this); 2145 if (copy != NULL) { 2146 header = copy->fHeader; 2257 direct->AddMessage(copy); 2258 if (direct->Queue()->IsNextMessage(copy) && port_count(port) <= 0) {
|