| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.python/ |
| py-mi-var-info-path-expression.c | 35 struct cons *slots[2]; member in union:cons::__anon21064
47 c1.slots[0] = &c4;
48 c1.slots[1] = &c2;
51 c2.slots[0] = nil;
52 c2.slots[1] = &c3;
55 c3.slots[0] = nil;
56 c3.slots[1] = nil;
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.python/ |
| py-mi-var-info-path-expression.c | 35 struct cons *slots[2]; member in union:cons::__anon694
47 c1.slots[0] = &c4;
48 c1.slots[1] = &c2;
51 c2.slots[0] = nil;
52 c2.slots[1] = &c3;
55 c3.slots[0] = nil;
56 c3.slots[1] = nil;
|
| /src/external/bsd/wpa/dist/wpa_supplicant/wpa_gui-qt4/ |
| userdatarequest.h | 28 public slots:
31 protected slots:
|
| scanresults.h | 26 public slots:
33 protected slots:
|
| eventhistory.h | 46 public slots:
50 protected slots:
|
| addinterface.h | 27 public slots:
|
| networkconfig.h | 33 public slots:
42 protected slots:
|
| peers.h | 30 public slots:
55 protected slots:
|
| /src/external/gpl3/gcc/dist/gcc/objc/ |
| objc-map.h | 46 /* Total number of slots. This is the maximum number of elements
48 the number of slots in the C array. Important: this is
59 /* Number of slots that are not empty (ie, that are active). We
65 slots equals this number, we need to resize the array. This is
66 calculated once, when the slots are resized, and then kept cached
74 tree * GTY ((length ("%h.number_of_slots"))) slots;
77 to slots[i]. */
144 if (map->slots[i] == OBJC_MAP_PRIVATE_EMPTY_SLOT)
147 if (map->slots[i] == key)
154 if (map->slots[i] == OBJC_MAP_PRIVATE_EMPTY_SLOT
[all...] |
| objc-map.cc | 69 map->slots = ggc_cleared_vec_alloc<tree> (initial_capacity);
72 if (map->slots == NULL)
100 tree *old_slots = map->slots;
114 map->slots = ggc_cleared_vec_alloc<tree> (map->number_of_slots);
117 if (map->slots == NULL)
128 if (map->slots[k] == OBJC_MAP_PRIVATE_EMPTY_SLOT)
130 map->slots[k] = old_slots[i];
139 if (map->slots[k] == OBJC_MAP_PRIVATE_EMPTY_SLOT)
141 map->slots[k] = old_slots[i];
|
| /src/external/gpl3/gcc.old/dist/gcc/objc/ |
| objc-map.h | 46 /* Total number of slots. This is the maximum number of elements
48 the number of slots in the C array. Important: this is
59 /* Number of slots that are not empty (ie, that are active). We
65 slots equals this number, we need to resize the array. This is
66 calculated once, when the slots are resized, and then kept cached
74 tree * GTY ((length ("%h.number_of_slots"))) slots;
77 to slots[i]. */
144 if (map->slots[i] == OBJC_MAP_PRIVATE_EMPTY_SLOT)
147 if (map->slots[i] == key)
154 if (map->slots[i] == OBJC_MAP_PRIVATE_EMPTY_SLOT
[all...] |
| objc-map.cc | 69 map->slots = ggc_cleared_vec_alloc<tree> (initial_capacity);
72 if (map->slots == NULL)
100 tree *old_slots = map->slots;
114 map->slots = ggc_cleared_vec_alloc<tree> (map->number_of_slots);
117 if (map->slots == NULL)
128 if (map->slots[k] == OBJC_MAP_PRIVATE_EMPTY_SLOT)
130 map->slots[k] = old_slots[i];
139 if (map->slots[k] == OBJC_MAP_PRIVATE_EMPTY_SLOT)
141 map->slots[k] = old_slots[i];
|
| /src/crypto/external/apache2/openssl/dist/ssl/quic/ |
| quic_reactor_wait_ctx.c | 24 ossl_list_quic_reactor_wait_slot_init(&ctx->slots);
48 OSSL_LIST_FOREACH(slot, quic_reactor_wait_slot, &ctx->slots)
57 ossl_list_quic_reactor_wait_slot_insert_tail(&ctx->slots, slot);
69 OSSL_LIST_FOREACH(slot, quic_reactor_wait_slot, &ctx->slots)
81 OSSL_LIST_FOREACH_DELSAFE(slot, nslot, quic_reactor_wait_slot, &ctx->slots)
|
| /src/crypto/external/apache2/openssl/dist/include/internal/ |
| quic_reactor_wait_ctx.h | 90 slots; member in struct:quic_reactor_wait_ctx_st
|
| /src/external/bsd/libarchive/dist/libarchive/ |
| archive_read_set_format.c | 39 int r1, r2, slots, i; local
102 slots = sizeof(a->formats) / sizeof(a->formats[0]);
104 for (i = 0; i < slots; i++, a->format++) {
|
| /src/external/gpl3/gcc/dist/gcc/ |
| lra-spills.cc | 25 The pass creates necessary stack slots and assigns spilled pseudos
26 to the stack slots in following way:
29 for all stack slots S do
95 /* The stack slots for each spilled pseudo. Indexed by regnos. */
123 /* Array containing info about the stack slots. The array element is
125 static class slot *slots; variable in typeref:class:slot
126 /* The number of the stack slots currently existing. */
146 x = slots[slot_num].mem;
149 x = assign_stack_local (BLKmode, slots[slot_num].size,
150 slots[slot_num].align)
[all...] |
| /src/external/gpl2/lvm2/dist/libdm/datastruct/ |
| hash.c | 30 struct dm_hash_node **slots; member in struct:dm_hash_table
109 len = sizeof(*(hc->slots)) * new_size;
110 if (!(hc->slots = dm_malloc(len))) {
114 memset(hc->slots, 0, len);
118 dm_free(hc->slots);
129 for (c = t->slots[i]; c; c = n) {
138 dm_free(t->slots);
148 for (c = &t->slots[h]; *c; c = &((*c)->next)) {
228 for (c = t->slots[i]; c; c = n) {
237 memset(t->slots, 0, sizeof(struct dm_hash_node *) * t->num_slots)
[all...] |
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/ |
| signals.d | 4 * Signals and Slots are an implementation of the Observer Pattern.
6 * (called slots) are called.
8 * There have been several D implementations of Signals and Slots.
11 * longer necessary to instrument the slots.
14 * $(LUCKY A Deeper Look at Signals and Slots)$(BR)
23 * $(LINK2 http://www.digitalmars.com/d/archives/digitalmars/D/announce/signal_slots_library_4825.html, signal slots library)$(BR)
24 * $(LINK2 http://www.digitalmars.com/d/archives/digitalmars/D/Signals_and_Slots_in_D_42387.html, Signals and Slots in D)$(BR)
25 * $(LINK2 http://www.digitalmars.com/d/archives/digitalmars/D/Dynamic_binding_--_Qt_s_Signals_and_Slots_vs_Objective-C_42260.html, Dynamic binding -- Qt's Signals and Slots vs Objective-C)$(BR)
30 * $(LINK2 http://www.digitalmars.com/d/archives/digitalmars/D/13251.html, Signals and slots?)$(BR)
31 * $(LINK2 http://www.digitalmars.com/d/archives/digitalmars/D/10714.html, Signals and slots ready for evaluation)$(BR
[all...] |
| /src/external/gpl2/texinfo/dist/info/ |
| info.h | 60 /* Add POINTER to the list of pointers found in ARRAY. SLOTS is the number
61 of slots that have already been allocated. INDEX is the index into the
62 array where POINTER should be added. GROW is the number of slots to grow
65 #define add_pointer_to_array(pointer, idx, array, slots, grow, type) \
67 if (idx + 2 >= slots) \
68 array = (type *)(xrealloc (array, (slots += grow) * sizeof (type))); \
105 int nodes_slots; /* Number of slots allocated to NODES. */
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| lra-spills.cc | 25 The pass creates necessary stack slots and assigns spilled pseudos
26 to the stack slots in following way:
29 for all stack slots S do
95 /* The stack slots for each spilled pseudo. Indexed by regnos. */
123 /* Array containing info about the stack slots. The array element is
125 static class slot *slots; variable in typeref:class:slot
126 /* The number of the stack slots currently existing. */
146 x = slots[slot_num].mem;
149 x = assign_stack_local (BLKmode, slots[slot_num].size,
150 slots[slot_num].align)
[all...] |
| /src/crypto/external/cpl/trousers/dist/src/include/linux/ |
| tpm.h | 38 extern ssize_t tpm_cap_slot(int *slots);
|
| /src/external/gpl3/binutils/dist/gas/config/ |
| xtensa-istack.h | 100 TInsn slots[MAX_SLOTS]; member in struct:vliw_insn
|
| /src/external/gpl3/binutils/dist/gprofng/src/ |
| PathTree.cc | 72 slots = NULL;
163 int **tmp = slots[i].mvals;
168 delete[] slots;
169 slots = NULL;
240 DBG (assert (slots[slot_idx].vtype == vtype));
245 Slot *old_slots = slots;
246 slots = new Slot[nslots];
248 slots[i] = old_slots[i];
251 slots[slot_idx].id = id;
252 slots[slot_idx].vtype = vtype
[all...] |
| /src/external/gpl3/binutils.old/dist/gas/config/ |
| xtensa-istack.h | 100 TInsn slots[MAX_SLOTS]; member in struct:vliw_insn
|
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| PathTree.cc | 72 slots = NULL;
163 int **tmp = slots[i].mvals;
168 delete[] slots;
169 slots = NULL;
240 DBG (assert (slots[slot_idx].vtype == vtype));
245 Slot *old_slots = slots;
246 slots = new Slot[nslots];
248 slots[i] = old_slots[i];
251 slots[slot_idx].id = id;
252 slots[slot_idx].vtype = vtype
[all...] |
