Searched refs:slots (Results 1 - 25 of 142) sorted by relevance

123456

/netbsd-current/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.python/
H A Dpy-mi-var-info-path-expression.c35 struct cons *slots[2]; member in union:cons::__anon1553
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;
/netbsd-current/external/gpl3/gdb/dist/gdb/testsuite/gdb.python/
H A Dpy-mi-var-info-path-expression.c35 struct cons *slots[2]; member in union:cons::__anon1051
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;
/netbsd-current/external/bsd/wpa/dist/wpa_supplicant/wpa_gui-qt4/
H A Duserdatarequest.h28 public slots:
31 protected slots:
H A Dscanresults.h26 public slots:
33 protected slots:
H A Deventhistory.h46 public slots:
50 protected slots:
H A Daddinterface.h27 public slots:
H A Dnetworkconfig.h33 public slots:
42 protected slots:
/netbsd-current/external/gpl3/gcc.old/dist/gcc/objc/
H A Dobjc-map.h46 /* 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[
[all...]
H A Dobjc-map.c69 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];
/netbsd-current/external/gpl3/gcc/dist/gcc/objc/
H A Dobjc-map.h46 /* 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[
[all...]
H A Dobjc-map.cc69 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];
/netbsd-current/external/gpl3/gdb.old/dist/gas/testsuite/gas/mips/
H A Dmicromips-warn-branch-delay.s1 # Source file used to test microMIPS fixed-size branch delay slots.
H A Dmicromips-warn-branch-delay-1.s2 # branch delay slots.
/netbsd-current/external/bsd/libarchive/dist/libarchive/
H A Darchive_read_set_format.c39 int r1, r2, slots, i; local
102 slots = sizeof(a->formats) / sizeof(a->formats[0]);
104 for (i = 0; i < slots; i++, a->format++) {
/netbsd-current/external/gpl2/lvm2/dist/libdm/datastruct/
H A Dhash.c30 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,
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/
H A Dsignals.d6 * (called slots) are called.
11 * longer necessary to instrument the slots.
23 * $(LINK2 http://www.digitalmars.com/d/archives/digitalmars/D/announce/signal_slots_library_4825.html, signal slots library)$(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)
36 * $(LINK2 http://www.digitalmars.com/d/archives/16583.html, The importance of component programming (properties$(COMMA) signals and slots$(COMMA) etc))$(BR)
37 * $(LINK2 http://www.digitalmars.com/d/archives/16368.html, signals and slots)$(BR)
47 * or slots.
96 * used as slots.
101 * Call each of the connected slots, passin
[all...]
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/
H A Dsignals.d6 * (called slots) are called.
11 * longer necessary to instrument the slots.
23 * $(LINK2 http://www.digitalmars.com/d/archives/digitalmars/D/announce/signal_slots_library_4825.html, signal slots library)$(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)
36 * $(LINK2 http://www.digitalmars.com/d/archives/16583.html, The importance of component programming (properties$(COMMA) signals and slots$(COMMA) etc))$(BR)
37 * $(LINK2 http://www.digitalmars.com/d/archives/16368.html, signals and slots)$(BR)
47 * or slots.
96 * used as slots. This applies even if the nested function does not access
102 * Call each of the connected slots, passin
[all...]
/netbsd-current/external/gpl2/texinfo/dist/info/
H A Dinfo.h61 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. */
/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dlra-spills.c25 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
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_nu
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dlra-spills.cc25 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_nu
[all...]
/netbsd-current/crypto/external/cpl/trousers/dist/src/include/linux/
H A Dtpm.h38 extern ssize_t tpm_cap_slot(int *slots);
/netbsd-current/external/gpl3/binutils.old/dist/gas/config/
H A Dxtensa-istack.h100 TInsn slots[MAX_SLOTS]; member in struct:vliw_insn
/netbsd-current/external/gpl3/binutils/dist/gprofng/src/
H A DPathTree.cc72 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_id
[all...]
/netbsd-current/external/gpl3/binutils/dist/gas/config/
H A Dxtensa-istack.h100 TInsn slots[MAX_SLOTS]; member in struct:vliw_insn
/netbsd-current/external/gpl3/gdb.old/dist/gas/config/
H A Dxtensa-istack.h100 TInsn slots[MAX_SLOTS]; member in struct:vliw_insn

Completed in 424 milliseconds

123456