index 125 lib/dynarray.h DYNARRAY_PREFIX##at (struct DYNARRAY_STRUCT *list, size_t index); index 87 lib/fcntl.c unsigned int index; index 133 lib/fcntl.c index = (unsigned int) duplicated_fd / CHAR_BIT; index 134 lib/fcntl.c if (fds_to_close_bound <= index) index 136 lib/fcntl.c if (sizeof fds_to_close <= index) index 140 lib/fcntl.c index + 1 - fds_to_close_bound); index 141 lib/fcntl.c fds_to_close_bound = index + 1; index 143 lib/fcntl.c fds_to_close[index] |= 1 << ((unsigned int) duplicated_fd % CHAR_BIT); index 250 lib/malloc/dynarray-skeleton.c DYNARRAY_NAME (at) (struct DYNARRAY_STRUCT *list, size_t index) index 252 lib/malloc/dynarray-skeleton.c if (__glibc_unlikely (index >= DYNARRAY_NAME (size) (list))) index 253 lib/malloc/dynarray-skeleton.c __libc_dynarray_at_failure (DYNARRAY_NAME (size) (list), index); index 254 lib/malloc/dynarray-skeleton.c return list->u.dynarray_header.array + index; index 167 lib/malloc/dynarray.h _Noreturn void __libc_dynarray_at_failure (size_t size, size_t index); index 28 lib/malloc/dynarray_at_failure.c __libc_dynarray_at_failure (size_t size, size_t index) index 34 lib/malloc/dynarray_at_failure.c index, size); index 3031 src/alloc.c size_t index, restbytes; index 3038 src/alloc.c index = VINDEX (nbytes); index 3039 src/alloc.c if (vector_free_lists[index]) index 3041 src/alloc.c vector = vector_free_lists[index]; index 3042 src/alloc.c vector_free_lists[index] = next_vector (vector); index 3049 src/alloc.c for (index = VINDEX (nbytes + VBLOCK_BYTES_MIN); index 3050 src/alloc.c index < VECTOR_MAX_FREE_LIST_INDEX; index++) index 3051 src/alloc.c if (vector_free_lists[index]) index 3054 src/alloc.c vector = vector_free_lists[index]; index 3055 src/alloc.c vector_free_lists[index] = next_vector (vector); index 3059 src/alloc.c restbytes = index * roundup_size + VBLOCK_BYTES_MIN - nbytes; index 5597 src/alloc.c pure->index = purecopy (table->index); index 149 src/comp.c gcc_jit_rvalue *index)); index 173 src/comp.c (gcc_jit_function *func, int index)); index 862 src/emacs-module.c module_vec_set (emacs_env *env, emacs_value vector, ptrdiff_t index, index 867 src/emacs-module.c check_vec_index (lisp, index); index 868 src/emacs-module.c ASET (lisp, index, value_to_lisp (value)); index 872 src/emacs-module.c module_vec_get (emacs_env *env, emacs_value vector, ptrdiff_t index) index 876 src/emacs-module.c check_vec_index (lisp, index); index 877 src/emacs-module.c return lisp_to_value (env, AREF (lisp, index)); index 4239 src/fns.c gc_aset (h->index, idx, make_fixnum (val)); index 4351 src/fns.c return XFIXNUM (AREF (h->index, idx)); index 4463 src/fns.c index, PVEC_HASH_TABLE); index 4545 src/fns.c h->index = make_vector (hash_index_size (h, size), make_fixnum (-1)); index 4578 src/fns.c h2->index = Fcopy_sequence (h1->index); index 4633 src/fns.c h->index = make_vector (index_size, make_fixnum (-1)); index 4644 src/fns.c ptrdiff_t start_of_bucket = hash_code % ASIZE (h->index); index 4673 src/fns.c ptrdiff_t start_of_bucket = XUFIXNUM (hash_code) % ASIZE (h->index); index 4699 src/fns.c start_of_bucket = XUFIXNUM (hash_code) % ASIZE (h->index); index 4754 src/fns.c start_of_bucket = XUFIXNUM (hash) % ASIZE (h->index); index 4767 src/fns.c ptrdiff_t start_of_bucket = XUFIXNUM (hash_code) % ASIZE (h->index); index 4818 src/fns.c for (ptrdiff_t i = 0; i < ASIZE (h->index); i++) index 4819 src/fns.c ASET (h->index, i, make_fixnum (-1)); index 4840 src/fns.c ptrdiff_t n = gc_asize (h->index); index 4859 src/font.c (Lisp_Object otf_features, Lisp_Object gstring_in, Lisp_Object from, Lisp_Object to, Lisp_Object gstring_out, Lisp_Object index) index 4883 src/font.c CHECK_FIXNAT (index); index 4887 src/font.c if (XFIXNUM (index) >= ASIZE (gstring_out)) index 4888 src/font.c args_out_of_range (index, make_fixnum (ASIZE (gstring_out))); index 4891 src/font.c gstring_out, XFIXNUM (index), 0); index 687 src/font.h int (*anchor_point) (struct font *font, unsigned code, int index, index 96 src/ftcrfont.c cairo_glyph_t cr_glyph = {.index = glyph}; index 249 src/ftcrfont.c stack_glyph.index = 0; index 253 src/ftcrfont.c stack_glyph.index = 0; index 255 src/ftcrfont.c int this_width = ftcrfont_glyph_extents (font, stack_glyph.index, NULL); index 395 src/ftcrfont.c else if (stack_glyph.index) index 396 src/ftcrfont.c code = stack_glyph.index; index 601 src/ftcrfont.c glyphs[i].index = s->char2b[from + i]; index 605 src/ftcrfont.c glyphs[i].index, index 1385 src/ftfont.c ftfont_info->index = XFIXNUM (idx); index 1500 src/ftfont.c val = Fcons (font->props[FONT_FILE_INDEX], make_fixnum (ftfont_info->index)); index 2111 src/ftfont.c *g = in_glyphs[otfg->f.index.from]; index 2121 src/ftfont.c if (otfg->f.index.from < otfg->f.index.to) index 2124 src/ftfont.c for (j = otfg->f.index.from + 1; j <= otfg->f.index.to; j++) index 2145 src/ftfont.c && otfg->f.index.from == otfg[-1].f.index.from); index 2149 src/ftfont.c *g = in_glyphs[otfg->f.index.to]; index 2201 src/ftfont.c for (j = otfg->f.index.from; j <= otfg->f.index.to; j++) index 2402 src/ftfont.c for (j = otfg->f.index.from; j <= otfg->f.index.to; j++) index 2516 src/ftfont.c *g = in_glyphs[otfg->f.index.from]; index 2526 src/ftfont.c if (otfg->f.index.from < otfg->f.index.to) index 2529 src/ftfont.c for (j = from + otfg->f.index.from + 1; index 2530 src/ftfont.c j <= from + otfg->f.index.to; j++) index 2541 src/ftfont.c && otfg->f.index.from == otfg[-1].f.index.from); index 2545 src/ftfont.c *g = in_glyphs[otfg->f.index.to]; index 2749 src/ftfont.c otf_gstring.glyphs[i].f.index.from = LGLYPH_FROM (g); index 2750 src/ftfont.c otf_gstring.glyphs[i].f.index.to = LGLYPH_TO (g); index 2756 src/ftfont.c Lisp_Object g0 = LGSTRING_GLYPH (lgstring, otfg->f.index.from); index 2757 src/ftfont.c Lisp_Object g1 = LGSTRING_GLYPH (lgstring, otfg->f.index.to); index 64 src/ftfont.h int index; index 248 src/haiku_select.cc be_enum_message (void *message, int32 *tc, int32 index, index 256 src/haiku_select.cc rc = msg->GetInfo (B_ANY_TYPE, index, &name, &type, count); index 268 src/haiku_select.cc int32 index, char **path_buffer) index 277 src/haiku_select.cc rc = msg->FindRef (name, index, &ref); index 298 src/haiku_select.cc int32 index, float *x, float *y) index 305 src/haiku_select.cc rc = msg->FindPoint (name, index, &point); index 318 src/haiku_select.cc int32 type_code, int32 index, index 325 src/haiku_select.cc index, buf_return, size_return) != B_OK; index 346 src/haiku_select.cc int32 index) index 354 src/haiku_select.cc if (msg->FindMessage (name, index, out) != B_OK) index 3047 src/image.c int index, width, height, frames; index 3066 src/image.c cache->index = -1; index 7382 src/image.c ptrdiff_t index; /* Where are we? */ index 7395 src/image.c if (length > tbr->len - tbr->index) index 7398 src/image.c memcpy (data, tbr->bytes + tbr->index, length); index 7399 src/image.c tbr->index = tbr->index + length; index 7494 src/image.c tbr.index = 0; index 8491 src/image.c ptrdiff_t index; index 8500 src/image.c size = min (size, src->len - src->index); index 8501 src/image.c memcpy (buf, src->bytes + src->index, size); index 8502 src/image.c src->index += size; index 8529 src/image.c idx = src->index + off; index 8539 src/image.c src->index = idx; index 8540 src/image.c return src->index; index 8672 src/image.c memsrc.index = 0; index 8976 src/image.c ptrdiff_t index; index 8990 src/image.c if (len > src->len - src->index) index 8993 src/image.c memcpy (buf, src->bytes + src->index, len); index 8994 src/image.c src->index += len; index 9060 src/image.c if (cache->index != idx - 1) index 9061 src/image.c cache->index = -1; index 9121 src/image.c memsrc.index = 0; index 9299 src/image.c start_frame = cache->index + 1; index 9302 src/image.c cache->index = idx; index 9757 src/image.c if (cache->handle && cache->index == idx - 1) index 9761 src/image.c cache->index++; index 9806 src/image.c cache->index = idx; index 10110 src/image.c int index; index 10125 src/image.c cache->index = 0; index 10192 src/image.c if (ino == 0 || cache->wand == NULL || cache->index > ino) index 10203 src/image.c for (i = max (1, cache->index + 1); i <= ino; i++) index 10289 src/image.c cache->index = ino; index 63 src/json.c DEF_DLL_FN (json_t *, json_array_get, (const json_t *array, size_t index)); index 1176 src/lisp.h builtin_lisp_symbol (int index) index 1178 src/lisp.h return make_lisp_symbol (&lispsym[index]); index 1688 src/lisp.h SREF (Lisp_Object string, ptrdiff_t index) index 1690 src/lisp.h return SDATA (string)[index]; index 1693 src/lisp.h SSET (Lisp_Object string, ptrdiff_t index, unsigned char new) index 1695 src/lisp.h SDATA (string)[index] = new; index 2432 src/lisp.h Lisp_Object index; index 4646 src/lread.c intern_sym (Lisp_Object sym, Lisp_Object obarray, Lisp_Object index) index 4664 src/lread.c ptr = aref_addr (obarray, XFIXNUM (index)); index 4673 src/lread.c intern_driver (Lisp_Object string, Lisp_Object obarray, Lisp_Object index) index 4676 src/lread.c return intern_sym (Fmake_symbol (string), obarray, index); index 123 src/module-env-25.h emacs_value (*vec_get) (emacs_env *env, emacs_value vector, ptrdiff_t index) index 126 src/module-env-25.h void (*vec_set) (emacs_env *env, emacs_value vector, ptrdiff_t index, index 692 src/nsterm.h - (BOOL)setFrame: (unsigned int) index; index 2696 src/pdumper.c h->index = make_fixnum (ASIZE (h->index)); index 2706 src/pdumper.c h->index = Fmake_vector (h->index, make_fixnum (-1)); index 157 src/profiler.c ptrdiff_t index = log->next_free; index 160 src/profiler.c Lisp_Object backtrace = HASH_VALUE (log, index); index 161 src/profiler.c eassert (BASE_EQ (Qunbound, HASH_KEY (log, index))); index 183 src/profiler.c eassert (index == j); index 2831 src/treesit.c = ts_query_capture_name_for_id (treesit_query, capture.index, index 177 src/w32fns.c (IN HIMC context, IN DWORD index, OUT LPVOID buffer, IN DWORD bufLen); index 849 src/w32fns.c int index = 0; index 858 src/w32fns.c while (RegEnumValueA (colors_key, index, name_buffer, &name_size, index 870 src/w32fns.c index++; index 439 src/w32image.c int index = FIXNATP (lisp_index) ? XFIXNAT (lisp_index) : 0; index 442 src/w32image.c status = w32_select_active_frame (pBitmap, index, &nframes, &delay); index 1181 src/w32uniscribe.c unsigned short index; index 1182 src/w32uniscribe.c OTF_INT16_VAL (tbl, langsys_table + 6 + k * 2, &index); index 1183 src/w32uniscribe.c OTF_TAG_VAL (tbl, feature_table + 2 + index * 6, feature); index 1208 src/w32uniscribe.c unsigned short index; index 1209 src/w32uniscribe.c OTF_INT16_VAL (tbl, langsys_table + 6 + k * 2, &index); index 1210 src/w32uniscribe.c OTF_TAG_VAL (tbl, feature_table + 2 + index * 6, feature); index 6022 src/xfaces.c enum font_property_index index, Lisp_Object symbol) index 6031 src/xfaces.c ASET (font_object, index, Qnil); index 5353 src/xterm.c int index, XIScrollClassInfo *info) index 5357 src/xterm.c valuator = &device->valuators[index]; index 1074 test/manual/etags/c-src/emacs/src/lisp.h builtin_lisp_symbol (int index) index 1076 test/manual/etags/c-src/emacs/src/lisp.h return make_lisp_symbol (lispsym + index); index 1297 test/manual/etags/c-src/emacs/src/lisp.h SREF (Lisp_Object string, ptrdiff_t index) index 1299 test/manual/etags/c-src/emacs/src/lisp.h return SDATA (string)[index]; index 1302 test/manual/etags/c-src/emacs/src/lisp.h SSET (Lisp_Object string, ptrdiff_t index, unsigned char new) index 1304 test/manual/etags/c-src/emacs/src/lisp.h SDATA (string)[index] = new; index 1856 test/manual/etags/c-src/emacs/src/lisp.h Lisp_Object index; index 1928 test/manual/etags/c-src/emacs/src/lisp.h return AREF (h->index, idx); index 61 test/manual/etags/c-src/tab.c int index; index 65 test/manual/etags/c-src/tab.c for (index = 0; tab[index]; index++) index 66 test/manual/etags/c-src/tab.c free(tab[index]); index 74 test/manual/etags/c-src/tab.c int index; index 82 test/manual/etags/c-src/tab.c for (index = 0; (tab[index] = get_word(&str, delim)); index++) index 705 test/manual/noverlay/itree-tests.c shuffle (int *index, int n) index 710 test/manual/noverlay/itree-tests.c int h = index[j]; index 711 test/manual/noverlay/itree-tests.c index[j] = index[i]; index 712 test/manual/noverlay/itree-tests.c index[i] = h; index 719 test/manual/noverlay/itree-tests.c int index[N]; index 721 test/manual/noverlay/itree-tests.c index[i] = i; index 723 test/manual/noverlay/itree-tests.c shuffle (index, N); index 730 test/manual/noverlay/itree-tests.c itree_insert (&tree, &nodes[index[i]], pos, pos + 1); index 733 test/manual/noverlay/itree-tests.c shuffle (index, N); index 736 test/manual/noverlay/itree-tests.c ck_assert (interval_tree_contains (&tree, &nodes[index[i]])); index 737 test/manual/noverlay/itree-tests.c itree_remove (&tree, &nodes[index[i]]); index 824 test/manual/noverlay/itree-tests.c int *index = calloc (n, sizeof (int)); index 826 test/manual/noverlay/itree-tests.c index[i] = i; index 830 test/manual/noverlay/itree-tests.c shuffle (index, n); index 836 test/manual/noverlay/itree-tests.c struct itree_node *node = &nodes[index[i]]; index 839 test/manual/noverlay/itree-tests.c free (index);