/haiku-fatelf/src/tests/system/benchmarks/libMicro/ |
H A D | exec_bin.c | 43 int left; local 49 left = atoi(argv[1]); 51 left--; 53 if (left <= 0) { 57 (void) sprintf(buffer, "%d", left);
|
/haiku-fatelf/src/add-ons/print/drivers/gutenprint/ |
H A D | Rectangle.h | 21 left(0), 32 left(static_cast<T>(rect.left)), 40 Rectangle(T left, T top, T right, T bottom) argument 42 left(left), 51 left = static_cast<T>(rect.left); 60 return right - left; 69 T left; member in class:Rectangle [all...] |
/haiku-fatelf/src/system/kernel/util/ |
H A D | AVLTreeBase.cpp | 68 while (node->left) 69 node = node->left; 93 if (node->left) { 94 // We have a left subtree, so go to the right-most node. 95 node = node->left; 99 // No left subtree: Backtrack our path and stop, where we 105 } while (node && previous == node->left); 117 // The next node cannot be in the left subtree. 119 // We have a right subtree, so go to the left-most node. 121 while (node->left) 268 AVLTreeNode* left = node->left; local 330 AVLTreeNode** left = &(*node)->left; local 378 bool left; member in struct:node_info 470 AVLTreeNode** left = &(*node)->left; local 508 AVLTreeNode* left = (*node)->left; local [all...] |
/haiku-fatelf/src/libs/alm/ |
H A D | Column.cpp | 21 * The left boundary of the column. 53 Column::Column(LinearSpec* ls, XTab* left, XTab* right) argument 55 fLeft(left),
|
H A D | ALMLayoutBuilder.cpp | 61 BALMLayoutBuilder::Add(BView* view, XTab* left, YTab* top, argument 64 Area* a = (fLayout->AddView(view, left, top, right, bottom)); 79 BALMLayoutBuilder::Add(BLayoutItem* item, XTab* left, YTab* top, argument 82 _SetCurrentArea(fLayout->AddItem(item, left, top, right, bottom)); 113 BALMLayoutBuilder::SetInsets(float left, float top, float right, argument 116 fLayout->SetInsets(left, top, right, bottom); 151 BReference<XTab> left = _left; local 153 left = fLayout->AddXTab(); 160 return Add(view, left, top, right, bottom); 169 XTab* left local 183 AddAbove(BView* view, YTab* _top, XTab* left, XTab* right) argument 201 AddBelow(BView* view, YTab* _bottom, XTab* left, XTab* right) argument 223 BReference<XTab> left = _left; local 241 XTab* left = currentArea->Right(); local 255 AddAbove(BLayoutItem* item, YTab* _top, XTab* left, XTab* right) argument 273 AddBelow(BLayoutItem* item, YTab* _bottom, XTab* left, XTab* right) argument [all...] |
H A D | ALMGroup.cpp | 67 ALMGroup::BuildLayout(BALMLayout* layout, XTab* left, YTab* top, XTab* right, argument 70 if (left == NULL) 71 left = layout->Left(); 79 _Build(layout, left, top, right, bottom); 99 ALMGroup::_Build(BALMLayout* layout, BReference<XTab> left, argument 103 layout->AddItem(LayoutItem(), left, top, right, bottom); local 105 layout->AddView(View(), left, top, right, bottom); local 115 current._Build(layout, left, top, currentRight, bottom); 116 left = currentRight; 123 current._Build(layout, left, to [all...] |
/haiku-fatelf/src/apps/processcontroller/ |
H A D | NoiseBarMenuItem.cpp | 55 frame.left = frame.right - kBarWidth; 74 float grenze1 = frame.left+(frame.right-frame.left)*fBusyWaiting; 75 float grenze2 = frame.left+(frame.right-frame.left)*(fBusyWaiting+fLost); 82 r.left = fGrenze1; 83 if (r.left < r.right) { 91 r.left = grenze1; 94 if (fGrenze2 > r.left && r.left > [all...] |
H A D | KernelMemoryBarMenuItem.cpp | 90 double grenze1 = cadre.left + (cadre.right - cadre.left) 92 double grenze2 = cadre.left + (cadre.right - cadre.left) 100 r.left = fGrenze1; 101 if (r.left < r.right) { 109 r.left = grenze1; 112 if (fGrenze2 > r.left && r.left >= fGrenze1) 113 r.left [all...] |
H A D | ThreadBarMenuItem.cpp | 60 frame.left = frame.right - kBarWidth; 79 float grenze1 = frame.left + (frame.right - frame.left) * fKernel; 80 float grenze2 = frame.left + (frame.right - frame.left) * (fKernel + fUser); 88 r.left = fGrenze1; 90 if (r.left < r.right) { 98 r.left = grenze1; 101 if (fGrenze2 > r.left && r.left > [all...] |
/haiku-fatelf/src/kits/support/ |
H A D | Url.cpp | 112 BString left; local 122 CopyInto(left, v + 1, Length() - v); 125 if (left.FindFirst("//") == 0) 126 left.RemoveFirst("//"); 127 fFull = left; 133 v = left.FindFirst("/"); 135 fPath = left; 140 fPath = left; 145 left.MoveInto(fPath, v+1, left [all...] |
/haiku-fatelf/src/system/libroot/posix/glibc/misc/ |
H A D | tsearch.c | 84 In this case, A has been rotated left. This preserves the ordering of the 96 struct node_t *left; member in struct:node_t 121 check_tree_recurse (p->left, d_sofar + (p->left && !p->left->red), d_total); 123 if (p->left) 124 assert (!(p->left->red && p->red)); 137 for(p = root->left; p; p = p->left) 162 lp = &(*rootp)->left; [all...] |
/haiku-fatelf/headers/libs/agg/ |
H A D | agg_trans_perspective.h | 66 double left[8][8]; local 75 left[ix][0] = 1.0; 76 left[ix][1] = src[ix]; 77 left[ix][2] = src[iy]; 78 left[ix][3] = 0.0; 79 left[ix][4] = 0.0; 80 left[ix][5] = 0.0; 81 left[ix][6] = -src[ix] * dst[ix]; 82 left[ix][7] = -src[iy] * dst[ix]; 85 left[i [all...] |
/haiku-fatelf/headers/private/interface/ |
H A D | clipping.h | 47 rect.left = min_c(r1.left, r2.left); 64 rect.left = max_c(r1.left, r2.left); 77 rect.left += x; 88 return BRect((float)rect.left, (float)rect.top, 101 // clipRect.left = (int32)floorf(rect.left); [all...] |
/haiku-fatelf/headers/libs/print/libprint/ |
H A D | ValidRect.h | 14 int left; member in struct:RECT
|
/haiku-fatelf/src/libs/bsd/ |
H A D | fgetln.c | 24 size_t length, left; local 36 left = sBufferSize; 41 line = fgets(line, left, stream); 63 left += 1;
|
/haiku-fatelf/src/bin/gdb/libiberty/ |
H A D | splay-tree.c | 65 splay_tree_delete_helper (sp, node->left); 102 /* The target is to the left. */ 103 next = &n->left; 127 if (n == (*parent)->left) 134 *node = n->left; 135 n->left = *parent; 141 /* Next handle the cases where both N and *PARENT are left children, 143 if (n == (*parent)->left && *parent == (*grandparent)->left) 147 (*grandparent)->left 371 splay_tree_node left, right; local [all...] |
/haiku-fatelf/src/apps/icon-o-matic/generic/gui/popup_control/ |
H A D | SliderView.cpp | 42 fButtonRect.right = fButtonRect.left + buttonWidth; 92 AddLine(BPoint(r.left, r.bottom), 93 BPoint(r.left, r.top), lightShadow); 94 AddLine(BPoint(r.left + 1.0, r.top), 99 BPoint(r.left + 1.0, r.bottom), darkShadow); 102 AddLine(BPoint(r.left, r.bottom), 103 BPoint(r.left, r.top), light); 104 AddLine(BPoint(r.left + 1.0, r.top), 109 BPoint(r.left + 1.0, r.bottom), shadow); 112 AddLine(BPoint(r.left, [all...] |
/haiku-fatelf/src/servers/app/ |
H A D | IntRect.cpp | 18 left = p.x; 34 left = p.x; 50 left += point.x; 60 left += dx; 104 left += point.x; 114 left += dx; 158 right = (right - left) + point.x; 159 left = point.x; 168 right = (right - left) + x; 169 left [all...] |
H A D | IntRect.h | 20 int32 left; member in class:IntRect 80 { return BRect(left, top, 99 return *(const IntPoint*)&left; 113 return IntPoint(left, bottom); 127 top = left = 0; 135 left = l; 145 left = r.left; 155 left = (int32)r.left; [all...] |
/haiku-fatelf/src/kits/tracker/ |
H A D | MiniMenuField.cpp | 133 AddLine(BPoint(rect.left + 3, rect.top + 1), 134 BPoint(rect.left + 3, rect.top + 7), outlineColor); 135 AddLine(BPoint(rect.left + 3, rect.top + 1), 136 BPoint(rect.left + 6, rect.top + 4), outlineColor); 137 AddLine(BPoint(rect.left + 6, rect.top + 4), 138 BPoint(rect.left + 3, rect.top + 7), outlineColor); 140 AddLine(BPoint(rect.left + 4, rect.top + 3), 141 BPoint(rect.left + 4, rect.top + 5), middleColor); 142 AddLine(BPoint(rect.left + 5, rect.top + 4), 143 BPoint(rect.left [all...] |
/haiku-fatelf/src/kits/interface/ |
H A D | RegionSupport.cpp | 57 * given upper-left y coordinate (top) will have the same lower-right y 61 * several shorter rectangles to account for shorter rectangles to its left 99 ((r1)->right > (r2)->left && \ 100 (r1)->left < (r2)->right && \ 108 if ((r)->left < (idRect)->fBounds.left)\ 109 (idRect)->fBounds.left = (r)->left;\ 140 ((R-1)->left <= (Rx1)) &&\ 147 (r)->left 412 register int left; local [all...] |
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/ |
H A D | AVLTree.h | 81 left(NULL), 89 AVLTreeStandardNode<Value> *left; member in struct:AVLTreeStandardNode 143 // Node *left; 295 while (fCurrent->left) 296 fCurrent = fCurrent->left; 306 if (node->left) { 307 // We have a left subtree, so go to the right-most node. 308 node = node->left; 312 // No left subtree: Backtrack our path and stop, where we 318 } while (node && previous == node->left); 582 Node *left = node->left; local 650 Node **left = &(*node)->left; local 701 bool left; member in struct:node_info 795 Node **left = &(*node)->left; local 832 Node *left = (*node)->left; local 856 bool left; member in struct:node_info [all...] |
/haiku-fatelf/src/add-ons/print/drivers/pcl6/ |
H A D | Rasterizer.cpp | 28 fBounds.left = (int)bounds.left; 43 fWidth = fBounds.right - fBounds.left + 1; 48 // offset to top, left point of rect 49 fBits += fBounds.top * fBPR + fBounds.left * 4; 52 fX = fBounds.left;
|
/haiku-fatelf/headers/os/interface/ |
H A D | Rect.h | 17 float left; member in class:BRect 24 BRect(float left, float top, float right, 31 void Set(float left, float top, float right, 94 return *(const BPoint*)&left; 108 return BPoint(left, bottom); 122 left(0), 133 left(l), 144 left(r.left), 155 left(leftTo [all...] |
/haiku-fatelf/src/system/boot/platform/generic/ |
H A D | video_blit.cpp | 30 uint16 height, uint16 imageWidth, uint16 left, uint16 top) 33 + gKernelArgs.frame_buffer.bytes_per_row * top + 4 * left); 53 uint16 height, uint16 imageWidth, uint16 left, uint16 top) 56 + gKernelArgs.frame_buffer.bytes_per_row * top + 3 * left; 77 uint16 height, uint16 imageWidth, uint16 left, uint16 top) 80 + gKernelArgs.frame_buffer.bytes_per_row * top + 2 * left); 102 uint16 height, uint16 imageWidth, uint16 left, uint16 top) 105 + gKernelArgs.frame_buffer.bytes_per_row * top + 2 * left); 127 uint16 height, uint16 imageWidth, uint16 left, uint16 top) 133 + left; 29 blit32(addr_t frameBuffer, const uint8 *data, uint16 width, uint16 height, uint16 imageWidth, uint16 left, uint16 top) argument 52 blit24(addr_t frameBuffer, const uint8 *data, uint16 width, uint16 height, uint16 imageWidth, uint16 left, uint16 top) argument 76 blit16(addr_t frameBuffer, const uint8 *data, uint16 width, uint16 height, uint16 imageWidth, uint16 left, uint16 top) argument 101 blit15(addr_t frameBuffer, const uint8 *data, uint16 width, uint16 height, uint16 imageWidth, uint16 left, uint16 top) argument 126 blit8(addr_t frameBuffer, const uint8 *data, uint16 width, uint16 height, uint16 imageWidth, uint16 left, uint16 top) argument 143 blit4(addr_t frameBuffer, const uint8 *data, uint16 width, uint16 height, uint16 imageWidth, uint16 left, uint16 top) argument 155 video_blit_image(addr_t frameBuffer, const uint8 *data, uint16 width, uint16 height, uint16 imageWidth, uint16 left, uint16 top) argument [all...] |