/barrelfish-master/usr/eclipseclp/icparc_solvers/ |
H A D | bitmap.h | 91 extern word create_bitmap(word min, word max, uword **bm_ptr); 93 extern word set_bitmap_lwb(uword *bitmap, word min, uword **new_bm_ptr); 95 extern word set_bitmap_upb(uword *bitmap, word max, uword **new_bm_ptr); 97 extern word remove_bitmap_element(uword *bitmap, word el, uword **new_bm_ptr); 99 extern word remove_bitmap_range(uword *bitmap, word lo0, word hi0, uword **new_bm_ptr); 101 extern word bitmap_intersect_into(uword *bitma [all...] |
H A D | bitmap.c | 114 #define BitsTo(n) ((uword) ALLBITS >> (BPW-1-(n))) 159 pstruct = (uword *) TG; \ 201 bit_count(uword bits) 229 lsb(uword bits) 272 msb(uword bits) 320 uword *bitmap; 335 create_bitmap(word min, word max, uword **bm_ptr) 337 uword *bitmap; 338 uword *bits_ptr; 412 result = set_bitmap_lwb(vbm.wptr, vmin.nint, (uword **) [all...] |
/barrelfish-master/usr/eclipseclp/Kernel/src/ |
H A D | mem.h | 57 if (((Stack)->top -= (WordsNeeded)) < (uword *)((Stack) + 1)) \ 77 uword *top, /* stack top inside this segment */ 82 extern void stack_create ARGS((struct stack_header **pstack, uword words_needed)); 83 extern void stack_pop_to ARGS((struct stack_header **pstack, uword *old_top)); 84 extern void stack_push ARGS((struct stack_header **pstack, uword words_needed)); 85 extern void stack_pop ARGS((struct stack_header **pstack, uword word_offset)); 114 extern void temp_create ARGS((struct temp_header **ptemp, uword bytes_needed)); 115 extern void temp_align ARGS((struct temp_header **ptemp, uword size)); 117 extern char *temp_alloc ARGS((struct temp_header **ptemp, uword bytes_needed)); 147 ((uword *)(((Bu [all...] |
H A D | mem.c | 104 #define UWORDS_PER_PAGE (BYTES_PER_PAGE/sizeof(uword)) 116 uword *start_of_stacks, /* only for mapped stacks, otherwise 0 */ 303 adjust_stacks(struct stack_struct *descr, uword *lower_max, uword *upper_max, uword *partition_hint) 305 register uword diff; 308 if (diff = (uword) lower_max % STACK_PAGESIZE) 309 lower_max += (STACK_PAGESIZE - diff)/sizeof(uword); 312 ((uword) upper_max % STACK_PAGESIZE)/sizeof(uword); [all...] |
H A D | database.h | 72 Make_Procedure_Prefix(0, 0, (uword)-1, D_UNKNOWN, DEFAULT_LINE, (uword)-1, did) 89 Allocate_Procedure(size, (uword)-1 , D_UNKNOWN, 0, (uword)-1, did) 91 code = AllocateCodeBlockBTable(size, btable, 0, (uword)-1, D_UNKNOWN, 0, Cid((uword)-1, did))
|
H A D | dummy_bigrat.c | 73 ec_big_to_chunks(pword *pw1, uword chunksize, pword *result)
|
H A D | bip_array.c | 82 uword *vm_inst_ctr_; 133 uword w; 241 vm_inst_ctr_ = (uword*) 481 uword *adr; 482 uword kind; 578 uword *adr; 579 uword kind; 653 uword *adr; 654 uword kind; 727 uword *ad [all...] |
H A D | ec_public.h | 93 #define SIGN_BIT ((uword) UWSUF(0x8000000000000000)) 96 #define SIGN_BIT ((uword) UWSUF(0x80000000)) 103 #define MAX_U_WORD ((uword) -1)
|
H A D | property.h | 114 Extern uword * get_elt_address ARGS((value, type, uword*, dident, type, int*)); 115 Extern word get_first_elt ARGS((pword*, pword*, uword*, uword*, dident, type));
|
H A D | types.h | 79 typedef unsigned int uword; typedef 82 typedef unsigned long uword; typedef 85 typedef unsigned long long uword; typedef 88 typedef unsigned __int64 uword; typedef 106 uword as_int; 156 uword all; 157 uword *wptr; 172 uword all; 187 typedef uword vmcode; 220 uword *star [all...] |
H A D | printam.c | 62 static void _print_edesc(uword); 65 #define InvalidAddress(ptr) ((ptr) == NULL || (uword) (ptr) & 0x3) 157 uword *ptr = (uword *) *code++; \ 158 uword *end; \ 160 end = (uword *) ((pword *) ptr + *code++); \ 175 uword *ptr = (uword *) *code++; \ 176 uword *end; \ 184 end = (uword *) ((pwor [all...] |
H A D | tkexdr.c | 45 typedef unsigned int uword; typedef 48 typedef unsigned long uword; typedef 51 typedef unsigned long long uword; typedef 54 typedef unsigned __int64 uword; typedef 176 uword as_int; 194 _EcReadExdr(Tcl_Interp *interp, Tcl_Channel channel, int nextch, Tcl_HashTable *string_table, uword *string_index) 266 uword this_index; 327 uword string_index = 0; 383 _EcExdr2Tcl(Tcl_Interp *interp, char *bp, char *stop, Tcl_HashTable *string_table, uword *string_index, Tcl_Obj **result) 452 uword this_inde [all...] |
H A D | bip_store.c | 165 uword i; 229 prop->val.wptr = (uword *) htable_new(0); 251 uword new_size = obj->size * HTABLE_EXPAND_FACTOR; 253 uword i; 303 _htable_find(t_heap_htable *obj, uword hash, value vkey, type tkey, t_htable_elem ***ppslot) 335 uword hash; 392 uword hash; 445 uword hash; 465 uword hash; 494 uword has [all...] |
H A D | sch_macros.h | 91 (uword)Site(t1),(uword)Knot(t1),(uword)Edge(t1)); \ 96 (uword)Site(t1),(uword)Knot(t1),(uword)Edge(t1), \ 97 (uword)Site(t2),(uword)Knot(t2),(uword)Edge(t2)); \ 102 (uword)Sit [all...] |
H A D | gc_stacks.c | 97 uword 251 if ((uword)esize > 1000000) {\ 959 trailed_item = (pword *) ((uword *) trailed_item 978 ((uword *) trailed_item + 1); 984 trailed_item = (pword *) ((uword *) trailed_item 1017 trailed_item = (pword*) ((uword*)trailed_item + 1); 1268 uword *eam_ptr = EdescEamPtr(edesc); \ 1272 uword eam = EamPtrEam(eam_ptr); \ 1647 trailed_item = (pword *)((uword *)(*tr++) + TrailedOffset(i)); 2224 (uword *) ((pwor [all...] |
H A D | external.h | 111 address = (pword *) ((uword *) address + 1 + DidArity(adid));\ 119 address = (pword *) ((uword *) address + 1 + DidArity(adid));\
|
H A D | emu_util.c | 83 extern void alloc_stack_pairs(int nstacks, char **names, uword *bytes, struct stack_struct **descr); 85 uword sizes[4]; 201 uword *find_word(); 206 (void) find_word((uword) 0); 474 uword * 475 find_word(uword w) /* scan Prolog data areas for a particular uword */ 477 uword *p; 486 for(p = (uword *) &g_emu_.emu_args[0]; 487 p < (uword *) [all...] |
H A D | main.c | 120 static uword 124 uword multiple = 0; 125 uword size; 151 size = (uword) atol(arg); 627 static uword 631 uword multiple = 0; 632 uword size; 658 size = (uword) atol(arg); 669 uword size;
|
H A D | emu_export.h | 130 SP->val.wptr = (uword *) (Val); 143 * <pointer to EAM>10 LSB=10 indicates pointer to uword-array 145 * uword of the array have LSB=0. 151 * <pointer to EAM>010 LSB=10 indicates pointer to uword-array 153 * uword of the array have LSB=0. 157 * Bitmaps are cut up into 31-bit chunks (bits 1 to 31 of a uword, with 158 * bit 0 of the uword being used as a marker for the last chunk). 161 * chunks even on 64-bit machines, with the rest of the uword wasted. 170 #define EdescEamPtr(ed) ((ed)&1 ? (uword*)(&(ed)) : (uword*)((e [all...] |
H A D | dict.c | 1415 uword hash; 1420 uword size; 1421 uword nentries; 1422 uword nreuse; 1436 uword i; 1461 uword new_size = table->size * CONSTANT_TABLE_EXPAND_FACTOR; 1463 uword i; 1514 uword hash; 1597 uword entry_count = 0; 1598 uword max_chai [all...] |
H A D | bip_tconv.c | 1053 static uword 1056 uword maxdepth, /* > 0 */ 1057 uword hash, 1060 uword h; 1134 uword 1137 uword maxdepth, /* > 0 */ 1147 uword h; 1155 h = vdepth.nint ? ec_term_hash(vterm, tterm, (uword)vdepth.nint, &res) : 0; 1299 _flatten_array(uword d, word n, pword *from) 1329 uword arit [all...] |
H A D | bip_bag.c | 64 uword size; 65 uword ref_ctr;
|
H A D | manual_examples.c | 49 uword *dim; 64 dim = (uword *) p->val.ptr;
|
/barrelfish-master/usr/eclipseclp/Oci/ |
H A D | dbi.h | 65 uword arity; /* number of slots in type map */ 66 uword tuples; /* number of tuples stored in cursor */ 67 uword from; /* index of first valid unread tuple */ 68 uword to; /* 1 + index of last valid unread tuple */
|
/barrelfish-master/usr/eclipseclp/Shm/src/ |
H A D | memman.h | 62 typedef unsigned int uword; typedef 66 typedef unsigned long uword; typedef 71 typedef unsigned long long uword; typedef 75 typedef unsigned __int64 uword; typedef 85 #define SIGN_BIT ((uword) WSUF(0x8000000000000000)) 90 #define SIGN_BIT ((uword) 0x80000000L)
|