Home
last modified time | relevance | path

Searched refs:elements (Results 1 – 25 of 128) sorted by relevance

123456

/haiku/src/libs/libsolv/solv/
H A Dqueue.c25 q->alloc = q->elements = 0; in queue_init()
32 if (!s->elements) in queue_init_clone()
34 t->alloc = t->elements = 0; in queue_init_clone()
38 t->alloc = t->elements = solv_malloc2(s->count + EXTRA_SPACE, sizeof(Id)); in queue_init_clone()
40 memcpy(t->alloc, s->elements, s->count * sizeof(Id)); in queue_init_clone()
49 q->elements = buf; in queue_init_buffer()
59 q->alloc = q->elements = 0; in queue_free()
70 memcpy(q->alloc, q->elements, q->count * sizeof(Id)); in queue_alloc_one()
71 q->elements = q->alloc; in queue_alloc_one()
74 else if (q->alloc != q->elements) in queue_alloc_one()
[all …]
H A Dselection.c47 Id select = selection->elements[i] & SOLVER_SELECTMASK; in selection_prune()
54 Repo *repo = pool_id2repo(pool, selection->elements[i + 1]); in selection_prune()
61 FOR_JOB_SELECT(p, pp, select, selection->elements[i + 1]) in selection_prune()
66 selection->elements[j] = selection->elements[i]; in selection_prune()
67 selection->elements[j + 1] = selection->elements[i + 1]; in selection_prune()
88 Id select = selection->elements[i] & SOLVER_SELECTMASK; in selection_solvables()
97 Repo *repo = pool_id2repo(pool, selection->elements[i + 1]); in selection_solvables()
104 FOR_JOB_SELECT(p, pp, select, selection->elements[i + 1]) in selection_solvables()
111 solv_sort(pkgs->elements, pkgs->count, sizeof(Id), selection_solvables_sortcmp, NULL); in selection_solvables()
112 lastid = pkgs->elements[0]; in selection_solvables()
[all …]
H A Dproblems.c78 jp = solv->ruletojob.elements; in solver_disableproblem()
135 jp = solv->ruletojob.elements; in solver_enableproblem()
197 if (!essentialok && sug < 0 && (solv->job.elements[-sug - 1] & SOLVER_ESSENTIAL) != 0) in refine_suggestion()
243 v = solv->problems.elements[i]; in refine_suggestion()
263 if (!essentialok && (solv->job.elements[-v - 1] & SOLVER_ESSENTIAL) != 0) in refine_suggestion()
285 v = disabled.elements[i]; in refine_suggestion()
287 disabled.elements[j++] = v; in refine_suggestion()
295 v = disabled.elements[disabledcnt]; in refine_suggestion()
318 solver_printproblem(solv, disabled.elements[i]); in refine_suggestion()
322 v = disabled.elements[i]; in refine_suggestion()
[all …]
H A Dqueue.h23 Id *elements; /* pointer to elements */ member
39 q->left += (q->elements - q->alloc) + q->count; in queue_empty()
40 q->elements = q->alloc; in queue_empty()
53 return *q->elements++; in queue_shift()
62 return q->elements[--q->count]; in queue_pop()
68 if (!q->alloc || q->alloc == q->elements) in queue_unshift()
70 *--q->elements = id; in queue_unshift()
79 q->elements[q->count++] = id; in queue_push()
88 if (q->elements[--i] == id) in queue_pushunique()
117 extern void queue_insertn(Queue *q, int pos, int n, Id *elements);
H A Dpolicy.c89 s = pool->solvables + plist->elements[i]; in prune_to_highest_prio()
102 s = pool->solvables + plist->elements[i]; in prune_to_highest_prio()
104 plist->elements[j++] = plist->elements[i]; in prune_to_highest_prio()
117 solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool); in prune_to_highest_prio_per_name()
118 queue_push(&pq, plist->elements[0]); in prune_to_highest_prio_per_name()
119 name = pool->solvables[pq.elements[0]].name; in prune_to_highest_prio_per_name()
122 if (pool->solvables[plist->elements[i]].name != name) in prune_to_highest_prio_per_name()
127 plist->elements[j++] = pq.elements[k]; in prune_to_highest_prio_per_name()
129 queue_push(&pq, plist->elements[i]); in prune_to_highest_prio_per_name()
130 name = pool->solvables[pq.elements[0]].name; in prune_to_highest_prio_per_name()
[all …]
H A Drules.c842 if (!MAPTST(m, qs.elements[i])) in solver_addrpmrulesforupdaters()
843 solver_addrpmrulesforsolvable(solv, pool->solvables + qs.elements[i], m); in solver_addrpmrulesforupdaters()
879 Solvable *ns = pool->solvables + qs->elements[i]; in finddistupgradepackages()
904 p = dupqs.elements[i]; in addduppackages()
946 if (MAPTST(&solv->multiversion, qs.elements[i])) in solver_addupdaterule()
949 Solvable *ps = pool->solvables + qs.elements[i]; in solver_addupdaterule()
953 qs.elements[j++] = qs.elements[i]; in solver_addupdaterule()
1108 if (allowedarchs.count == 1 && bests && allowedarchs.elements[0] == bests->arch) in solver_addinfarchrules()
1124 aa = allowedarchs.elements[j]; in solver_addinfarchrules()
1140 p = badq.elements[j]; in solver_addinfarchrules()
[all …]
H A Dtransaction.c86 if (ti->elements[i + 1] == p) in transaction_all_obs_pkgs()
87 queue_push2(pkgs, p, ti->elements[i]); in transaction_all_obs_pkgs()
90 solv_sort(pkgs->elements, pkgs->count / 2, 2 * sizeof(Id), obsq_sortcmp, pool); in transaction_all_obs_pkgs()
92 pkgs->elements[i / 2] = pkgs->elements[i + 1]; in transaction_all_obs_pkgs()
100 if (ti->elements[i] == p) in transaction_all_obs_pkgs()
101 queue_push(pkgs, ti->elements[i + 1]); in transaction_all_obs_pkgs()
125 if (ti->elements[i] == p) in transaction_obs_pkg()
126 return ti->elements[i + 1]; in transaction_obs_pkg()
314 q = oq.elements[i]; in transaction_type()
326 if (rq.elements[j] == p) in transaction_type()
[all …]
H A Dsolver.c144 if (q->elements[i] == dep || q->elements[i] == rd->name) in solver_check_installsuppdepq_dep()
177 extraflags &= solv->job.elements[-v - 1]; in autouninstall()
247 whyp = solv->learnt_pool.elements + solv->learnt_why.elements[i - solv->learntrules]; in enabledisablelearntrules()
308 v = solv->decisionq.elements[--solv->decisionq.count]; in makeruledecisions()
317 ri = solv->ruleassertions.elements[ii]; in makeruledecisions()
382 if (solv->decisionq.elements[i] == -v) in makeruledecisions()
402 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1); in makeruledecisions()
414 assert(solv->decisionq_why.elements[i] > 0); in makeruledecisions()
419 if (solv->decisionq_why.elements[i] < solv->rpmrules_end) in makeruledecisions()
425 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]); in makeruledecisions()
[all …]
H A Dsolverdebug.c61 n = solv->decisionq.elements[i]; in solver_create_decisions_obsoletesmap()
91 n = solv->decisionq.elements[i]; in solver_create_decisions_obsoletesmap()
240 jp = solv->ruletojob.elements; in solver_printproblem()
272 p = solv->decisionq.elements[i]; in solver_printdecisionq()
277 why = solv->decisionq_why.elements[i]; in solver_printdecisionq()
317 p = trans->steps.elements[i]; in solver_printdecisions()
368 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s", pool_solvid2str(pool, iq.elements[j])); in solver_printdecisions()
390 s = pool->solvables + recommendations.elements[i]; in solver_printdecisions()
391 if (solv->decisionmap[recommendations.elements[i]] > 0) in solver_printdecisions()
409 s = pool->solvables + suggestions.elements[i]; in solver_printdecisions()
[all …]
/haiku/src/kits/locale/
H A DDateTimeFormat.cpp54 BTimeFormatStyle timeStyle, int32 elements) { in SetDateTimeFormat() argument
61 if (elements & B_DATE_ELEMENT_YEAR) in SetDateTimeFormat()
63 if (elements & B_DATE_ELEMENT_MONTH) in SetDateTimeFormat()
65 if (elements & B_DATE_ELEMENT_WEEKDAY) in SetDateTimeFormat()
67 if (elements & B_DATE_ELEMENT_DAY) in SetDateTimeFormat()
69 if (elements & B_DATE_ELEMENT_AM_PM) in SetDateTimeFormat()
71 if (elements & B_DATE_ELEMENT_HOUR) { in SetDateTimeFormat()
77 if (elements & B_DATE_ELEMENT_MINUTE) in SetDateTimeFormat()
79 if (elements & B_DATE_ELEMENT_SECOND) in SetDateTimeFormat()
81 if (elements & B_DATE_ELEMENT_TIMEZONE) in SetDateTimeFormat()
/haiku/src/system/libroot/os/
H A Dparsedate.cpp548 preparseDate(const char* dateString, parsed_element* elements) in preparseDate() argument
556 memset(&elements[0], 0, sizeof(parsed_element)); in preparseDate()
570 elements[index].SetCharType(TYPE_COMMA); in preparseDate()
572 elements[index].SetCharType(TYPE_DOT); in preparseDate()
575 elements[index].SetCharType(TYPE_DASH); in preparseDate()
577 elements[index].SetCharType(TYPE_COLON); in preparseDate()
585 elements[index].flags = FLAG_HAS_DASH; in preparseDate()
592 elements[index].type = TYPE_UNKNOWN; in preparseDate()
593 elements[index].value_type = VALUE_NUMERICAL; in preparseDate()
594 elements[index].value = atoll(dateString); in preparseDate()
[all …]
/haiku/data/catalogs/tests/kits/opengl/glinfo/
H A Dja.catkeys11 Maximum recommended vertex elements Capabilities Maximum recommended vertex elements
23 Maximum recommended index elements Capabilities Maximum recommended index elements
H A Dfur.catkeys11 Maximum recommended vertex elements Capabilities Numar massim di elements vertex conseâts
23 Maximum recommended index elements Capabilities Numar massim di elements de tabele conseâts
H A Dca.catkeys11 Maximum recommended vertex elements Capabilities Màxim recomanat d'elements de vèrtex
23 Maximum recommended index elements Capabilities Màxim recomanat d'elements d’índex
H A Dth.catkeys11 Maximum recommended vertex elements Capabilities องค์ประกอบจุดสุดยอดสูงสุดที่แนะนำ
21 Maximum recommended index elements Capabilities องค์ประกอบดัชนีที่แนะนำสูงสุด
H A Dko.catkeys11 Maximum recommended vertex elements Capabilities 최대 권고 버텍스 요수 수
23 Maximum recommended index elements Capabilities 최대 권고 인덱스 요소 수
H A Dru.catkeys11 Maximum recommended vertex elements Capabilities Максимально рекомендуемые элементы вершины
23 Maximum recommended index elements Capabilities Максимально рекомендуемые индексные элементы
H A Del.catkeys11 Maximum recommended vertex elements Capabilities Μέγιστος προτεινόμενος αριθμός κορυφών
23 Maximum recommended index elements Capabilities Μέγιστος προτεινόμενος αριθμός δεικτών
H A Dzh_Hans.catkeys11 Maximum recommended vertex elements Capabilities 推荐的顶点元素最大数量
23 Maximum recommended index elements Capabilities 最大推荐索引项
H A Duk.catkeys11 Maximum recommended vertex elements Capabilities Максимум рекомендованих вершинних елементів
23 Maximum recommended index elements Capabilities Максимум рекомендованих індексних елементів
/haiku/src/libs/print/libprint/
H A DHalftone.cpp134 Halftone::InitElements(int x, int y, uchar* elements) in InitElements() argument
144 elements[i] = *pos; in InitElements()
204 uchar elements[16]; in DitherRGB32() local
205 InitElements(x, y, elements); in DitherRGB32()
218 uchar *e = elements; in DitherRGB32()
219 uchar *last_e = elements + 16; in DitherRGB32()
228 e = elements; in DitherRGB32()
249 e = elements; in DitherRGB32()
/haiku/headers/private/shared/
H A DArray.h272 Element* elements = (Element*)malloc(newCapacity * sizeof(Element)); in _Resize() local
273 if (elements == NULL) in _Resize()
277 memcpy(elements, fElements, index * sizeof(Element)); in _Resize()
281 memcpy(elements + index + delta, fElements + index, in _Resize()
285 memcpy(elements + index, fElements + index - delta, in _Resize()
291 fElements = elements; in _Resize()
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/
H A DBlockingQueue.h24 const Vector<Element*>** elements = NULL);
68 const Vector<Element*>** elements) in Close() argument
75 if (elements) in Close()
76 *elements = &fElements; in Close()
H A DRequestMemberArray.h105 Member* elements in _EnsureCapacity() local
107 if (!elements) in _EnsureCapacity()
110 fElements = elements; in _EnsureCapacity()
/haiku/src/apps/installer/
H A DBlockingQueue.h27 const vector<Element*>** elements = NULL);
71 const vector<Element*>** elements) in Close() argument
78 if (elements) in Close()
79 *elements = &fElements; in Close()

123456